Since the irreducible element is not a unit, the principal ideal is proper. Suppose . As is a principal ideal domain, write . Then for some . The definition of an irreducible element says that or is a unit.
If is a unit, then . If is a unit, then and are associate elements, so . Thus is a maximal ideal. By the permitted criterion that a quotient ring by a maximal ideal is a field,
The element lies in the unit group and satisfies . Its order of a group element divides two and, by Lagrange's theorem, divides the odd number . Its order is therefore one, so and .
It follows that
is a well-defined unital ring homomorphism. For a nonzero ring, this says its characteristic of a ring is two. If the zero ring is permitted, the same map still exists. This is the odd unit group forces characteristic two argument, with that harmless exception to the characteristic wording.
Write , and let be the coordinate ring homomorphism. Set . Each is an ideal: it is an additive subgroup, and multiplying a lift in on either side by a tuple with prescribed th coordinate proves closure under left and right multiplication by .
Certainly . Conversely, let . For each , choose with th coordinate , and let have in coordinate and zero elsewhere. Since is an ideal, , and
Therefore
The finite sum is essential to this proof of ideals of a finite product of rings.
Multiplication in a direct product of rings is coordinatewise. Thus has a two-sided inverse exactly when each has a two-sided inverse in , and then
Consequently its unit group is the direct product of groups
The identification preserves multiplication because both sides use coordinatewise multiplication. This is the unit group of a direct product of rings formula.
Write . The unit group is a finite abelian group of group order , since multiplication in a field satisfies commutativity. The structure theorem for finitely generated abelian groups, applied to this finite group, gives invariant factors of a finitely generated module
after omitting trivial factors. If there are no factors, the unit group is trivial and hence a cyclic group.
Otherwise put . Every element satisfies , because the order of a group element in each coordinate divides . Hence all distinct nonzero elements of are roots of a polynomial . The root bound for a polynomial over a field gives
For completeness, that bound follows by induction from the factor theorem: if a nonzero polynomial vanishes at , write ; every other root of a polynomial is a root of , because a field has no zero divisors. Each new distinct root therefore uses one unit of polynomial degree.
On the other hand, the group order in the decomposition is
Equality is forced, so . As every retained factor is greater than , there can be only one. Consequently
The same proof establishes the more general result finite multiplicative subgroup of a field is cyclic. The square-free integer result in part (c)(i) alone would not suffice, since need not be a square-free integer; the root bound for a polynomial rules out multiple invariant factors of a finitely generated module even then.
Let be a square-free integer. If , then is the trivial cyclic group. Otherwise, finiteness means that a direct sum of modules decomposition into cyclic groups has only finitely many nontrivial factors, each of finite group order. Omit trivial factors and write
The integers are coprime integers whenever . If a prime number divided both, then , contradicting the square-free integer hypothesis.
Moreover, and are coprime integers: any common prime divisor would divide one of the earlier factors as well as . Thus part (b)(ii) can be applied repeatedly to combine factors, giving
In particular is a cyclic group. Under the displayed identifications, the element whose coordinate in every factor is the class of is a generator of a group.
Define the group homomorphism
By part (b)(i), its kernel of a group homomorphism is
It is surjective. Indeed, choose with by Bézout's identity. For any prescribed classes and , the integer
satisfies and . The first isomorphism theorem for groups therefore gives
This proves the required isomorphism and is the Chinese remainder theorem for coprime integers. It also shows that generates the direct sum of modules when these additive groups are viewed as -modules.
Every multiple of is a multiple of both and , so .
For the reverse inclusion, let lie in this intersection of ideals. Since are coprime integers, Bézout's identity supplies with . Multiplying by gives
Thus , and . Consequently
Here Bézout's identity follows from the allowed principal ideal domain property of : the ideal is generated by their greatest common divisor, which is .
Let generate the submodule , and let generate the quotient module . Choose each as a representative of its class. For any , there are such that
Therefore . Expressing that difference using the generating set of a module gives
Hence
is a finitely generated module. This proves that finite generation is preserved by module extensions.
Choose a finite generating set of a module for the finitely generated module . For any , the surjectivity of the module homomorphism gives with . Write . Since is a module homomorphism,
Thus
is a finitely generated module. The argument includes , in which case surjectivity forces and the empty generating set of a module suffices.
The required property is
For a nonzero element of an integral domain , this follows from
Indeed, in the quotient ring exactly when . The prime element condition says this forces or , exactly the absence of zero divisors in the quotient ring. The nonunit condition makes the quotient ring nonzero. Being an integral domain is preserved by every ring isomorphism.
With the usual definition of a prime element, is understood. The prime ideal formulation works for every ideal of any commutative ring, including the zero ideal; it avoids this convention about elements.
No such property exists. The ring isomorphism in part (b)(ii) identifies quotient rings by elements having different irreducible element behaviour.
The element is an irreducible element of . It is nonzero and a nonunit. Every nonzero nonunit of has polynomial degree at least : the only possible polynomials of smaller polynomial degree are constant polynomials, and every nonzero constant polynomial is a unit. If with both nonunits, additivity of polynomial degree in the integral domain would give
which is impossible. Thus one factor must be a unit.
In , however, is a product of two nonunits, so is not an irreducible element. If a ring isomorphism invariant characterized irreducible elements by the indicated quotient ring, the irreducible element would imply that has . Its isomorphic quotient ring would then have , incorrectly making an irreducible element.
Consequently,
Set and . Part (b)(i) gives a unique representative for each element of the quotient ring . By polynomial division, each element of the quotient ring likewise has a unique representative . Thus the proposed map is well-defined and a bijection.
It preserves addition and . To verify multiplication, all terms of polynomial degree at least lie in . Hence
In the other quotient ring, , giving exactly the same coefficient formula:
Therefore
is a ring isomorphism. Both sides are examples of a truncated polynomial ring; the generator on the left is the class of , whose square is nonzero and whose cube vanishes.
All principal ideals in this part are taken inside the subring , rather than inside . First, is a subring: sums and additive inverses retain zero coefficient of , and the coefficient of in a product is . It contains .
The principal ideal is precisely
Indeed, multiplying an element of by gives a possible term of polynomial degree and terms of polynomial degrees at least , with no term. Conversely, dividing any displayed polynomial by gives a polynomial with no term, hence an element of .
Given , let be its coefficients of , respectively. Subtracting these terms leaves an element of , so
For uniqueness, if two such representatives differ by an element of , their difference has possible monomials only , whereas every element of has zero coefficients at all three. Comparing coefficients gives , , .
In particular, . Treating as the principal ideal of instead would incorrectly discard this surviving term.
Regard as the polynomial ring . The coefficient ring is a Euclidean domain, hence a principal ideal domain. The element is a prime element: the quotient ring is an integral domain.
The monic polynomial has its other coefficients divisible by , while . Part (a)(i), with playing the role of and the indeterminate, proves that is an irreducible polynomial.
Now use the automorphism of a polynomial ring
Its inverse fixes and sends to . A ring isomorphism preserves units and factorizations, hence preserves irreducible elements. Since
we obtain
Applying the Eisenstein criterion directly to the second expression with the prime element would fail, since ; the change of indeterminate supplies the required argument.
We prove the stated Eisenstein criterion directly. Assume . Suppose in the polynomial ring . Since the principal ideal domain is an integral domain, polynomial degree is additive under polynomial multiplication, and the product of the leading coefficients of is the leading coefficient of . These two coefficients are therefore units. Multiplying and by inverse units, without changing their product, makes both factors monic polynomials.
If either factor is a constant polynomial, that factor is now , so the original factor was a unit. It remains to rule out and .
The prime element generates a maximal ideal in the principal ideal domain . Indeed, if , then , and the irreducible element property of forces either or . Consequently is a field. Apply reduction modulo an ideal to every coefficient. The monic polynomial factors retain their polynomial degrees, and the hypotheses give
The polynomial ring over a field is a unique factorization domain, and is an irreducible polynomial. Thus its only monic polynomial divisors in are powers of . Hence and . Both have zero constant term, so and . This gives , a contradiction.
The monic polynomial has positive polynomial degree, so it is a nonzero nonunit. Every factorization therefore has a unit factor, proving
Interpret the source's missing variable in the limit arrow as . We prove convergence in distribution by showing that the angle of the Brownian motion becomes uniform on the circle group.
Let . For every integer , its angular Fourier coefficients satisfy
These are precisely the Fourier coefficients of the uniform distribution on the unit circle. Thus expectations of every trigonometric polynomial converge to its uniform angular average. By the Stone-Weierstrass theorem, trigonometric polynomials approximate continuous functions on the unit circle uniformly. Given an approximation error , the discrepancy of expectations is at most the polynomial discrepancy plus . Taking and then proves weak convergence of probability measures to uniform angular measure.
The function is continuous on the unit circle, so the continuous mapping theorem and part (a)(ii) imply
Equivalently, the limiting arcsine distribution has cumulative distribution function for , and probability density function for . This proves the limiting law rather than inferring it merely from the limiting mean.
The characteristic function of gives . Taking real parts and using ,
There is also a direct check from the stochastic differential equation. Its Itô integral has zero expectation because its integrand is bounded. Thus satisfies and , whose solution is the same expression.
Here . For , and . Since standard Brownian motion has quadratic variation , Itô's formula gives
Therefore
The squared diffusion coefficient is . Its sign depends on : one cannot replace by the nonnegative square root while retaining the same driving Brownian motion.
Apply the same characteristic polynomial calculation with replaced by . Pathwise,
The real-valued processes give continuous lifts of these angles. The eigenvalues coincide whenever ; the exponential formulas remain valid at those times.

There are unlisted articles, also show them or only show them.