Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 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.

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.

Depends on

Used by

Cited to discharge well-definedness by Scalars, tensor powers, the empty tensor, opposite algebras and finite sums.

Dependency tree · two levels

20 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