Throughout the propositions, R is an UFD, and a,b,c are non-zero elements of R. Let F(a) denote the multiset of irreducible factors of a.
We will be using multiset operations and relations as given by wikipedia.
Lemma P2.1
F(ab)=F(a)+F(b).
Proof
For convenience, we will ignore units as for any unit u,F(ua)=a.
Write down ab as a product of irreducible factors of a and b:
ab=a1p1a2p2…anpnb1q1b2q2…bmqm.
Whenever ai=bj we add up the powers. When all factors are distinct, we have an irreducible factorization of ab. The multiplicity of each individual irreducible factor is the sum of multiplicities of this factor in a and in b, which matches the definition of the sum of two multisets. By uniqueness this is precisely F(ab).
■
Proposition A1
(a)⊆(b) if and only if F(b)⊆F(a).
Proof
Suppose (a)⊆(b). Then there exists an element w∈R such that a=wb. Hence F(a)=F(w)+F(b). Since addition of multisets can only increase the multiplicity of any element, F(a) must, at the very least, contain all elements of F(b). Thus F(b)⊆F(a) as required.
Suppose conversely that F(b)⊆F(a). In that case, there exists a (possibly empty) multiset of irreducible factors W such that F(a)=F(b)+W. Let w∈R denote the product (with multiplicity) of all elements of W. We have W=F(w) and hence
F(a)=F(b)+F(w)=F(bw).
Since a and bw have the same multiset of irreducible factors, there exists a unit u such that a=bwu. Hence a∈(b) and so (a)⊆(b).