Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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.

Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields

Statement

Let R be a commutative ring and n≥0.

  1. Multivariate polynomial ring. The ring R[x1,…,xn] of Polynomial rings in finitely many commuting indeterminates by iteration is a commutative R-algebra, free as an R-module on the monomials xα=x1α1⋯xnαn (α∈Nn), and for every commutative R-algebra A and elements a1,…,an∈A there is a unique R-algebra homomorphism R[x1,…,xn]→A with xi↦ai. If R is an integral domain, so is R[x1,…,xn].
  2. Laurent polynomial ring. The set ΛR,n of finitely supported functions Zn→R with coefficientwise addition and convolution (ab)γ=∑α+β=γaαbβ (summed only over the finite supports of a and b) is a commutative R-algebra, free as an R-module on the monomials xα (α∈Zn); each xi is a unit. For every commutative R-algebra A and units u1,…,un∈A there is a unique R-algebra homomorphism ΛR,n→A with xi↦ui. If R is an integral domain, so is ΛR,n; no domain assertion is made over a ring with zero divisors. Only finitely many variables are used; in applications to Coxeter systems with a finite generator set, W may nevertheless be infinite.
  3. Fraction field. If R is an integral domain, then on pairs (f,g) with f,g∈ΛR,n and g≠0, the relation (f,g)∼(f′,g′) iff fg′=f′g is an equivalence relation compatible with (f,g)+(f′,g′):=(fg′+f′g,gg′) and (f,g)(f′,g′):=(ff′,gg′), and the quotient K(ΛR,n) is a field containing ΛR,n through f↦[(f,1)]. The same construction gives the fraction field of R[x1,…,xn].

Facts & Assumptions

Given: A commutative ring R, an integer n≥0, and a commutative R-algebra A.

[F1]

The polynomial ring R[x] is the set of finitely supported functions N→R with coefficientwise addition and convolution (ab)k=∑i+j=kaibj; its elements are written ∑iaixi, and the constant embedding sends r to the sequence supported at 0 with coefficient r (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution).

[F2]

These operations make R[x] a commutative ring and the constant map R→R[x] an injective unital ring homomorphism (Polynomial convolution makes R[x] a commutative ring containing R as its constant subring).

[F3]

A coefficient homomorphism and the image of x determine a unique unital ring homomorphism R[x]→S; it is ev⁡φ,s(∑iaixi)=∑iφ(ai)si (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism).

[F4]

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

[F5]

If R is an integral domain then so is R[x1,…,xn], including n=0 (A polynomial ring in finitely many indeterminates over an integral domain is an integral domain).

[F6]

The free module R(X)=⨁x∈XR has standard basis ex and every element is uniquely a finite sum ∑x∈Frxex (The free module on a set and its standard basis).

[F7]

A set map from a basis into a module extends uniquely to an R-linear map (Universal property of the free module on a set).

[F8]

Finite sums in a commutative monoid are invariant under reindexing, split over disjoint unions and satisfy Fubini (Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule).

[F9]

An integral domain is a commutative ring with 1≠0 and no zero divisors: ab=0 implies a=0 or b=0 (Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors, Commutative ring).

[F10]

Equivalence relations, classes and quotient sets; a relation between pairs is an equivalence relation when reflexive, symmetric and transitive (Equivalence relation, equivalence class, and the quotient set A/∼).

[F12]

The integers form a totally ordered commutative ring; in particular their addition is associative and commutative and their order is translation-invariant (The integers form a totally ordered ring).

Proof

technique · direct
1.1givenF1F2F3F4F6F11algebra

Multivariate basis and universal property, by induction on n. For n=0, R[x1,…,x0]=R by [F4], the single monomial x(0)=1 is a basis of the free rank-one module R by [F6], and the structure map of A is the unique R-algebra homomorphism R→A by [F11]. For the step, put S:=R[x1,…,xn], free over R on the monomials xα by induction, and R[x1,…,xn+1]=S[xn+1] by [F4]: by [F1] and [F2] (applied over the coefficient ring S) an element of S[xn+1] is a finitely supported function k↦sk with sk∈S, each sk=∑αaα,kxα a finite R-linear combination, so substituting the unique coefficient expansions gives a unique finite R-linear combination of the monomials xαxn+1k, and these therefore form an R-basis indexed by Nn×N≅Nn+1; applying [F3] twice, a unital R-algebra homomorphism S[xn+1]→A is exactly a unital R-algebra homomorphism S→A together with an element a∈A (the image of xn+1), which by induction is exactly images a1,…,an+1∈A of the generators.

1.2givenF5

If R is an integral domain, R[x1,…,xn] is one by [F5].

1.3givenF6F8F11F12algebra

