Alphabeta Math
Pipeline-generated
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.

✓ 9 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 5 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Tensor Coherence and Algebraic Descent

1 · Prerequisites

2 · Summary

The page fixes the tensor conventions shared by the Hopf and Hecke branches: k is a field, ⊗ means ⊗k over k-vector spaces, tensor powers are left-associated with the empty tensor k, and parentheses in iterated tensor powers may be dropped only after the coherence lemma below has been proved. It then supplies the coherence, duality and descent facts that the construction pages of these branches consume.

Coherence is proved concretely rather than invoked from a general monoidal theorem: the associator, the symmetry and the unit isomorphisms satisfy naturality, the pentagon, the unit triangle and both symmetry hexagons, each verified on elementary tensors and extended to all linear maps by the spanning property of the tensor product. Finite tensor duality identifies V∗⊗W∗ with (V⊗W)∗ through the product dual basis and exhibits the basis-independent coevaluation element ∑ivi⊗vi∗ together with both zigzag identities; no surjectivity is asserted in infinite dimension, and the companion page's counterexample shows that the finite-dimensional hypothesis is necessary.

The Choice assumptions are recorded explicitly. The injection lemma and the kernel computation for a tensor product of quotient maps assume the Axiom of Choice through Every linear subspace U of a vector space V has a complement: a linear subspace W with V=U⊕W, and coefficient separation for a finite independent family inherits that assumption in infinite ambient dimension while remaining choice-free in finite dimension, where the independent list is extended to a basis.

The descent half constructs the free associative R-algebra R⟨S⟩ on the words in S with concatenation as product, proves its universal property and the two-sided-ideal description of a generated relation ideal, and identifies the quotient as the presented algebra. Base change along a commutative ring homomorphism is proved by explicit mutually inverse generator maps, with the image ideal of a relation ideal carrying the corresponding quotient presentation and no flatness hypothesis; free bases transport along any commutative specialization. Polynomial and Laurent rings are built from finitely supported monomials, their universal properties by substitution, and their fraction fields over domains from numerator-denominator pairs. Finite matrix and module preliminaries supply the right-inverse determinant argument, invariance of finite matrix rank under field extension, finite composition series, the splitting of a submodule of a finite direct sum of simple modules without arbitrary Choice, and the vanishing trace of a nilpotent endomorphism. The regular-module detection principle closes the page: evaluation at 1 and at 1⊗n detects equality of algebra elements, multilinear identities are checked on pure tensors, and a quotient identity requires the descent that the recorded warning makes explicit.

Prerequisite pages: tensor-products-of-modules, modules-and-module-homomorphisms, ideals-and-quotient-rings, dual-spaces-bilinear-forms-and-inertia, linear-independence-bases-and-dimension, linear-maps-rank-nullity-and-quotient-spaces, chain-conditions-and-semisimple-modules, relations-functions-and-quotients. The companion tensor-coherence-and-algebraic-descent-examples develops the calculations and failures needed to test these constructions.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Scalars, tensor powers, the empty tensor, opposite algebras and finite sums

Definition

Fix the following conventions, used on this page and by the later Hopf and Hecke pages.

Parentheses in iterated tensor products may be dropped only after Associator naturality, pentagon, unit triangle and symmetry hexagons on elementary tensors ↗ has been proved.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Associator naturality, pentagon, unit triangle and symmetry hexagons on elementary tensors

Statement

Let k be a field and let L,M,N,X be k-vector spaces. Write αA,B,C:(A⊗B)⊗C→A⊗(B⊗C) for the associators of Symmetry and associativity isomorphisms for tensor products over a commutative ring, σA,B for its symmetries, and λ,ρ for the unit isomorphisms of The regular module is a tensor unit: R⊗RN≅N and M⊗RR≅M.

  1. Naturality. α and σ are natural in all variables: for linear maps the usual squares commute; the unit isomorphisms are natural as well.
  2. Pentagon. (idL⊗αM,N,X)∘αL,M⊗N,X∘(αL,M,N⊗idX)=αL,M,N⊗X∘αL⊗M,N,X as maps ((L⊗M)⊗N)⊗X→L⊗(M⊗(N⊗X)).
  3. Unit triangle. (idM⊗λN)∘αM,k,N=ρM⊗idN as maps (M⊗k)⊗N→M⊗N.
  4. First symmetry hexagon. αL,N,M∘(σN,L⊗idM)∘αN,L,M−1∘σL⊗M,N=(idL⊗σM,N)∘αL,M,N as maps ((L⊗M)⊗N)→L⊗(N⊗M).
  5. Second symmetry hexagon. αN,L,M−1∘σL⊗M,N∘αL,M,N−1=(σL,N⊗idM)∘αL,N,M−1∘(idL⊗σM,N) as maps L⊗(M⊗N)→(N⊗L)⊗M.

All five identities are equalities of k-linear maps between iterated tensor products.

Facts & Assumptions

Given: A field k, vector spaces L,M,N,X and linear maps between vector spaces as named in the steps.

[F1]

The conventions: V⊗W is the tensor product over k with unit and universal property, every element is a finite sum of elementary tensors, and tensor powers are left-associated with k as the empty tensor (Scalars, tensor powers, the empty tensor, opposite algebras and finite sums).

[F2]

The associator and symmetry are isomorphisms acting on elementary tensors by αL,M,N((l⊗m)⊗n)=l⊗(m⊗n) and σM,N(m⊗n)=n⊗m, with σN,MσM,N=id (Symmetry and associativity isomorphisms for tensor products over a commutative ring).

[F3]

The unit isomorphisms act by λN(r⊗n)=rn and ρM(m⊗r)=mr (The regular module is a tensor unit: R⊗RN≅N and M⊗RR≅M).

[F4]

Functoriality: (f⊗g)(m⊗n)=f(m)⊗g(n) defines a linear map, idM⊗idN=idM⊗N, and (f′∘f)⊗(g′∘g)=(f′⊗g′)∘(f⊗g) (Module homomorphisms induce tensor-product homomorphisms functorially).

[F5]

Every element of a tensor product is a finite sum of elementary tensors, and the defining relations give (cm)⊗n=m⊗(cn)=c(m⊗n) for c∈k (The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums, Scalars, tensor powers, the empty tensor, opposite algebras and finite sums).

Proof

technique · direct
1.1givenF2F4F5algebra

Naturality of α and σ: for linear maps f:L→L′, g:M→M′, h:N→N′ and an elementary tensor (l⊗m)⊗n one has αL′,M′,N′(((f⊗g)⊗h)((l⊗m)⊗n))=αL′,M′,N′((f(l)⊗g(m))⊗h(n))=f(l)⊗(g(m)⊗h(n)) and (f⊗(g⊗h))(αL,M,N((l⊗m)⊗n))=(f⊗(g⊗h))(l⊗(m⊗n))=f(l)⊗(g(m)⊗h(n)), by [F2] and [F4]; likewise σM′,N′((g⊗h)(m⊗n))=h(n)⊗g(m)=((h⊗g)∘σM,N)(m⊗n). Both sides of each square are k-linear and the elementary tensors span by [F5], so the squares commute on their whole domains.

1.2givenF3F4F5algebra

Naturality of the unit isomorphisms: for linear f:N→N′ and r⊗n∈k⊗N one has λN′((idk⊗f)(r⊗n))=λN′(r⊗f(n))=rf(n)=f(rn)=f(λN(r⊗n)) by [F3] and [F4], and for linear g:M→M′ likewise ρM′((g⊗idk)(m⊗r))=g(m)r=g(mr)=g(ρM(m⊗r)); the elementary tensors span, so both naturality squares commute.

1.3givenF2F5algebra

Pentagon: on an elementary tensor ((l⊗m)⊗n)⊗x of ((L⊗M)⊗N)⊗X the left composite sends it by [F2] to (αL,M,N⊗idX)(((l⊗m)⊗n)⊗x)=(l⊗(m⊗n))⊗x, then to l⊗((m⊗n)⊗x), then to l⊗(m⊗(n⊗x)); the right composite sends it to (l⊗m)⊗(n⊗x) and then to l⊗(m⊗(n⊗x)). Both sides are k-linear maps whose domain is spanned by such elementary tensors [F5], so the two composites agree everywhere.

