I'm studying Unique Factorization Domain (UFD) and there's a lemma in my textbook stating that:
In polynomial ring $A[x]$ with $A$ is a UFD, if $g$ is a primitive polynomial and divides $af$ ($a\in A$), then $g$ divides $f$.
Here is the proof given in my textbook: Since $g|af$, hence $af=gh$ with $h\in A[x]$. Let's write $$f=c(f)f_1, h=c(h)h_1$$ with $f_1,h_1$ are primitive polynomials, $c(f)$ is GCD of all coefficients in $f(x)$. And we have $$ a.c(f)f_1=c(h)gh_1.$$ According to Gauss's lemma, we deduce that $gh_1$ is a primitive polynomial. Hence, $gh_1$ is associated with $f_1$. So $g|f_1$, which means that $g|f$.
I don't understand why from $gh_1$ is a primitive polynomial, we conclude that $gh_1$ is associated with $f_1$? Can someone explain for me?
In fact we have a theorem:
Proof. We may assume that no irreducible divides both $\alpha$ and $\beta$, by cancelling. We then aim to show that $\alpha$ and $\beta$ are units. Assume $\alpha$ is not a unit, and let $r$ be an irreducible that divides $\alpha$. Note that $r$ divides $\beta q(x)$, but cannot divide every coefficient of $q$ (because $q(x)$ is primitive). Let $i$ be such that $r\nmid q_i$, where $q_i$ is the coefficient of $x^i$ in $q(x)$. Then $r$ divides $\beta q_i$ but not $q_i$, and since $r$ is irreducible, it follows that $r\mid \beta$. But we assumed that $\alpha$ and $\beta$ had no common irreducible factors. This contradiction arises from assuming that $\alpha$ is not a unit; thus, $\alpha$ is a unit. Hence $\alpha p(x)$ is primitive, so $\beta$ must be a unit (since it divides all coefficients of the primitive polynomial $\alpha p(x)$). Thus, $\alpha$ and $\beta$ are units, so $p(x)$ and $q(x)$ are associates. $\Box$
Thus, since $c(h)gh_1 = ac(f)f_1$, with $gh_1$ and $f_1$ primitive, it follows that $gh_1$ and $f_1$ are associates.