Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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.

Finite-variable polynomial algebras over fields are integrally closed

Statement

For every field K and every finite d≥0, the ring K[x1,…,xd] is an integrally closed domain.

Facts & Assumptions

Given: a field K and an integer d≥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 one 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]

a∣b means b=ac for some c; a,b are associates when a=ub for a unit u (Divisibility and associates in an integral domain, Left inverse, right inverse, and invertible element of a monoid).

[L4]

Let R be a UFD with field of fractions K=Frac⁡(R). A polynomial in R[x] is primitive when its coefficients have no common nonunit divisor. Then products of primitive polynomials are primitive, and a primitive polynomial of positive degree is irreducible in R[x] exactly when 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), and every irreducible p∈F[x] is prime (Every irreducible polynomial over a field is prime).

[L6]

An element of a ring is integral over a subring when it is a root of a monic polynomial with coefficients in that subring; the integral closure of a domain A in a field extension of Frac⁡(A) is the set of elements integral over A, and A is integrally closed when every element of Frac⁡(A) integral over A already lies in A (Integral elements over a commutative ring and algebraic integers, Integral closure in an extension ring and integrally closed domains).

[L7]

Frac⁡(D)=(D∖{0})−1D is the field of fractions of a domain D, with elements the fractions a/b for a,b∈D, b≠0 (The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain).

[L8]

R[x1,…,x0]:=R and R[x1,…,xn+1]:=R[x1,…,xn][xn+1] (Polynomial rings in finitely many commuting indeterminates by iteration).

[L9]

A polynomial ring over a domain is a domain (A polynomial ring over an integral domain is an integral domain), and so is a polynomial ring in finitely many indeterminates over a domain (A polynomial ring in finitely many indeterminates over an integral domain is an integral domain).

[L10]

Over a domain and for nonzero f,g one has deg⁡(fg)=deg⁡f+deg⁡g (Over an integral domain, degrees add under multiplication of nonzero polynomials).

[L11]

Every nonempty subset of N has a least element (The well-ordering principle).

[L13]

A field is a commutative ring in which every nonzero element is a unit, and it is an integral domain (Field, Every field is a commutative ring with 1≠0; it is an integral domain, and it is a commutative division ring).

Proof

technique · direct
1.1

Let R be a domain with the two properties

(P1) every nonzero nonunit of R is a finite product of irreducibles, and > (P2) every irreducible element of R is prime.

Then R satisfies the uniqueness clause of [L1]: if p1⋯pm=q1⋯qn are two products of irreducibles with m,n≥1, then m=n and after a permutation each pi is associate to qi. Indeed p1 is prime by (P2) and divides the product q1⋯qn, so by [L2] there is an index j with p1∣qj; writing qj=p1w, the element w must be a unit, since otherwise qj=p1w would factor the irreducible qj into two nonunits, so qj is associate to p1 by [L3]. Move qj to the first position and cancel the nonzero factor p1 using [L12]. This gives p2⋯pm=wq2⋯qn. If either remaining list is empty, the other must also be empty, since a product containing a nonunit cannot be a unit. Otherwise absorb w into q2, which remains irreducible, and apply induction to the shorter products. This proves the uniqueness clause. [L1, L2, L3, L12, algebra]

1.2

Let R be a UFD, which by [L1] is a domain, and let 0≠f∈R[x] have nonzero coefficients a1,…,as. Write P for the set of associate classes of irreducibles of R. For C∈P and 0≠a∈R, let vC(a) be the exponent of any representative of C in a factorization of a; this is independent of the chosen representative and factorization by the uniqueness clause of [L1]. Set vC(f):=min⁡ivC(ai). Only finitely many classes have vC(f)>0, because each ai has only finitely many irreducible factors. For each such class choose one representative pC, and put c(f):=∏C∈P, vC(f)>0pC vC(f)∈R∖{0},f∗:=f/c(f)∈R[x]. The product is finite; its associate class does not depend on the representatives chosen. Each vC(f) is the exponent of C in c(f), so c(f) divides every coefficient of f and f=c(f)f∗. For every class C, some coefficient ai has vC(ai)=vC(f), so that coefficient of f∗ is not divisible by a representative of C. Thus no irreducible divides every coefficient of f∗, and f∗ is primitive. If also 0≠c∈R and 0≠h∈R[x] satisfies f=ch with h primitive, then for each C the coefficientwise identity vC(ca)=vC(c)+vC(a) gives vC(f)=vC(c)+vC(h)=vC(c); hence c and c(f) have the same exponent in every associate class and are associates by [L1, L3]. In particular a polynomial is primitive exactly when its content is a unit.