1.4givenF2F3F5algebra

Unit triangle: for an elementary tensor (m⊗c)⊗n of (M⊗k)⊗N the left side gives (idM⊗λN)(m⊗(c⊗n))=m⊗(cn) by [F2] and [F3], while the right side gives (ρM⊗idN)((m⊗c)⊗n)=(mc)⊗n; these are equal because (mc)⊗n=m⊗(cn) by the balancing relations of [F5]. Both sides are linear on the span of the elementary tensors, so the identity holds.

1.5givenF2F5algebra

First symmetry hexagon: on an elementary tensor (l⊗m)⊗n of (L⊗M)⊗N the left composite gives successively n⊗(l⊗m) (symmetry σL⊗M,N), (n⊗l)⊗m (inverse associator), (l⊗n)⊗m (symmetry in the first factor), l⊗(n⊗m) (associator), while the right composite gives l⊗(m⊗n) and then l⊗(n⊗m) by the symmetry in the second factor; the two agree on the spanning elementary tensors, hence everywhere.

1.6givenF2F5algebra

Second symmetry hexagon: on an elementary tensor l⊗(m⊗n) of L⊗(M⊗N) the left composite gives (l⊗m)⊗n, then n⊗(l⊗m), then (n⊗l)⊗m, while the right composite gives l⊗(n⊗m), then (l⊗n)⊗m, then (n⊗l)⊗m; agreement on the spanning elementary tensors gives the identity everywhere.

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

Steps 1.1–1.6 verify all five identities on elementary tensors, and each identity is between k-linear maps whose domains are the iterated tensor products of [F1] spanned by elementary tensors [F5]; a linear map is determined by its values on a spanning set, so each identity holds on its whole domain, and no general monoidal coherence theorem was invoked.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Tensoring injections and the kernel of a tensor product of quotient maps over a field

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let k be a field, let f:V→V′ be an injective linear map and let W be a k-vector space. Then f⊗idW:V⊗W→V′⊗W is injective. Moreover, if U⊆V and Z⊆W are subspaces and p:V→V/U, q:W→W/Z are the quotient maps, then, viewing U⊗W and V⊗Z as subspaces of V⊗W through the injections of the first part and the inclusions U⊆V, Z⊆W, ker⁡(p⊗q)=U⊗W+V⊗Z.

Facts & Assumptions

Given: A field k, an injective linear map f:V→V′, a k-vector space W, subspaces U⊆V, Z⊆W, and the quotient maps p:V→V/U, q:W→W/Z.

[A1]

The Axiom of Choice holds, so by Every linear subspace U of a vector space V has a complement: a linear subspace W with V=U⊕W every linear subspace of a vector space has a complement: for the injections f, and the inclusions U⊆V, Z⊆W, there are subspaces with V′=f(V)⊕C, V=U⊕V1 and W=Z⊕W1 (Internal direct sum V=⨁i<nUi: the sum is everything and each summand meets the sum of the others only in 0V).

[F1]

The conventions: V⊗W is the tensor product with its universal property, every element is a finite sum of elementary tensors, the defining relations give (v+v′)⊗w=v⊗w+v′⊗w, v⊗(w+w′)=v⊗w+v⊗w′ and 0⊗w=0=v⊗0, and kv⊗w=v⊗kw (Scalars, tensor powers, the empty tensor, opposite algebras and finite sums).

[F2]

Functoriality: (f⊗g)(v⊗w)=f(v)⊗g(w) defines a linear map, id⊗id=id, and (f′∘f)⊗(g′∘g)=(f′⊗g′)∘(f⊗g) (Module homomorphisms induce tensor-product homomorphisms functorially).

[F3]

Quotient modules consist of cosets, the quotient map is linear with kernel the submodule quotiented by, and kernels and images of linear maps are subspaces (Quotient module M/N with scalar multiplication on additive cosets, Kernel and image of a linear map, Linear subspace of a vector space).

Proof

technique · direct
1.1givenA1F2algebra

Injectivity of f⊗idW: by [A1] write V′=f(V)⊕C and define g:V′→V by g(f(v)+c):=v; this is well defined and linear because every element of V′ has a unique decomposition, and g∘f=idV. By [F2], (g⊗idW)∘(f⊗idW)=(g∘f)⊗idW=idV⊗idW=idV⊗W, so f⊗idW has a left inverse and is injective.

1.2givenF1F3algebra

Containment: for u∈U and w∈W one has (p⊗q)(u⊗w)=p(u)⊗q(w)=0⊗q(w)=0 by [F1], because p kills U; likewise p⊗q kills every v⊗z∈V⊗Z because q kills Z. Hence im⁡(U⊗W) and im⁡(V⊗Z) lie in the kernel ker⁡(p⊗q), which is a subspace by [F3], so their sum U⊗W+V⊗Z lies in the kernel as well.

1.3givenA1F2F3algebra

Complements and an isomorphism: by [A1] write V=U⊕V1 and W=Z⊕W1. The restrictions p1:=p∣V1 and q1:=q∣W1 are isomorphisms onto V/U and W/Z: a coset v+U with v=u+v1 equals v1+U, so p1 is surjective, and if p(v1)=0 then v1∈U∩V1=0 by the direct-sum condition, so p1 is injective (and likewise for q1); by [F2] the map p1⊗q1:V1⊗W1→(V/U)⊗(W/Z) is then an isomorphism with inverse s⊗r, where s=p1−1 and r=q1−1. Every element of V is uniquely u+x with u∈U, x∈V1, so the component maps v↦u and v↦x are well defined and linear, and likewise for W=Z⊕W1; consequently each of the three inclusion-induced maps ιU⊗idW:U⊗W→V⊗W, idV⊗ιZ:V⊗Z→V⊗W and ιV1⊗ιW1:V1⊗W1→V⊗W has a left inverse induced by the corresponding component projection (for the first, (πU⊗idW)∘(ιU⊗idW)=(πU∘ιU)⊗idW=idU⊗W by [F2], and similarly for the others), hence is injective and exhibits its domain inside V⊗W through the injections of the statement; under these identifications the composite V1⊗W1→V⊗W→(V/U)⊗(W/Z) is exactly p1⊗q1, since both send x⊗y to p1(x)⊗q1(y).

2.1step 1.1step 1.2step 1.3F1algebra

Kernel: let t∈ker⁡(p⊗q) and write t=∑ivi⊗wi as a finite sum of elementary tensors by [F1]. Decompose vi=ui+xi with ui∈U, xi∈V1 and wi=zi+yi with zi∈Z, yi∈W1 by the direct sums of step 1.3 and expand bilinearly by [F1]: t=∑iui⊗wi+∑ixi⊗zi+∑ixi⊗yi, where the first summand lies in im⁡(U⊗W), the second in im⁡(V1⊗Z)⊆im⁡(V⊗Z), and the third is the image of ∑ixi⊗yi∈V1⊗W1. Applying p⊗q kills the first two summands by step 1.2, so 0=(p⊗q)(t)=(p1⊗q1)(∑ixi⊗yi) by the identification of step 1.3; injectivity of p1⊗q1 gives ∑ixi⊗yi=0 in V1⊗W1, hence the third summand is 0 in V⊗W, and t∈U⊗W+V⊗Z.

3.1step 1.1step 1.2step 2.1∎

Steps 1.2 and 2.1 give the two inclusions, so ker⁡(p⊗q)=U⊗W+V⊗Z for the subspaces exhibited through the injections of step 1.1, and step 1.1 itself is the first assertion of the statement.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Coefficient separation for an independent family of vectors, with explicit Choice assumptions

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let v1,…,vn∈V be linearly independent vectors in a k-vector space V and let w1,…,wn∈W satisfy ∑i=1nvi⊗wi=0 in V⊗W. Then wi=0 for every i; equivalently, the linear map Wn→V⊗W, (wi)↦∑ivi⊗wi, is injective.

