Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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 cell form is associative and its radical is a submodule

Statement

Let R be a commutative ring and A a cellular R-algebra with cellular basis (C,Λ) and cell modules Cλ (Cellular bases and cell modules). For each λ∈Λ there is a unique R-bilinear form ⟨ , ⟩λ:Cλ×Cλ⟶R with cusλctvλ≡⟨csλ,ctλ⟩λ cuvλ(modA⊳λ) for all s,t,u,v∈T(λ); in particular the scalar coefficient on the right hand side is independent of u and v, and ⟨csλ,ctλ⟩λ depends only on s,t. This form is (i) symmetric, ⟨x,y⟩λ=⟨y,x⟩λ; (ii) associative, ⟨xa,y⟩λ=⟨x, i(a)y⟩λ for all a∈A, where i(a)y denotes the right action y i(a) of i(a) on y, i.e. the left action a⋅y:=y i(a); (iii) characterised by x cuvλ=⟨x,cuλ⟩λ cvλ for x∈Cλ; and (iv) its radical rad Cλ:={x∈Cλ:⟨x,y⟩λ=0 for all y∈Cλ} is an A-submodule of Cλ, namely the kernel of x↦⟨x,−⟩λ.

Facts & Assumptions

Given: A commutative ring R, a cellular R-algebra A with cellular basis (C,Λ), a label λ∈Λ, and the cell module Cλ with basis {ctλ:t∈T(λ)} (Cellular bases and cell modules).

[F1]

The cellular axioms and cell-module structure (Cellular bases and cell modules): C={cstλ} is an R-basis of A; A⊳λ=⟨cuvμ:μ⊳λ⟩R; the R-linear map i with i(cstλ)=ctsλ is an algebra anti-automorphism with i2=id; for all λ, t∈T(λ), a∈A there are rv∈R with cstλa≡∑vrvcsvλ(modA⊳λ) for all s; Cλ is a right A-module by ctλa:=∑vrvcvλ when cttλa≡∑vrvctvλ(modA⊳λ), and a left A-module via i with a⋅ctλ:=ctλi(a); and A⊵λ/A⊳λ≅Cλ⊗RCλ via cstλ+A⊳λ↦csλ⊗ctλ, where A⊵λ=⟨cuvμ:μ⊵λ⟩R.

Proof

technique · direct
1.1givenF1algebra

The submodules A⊵λ and A⊳λ are two-sided ideals of A, and the following two congruence rules hold modulo A⊳λ: for all a∈A and u,v∈T(λ), cusλa≡∑w∈T(λ)rw cuwλ,a ctvλ≡∑w∈T(λ)sw cwvλ, where the rw do not depend on u and the sw do not depend on v. Indeed, the first is the cellular rule [F1] applied to the fixed label λ, the second-slot index s and the element a, which gives coefficients independent of the free first index u; right multiplication by a therefore preserves each A⊵μ and A⊳μ, so A⊵λ and (as its span over all μ⊳λ) A⊳λ are right ideals, while applying the anti-automorphism i to the first rule — it swaps the two indices, fixes R and preserves both spans — gives the second rule and shows that they are also left ideals.

2.1givenstep 1.1F1algebra

Existence and uniqueness of the form: for all s,t∈T(λ) there is a unique r=r(s,t)∈R with cusλctvλ≡r cuvλ(modA⊳λ) for all u,v, and r depends only on s,t. Since A⊳λ is a two-sided ideal by step 1.1, the quotient ring A/A⊳λ contains Q:=A⊵λ/A⊳λ with R-basis the classes cˉuv:=cuvλ+A⊳λ. Applying the two rules of step 1.1 to the product cusλctvλ — first with a:=ctvλ, then with a:=cusλ — gives cˉuscˉtv=∑wρwcˉuw=∑xσxcˉxv, where ρw does not depend on u and σx does not depend on v. Comparing the coefficients of cˉab in the two bases: the left expansion contributes ρb when a=u and 0 otherwise, the right expansion σa when b=v and 0 otherwise; hence σa=0 for a≠u and ρb=0 for b≠v, leaving cˉuscˉtv=σucˉuv=ρvcˉuv. The common value σu=ρv is independent of v (being σu) and independent of u (being ρv), so it depends only on s,t; call it ⟨csλ,ctλ⟩λ. It is determined by the displayed congruence, because the coefficient of cˉuv in the indicated free basis is unique, including over the zero ring. Bilinear extension gives the unique R-bilinear form with the stated property.

