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 , the commutative ring
is Noetherian and a unique factorisation domain. Its units are exactly the elements with .
Facts & Assumptions
Given: An integer and commuting indeterminates .
The one-variable Laurent ring is Noetherian and a UFD, and its units are (The Laurent polynomial ring is Noetherian and a unique factorisation domain).
A polynomial ring in finitely many variables over a Noetherian commutative ring is Noetherian (If is Noetherian then is Noetherian for every ).
Every localization of a Noetherian commutative ring is Noetherian (Every quotient and every localisation of a Noetherian ring is Noetherian).
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).
For every field , is a UFD (For every field , is a unique factorisation domain).
Proof
For the statement is [F1]. Suppose , put , and let be the multiplicative set generated by . Clearing negative powers identifies with .
We prove by induction on the number of added variables that is a UFD. The base is [F1]. For the induction step let be the preceding UFD and its fraction field. Every nonzero is its content times a primitive polynomial : since has finitely many coefficients, take the product over irreducibles of their minimum exponents in those coefficients. Factor in and factor in using [F5]. Clear denominators in each positive-degree irreducible factor and divide by its content to obtain primitive polynomials . By [F4], their product is primitive and is associated to in . Write this scalar as with coprime , so . Any irreducible divisor of then divides every coefficient of , and any irreducible divisor of divides every coefficient of ; primitiveness forces and to be units. Thus is associated in to the product of the . Each is irreducible in by [F4], and the content factors in , so every nonzero nonunit of factors into irreducibles.
By [F2], is Noetherian because is Noetherian by [F1]. Its localization is Noetherian by [F3].
For uniqueness in the same induction step, contents have unique factorization in . Two factorizations of the primitive part become factorizations in the UFD , so their primitive positive-degree factors pair up up to scalar associates. If primitive satisfy for coprime , then ; any irreducible factor of must divide every coefficient of , and any irreducible factor of must divide every coefficient of . Primitiveness forces to be units, so the scalar is a unit of . This proves uniqueness in and completes the induction.
Localizing the UFD at preserves unique factorization: factor a numerator in and discard the irreducible factors that divide an element of , 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 , so primality in 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 . Thus is a UFD.
If is a unit, then for some . Every irreducible factor of therefore divides a product of powers of , so it is associated in to one of these variables. The only units already in are the units of , namely , by degree in and [F1]. Consequently the units of are exactly .
Steps 2.1, 3.1 and 4.1 prove Noetherianity, unique factorization, and the stated unit description for every .
Depends on
- The Laurent polynomial ring is Noetherian and a unique factorisation domain
- If $R$ is Noetherian then $R[x_1,\ldots,x_n]$ is Noetherian for every $n\in\mathbb N$
- Every quotient and every localisation of a Noetherian ring is Noetherian
- Gauss lemma over a UFD
- For every field $F$, $F[x]$ is a unique factorisation domain
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
- Keith Conrad, Eisenstein Criterion and Gauss' Lemma, Theorem 1.3 (standard reference, not scraped)
- The Stacks Project, Section 10.31 (Tag 00FM), Noetherian rings (standard reference, not scraped)
- The Stacks Project, Section 10.9 (Tag 00CM), Localization (standard reference, not scraped)