If V is finite-dimensional the same conclusion is proved without the Axiom of Choice.

Facts & Assumptions

Given: A field k, a k-vector space V with linearly independent vectors v1,…,vn, a k-vector space W, and elements w1,…,wn∈W with ∑ivi⊗wi=0 in V⊗W.

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[F1]

The tensor product conventions: V⊗W has the universal property, every element is a finite sum of elementary tensors, and the empty tensor k is identified with the tensor unit through the unit isomorphisms, so k⊗W→W, c⊗w↦cw, is an isomorphism (Scalars, tensor powers, the empty tensor, opposite algebras and finite sums).

[F2]

Under [A1], for every injective linear map f:V→V′ and every k-vector space W the map f⊗idW is injective (Tensoring injections and the kernel of a tensor product of quotient maps over a field).

[F3]

The span of a set is the smallest linear subspace containing it (Linear combination of a finite list, and the span span⁡(S) as the smallest linear subspace containing S); in particular span⁡(v1,…,vn) is a linear subspace containing each vi, and since it is a subspace it contains every finite linear combination of the vi.

[F4]

The span of a finite list consists of its linear combinations. A finite list is an ordered basis exactly when every vector has a unique expansion in it; addition and scaling of the unique coordinate lists show that its coordinate functionals are linear (A finite list v:n→V is an ordered basis if and only if every x∈V equals ∑i<nλivi for exactly one λ:n→F; those scalars are the coordinates of x in that ordered basis).

[F5]

