Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Nonzero cellular heads classify the simple modules over a field

Statement

Let A be a finite-dimensional cellular algebra over a field F, with finite cell poset Λ. For λ∈Λ, let Δ(λ) and its symmetric invariant form be as in Cell modules, their forms, and radicals, and put D(λ)=Δ(λ)/rad⁡Δ(λ). Then every nonzero D(λ) is absolutely simple, the nonzero D(λ) are pairwise nonisomorphic, and they form a complete set of simple right A-modules up to isomorphism.

Facts & Assumptions

Given: A finite-dimensional cellular algebra A over F with finite cell poset Λ and the modules and forms in the Statement.

[F1]

Cell modules, their forms, and radicals: each Δ(λ) is a right module; its form is symmetric and invariant; the radical is a submodule; and cell-layer multiplication defines that form.

[F2]

Cell data, multipartition dominance, and higher-cell ideals: A≥λ and A>λ are two-sided ideals, with their indicated cell-basis spans.

[F3]

Finite matrix and module preliminaries: right inverses, rank invariance, finite length and nilpotent trace: a finite-dimensional vector space has finite bases, kernels, and quotients; scalar extension of a finite matrix preserves its rank when the scalar extension is a field extension.

Proof

Given: The data in the Statement.

1.1F1algebra

For x=∑tatct∈Δ(λ), the rank-one multiplication identity of [F1] givesxCu,vλ=∑tat⟨ct,cu⟩λcv=⟨x,cu⟩λcv. If the form is not identically zero, its radical is proper and D(λ)≠0. For any x∉rad⁡Δ(λ) there is cu with ⟨x,cu⟩≠0. Every submodule of Δ(λ) containing such an x contains each basis vector cv, because the action identity is exact and division by the nonzero field scalar gives cv=xCu,vλ/⟨x,cu⟩. Thus every submodule not contained in the radical is all of Δ(λ), and the quotient D(λ) is simple.

2.1F1F3step 1.1

Let E/F be any field extension. The Gram matrix of the form has the same rank over E as over F: its rank is characterized by the largest nonzero minor, and a minor in F vanishes in E exactly when it already vanished in F. Hence rad⁡(Δ(λ)⊗FE)=rad⁡Δ(λ)⊗FE, and D(λ)⊗FE is nonzero whenever D(λ) is. Step 1.1, applied over E, proves it simple. Thus it remains simple after every field extension, which is absolute simplicity.

2.2F1F2step 1.1algebra

Suppose D(μ)≠0, so the form on Δ(μ) is not identically zero. Let M be a proper submodule of Δ(λ) and suppose ϕ:Δ(μ)→Δ(λ)/M is nonzero. There is an x∉rad⁡Δ(μ) with ϕ(x)≠0: otherwise, for a fixed x0 outside the radical, each radical vector z is the difference (x0+z)−x0 of two vectors outside the radical, so ϕ would vanish on the whole module. Choose y=∑sbscs with ⟨x,y⟩μ=1 and define at=∑sbsCs,tμ∈A≥μ. The rank-one identity gives xat=ct, so ϕ(ct)=ϕ(x)at. If λ≱μ, then A≥λ∩A≥μ⊆A>λ: a basis shape in the intersection is above both labels, and it cannot equal λ without implying λ≥μ. For any cell basis representative of a vector in Δ(λ), multiplying by at lies in both ideals, so it acts as zero in Δ(λ)/M. Thus every ϕ(ct)=0, contradicting ϕ≠0. Therefore a nonzero map of this kind forces λ≥μ.

3.1F1step 2.2

If D(λ) and D(μ) are nonzero and isomorphic, compose the quotient map Δ(μ)↠D(μ) with the isomorphism to obtain a nonzero map Δ(μ)→Δ(λ)/rad⁡Δ(λ). Step 2.2 gives λ≥μ. Reversing the roles gives μ≥λ. Antisymmetry of the cell poset implies λ=μ.

4.1F1F2step 1.1algebra∎

Choose a linear extension λ1,…,λm of the finite poset in which every maximal remaining element is listed next. The prefix Uk={λ1,…,λk} is upward closed, so Jk=span⁡{Cs,tμ:μ∈Uk} is an ideal: it is the sum of the ideals A≥μ for μ∈Uk. Also Jk=Jk−1+A≥λk, because every label strictly above λk occurs earlier. Let S be a simple right A-module. Since Jm=A, choose the least k with SJk≠0. Then SJk−1=0 and SJk=S, so SA≥λk=S and SA>λk=0. Choose s0∈S and u such that s0Cu,vλk≠0 for some v; this is possible because SA≥λk≠0 and the cell basis spans that ideal. Define ψ:Δ(λk)→S by ψ(ct)=s0Cu,tλk. For a∈A, the cell axiom gives Cu,tλka≡∑wrt,w(a)Cu,wλk modulo A>λk; that higher ideal annihilates S, so ψ(cta)=ψ(ct)a. The map is a nonzero module map and hence surjective. Choose t with ψ(ct)≠0. The annihilator {x∈S:xA≥λk=0} is a submodule because A≥λk is a two-sided ideal. It is proper since SA≥λk=S≠0, so simplicity makes it zero. Hence ψ(ct)A≥λk≠0; since SA>λk=0, some cell basis element Cp,qλk acts nontrivially on ψ(ct). If the form on Δ(λk) were zero, the rank-one action identity would give ctCp,qλk=0, contradicting the module-map identity ψ(ctCp,qλk)=ψ(ct)Cp,qλk≠0. Thus the form is nonzero and its radical is proper. By step 1.1, every proper submodule of Δ(λk) is contained in its radical; since ker⁡ψ is maximal, it equals the radical. Therefore S≅D(λk).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

37 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