3.1step 2.1F1algebra

Symmetry: for all s,t,u,v, using that i is an anti-automorphism with i(cabλ)=cbaλ, fixes R and preserves A⊳λ, one has ⟨csλ,ctλ⟩λcˉuv≡cusλctvλ=(cvtλcsuλ)i≡(⟨ctλ,csλ⟩λcvuλ)i=⟨ctλ,csλ⟩λcˉuv, so ⟨csλ,ctλ⟩λ=⟨ctλ,csλ⟩λ, and by bilinearity ⟨x,y⟩λ=⟨y,x⟩λ for all x,y∈Cλ.

3.2step 1.1step 2.1F1algebra

Associativity: fix s,t∈T(λ) and a∈A, and write csλa=∑wrwcwλ in Cλ — the coefficients rw are those of step 1.1. Then, by step 2.1 applied first to csλa and bilinearity of the form, ⟨csλa,ctλ⟩λcˉuv=∑wrwcˉuwcˉtv=(cˉusaˉ)⋅cˉtv=cˉus⋅(aˉcˉtv). The second rule of step 1.1 writes actvλ≡∑xsxcxvλ(modA⊳λ) with coefficients sx characterised by ctλi(a)=∑xsxcxλ in Cλ; hence cˉus⋅(aˉcˉtv)=∑xsxcˉuscˉxv=∑xsx⟨csλ,cxλ⟩λcˉuv=⟨csλ,ctλi(a)⟩λcˉuv=⟨csλ,a⋅ctλ⟩λcˉuv. Cancelling the basis element cˉuv gives ⟨csλa,ctλ⟩λ=⟨csλ,i(a)ctλ⟩λ; by bilinearity this is ⟨xa,y⟩λ=⟨x,i(a)y⟩λ for all x,y∈Cλ. Replacing a by i(a) and using i2=id gives the equivalent left-action form ⟨x i(a),y⟩λ=⟨x, i(a)⋅y⟩λ, where i(a)⋅y=y i(i(a))=y a is the left action of i(a): this is the dual statement.

3.3step 2.1F1algebra

The adjointness identity x cuvλ=⟨x,cuλ⟩λcvλ holds for all x∈Cλ and u,v∈T(λ): it suffices to treat x=csλ, and there step 2.1 with (u,s,t,v):=(s,s,u,v) gives cssλcuvλ≡⟨csλ,cuλ⟩λcsvλ(modA⊳λ); by the definition of the right action in [F1], the coefficients of csvλ on the right are exactly the coefficients of cvλ in csλ⋅cuvλ, so csλ cuvλ=⟨csλ,cuλ⟩λcvλ; bilinearity in x extends this to all x.

4.1step 3.2step 3.3algebra∎

The radical is a submodule and a kernel: for fixed y∈Cλ the assignment x↦⟨x,y⟩λ is an R-linear map with kernel {x:⟨x,y⟩λ=0}, so rad Cλ=⋂yker⁡(x↦⟨x,y⟩λ) is an R-submodule; and if x∈rad Cλ then for every a∈A and y∈Cλ step 3.2 gives ⟨xa,y⟩λ=⟨x,i(a)y⟩λ=0, so xa∈rad Cλ: the radical is an A-submodule, namely the kernel of the A-module map x↦⟨x,−⟩λ. This completes the proof of (i)-(iv).

Depends on

Used by

Dependency tree · two levels

4 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