In a finite-dimensional space every linearly independent subset is contained in a basis, with no choice principle used (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

[F6]

Functoriality supplies an additive map f⊗g with (f⊗g)(v⊗w)=f(v)⊗g(w) and respects composition (Module homomorphisms induce tensor-product homomorphisms functorially). For linear f,g over k, this map is k-linear: the scalar action of [F1] gives (f⊗g)(c(v⊗w))=f(cv)⊗g(w)=c(f(v)⊗g(w)), and additivity extends this identity to every finite tensor sum.

Proof

technique · direct
1.1givenA1F1F2F3F4F6algebra

Arbitrary dimension, under [A1]. Put V0:=span⁡(v1,…,vn), a linear subspace of V containing every vi by [F3]; the inclusion ι:V0↪V is injective and linear, so ι⊗idW:V0⊗W→V⊗W is injective by [F2]. Since (ι⊗idW)(∑ivi⊗wi)=∑ivi⊗wi=0 by [F6], injectivity gives ∑ivi⊗wi=0 in V0⊗W. Every element of V0 is a linear combination of the finite list (vi) by the span clause of [F4], so the list (v1,…,vn) spans V0, and it is linearly independent by hypothesis, so it is an ordered basis of V0 with linear coordinate functionals φi:V0→k satisfying φi(vj)=δij by [F4]. For each i, functoriality [F6] gives the linear map φi⊗idW:V0⊗W→k⊗W, and applying it to the relation yields 0=∑j(φi⊗idW)(vj⊗wj)=∑jφi(vj)⊗wj=1⊗wi; the unit isomorphism of [F1] sends 1⊗wi to wi, so wi=0.

1.2givenF1F4F5F6algebra

Finite dimension, without Choice. If V is finite-dimensional, the vectors v1,…,vn are distinct and form a linearly independent finite subset of V, so by [F5] this subset is contained in a basis B of V; listing the finite set B with v1,…,vn in the first n positions gives an ordered basis (b1,…,bm) with bj=vj for j≤n whose coordinate functionals ψ1,…,ψm are linear by [F4] and satisfy ψj(vk)=δjk for j,k≤n. Applying ψi⊗idW to the relation in V⊗W by [F6] gives 0=1⊗wi, hence wi=0 by the unit isomorphism of [F1]; no complement or Zorn extension is used, only the finite-dimensional extension of [F5].

2.1step 1.1step 1.2givenF1∎

Both cases give wi=0 for all i: step 1.1 under the Axiom of Choice in arbitrary dimension and step 1.2 in finite dimension without it; the map Wn→V⊗W with (wi)↦∑ivi⊗wi is linear by bilinearity of elementary tensors [F1] and has trivial kernel, so subtracting two tuples with the same image proves injectivity, which is the equivalent form of the claim.

Remarks

The proof uses AC through the tensor-injection lemma in arbitrary ambient dimension and avoids it when V is finite-dimensional. It establishes sufficiency of these assumptions, not necessity of AC or a sharp boundary between choice principles.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Finite tensor duality and basis-independent coevaluation

Statement

Let V,W be finite-dimensional k-vector spaces.

  1. The bilinear map V∗×W∗→(V⊗W)∗, (f,g)↦[v⊗w↦f(v)g(w)], induces an isomorphism V∗⊗W∗→(V⊗W)∗. For ordered bases (v1,…,vm) of V, (w1,…,wn) of W with dual bases (vi∗), (wj∗), the image of vi∗⊗wj∗ is the dual basis vector of vi⊗wj in the product basis of V⊗W.
  2. For every ordered basis (v1,…,vn) of V the element ∑i=1nvi∗⊗vi∈V∗⊗V is independent of the basis and corresponds to idV under the isomorphism V∗⊗V→Hom⁡(V,V), f⊗v↦[x↦f(x)v] (For finite-dimensional V, the canonical map V∗⊗FW→Hom⁡F(V,W) is an isomorphism). Its image under σV∗,V is the corresponding element ∑ivi⊗vi∗ of V⊗V∗.
  3. The evaluation ev:V∗⊗V→k, f⊗v↦f(v), and the coevaluation coev:k→V⊗V∗, 1↦∑ivi⊗vi∗, are independent of the basis and satisfy (idV⊗ev)∘αV,V∗,V∘(coev⊗idV)=idV and (ev⊗idV∗)∘αV∗,V,V∗−1∘(idV∗⊗coev)=idV∗, the unit isomorphisms k⊗V≅V, V⊗k≅V being understood.

Facts & Assumptions

Given: A field k, finite-dimensional k-vector spaces V,W, ordered bases (v1,…,vm) of V and (w1,…,wn) of W with their dual bases, and ordered bases of V written (v1,…,vn).

[F1]

The tensor product conventions: M⊗N is the tensor product over k with its universal property, every element is a finite sum of elementary tensors, the unit isomorphisms λN:k⊗N→N and ρM:M⊗k→M are given by r⊗n↦rn and m⊗r↦mr, and tensor powers are left-associated with V⊗0=k (Scalars, tensor powers, the empty tensor, opposite algebras and finite sums).

[F2]

The algebraic dual V∗ is the space of linear functionals on V (Linear functionals and the algebraic dual V∗=L(V,F)).

[F3]

The dual family (b∗)b∈B of a basis is defined by b∗(c)=δbc and linear extension (The dual family (b∗)b∈B associated to a Hamel basis B, defined by b∗(c)=δbc).

[F4]

If B=(b1,…,bn) is a basis of a finite-dimensional space, its dual family B∗ is a basis, so it is linearly independent and spans the dual space (The dual family of a finite basis is a basis of the dual space, with the same dimension).

[F5]

The elementary tensors of two bases form a basis of the tensor product (The elementary tensors of two bases form the product basis of the tensor product).

[F6]

Coordinates with respect to an ordered basis are unique, so x=∑iλibi with λ the coordinate list of x; for the dual basis of a basis this gives f=∑if(bi)bi∗ and x=∑ibi∗(x)bi (A finite list v:n→V is an ordered basis if and only if every x∈V equals ∑i<nλivi for exactly one λ:n→F; those scalars are the coordinates of x in that ordered basis).

[F7]

For finite-dimensional V the map Φ:V∗⊗W→Hom⁡(V,W), ϕ⊗w↦[y↦ϕ(y)w], is an isomorphism with inverse Ψ(T)=∑ivi∗⊗T(vi) (For finite-dimensional V, the canonical map V∗⊗FW→Hom⁡F(V,W) is an isomorphism).

[F8]

The symmetry and associativity isomorphisms act on elementary tensors by σM,N(m⊗n)=n⊗m and αL,M,N((l⊗m)⊗n)=l⊗(m⊗n) (Symmetry and associativity isomorphisms for tensor products over a commutative ring).

[F9]

The unit isomorphisms λN:k⊗N→N and ρM:M⊗k→M are isomorphisms with the stated formulas (The regular module is a tensor unit: R⊗RN≅N and M⊗RR≅M).

Proof

technique · direct
1.1givenF1F2F3F4F5algebra

Claim 1. For fixed (f,g)∈V∗×W∗ the pairing V×W→k, (v,w)↦f(v)g(w), is k-bilinear, so it defines a functional θ(f,g)∈(V⊗W)∗ with θ(f,g)(v⊗w)=f(v)g(w) by the universal property in [F1], the star denoting the space of linear functionals [F2]; the assignment (f,g)↦θ(f,g) is itself k-bilinear, so it induces a k-linear map θ:V∗⊗W∗→(V⊗W)∗ by [F1]. On the one hand (vi∗⊗wj∗) is a basis of V∗⊗W∗ by [F4] and [F5], on the other hand the dual vectors (vi⊗wj)∗ in (V⊗W)∗ of the product basis (vi⊗wj) (a basis by [F5]) form a basis of (V⊗W)∗ by [F4]; and θ(vi∗⊗wj∗)(vk⊗wl)=vi∗(vk)wj∗(wl)=δikδjl=(vi⊗wj)∗(vk⊗wl) by [F3], so θ(vi∗⊗wj∗)=(vi⊗wj)∗ because linear functionals agreeing on the spanning product basis agree. If z=∑i,jcijvi∗⊗wj∗ satisfies θ(z)=0, then ∑i,jcij(vi⊗wj)∗=0 and linear independence of the dual product basis [F4] gives all cij=0, so θ is injective; and every L∈(V⊗W)∗ is L=∑i,jdij(vi⊗wj)∗=θ(∑i,jdijvi∗⊗wj∗) by spanning [F4], so θ is surjective. Hence θ is an isomorphism with the stated values on the dual product basis.

1.2givenF6F7F8algebra

Claim 2. By [F7] the map Φ:V∗⊗V→Hom⁡(V,V) is an isomorphism, so the preimage of idV is unique and any two bases (v1,…,vn) give the same element as soon as both give idV. For y∈V the coordinate expansion of [F6] gives y=∑ivi∗(y)vi, hence Φ(∑ivi∗⊗vi)(y)=∑ivi∗(y)vi=y on a spanning set of V, so Φ(∑ivi∗⊗vi)=idV and the element ∑ivi∗⊗vi is the unique preimage of idV, independent of the basis. Its image under σV∗,V is ∑ivi⊗vi∗ by the elementary-tensor formula of [F8].

2.1step 1.2F1F6F8F9algebra

Claim 3. The pairing V∗×V→k, (f,v)↦f(v), is k-bilinear, so it induces ev:V∗⊗V→k, f⊗v↦f(v), by [F1]; evaluation is basis-free. The coevaluation coev:k→V⊗V∗ is defined by 1↦∑ivi⊗vi∗, which by step 1.2 is independent of the basis and equals σV∗,V applied to the unique preimage of idV; it is k-linear because k is spanned by 1. For the first zigzag, use the conventions of [F1] and the formulas of [F8] and [F9]: for x∈V, (coev⊗idV)(1⊗x)=∑i(vi⊗vi∗)⊗x, the associator sends this to ∑ivi⊗(vi∗⊗x), and (idV⊗ev) sends it to ∑ivi⊗vi∗(x)=x⊗1 by [F6], which the unit isomorphism ρV identifies with x; both composites are linear in x, so they agree everywhere. For the second zigzag, f⊗1 maps under (idV∗⊗coev) to ∑if⊗(vi⊗vi∗), the inverse associator sends this to ∑i(f⊗vi)⊗vi∗, and (ev⊗idV∗) sends it to ∑if(vi)(1⊗vi∗)=1⊗f by the dual expansion of [F6], which the unit isomorphism λV∗ identifies with f; again both composites are linear, so equality on the spanning elements f⊗1 proves the identity.

3.1step 1.1step 1.2step 2.1∎

Steps 1.1, 1.2 and 2.1 prove claims 1, 2 and 3 respectively, with the dual product basis values, the basis independence of the preimage of idV, and both zigzag identities established.

Remarks

  • Infinite dimension is deliberately outside the claim. No surjectivity of V∗⊗W∗→(V⊗W)∗ is claimed in infinite dimension, and the companion page's An infinite-dimensional tensor-dual functional outside the image ↗ exhibits a functional outside the image when V has an infinite basis, so the finite-dimensional hypothesis of part 1 cannot simply be dropped.
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

The free associative R-algebra on a set and descent of relations

Statement

Let R be a commutative ring and S a set. There is a unital associative R-algebra R⟨S⟩, the free associative R-algebra on S, whose underlying R-module is free on the set of finite words in S (including the empty word), with product given on words by concatenation and extended R-bilinearly.

  1. Universal property. For every R-algebra A (Algebras over a commutative ring, central structure maps, and algebra homomorphisms) and every map S→A there is a unique unital R-algebra homomorphism R⟨S⟩→A extending it. When R=k is a field and S indexes a basis of a vector space V, R⟨S⟩ reproduces the published tensor algebra T(V) (Tensor algebra of a vector space, Universal property of the tensor algebra).
  2. Two-sided ideal description. For E⊆R⟨S⟩ the two-sided ideal (E) (The ideal generated by a subset and principal ideals) is the set of finite sums ∑sasesbs with as,bs∈R⟨S⟩ and es∈E.
  3. Quotient universal property. If φ:R⟨S⟩→A is an R-algebra homomorphism killing E, then φ factors uniquely through the quotient R⟨S⟩/(E) (A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring); the quotient is the presented R-algebra with generators S and relations E.

Facts & Assumptions

Given: A commutative ring R and a set S.

[F1]

A natural number is a von Neumann natural n={0,…,n−1}, so a function n→S is a finite list of elements of S; function sets, restrictions and functions extended by one value are available (The natural numbers N (von Neumann), The set BA of all functions A→B).

[F2]

Addition of natural numbers satisfies m+0=m and m+σ(n)=σ(m+n), is associative and commutative, is cancellative, has 0 as two-sided identity, and is compatible with the order; N is trichotomously linearly ordered and i<n means i∈n (Addition is associative, Addition is commutative, Left identity for addition, Addition is cancellative, On N the order is membership: m<n  ⟺  m∈n, ≤ is a linear order on N, Order is compatible with addition).

[F3]

The free R-module on a set X is R(X)=⨁x∈XR, with standard basis ex and unique finitely supported coefficient families; a set map from a basis extends uniquely to an R-linear map (The free module on a set and its standard basis, Universal property of the free module on a set).

[F4]

Balanced pairings induce unique group homomorphisms out of the tensor product with the prescribed values on elementary tensors (Universal property of the tensor product for balanced maps into abelian groups).

[F5]

An R-algebra is a unital ring with a central unital structure map, and algebra homomorphisms are unital ring homomorphisms over it (Algebras over a commutative ring, central structure maps, and algebra homomorphisms, Commutative ring, Ring homomorphism: additive, multiplicative, and required to send 1 to 1).

[F6]

Two-sided ideals are additive subgroups closed under both one-sided multiplications; (E) is the intersection of all two-sided ideals containing E (Left, right and two-sided ideals, The ideal generated by a subset and principal ideals).

[F8]

The tensor algebra T(V)=⨁n≥0V⊗n of a k-vector space is a unital associative k-algebra, and every linear map V→A into a unital associative k-algebra extends uniquely to a unital k-algebra homomorphism T(V)→A; the degree-one inclusion is j:V→T(V) (Tensor algebra of a vector space, Universal property of the tensor algebra).

Proof

technique · direct
1.1givenF1F2algebraconstruct

Words and concatenation. Call a word in S a function w:n→S with n∈N its length, and write W:=⋃n∈NSn for the set of words; the empty word is the unique function 0→S (there is exactly one, by [F1]). If w:m→S and v:n→S, define the concatenation wv:m+n→S by recursion on n: wv:=w when n=0; and when n=σ(n′), write v′ for the restriction of v to n′, a:=v(n′) for the last letter, and define wv as the function m+σ(n′)=σ(m+n′) extending wv′ by the value a at the new index m+n′ (the case split uses that every index i<n satisfies i<n−1 or i=n−1 by trichotomy [F2], and uniqueness of the decomposition i=m+j for m≤i follows from commutativity and cancellation [F2]). Unwinding the two recursive clauses, an index of wv lying in the first m positions carries the corresponding letter of w and an index i=m+j with j<n carries v(j); associativity (wv)u=w(vu) is then proved by induction on the length of u: for u of length 0 both sides are wv, and for u with last letter a and predecessor u′ one has w(vu)=w((vu′)a)=(w(vu′))a=((wv)u′)a=(wv)u by the induction hypothesis and the defining clause, the domains being equal by associativity of addition [F2]; the empty word is neutral since w∅=w by definition and ∅v=v by the same induction.

2.1step 1.1F3F4F5F9algebra

The algebra R⟨S⟩. Let F:=R(W) be the free R-module on the set W of words, with basis (uw)w∈W ([F3]), and let μ:F⊗RF→F be the group homomorphism obtained from the R-bilinear (hence balanced) pairing (∑wawuw,∑vbvuv)↦∑w,vawbvuwv by [F4] and [F9]. Define fg:=μ(f⊗g); the displayed formula makes this multiplication R-bilinear and gives uwuv=uwv. Its associativity follows from associativity of concatenation of step 1.1 after expanding finite sums by bilinearity, and u∅ is a two-sided identity because ∅ is neutral for concatenation; hence F with this multiplication is a unital associative ring, and the map R→F, r↦ru∅, is a central unital structure map because scalars commute with the basis, so R⟨S⟩:=F is a unital associative R-algebra [F5] with product given on words by concatenation.

3.1step 2.1givenF5F6algebra

Ideal description. Let R⟨S⟩ be the R-algebra of step 2.1 and let E⊆R⟨S⟩; let J be the set of finite sums ∑sasesbs with as,bs∈R⟨S⟩, es∈E. The empty sum shows 0∈J; a sum of two such finite sums is again one, and −aeb=(−a)eb, so J is an additive subgroup; for c∈R⟨S⟩ one has c(aeb)=(ca)eb and (aeb)c=ae(bc), so J is a two-sided ideal [F6]. It contains E, since e=1e1, and every two-sided ideal I⊇E contains every aeb with e∈E by the left and right ideal properties, hence contains all finite sums in J; therefore J is a two-sided ideal containing E and contained in every such ideal, so J=(E) by the description of (E) as the intersection [F6].

3.2step 2.1F3F5algebra

Universal property. Let A be an R-algebra and φ0:S→A a map. Define φ^0(uw):=φ0(w(0))φ0(w(1))⋯φ0(w(n−1))∈A for a word w:n→S of length n, the empty product being 1A, and extend R-linearly to φ^0:R⟨S⟩→A by [F3]. Then φ^0(uwv)=φ^0(uw)φ^0(uv) by the defining concatenation rule and induction on the length, and φ^0 is unital and R-linear, so it is a unital R-algebra homomorphism [F5] extending φ0 on the words of length one. If ψ is any unital R-algebra homomorphism extending φ0, then ψ(uw)=φ0(w(0))⋯φ0(w(n−1))=φ^0(uw) for every word, by multiplicativity and induction on the length, so ψ=φ^0 on a spanning set and hence everywhere: the extension is unique.

4.1step 2.1step 3.1F5F7algebra

Quotient universal property. Let I:=(E) and let φ:R⟨S⟩→A be an R-algebra homomorphism killing E, so E⊆ker⁡φ and hence I=(E)⊆ker⁡φ by step 3.1 since the kernel of a ring homomorphism is a two-sided ideal. By [F7] there is a unique ring homomorphism φˉ:R⟨S⟩/I→A with φˉ(x+I)=φ(x); it is unital and respects the structure maps, hence is an R-algebra homomorphism, so it is the unique R-algebra factorization, and R⟨S⟩/(E) is the presented R-algebra on generators S and relations E.

4.2step 3.2F3F8algebra

Tensor algebra. Now let R=k be a field and let S index a basis of a k-vector space V, so e:S→V, s↦es is a bijection onto a basis. The map S→T(V), s↦j(es), extends by step 3.2 to a unital k-algebra homomorphism Θ:k⟨S⟩→T(V), and the linear map V→k⟨S⟩ with es↦us (existing by [F3]) extends by [F8] to a unital k-algebra homomorphism Ξ:T(V)→k⟨S⟩. The composite ΞΘ fixes every one-letter word us, hence is the identity by the uniqueness in step 3.2; and ΘΞ restricts to the identity on V, so by the uniqueness in [F8] it is the identity on T(V). Thus Θ is an isomorphism of unital k-algebras and k⟨S⟩ reproduces T(V).

5.1step 1.1step 2.1step 3.1step 3.2step 4.1step 4.2∎

Collecting: step 1.1 constructs the words and their associative concatenation, step 2.1 the R-algebra R⟨S⟩ free on the words on which the product is concatenation, step 3.2 its universal property, step 4.2 the tensor-algebra identification for R=k a field, step 3.1 the two-sided ideal description and step 4.1 the quotient universal property, so all three parts of the claim hold.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Presentation base change and transport of explicit bases to commutative specializations

Statement

Let φ:R→S be a homomorphism of commutative rings, let X be a set and let R⟨X⟩ be the free R-algebra on X (The free associative R-algebra on a set and descent of relations).

  1. There is a unique S-algebra isomorphism S⊗RR⟨X⟩→S⟨X⟩ with s⊗xi1⋯xin↦s xi1⋯xin on words; its inverse sends a word to 1⊗ that word.
  2. If I⊆R⟨X⟩ is a two-sided ideal, then there is a unique S-algebra isomorphism S⊗R(R⟨X⟩/I)≅(S⊗RR⟨X⟩)/im⁡(S⊗RI), sending s⊗(y+I) to (s⊗y)+im⁡(S⊗RI), the image ideal being generated by the images of the relations. No flatness or freeness of S over R is assumed.
  3. If an R-algebra A is free as an R-module with basis (ai), then S⊗RA is a free S-module with basis (1⊗ai). Consequently an explicitly constructed basis isomorphism of a presentation may be tensored with S to give a basis in every commutative specialization.

Facts & Assumptions

Given: A homomorphism φ:R→S of commutative rings, a set X, and a two-sided ideal I⊆R⟨X⟩.

[F1]

R⟨X⟩ is the free associative R-algebra on X: it is free as an R-module on the words in X, the product is concatenation, and every map X→A into a unital R-algebra A extends uniquely to an R-algebra homomorphism R⟨X⟩→A (The free associative R-algebra on a set and descent of relations).

[F2]

Extension of scalars: S is an R-module through φ and also an S-module, so S⊗RR⟨X⟩ is an S-module with s′(s⊗y)=s′s⊗y, and balanced pairings induce linear maps out of tensor products (Restriction of scalars and extension of scalars S⊗RM along a ring homomorphism R→S, Universal property of the tensor product for balanced maps into abelian groups).

[F3]

For R-algebras the tensor product is an R-algebra with (s⊗y)(s′⊗y′)=ss′⊗yy′ and unit 1⊗1 (The tensor product of R-algebras has multiplication (a⊗b)(a′⊗b′)=aa′⊗bb′, Algebras over a commutative ring, central structure maps, and algebra homomorphisms).

[F4]

Tensoring is right exact: the tensor of an exact sequence A→B→C→0 is exact, so the kernel of the tensored surjection is the image of the tensored map on A (Tensoring is right exact).

[F6]

A free module on a set has a standard basis with unique finite expansions, and a set map from a basis extends uniquely to a linear map (The free module on a set and its standard basis, Universal property of the free module on a set).

Proof

technique · direct
1.1givenF1F2F3algebra

The map Θ. Let ρ:R⟨X⟩→S⟨X⟩ be the R-algebra homomorphism extending the generator map X→S⟨X⟩ (which need not be injective when S is the zero ring), existing by [F1]. The pairing β:S×R⟨X⟩→S⟨X⟩, β(s,y):=s ρ(y), is additive in each variable and satisfies β(sφ(r),y)=sφ(r)ρ(y)=sρ(ry)=β(s,ry) because ρ is R-linear [F3, F1], so by [F2] it induces an R-linear map Θ:S⊗RR⟨X⟩→S⟨X⟩ with Θ(s⊗y)=sρ(y); it is S-linear because Θ(s′(s⊗y))=s′sρ(y)=s′Θ(s⊗y). The map S→S⊗RR⟨X⟩, s↦s⊗1, is unital and central by [F3], so the tensor product is an S-algebra with (s⊗y)(s′⊗y′)=ss′⊗yy′, and Θ((s⊗y)(s′⊗y′))=ss′ρ(yy′)=ss′ρ(y)ρ(y′)=Θ(s⊗y)Θ(s′⊗y′) and Θ(1⊗1)=1; so Θ is a unital S-algebra homomorphism, and Θ(s⊗w)=s w on a word w.

1.2givenF2F3F4F5algebra

Part 2. The quotient map π:R⟨X⟩→R⟨X⟩/I is a surjective R-algebra homomorphism with kernel I, so the sequence I→R⟨X⟩→R⟨X⟩/I→0 is exact, and tensoring with S over R gives an exact sequence whose middle map is idS⊗π with kernel J:=im⁡(S⊗RI) by [F4]. The set J is a two-sided ideal of the S-algebra S⊗RR⟨X⟩: it consists of finite sums ∑isi⊗ei with ei∈I and is an additive subgroup, left multiplication by an elementary tensor gives (s⊗y)(si⊗ei)=ssi⊗yei with yei∈I, right multiplication gives (si⊗ei)(s⊗y)=sis⊗eiy with eiy∈I, and additivity extends both closures to all of S⊗RR⟨X⟩. Moreover J is generated as an ideal by the images 1⊗e of the relations, since si⊗ei=(si⊗1)(1⊗ei). By [F5] the surjective S-algebra homomorphism idS⊗π, which kills J, factors through a surjective S-algebra homomorphism Θ‾:(S⊗RR⟨X⟩)/J→S⊗R(R⟨X⟩/I) with kernel J/J=0, hence an isomorphism. Its inverse is induced on the quotient by the pairing (s,y+I)↦s⊗y+J, which is well defined because y′∈y+I gives s⊗y′−s⊗y=s⊗(y′−y)∈J and is bilinear by [F2]; the two maps are inverse because they are inverse on the spanning elements s⊗(y+I) and s⊗y+J. The inverse is the unique S-algebra map with these prescribed values, since the tensors s⊗(y+I) span its source.

1.3givenF2F3F6algebra

Part 3. Let A be free with basis (ai)i∈I, so every y∈A has a unique expansion y=∑iciai by [F6]. The pairing γ:S×A→S(I), γ(s,∑iciai):=∑i(sφ(ci))ei, is additive in each variable and satisfies γ(sφ(r),y)=γ(s,ry) because the coordinates of ry are rci, and φ(rci)=φ(r)φ(ci); by [F2] it induces an S-linear map Γ:S⊗RA→S(I) with Γ(s⊗y)=∑isφ(ci)ei, in particular Γ(1⊗ai)=ei, and the S-linear map Δ:S(I)→S⊗RA with Δ(ei)=1⊗ai, existing by [F6], satisfies ΓΔ=id on the standard basis and ΔΓ(1⊗ai)=1⊗ai; since elementary tensors and basis elements span, Γ and Δ are mutually inverse isomorphisms. Hence (1⊗ai) is an S-basis of S⊗RA, and an explicitly constructed basis isomorphism of a presented R-algebra may be tensored with S to transport the basis to every commutative specialization.

2.1step 1.1F1F3algebra

Inverse for part 1. The map X→S⊗RR⟨X⟩, x↦1⊗x, extends by the universal property of [F1] applied over S to an S-algebra homomorphism Λ:S⟨X⟩→S⊗RR⟨X⟩, and for a word w=xi1⋯xin one has Λ(ρ(w))=Λ(xi1⋯xin)=∏kΛ(xik)=∏k(1⊗xik)=1⊗w by multiplicativity and [F3]; hence ΛΘ(s⊗w)=Λ(sw)=s(1⊗w)=s⊗w for every s∈S and word w, so ΛΘ=id on the spanning elementary tensors s⊗w. Conversely ΘΛ and the identity of S⟨X⟩ are unital S-algebra homomorphisms agreeing on the generators x∈X, so by the uniqueness in [F1] they are equal. Thus Θ is an S-algebra isomorphism, unique because it is determined on the spanning elementary tensors, and Λ sends a word to 1⊗w.

3.1step 1.1step 1.2step 1.3step 2.1∎

Collecting: step 1.1 constructs Θ and step 2.1 proves it is the unique S-algebra isomorphism of part 1 with the stated values; step 1.2 proves the quotient identification of part 2 with the image ideal generated by the relations and no flatness hypothesis; step 1.3 proves the free-basis transport of part 3.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

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.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Finite matrix and module preliminaries: right inverses, rank invariance, finite length and nilpotent trace

Statement

Let k be a field.

  1. Let R be a commutative ring, M a free R-module of finite rank n with basis (e0,…,en−1), and let v0,…,vn−1∈M span M. Then the coordinate matrix A of (v0,…,vn−1) in the basis (ei) has a right inverse, det⁡(A) is a unit of R, and (v0,…,vn−1) is a basis of M. The determinant is formed for n≥1; for n=0 the module is the zero module and the empty family is its basis, with no determinant clause.
  2. If F⊆E is a field extension and A∈Mm×n(F), then the rank of A over F equals its rank over E.
  3. Let B be a finite-dimensional k-algebra and N a finite-dimensional left B-module. A proper submodule has strictly smaller k-dimension, a maximal proper submodule of a nonzero finite-dimensional module exists by maximal dimension (no arbitrary Choice), and iterating produces a finite composition series of N (Composition series and length of a module); in particular N has finite length.
  4. If S1,…,Sm are simple B-modules and N⊆S1⊕⋯⊕Sm is a submodule, then N is isomorphic to a direct sum of a subfamily of the Si, and N has a complement in S1⊕⋯⊕Sm.
  5. If T:N→N is k-linear with Tr=0 for some r≥1, then tr⁡(T)=0 (The basis-independent trace of an endomorphism of a finite-dimensional vector space).

Facts & Assumptions

Given: A field k; a commutative ring R; a free R-module M of finite rank n with basis (e0,…,en−1) and vectors v0,…,vn−1 spanning M; a field extension F⊆E and a matrix A∈Mm×n(F); a finite-dimensional k-algebra B and a finite-dimensional left B-module N; simple B-modules S1,…,Sm and a submodule N⊆S1⊕⋯⊕Sm; a k-linear T:N→N with Tr=0 for some r≥1.

[F1]

A free module on a set has a standard basis with unique finite expansions, and a family (bx) is a basis of a module when every element is uniquely a finite R-linear combination of the bx (The free module on a set and its standard basis).

[F2]

Matrix product and identity over a commutative ring: (AB)ik=∑j<naijbjk, and In has entry 1 on the diagonal and 0 elsewhere (Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose).

[F3]

Invertibility over a commutative ring means the existence of C with AC=In=CA, and the inverse is unique (Invertible square matrices and similarity over a commutative ring).

[F4]

The Leibniz determinant is det⁡(A)=∑σ∈Snsgn⁡(σ)∏i<naσ(i),i and is multiplicative, det⁡(AB)=det⁡(A)det⁡(B) (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix, For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)).