Construction of ΛR,n: let ΛR,n:=R(Zn) be the free R-module with standard basis the monomials xα by [F6], and define multiplication on the basis by xαxβ:=xα+β, extended R-bilinearly, so that (ab)γ=∑α∈supp⁡a, β∈supp⁡bα+β=γaαbβ is a finite sum by [F8], and supp⁡(ab)⊆supp⁡a+supp⁡b is finite. The rule is closed and associative because Zn has associative, commutative coordinatewise addition by [F12] and reindexing the finite triple sum gives ((ab)c)γ=(a(bc))γ=∑α+β+δ=γaαbβcδ by [F8]; it is commutative because α+β=β+α and R is commutative; it is distributive over the coefficientwise addition inherited from [F6]; and the basis vector x0, coefficient 1R at 0 and 0 elsewhere, is a two-sided identity. Hence ΛR,n is a commutative ring, it is an R-algebra through r↦rx0 by [F11], it is free on the monomials by construction, and each xi is a unit since the monomial x−ei with coefficient 1R satisfies xix−ei=xei−ei=x0=1.

1.4givenF6F7F13algebra

Universal property of ΛR,n: let u1,…,un∈A be units and for α∈Zn put uα:=u1α1⋯unαn, negative exponents denoting powers of the inverses. Every element of ΛR,n is a unique finite sum ∑αaαxα by [F6], so xα↦uα extends uniquely to an R-linear map Φ:ΛR,n→A by [F7]; it is a unital ring homomorphism because uα+β=uαuβ and u0=1 in A by [F13], applied in the unit group of A, which is abelian because A is commutative, and it is the unique R-algebra homomorphism with xi↦ui because the monomials span.

1.5givenF8F9F12algebra

Domain of ΛR,n: suppose R is an integral domain. Order Zn lexicographically: distinct tuples are compared at their first differing coordinate. By [F12] the integer order is total, and adding the same tuple preserves that first differing coordinate and its strict comparison; hence this is a translation-invariant total order (for n=0, there is just the empty tuple). For nonzero a,b∈ΛR,n the finite supports supp⁡a,supp⁡b are nonempty and have greatest elements α,β. A coefficient (ab)γ with γ>α+β is a sum of products aα′bβ′ with α′+β′=γ, and each such term has α′>α (then aα′=0) or β′>β (then bβ′=0), since α′≤α and β′≤β would give α′+β′≤α+β<γ; so (ab)γ=0 for γ>α+β. For γ=α+β every term indexed within the supports with α′≠α has α′<α and then β′>β by strict order invariance, hence vanishes, and the remaining term is aαbβ≠0 because R has no zero divisors [F9]; so (ab)α+β≠0 and ab≠0. Since 1R≠0 in R, the unit of ΛR,n differs from 0, so ΛR,n is an integral domain.

1.6givenF9F10algebra

Fraction field for a commutative integral domain D: on P:={(f,g):f,g∈D, g≠0} define (f,g)∼(f′,g′) iff fg′=f′g. This is reflexive and symmetric, and transitive: from fg′=f′g and f′g′′=f′′g′ one gets g′(fg′′)=(fg′)g′′=(f′g)g′′=f′(gg′′)=f′(g′′g)=(f′g′′)g=(f′′g′)g=f′′(g′g)=g′(f′′g), so cancellation of the nonzero g′ in the domain gives fg′′=f′′g. Sums (f,g)+(f′,g′)=(fg′+f′g,gg′) and products (f,g)(f′,g′)=(ff′,gg′) have nonzero second components since D has no zero divisors, and they respect ∼: if fg′=f′g and hk′=h′k then (fk+hg)(g′k′)=fkg′k′+hgg′k′=f′k′(gk)+h′g′(gk)=(f′k′+h′g′)(gk) and fh g′k′=f′g h′k=f′h′ gk, so the operations are well defined on the quotient set D′=P/∼ of [F10]. Writing f/g for [(f,g)], addition of f/g,h/k,l/m in either order gives (fkm+hgm+lgk)/(gkm), multiplication in either order gives fhl/(gkm), and distributivity gives f(hm+lk)/(gkm) on both sides. Commutativity follows from that in D; 0/1 and 1/1 are the identities, and (−f)/g is the additive inverse of f/g. Thus D′ is a commutative ring, with 0/1≠1/1 because 0≠1 in D, and D′ is a field: for a class [(f,g)]≠[(0,1)] one has f≠0, so that (f,g)(g,f)=(fg,fg)∼(1,1) since fg⋅1=1⋅fg, and hence [(g,f)] is an inverse. Finally f↦[(f,1)] is a unital ring homomorphism with kernel {f:[(f,1)]=[(0,1)]}={f:f=0}, so it injects D into D′.

2.1step 1.1step 1.2step 1.3step 1.4step 1.5step 1.6F5∎

Collecting the clauses: step 1.1 gives the monomial basis, the universal property and, with [F5] as used in step 1.2, the domain assertion of the multivariate clause; step 1.3 gives the ring structure, freeness and the unit property of ΛR,n, step 1.4 its unit-substitution universal property, and step 1.5 its domain assertion. If R is an integral domain then D:=ΛR,n is a domain by step 1.5 and R[x1,…,xn] is a domain by step 1.2, so step 1.6 applies to both and yields the fraction field K(ΛR,n) and the fraction field of R[x1,…,xn] with the embedding f↦[(f,1)], which completes all three parts of the claim.

Depends on

Used by

Dependency tree · two levels

67 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