L1L3construct
1.3

Let R be an integral domain. Then f∈R[x] is a unit of R[x] if and only if f is a constant and a unit of R; and if p∈R, then p is irreducible in R[x] if and only if p is irreducible in R. Indeed, if fg=1 in R[x] then f,g≠0 and [L10] gives deg⁡f+deg⁡g=deg⁡1=0, so deg⁡f=deg⁡g=0 and fg=1 holds in R; conversely units of R are units of R[x]. The cases p=0 or p a unit are excluded from irreducibility in both rings. For a nonzero nonunit p, if p=fg with deg⁡p=0 then deg⁡f=deg⁡g=0 by [L10], so the factorization takes place in R, while a factorization in R is one in R[x].

L10algebra
2.1

Let R be a domain with (P1) and (P2) of step 1.1. Then R is integrally closed. Indeed let z∈Frac⁡(R) be integral over R; if z=0 then z∈R, so assume z≠0. By [L7] there are a,b∈R with b≠0 and z=a/b. For 0≠c∈R let m(c) be the number of irreducible factors in a factorization of c when c is a nonunit, and 0 when c is a unit; by (P1) and step 1.1 this number does not depend on the chosen factorization. Representations z=a/b exist, so by [L11] we may fix one for which m(b) is least. Suppose b were not a unit; then b=q1⋯qm with m=m(b)≥1 and all qi irreducible by (P1). By [L6] there is a monic equation zn+rn−1zn−1+⋯+r0=0 with n≥1 and ri∈R; multiplying by bn gives an+rn−1an−1b+⋯+r0bn=0, so b∣an, hence q1∣an. Since q1 is prime by (P2), iterating [L2] yields q1∣a. Writing a=q1a′ and b=q1b′ gives a new representation z=a′/b′ whose denominator b′=q2⋯qm satisfies m(b′)=m−1 by step 1.1, contradicting the minimality of m(b). So b is a unit, z=ab−1∈R, and every element of Frac⁡(R) integral over R lies in R: by [L6], R is integrally closed.

L2L6L7L11step 1.1algebra
2.2

Let R be a UFD and let 0≠f,g∈R[x]. Then the contents satisfy c(fg)∼c(f)c(g) (associates). Indeed by step 1.2 both f∗=f/c(f) and g∗=g/c(g) are primitive, so f∗g∗ is primitive by [L4], and applying the uniqueness of contents from step 1.2 to the identity fg=c(f)c(g) (f∗g∗) shows that c(fg) is associate to c(f)c(g).

L4step 1.2algebra
2.3

Let R be a UFD, K=Frac⁡(R), and let p∈R[x] be irreducible of positive degree. Then p is primitive and irreducible in K[x]. If some nonunit d∈R divided every coefficient of p, then p=d (p/d) with d a nonunit and p/d of positive degree, hence a nonunit of R[x] by step 1.3: this contradicts irreducibility of p. So p is primitive, and then [L4] applied to p over the UFD R makes p irreducible in K[x].

L4step 1.3algebra
3.1

Let R be a UFD with K=Frac⁡(R), let p∈R[x] be primitive, let a∈R[x], and let q∈K[x] satisfy a=pq. Then q∈R[x]. If q=0 this is immediate; otherwise p and a=pq are nonzero, so their contents are defined. Choose 0≠u∈R with uq∈R[x], which is possible by [L7] applied to the finitely many nonzero coefficients of q. Applying step 2.2 in the ring R[x] to ua=p (uq) gives c(ua)∼c(p)c(uq)∼c(uq), where we used that p is primitive, so c(p)∼1 by step 1.2. On the other hand c(ua)∼u c(a) by the coefficientwise exponent identity of step 1.2. Hence c(uq)∼u c(a) is divisible by u, so u divides every coefficient of uq; writing each coefficient of uq as ur with r∈R and cancelling u in K shows that the corresponding coefficient of q equals r. Therefore all coefficients of q lie in R.

L7step 1.2step 2.2construct
3.2