[F5]

A matrix A∈Mn(R) over a commutative ring is invertible if and only if det⁡(A) is a unit of R (A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit).

[F6]

Every family of nonempty sets indexed by a natural number n has a choice function (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

[F7]

The row space Row⁡(A)⊆Fn is the span of the rows, and rank⁡(A)=dim⁡FRow⁡(A), defined because a finite list spans it (Row space, column space, nullspace, row rank, column rank and matrix rank).

[F8]

An R-algebra has a central structure map, and a left module over a k-algebra is a k-vector space through that map (Algebras over a commutative ring, central structure maps, and algebra homomorphisms, Unital left and right modules over a ring; unqualified module means left module).

[F9]

A subspace of a finite-dimensional space is finite-dimensional with no larger dimension; dim⁡FU=dim⁡FV holds for U⊆V exactly when U=V; every independent subset of a finite-dimensional space is contained in a basis (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

[F11]

The trace of a square matrix is the sum of its diagonal entries, and the trace of an endomorphism of a finite-dimensional space is the trace of any matrix of it (The trace tr⁡(A) as the sum of the diagonal entries, The basis-independent trace of an endomorphism of a finite-dimensional vector space).

[F14]

The direct sum ⨁i=1mSi is the submodule of the product of tuples with finite support, with coordinate inclusions (The direct sum of an indexed family of modules).

Proof

technique · direct
1.1givenF1F6algebrachoose

Write the unique coordinate expansion vj=∑i<naijei of each vj in the basis (ei); this is the coordinate matrix A=(aij), and identifying M with Rn through coordinate expansions of [F1] carries vj to the j-th column aj of A and is an R-module isomorphism. Since the vj span M, the columns aj span Rn, so for every i<n the set {b∈Rn:Ab=ei} is nonempty; by [F6] applied to the function i↦{b∈Rn:Ab=ei} on n there are b0,…,bn−1∈Rn with Abi=ei, and B∈Mn(R) denotes the matrix with i-th column bi.

1.2givenF7F12algebra

Let U⊆Fn be the F-row space of A and (u0,…,ur−1) an F-basis of it, so that r=rank⁡F(A) by [F7]; by [F12] the field extension makes En an F-vector space containing Fn, and viewing rows and the ui in En, every row of A is an F-combination of the ui and hence an E-combination, so every E-combination of the rows is an E-combination of the ui: each ui is itself an F-combination of the rows and therefore lies in UE, so the list (u0,…,ur−1) E-spans the E-row space UE of the matrix A read over E.

1.3givenF8F9algebra

A submodule of N is closed under k-scalars through the structure map of the k-algebra B of [F8], hence is a k-linear subspace of N; consequently, if L⊊L′⊆N are submodules then dim⁡kL<dim⁡kL′ by [F9].

1.4givenF13F14algebra

Claim 4 is proved by induction on m. For m=0 the direct sum is 0, so N=0 is the empty direct sum with complement 0; for m=1 the only submodules of the simple module S1 are 0 and S1, the direct sums over the empty and the full subfamily, with complements S1 and 0; for m≥2, write S:=S1 and M:=S2⊕⋯⊕Sm, a direct sum of m−1 simple modules, so that S1⊕⋯⊕Sm=S⊕M with the coordinate projections as in [F14], and let N⊆S⊕M be a submodule.

1.5givenF9F10algebra

If T:N→N is k-linear with Tr=0, put Kj:=ker⁡(Tj) for j≥0, so that K0=0 and 0=K0⊆K1⊆⋯⊆Kr=N is a chain of k-subspaces of the finite-dimensional space N, with Kj finite-dimensional for every j by [F9]; extend a basis of Kj successively to a basis of Kj+1 using the extension clause of [F9] and concatenate the successive blocks to an ordered basis (w1,…,wd) of N in the sense of [F10].

2.1step 1.1F2F4algebra

By [F2] the i-th column of AB is Abi=ei, so AB=In; by [F4] det⁡(A)det⁡(B)=det⁡(AB)=det⁡(In), and the Leibniz expansion of det⁡(In) has vanishing products ∏i<n(In)σ(i),i unless σ=id⁡, so det⁡(In)=1 for n≥1 and det⁡(A)det⁡(B)=1: the determinant det⁡(A) is a unit of R with inverse det⁡(B).

2.2step 1.2F7F12algebra

Suppose ∑i<rλiui=0 in En with all λi∈E. The coefficients span an F-subspace L⊆E that is spanned by the finitely many λi; discarding from that finite spanning list each vector lying in the span of those retained leaves an F-basis (μ1,…,μt) of L, and λi=∑tcitμt with cit∈F. For each coordinate k<n the equality gives 0=∑i<rλiui(k)=∑tμt(∑i<rcitui(k)) in E; the μt are F-independent in E and the coefficients ∑i<rcitui(k) lie in F, so they all vanish, that is ∑i<rcitui=0 in Fn for every t; the ui are F-independent, so every cit=0 and hence every λi=0: the list (u0,…,ur−1) is E-independent.

2.3step 1.3F9choosealgebra

Let N≠0. The k-dimensions dim⁡kL of the proper submodules L⊊N form a nonempty set of natural numbers, since the zero submodule is proper and has dimension 0, bounded above by dim⁡kN−1 by [F9]; let d be its largest element and let L be a proper submodule with dim⁡kL=d (one selection from a nonempty set of submodules). Then L is maximal proper: if L⊊L′⊆N, step 1.3 gives dim⁡kL′>dim⁡kL=d, so L′ is not a proper submodule with dimension at most d, whence L′=N.

2.4step 1.4F13F14algebra

Case N∩S≠0 of claim 4. Since S is simple and N∩S is a nonzero submodule of it, N∩S=S, and for n=s+u∈N with s∈S, u∈M one has u=n−s∈N∩M; hence N=S⊕(N∩M) with the sum direct because S∩M=0. By the induction hypothesis applied to N∩M⊆M there are a subfamily (Si)i∈J, J⊆{2,…,m}, with N∩M≅⨁i∈JSi and a submodule K′⊆M with (N∩M)∩K′=0 and (N∩M)+K′=M; then N≅S⊕⨁i∈JSi, and K′ is a complement of N in S⊕M, because N+K′=S+(N∩M)+K′=S⊕M and an element of N∩K′ lies in M, hence has zero S-component and lies in (N∩M)∩K′=0.

3.1step 2.1F1F3F5algebra

By [F5] the unit determinant of step 2.1 makes A invertible, so [F3] gives C with CA=AC=In; if ∑j<nλjaj=0 in Rn, then 0=C(0)=CAλ=λ, so the columns aj of A are linearly independent and, being spanning, they form a basis of Rn; applying the coordinate isomorphism to the preimages shows (v0,…,vn−1) is a basis of M, which proves claim 1 for n≥1; for n=0 the module is 0 with empty basis by [F1] and there is no determinant clause.

3.2step 1.2step 2.2F7algebra

The list (u0,…,ur−1) is E-independent by step 2.2 and E-spans UE by step 1.2, so it is an E-basis of UE; therefore rank⁡E(A)=dim⁡EUE=r=dim⁡FU=rank⁡F(A) by [F7], which is claim 2.

3.3step 2.3F9F13algebra

Iteration for claim 3: starting from N and repeatedly replacing a nonzero module by a maximal proper submodule, which exists by step 2.3, produces a strictly decreasing chain N=N0⊋N1⊋⋯⊋Nt=0 of finite-dimensional submodules, because each Ni is finite-dimensional by [F9] and each step strictly lowers the k-dimension, so the process terminates after at most dim⁡kN steps. Reading the chain upwards gives 0=Nt⊊⋯⊊N0=N, and each factor Ni−1/Ni is simple: if it had a nonzero proper submodule Q, the preimage {x∈Ni−1:x+Ni∈Q} would be a submodule strictly between Ni and Ni−1, contradicting maximality of Ni in Ni−1; this is a finite composition series of N in the sense of [F13], so N has finite length.

3.4step 2.4F13F14algebra

Case N∩S=0 of claim 4. The projection π:N→M is then injective, and π(N)⊆M is a submodule to which the induction hypothesis applies: there are a subfamily (Si)i∈J, J⊆{2,…,m}, with π(N)≅⨁i∈JSi and a submodule K⊆M with π(N)∩K=0 and π(N)+K=M. For u∈π(N) let f(u)∈S be the S-component of the unique n∈N with π(n)=u, so that this n is f(u)+u and N={f(u)+u:u∈π(N)}; the projection and the S-component map are B-module homomorphisms; the inverse of the restricted projection respects addition and B-scalars, so f is a B-module homomorphism. Every x=s+u∈S⊕M with u=u1+u2, u1∈π(N), u2∈K, equals (f(u1)+u1)+((s−f(u1))+u2)∈N+(S⊕K), and if n=f(u)+u∈N∩(S⊕K) with n=s′+k, k∈K, then projecting to M gives u=k, so u∈π(N)∩K=0, u=0 and n=f(0)=0 by linearity of f, whence N∩(S⊕K)=0; therefore S⊕K is a complement of N in S⊕M, and N≅π(N)≅⨁i∈JSi through the injective projection.

4.1step 1.4step 2.4step 3.4algebra

Cases 2.4 and 3.4 cover every submodule N⊆S⊕M according to whether N∩S is zero, and in both cases N is isomorphic to a direct sum of a subfamily of S1,…,Sm and has a complement in S1⊕⋯⊕Sm; with the case m≤1 of step 1.4 this proves claim 4 by induction on m.

5.1step 1.5step 3.1step 3.2step 3.3step 4.1F10F11algebra∎

In the ordered basis of step 1.5, a basis vector w∈Kj coming from the j-th block satisfies T(w)∈Kj−1, which is the span of the blocks preceding w; the matrix [T] of T in this ordered basis of [F10] therefore has zeros on its diagonal, and tr⁡(T) is the trace of that matrix by [F11] and thus the sum of its diagonal entries, which is 0. This proves claim 5, and with steps 3.1, 3.2, 3.3, 4.1 all five claims are proved.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

The left regular module and its tensor powers detect linear and tensor identities

Statement

Let R be a commutative ring and let A be a unital R-algebra (Algebras over a commutative ring, central structure maps, and algebra homomorphisms), with A regarded as its left regular module.

  1. For a,b∈A one has a=b if and only if a⋅1A=b⋅1A.
  2. For n≥1 the tensor power A⊗n is a left A-module via a⋅(a1⊗⋯⊗an)=(aa1)⊗⋯⊗an. If a⋅z=b⋅z for all z∈A⊗n, then a=b; in particular the single element 1A⊗n detects equality. The analogous statement holds for the right regular structure. The empty tensor power A⊗0=R carries no canonical left A-module structure here, so no n=0 case is claimed.
  3. For n≥1, if f,g:A×n→M are R-multilinear and agree on every n-tuple, then the R-linear maps A⊗n→M they induce (Finite iterated tensor products represent multilinear maps independently of parenthesization) agree; conversely, agreement of the induced maps gives agreement on all pure tensors a1⊗⋯⊗an.
  4. Descent warning: if π:A→A/I is a quotient of R-algebras (A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring), the induced map A⊗n→(A/I)⊗n is surjective, but an identity between R-linear maps out of (A/I)⊗n may be checked on images of pure tensors of A only after those maps have been shown to be well defined on the quotient; surjectivity alone is not descent.

Facts & Assumptions

Given: A commutative ring R, a unital R-algebra A, an R-module M for claim 3, a two-sided ideal I⊆A, and an integer n≥1.

[F1]

A unital R-algebra A has a central unital structure map and is a left and right module over itself; for a left A-module the action satisfies 1A⋅x=x and a⋅(b⋅x)=(ab)⋅x (Algebras over a commutative ring, central structure maps, and algebra homomorphisms, Unital left and right modules over a ring; unqualified module means left module).

[F2]

The tensor product A⊗R⋯⊗RA exists with its balanced universal property, every element is a finite sum of elementary tensors, and an R-multilinear map out of A×n induces a unique R-linear map out of the n-fold tensor power, independently of parenthesization (The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums, Universal property of the tensor product for balanced maps into abelian groups, Finite iterated tensor products represent multilinear maps independently of parenthesization).

[F3]

Tensoring a surjective homomorphism is surjective (Tensoring is right exact).

[F4]

A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring (A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring, The quotient ring R/I with (r+I)(s+I)=rs+I).

Proof

technique · direct
1.1givenF1

Claim 1: 1A is a two-sided identity of the regular module, so a=a⋅1A and b=b⋅1A by [F1]; conversely a⋅1A=b⋅1A is a=b.

1.2givenF1F2algebra

Claim 2: for a∈A the map A×n→A⊗n, (a1,…,an)↦(aa1)⊗a2⊗⋯⊗an, is R-multilinear, so it induces an R-linear map λa:A⊗n→A⊗n with λa(a1⊗⋯⊗an)=(aa1)⊗a2⊗⋯⊗an by [F2]. On elementary tensors λaλb=λab, λa+b=λa+λb and λ1A=id⁡, and since elementary tensors span [F2], these identities extend to all of A⊗n, so a⋅z:=λa(z) makes A⊗n a left A-module [F1]. The n-fold multiplication a1⊗⋯⊗an↦a1a2⋯an is the R-linear map μ:A⊗n→A induced by the R-multilinear product [F1, F2], and μ(λa(z))=aμ(z) for elementary tensors and hence for all z by linearity. If a⋅z=b⋅z for all z, then in particular λa(1A⊗n)=λb(1A⊗n), that is a⊗1A⊗(n−1)=b⊗1A⊗(n−1); applying μ gives a⋅1A=b⋅1A, and a⋅1A=a while b⋅1A=b by [F1], so a=b: the single element 1A⊗n detects equality. The right-handed statement is the mirror computation with ρa(a1⊗⋯⊗an)=a1⊗⋯⊗(ana).

1.3givenF2algebra

Claim 3: by [F2] the R-multilinear map f induces the unique R-linear map f‾:A⊗n→M with f‾(a1⊗⋯⊗an)=f(a1,…,an), and likewise for g; if f=g as functions then f‾ and g‾ agree on every elementary tensor, hence on the whole tensor power, so f‾=g‾. Conversely, if f‾=g‾, then for every tuple f(a1,…,an)=f‾(a1⊗⋯⊗an)=g‾(a1⊗⋯⊗an)=g(a1,…,an), so the multilinear maps agree on all tuples and the induced maps agree on all pure tensors.

1.4givenF3F4algebra

Claim 4: the quotient map π:A→A/I is a surjective R-algebra homomorphism, and π⊗n:=π⊗⋯⊗π:A⊗n→(A/I)⊗n is surjective by iterated [F3]; it sends an elementary tensor a1⊗⋯⊗an to π(a1)⊗⋯⊗π(an). If φ‾:(A/I)⊗n→Q is an R-linear map out of the quotient tensor power, then to check an identity between two such maps on images of pure tensors of A one must first know that each map is well defined on the quotient, equivalently, any proposed map φ:A⊗n→Q must annihilate ker⁡(π⊗n), so that φ=φ‾∘π⊗n for a well-defined map φ‾; that is the descent obligation, and surjectivity of π⊗n alone equips no map out of A⊗n with a well-defined value on a class. For ring-level descent the quotient universal property [F4] is the tool: a homomorphism killing I factors uniquely through π.

2.1step 1.1step 1.2step 1.3step 1.4∎

Collecting: step 1.1 proves claim 1, step 1.2 proves both the module structure and the detection statement of claim 2 together with its right-handed mirror, step 1.3 proves both directions of claim 3, and step 1.4 records the descent warning of claim 4.

5 · Examples, counterexamples and false statements

None yet.

Sources