How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Every finite-variable polynomial ring over a field is a UFD, with prime irreducibles and principal height-one primes
Statement
Let be a field and let be an integer. Then is a unique factorisation domain (Unique factorisation domain). Every irreducible element of it is prime (Irreducible and prime elements of an integral domain), and every prime ideal of height one (The height of a prime ideal) is generated by an irreducible element.
For the ring is the field itself (Polynomial rings in finitely many commuting indeterminates by iteration); it has no irreducibles and no height-one primes.
Facts & Assumptions
Given: A field and an integer .
A UFD is an integral domain in which every nonzero nonunit is a finite product of irreducibles, and any two such products of the same element have the same length and matching factors up to order and associates (Unique factorisation domain).
In a domain, a nonzero nonunit is irreducible when forces or to be a unit, and prime when implies or (Irreducible and prime elements of an integral domain).
Let be a UFD with field of fractions . A polynomial in is primitive when its coefficients have no common nonunit divisor. Products of primitive polynomials are primitive; and a primitive polynomial of positive degree is irreducible in if and only if it is irreducible in (Gauss lemma over a UFD).
Every domain has a field of fractions containing it as a subring (The field of fractions of an integral domain, is a field and embeds the integral domain ).
For every field , the polynomial ring is a UFD (For every field , is a unique factorisation domain).
The iterated polynomial ring is for , with (Polynomial rings in finitely many commuting indeterminates by iteration).
If is an integral domain then so is (A polynomial ring over an integral domain is an integral domain), and for nonzero polynomials over a domain (Over an integral domain, degrees add under multiplication of nonzero polynomials). A quotient is an integral domain exactly when is prime ( is an integral domain if and only if is a prime ideal), and a unital ring homomorphism induces one with (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism). A field is a commutative ring whose nonzero elements are units (Every field is a commutative ring with ; it is an integral domain, and it is a commutative division ring).
The Krull dimension of a nonzero commutative ring is the supremum of the lengths of strict chains of prime ideals, and the height of a prime is ; contraction along is an inclusion-preserving bijection from onto the primes of contained in (Krull dimension of a nonzero ring, The height of a prime ideal, Prime ideals of a localization are exactly the primes disjoint from the denominator set).
Proof
For the ring is the field by [L6]. Every nonzero element of a field is a unit by [L7], so there are no nonzero nonunits at all; the existence and uniqueness clauses of [L1] hold vacuously, and by [L2] there is no irreducible element, so the statement about irreducibles is vacuous too. This is the base case of the induction on .
Let be any UFD and irreducible. Then is prime: if with , factor , and write with factored as , as [L1] allows whenever the element in question is a nonzero nonunit, the unit cases being immediate from ; comparing the two products of irreducibles for and by the uniqueness clause of [L1] shows that is associate to one of the or one of the , hence divides or .
Now let be a UFD, by [L4], and . For each associate class of irreducibles in , let be the exponent of that class in the factorization of a nonzero ; it is well-defined by the uniqueness clause of [L1]. Let be the finite set of such classes appearing in the factorizations of the nonzero coefficients of , and for each choose one representative . Set and . This finite product is a common divisor of the coefficients, every common divisor divides it up to associates, and is primitive in the sense of [L3]; thus . For , define when with nonzero ; this is well-defined, and for every associate class exactly when is a unit of . Note also that an irreducible of positive degree is primitive: a nonunit constant dividing all coefficients would write with both factors nonunits, since has positive degree by [L7]. The content factors into irreducibles of by [L1], and each such constant is irreducible in , because a factorization of a constant in has both factors constant by [L7] and so is a factorization in . For the primitive part, [L5] gives a factorization in , with and each irreducible in ; if , then is a nonzero constant in and, being primitive, is a unit of . For each choose with and write , where is a content and is primitive; then , so is a nonzero scalar multiple of in , hence irreducible in and in by [L3]. By [L3] the product is primitive, and with . Since both and are primitive, comparison of the least exponents in each associate class gives for every , so is a unit of . Thus is a product of irreducibles of .
Assume now that and that is a UFD in which every irreducible element is prime; this is the induction hypothesis.
For uniqueness, let be two factorizations of the same element of into irreducibles. Multiply the positive-degree factors of each side together, using the primitivity noted in 1.3; the result is primitive by [L3] on each side, so comparing contents as in 1.3 shows that the two sides' constant factors are associates and that the products of positive-degree factors are associates of one another. Each positive-degree factor is irreducible in by [L3], and is a UFD by [L5], so the two products of positive-degree factors agree up to order, associates in , and a unit scalar; that scalar is a unit of by the exponent comparison of 1.3, so they agree up to order and associates in . The constant factors are products of irreducibles of and agree up to order and associates by the uniqueness clause of [L1]. Hence satisfies the uniqueness clause of [L1], and with 1.3 it is a UFD.
Every irreducible element of is prime. Let be irreducible. If then is irreducible in , hence prime in by 1.2; if in , then the induced map of [L7] kills , and is a domain by [L7] because is a domain for the prime element ; so all coefficients of or all coefficients of lie in , that is, or . If , then is primitive by 1.3, hence irreducible in by [L3], hence prime in the UFD by 1.2; if in , then in , so after possibly swapping we have for some . Write with and primitive, by the content construction of 1.3 applied to a polynomial clearing the denominators of ; then , and the product is primitive by [L3]. Comparing contents in the equality shows that is associate to the content of step 1.3: clearing the denominators of by some gives , whose left side has content and whose right side has content up to units because is primitive, the exponents of step 1.3 being additive in a constant factor. Hence and , so with and in .
In any UFD , every prime ideal of height one is generated by an irreducible element. By [L8], means that inside there is a strict chain of primes of length one and none of length two; in particular contains a nonzero element, so choose . Factoring into irreducibles and using that is prime, some irreducible factor lies in by [L1] and [L2]; then is prime by 1.2, so is a nonzero prime ideal contained in . Were , the strict chain of primes of would, by the inclusion-preserving bijection of [L8], give a chain of length two in , contradicting . Hence .
By [L6] the ring is the polynomial ring over , which is a UFD by step 1.4. Steps 1.3 and 2.1 therefore make a UFD, and step 2.2 shows that every irreducible element of it is prime, using the primitivity results quoted in those steps. So the UFD clause and the irreducible-is-prime clause hold for this whenever they hold for .
The base case 1.1 and the induction step 3.1 prove the UFD clause and the irreducible-is-prime clause for every . Finally, if is a prime ideal of height one, then is a UFD by 3.1, so 2.3 exhibits an irreducible element generating ; for the case is vacuous, a field having no nonzero prime ideal. This proves all three clauses of the statement.
Depends on
- For every field $F$, $F[x]$ is a unique factorisation domain
- Gauss lemma over a UFD
- Unique factorisation domain
- Polynomial rings in finitely many commuting indeterminates by iteration
- The height of a prime ideal
- Irreducible and prime elements of an integral domain
- The field of fractions $\operatorname{Frac}(D)=(D\setminus\{0\})^{-1}D$ of an integral domain
- $\operatorname{Frac}(D)$ is a field and $d\mapsto d/1$ embeds the integral domain $D$
- Krull dimension of a nonzero ring
- Prime ideals of a localization are exactly the primes disjoint from the denominator set
- A polynomial ring over an integral domain is an integral domain
- Over an integral domain, degrees add under multiplication of nonzero polynomials
- $R/P$ is an integral domain if and only if $P$ is a prime ideal
- Universal property of $R[x]$: a coefficient homomorphism and the image of $x$ determine a unique ring homomorphism
- Every field is a commutative ring with $1 \ne 0$; it is an integral domain, and it is a commutative division ring
Used by
Dependency tree · two levels
44 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- J. S. Milne, Algebraic Geometry v6.10, Propositions 1.29-1.31 and Theorem 1.32, pp. 24-25 (standard reference, not scraped)