Let R be a UFD and 0≠f∈R[x] a nonunit. Then f is a product of irreducibles of R[x]. If deg⁡f=0 then f∈R is a nonzero nonunit and [L1] factors it into irreducibles of R, each irreducible in R[x] by step 1.3. Assume deg⁡f≥1 and write f=c(f)f∗ with c(f)∈R and f∗ primitive by step 1.2; then deg⁡f∗=deg⁡f≥1, so f∗ is a nonunit of R[x] by step 1.3. Retain c(f) as a scalar (it may be a unit), and factor the nonzero nonunit f∗ in the UFD K[x] of [L5] as f∗=q1⋯qn with each qj irreducible in K[x] and n≥1. Each qj has positive degree, since a nonzero constant element of K[x] is a unit there, and each qj is not a unit because f∗ is not. Choose 0≠aj∈R with ajqj∈R[x] and write ajqj=djhj with dj∈R and hj∈R[x] primitive, using step 1.2. Then hj=(aj/dj)qj is a nonzero K-multiple of the irreducible qj, hence irreducible in K[x], and it is primitive, so hj is irreducible in R[x] by [L4]. By [L4] the product P:=h1⋯hn is primitive, and f∗=λP with λ:=∏jdj/aj∈K×. Choose b∈R and 0≠c∈R with λ=b/c, by [L7]. Then cf∗=bP in R[x], so step 2.2 and the content identity of step 1.2 give c c(f∗)∼c(cf∗)∼c(bP)∼b c(P)∼b, because c(P)∼1 by step 1.2; hence c divides b and λ=b/c lies in R. Therefore f=c(f)λ h1⋯hn exhibits f as a product of irreducibles of R[x], the nonzero scalar c(f)λ∈R itself being a product of irreducibles if it is a nonunit, or being absorbed into h1 if it is a unit; a unit multiple of an irreducible is irreducible.

L1L4L5L7step 1.2step 2.2step 1.3construct
4.1

Let R be a UFD. Then every irreducible element p of R[x] is prime. If deg⁡p=0, then p∈R is irreducible in R by step 1.3. When p∣ab in R[x], if a=0 or b=0 then p divides that factor; otherwise both are nonzero, and every coefficient of ab is divisible by p. For the associate class C=[p], this gives vC(ab)≥1, while step 2.2 gives vC(ab)=vC(a)+vC(b). Hence vC(a)≥1 or vC(b)≥1, which says exactly that p divides every coefficient of a or of b, so p∣a or p∣b in R[x]. If deg⁡p≥1, then p is primitive and irreducible in K[x] by step 2.3, hence prime in K[x] by [L5]. If p∣ab in R[x], then also p∣ab in K[x], so p∣a or p∣b in K[x]; say a=pq with q∈K[x]. Since p is primitive, step 3.1 gives q∈R[x], so p∣a in R[x]. Thus [L2] holds for p in R[x].

L2L5step 1.2step 2.2step 3.1step 1.3step 2.3
5.1

Let R be a UFD. Then R[x] is a UFD in which every irreducible is prime: existence of factorizations into irreducibles is step 3.2, and primeness of irreducibles is step 4.1, so the uniqueness clause follows from step 1.1 with (P1) = step 3.2 and (P2) = step 4.1.

L1step 1.1step 3.2step 4.1
6.1

We prove by induction on d that K[x1,…,xd] is a UFD in which every irreducible element is prime. For d=0 the ring is the field K by [L8], a UFD in which there are no irreducible elements by [L13] and [L1]. For d=1 the ring is K[x], a UFD by [L5] in which every irreducible is prime by [L5], each of these two cases being a base case. For the induction step, if K[x1,…,xd] is a UFD, then K[x1,…,xd+1]=K[x1,…,xd][xd+1] by [L8] is a UFD with prime irreducibles by step 5.1, so the property holds for every d.

L1L5L8L13step 5.1basedischarge-induction: cases d=0 and d=1
7.1

Every ring K[x1,…,xd] is a domain by [L9], in the case d=0 by [L13]. It is integrally closed: for d≥1 it is a UFD with prime irreducibles by step 6.1, so it satisfies (P1) and (P2) of step 1.1 and step 2.1 makes it integrally closed; for d=0 the ring is the field K by [L8], and every element of Frac⁡(K) is a fraction a/b with a,b∈K, b≠0 by [L7], that is, the unit multiple ab−1 of an element of K by [L13], and each element of K is a root of the monic polynomial T−a∈K[T], so every element of Frac⁡(K) integral over K lies in K.

L6L7L8L9L13step 2.1step 6.1∎

Depends on

Used by

Dependency tree · two levels

48 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