Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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 k be a field and let r≥0 be an integer. Then k[x1,…,xr] 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 r=0 the ring is the field k itself (Polynomial rings in finitely many commuting indeterminates by iteration); it has no irreducibles and no height-one primes.

Facts & Assumptions

Given: A field k and an integer r≥0.

[L1]

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).

[L2]

In a domain, a nonzero nonunit p is irreducible when p=ab forces a or b to be a unit, and prime when p∣ab implies p∣a or p∣b (Irreducible and prime elements of an integral domain).

[L3]

Let R be a UFD with field of fractions K. A polynomial in R[x] 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 R[x] if and only if it is irreducible in K[x] (Gauss lemma over a UFD).

[L5]

For every field F, the polynomial ring F[x] is a UFD (For every field F, F[x] is a unique factorisation domain).

[L6]

The iterated polynomial ring is k[x1,…,xr]=k[x1,…,xr−1][xr] for r≥1, with k[x1,…,x0]=k (Polynomial rings in finitely many commuting indeterminates by iteration).

[L7]

If R is an integral domain then so is R[x] (A polynomial ring over an integral domain is an integral domain), and for nonzero polynomials over a domain deg⁡(fg)=deg⁡f+deg⁡g (Over an integral domain, degrees add under multiplication of nonzero polynomials). A quotient R/p is an integral domain exactly when p is prime (R/P is an integral domain if and only if P is a prime ideal), and a unital ring homomorphism R→S induces one R[x]→S[x] with x↦x (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism). A field is a commutative ring whose nonzero elements are units (Every field is a commutative ring with 1≠0; it is an integral domain, and it is a commutative division ring).

