Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

The integral multivariable Laurent polynomial ring is Noetherian and a UFD

Statement

For every integer r≥1, the commutative ring

Λr=Z[t1±1,…,tr±1]

is Noetherian and a unique factorisation domain. Its units are exactly the elements ±t1k1⋯trkr with ki∈Z.

Facts & Assumptions

Given: An integer r≥1 and commuting indeterminates t1,…,tr.

[F1]

The one-variable Laurent ring Λ1=Z[t1±1] is Noetherian and a UFD, and its units are ±t1k (The Laurent polynomial ring is Noetherian and a unique factorisation domain).

[F2]

A polynomial ring in finitely many variables over a Noetherian commutative ring is Noetherian (If R is Noetherian then R[x1,…,xn] is Noetherian for every n∈N).

[F3]

Every localization of a Noetherian commutative ring is Noetherian (Every quotient and every localisation of a Noetherian ring is Noetherian).

[F4]

Products of primitive polynomials over a UFD are primitive, and a primitive positive-degree polynomial is irreducible over the UFD exactly when it is irreducible over its fraction field (Gauss lemma over a UFD).

[F5]

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

Proof

1.1givenF1constructbase

For r=1 the statement is [F1]. Suppose r>1, put Pr=Λ1[t2,…,tr], and let Sr be the multiplicative set generated by t2,…,tr. Clearing negative powers identifies Λr with Sr−1Pr.

1.2givenF1F4F5inductionconstructIH

We prove by induction on the number of added variables that Λ1[t2,…,tr] is a UFD. The base is [F1]. For the induction step let R be the preceding UFD and K its fraction field. Every nonzero f∈R[x] is its content c∈R times a primitive polynomial f0: since f has finitely many coefficients, take the product over irreducibles of their minimum exponents in those coefficients. Factor c in R and factor f0 in K[x] using [F5]. Clear denominators in each positive-degree irreducible factor and divide by its content to obtain primitive polynomials q1,…,qm∈R[x]. By [F4], their product q is primitive and is associated to f0 in K[x]. Write this scalar as a/b with coprime a,b∈R, so bf0=aq. Any irreducible divisor of a then divides every coefficient of f0, and any irreducible divisor of b divides every coefficient of q; primitiveness forces a and b to be units. Thus f0 is associated in R[x] to the product of the qi. Each qi is irreducible in R[x] by [F4], and the content factors in R, so every nonzero nonunit of R[x] factors into irreducibles.

2.1givenF1F2F3step 1.1

By [F2], Pr is Noetherian because Λ1 is Noetherian by [F1]. Its localization Sr−1Pr=Λr is Noetherian by [F3].

2.2givenF1F4F5step 1.2inductionalgebra

For uniqueness in the same induction step, contents have unique factorization in R. Two factorizations of the primitive part become factorizations in the UFD K[x], so their primitive positive-degree factors pair up up to scalar associates. If primitive f,g∈R[x] satisfy f=(a/b)g for coprime a,b∈R, then bf=ag; any irreducible factor of a must divide every coefficient of f, and any irreducible factor of b must divide every coefficient of g. Primitiveness forces a,b to be units, so the scalar is a unit of R. This proves uniqueness in R[x] and completes the induction.

3.1givenstep 1.1step 2.2algebra

Localizing the UFD Pr at Sr preserves unique factorization: factor a numerator in Pr and discard the irreducible factors that divide an element of Sr, since precisely those factors become units. Every remaining irreducible stays prime: if it divides a product of localized fractions, clearing denominators gives divisibility of the product of their numerators in Pr, so primality in Pr makes it divide one numerator; it cannot divide a cleared denominator because it was not inverted. Uniqueness follows by clearing denominators and using uniqueness in Pr. Thus Λr is a UFD.

4.1givenF1step 2.2step 3.1algebra

If u=f/s∈Sr−1Pr is a unit, then fg=sq for some q∈Sr. Every irreducible factor of f therefore divides a product of powers of t2,…,tr, so it is associated in Pr to one of these variables. The only units already in Pr are the units of Λ1, namely ±t1k, by degree in t2,…,tr and [F1]. Consequently the units of Λr are exactly ±t1k1⋯trkr.

5.1givenstep 2.1step 3.1step 4.1discharge-induction∎

Steps 2.1, 3.1 and 4.1 prove Noetherianity, unique factorization, and the stated unit description for every r≥1.

Depends on

Used by

Dependency tree · two levels

27 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