Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-26 (gpt-6-sol)
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 Cartan matrix is D^T D

Statement

If D=(dχφ) is the decomposition matrix and C=(cφψ) is the Cartan matrix, then

C=DTD.

Equivalently,

cφψ=∑χdχφdχψ.

Facts & Assumptions

Given: The decomposition matrix D and the Cartan matrix C of G at p.

[F1]

The Cartan invariants record composition multiplicities in projective covers (Projective indecomposable characters and Cartan invariants).

[L1]

Brauer reciprocity identifies dχφ with the multiplicity of χ in the projective indecomposable character Φφ (Brauer reciprocity).

[F2]

The decomposition map is additive on ordinary representation classes, sends the class afforded by χ to ∑ψdχψ[Sψ], and sends the projective lattice lift affording Φφ to [Pφ] (Decomposition numbers and the decomposition matrix, Projective indecomposable characters and Cartan invariants).

Proof

technique · direct
1.1L1given

Fix φ. Decompose the projective indecomposable character as Φφ=∑χdχφχ by [L1].

2.1F1F2step 1.1algebra

The Cartan entry cφψ is the multiplicity of Sψ in the projective cover Pφ by [F1]. Apply the decomposition map [F2] to the ordinary-character expansion in step 1.1. Its left side becomes [Pφ], while the right side becomes ∑χdχφ∑ψdχψ[Sψ]. Comparing coefficients of [Sψ] gives cφψ=∑χdχφdχψ.

3.1step 2.1algebra∎

This is exactly the (φ,ψ) entry of DTD, so C=DTD.

Depends on

Used by

Dependency tree · two levels

10 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