[L8]

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 p is dim⁡Rp; contraction along R→Rp is an inclusion-preserving bijection from Spec⁡Rp onto the primes of R contained in p (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

technique · induction
1.1

For r=0 the ring is the field k 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 r.

L1L2L6L7base
1.2

Let R be any UFD and p∈R irreducible. Then p is prime: if p∣ab with a,b≠0, factor a=∏iai, b=∏jbj and write ab=pc with c≠0 factored as ∏kck, as [L1] allows whenever the element in question is a nonzero nonunit, the unit cases being immediate from p∣ab; comparing the two products of irreducibles for ab and pc by the uniqueness clause of [L1] shows that p is associate to one of the ai or one of the bj, hence divides a or b.

L1L2algebra
1.3

Now let R be a UFD, K=Frac⁡(R) by [L4], and 0≠f∈R[x]. For each associate class C of irreducibles in R, let vC(a) be the exponent of that class in the factorization of a nonzero a∈R; it is well-defined by the uniqueness clause of [L1]. Let C(f) be the finite set of such classes appearing in the factorizations of the nonzero coefficients of f, and for each C∈C(f) choose one representative pC. Set eC=min⁡{vC(a):a≠0 is a coefficient of f} and c(f)=∏C∈C(f)pCeC. This finite product is a common divisor of the coefficients, every common divisor divides it up to associates, and f∗:=f/c(f) is primitive in the sense of [L3]; thus f=c(f)f∗. For λ∈K×, define vC(λ)=vC(a)−vC(b) when λ=a/b with nonzero a,b∈R; this is well-defined, and vC(λ)=0 for every associate class exactly when λ is a unit of R. Note also that an irreducible f of positive degree is primitive: a nonunit constant r∈R dividing all coefficients would write f=r⋅(f/r) with both factors nonunits, since f/r has positive degree by [L7]. The content c(f) factors into irreducibles of R by [L1], and each such constant is irreducible in R[x], because a factorization of a constant in R[x] has both factors constant by [L7] and so is a factorization in R. For the primitive part, [L5] gives a factorization f∗=ug1⋯gn in K[x], with u∈K× and each gj irreducible in K[x]; if n=0, then f∗ is a nonzero constant in R and, being primitive, is a unit of R. For each j choose aj∈R∖{0} with ajgj∈R[x] and write ajgj=djhj, where dj∈R is a content and hj∈R[x] is primitive; then gj=(dj/aj)hj, so hj is a nonzero scalar multiple of gj in K[x], hence irreducible in K[x] and in R[x] by [L3]. By [L3] the product h1⋯hn is primitive, and f∗=λ h1⋯hn with λ=u∏j(dj/aj)∈K×. Since both f∗ and h1⋯hn are primitive, comparison of the least exponents in each associate class gives vC(λ)=0 for every C, so λ is a unit of R. Thus f is a product of irreducibles of R[x].

L1L3L4L5L7algebra
1.4

Assume now that r≥1 and that k[x1,…,xr−1] is a UFD in which every irreducible element is prime; this is the induction hypothesis.

ih
2.1

For uniqueness, let p1⋯pm=q1⋯qn be two factorizations of the same element f≠0 of R[x] 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 K[x] by [L3], and K[x] is a UFD by [L5], so the two products of positive-degree factors agree up to order, associates in K[x], and a unit scalar; that scalar is a unit of R by the exponent comparison of 1.3, so they agree up to order and associates in R[x]. The constant factors are products of irreducibles of R and agree up to order and associates by the uniqueness clause of [L1]. Hence R[x] satisfies the uniqueness clause of [L1], and with 1.3 it is a UFD.

L1L3L5L7step 1.3
2.2

Every irreducible element of R[x] is prime. Let p∈R[x] be irreducible. If deg⁡p=0 then p∈R is irreducible in R, hence prime in R by 1.2; if p∣ab in R[x], then the induced map R[x]→(R/(p))[x] of [L7] kills ab, and (R/(p))[x] is a domain by [L7] because R/(p) is a domain for the prime element p; so all coefficients of a or all coefficients of b lie in (p), that is, p∣a or p∣b. If deg⁡p≥1, then p is primitive by 1.3, hence irreducible in K[x] by [L3], hence prime in the UFD K[x] by 1.2; if p∣ab in R[x], then p∣ab in K[x], so after possibly swapping a,b we have a=pq for some q∈K[x]. Write q=λq∗ with λ∈K× and q∗∈R[x] primitive, by the content construction of 1.3 applied to a polynomial clearing the denominators of q; then a=λ (pq∗), and the product pq∗ is primitive by [L3]. Comparing contents in the equality a=λ (pq∗) shows that λ is associate to the content c(a)∈R of step 1.3: clearing the denominators of λ by some u≠0 gives ua=(λu)(pq∗), whose left side has content u c(a) and whose right side has content λu up to units because pq∗ is primitive, the exponents vp of step 1.3 being additive in a constant factor. Hence λ∈R and q=λq∗∈R[x], so a=pq with q∈R[x] and p∣a in R[x].

L2L3L5L7step 1.2step 1.3
2.3

In any UFD A, every prime ideal of height one is generated by an irreducible element. By [L8], ht⁡(p)=1=dim⁡Ap means that inside p there is a strict chain of primes of length one and none of length two; in particular p contains a nonzero element, so choose 0≠f∈p. Factoring f into irreducibles and using that p is prime, some irreducible factor p lies in p by [L1] and [L2]; then p is prime by 1.2, so (p) is a nonzero prime ideal contained in p. Were (p)⊊p, the strict chain 0⊊(p)⊊p of primes of A would, by the inclusion-preserving bijection of [L8], give a chain of length two in Spec⁡Ap, contradicting dim⁡Ap=1. Hence p=(p).

L1L2L8step 1.2
3.1

By [L6] the ring k[x1,…,xr] is the polynomial ring A[xr] over A=k[x1,…,xr−1], which is a UFD by step 1.4. Steps 1.3 and 2.1 therefore make k[x1,…,xr] 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 r≥1 whenever they hold for r−1.

L6step 1.3step 1.4step 2.1step 2.2
4.1

The base case 1.1 and the induction step 3.1 prove the UFD clause and the irreducible-is-prime clause for every r≥0. Finally, if p⊆k[x1,…,xr] is a prime ideal of height one, then k[x1,…,xr] is a UFD by 3.1, so 2.3 exhibits an irreducible element generating p; for r=0 the case is vacuous, a field having no nonzero prime ideal. This proves all three clauses of the statement.

step 2.3step 3.1discharge-induction: step 1.1∎

Depends on

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