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.
Cellular decomposition matrices are unitriangular for the cell order
Statement
Let be a field, a finite-dimensional cellular -algebra with cellular basis and cell modules , (Cellular bases and cell modules, Nonzero cell heads classify the simple modules of a cellular algebra). For with let be the multiplicity of as a composition factor of (well defined by Jordan–Hölder theorem for modules and Composition series and length of a module). Then i.e. a nonzero off-diagonal entry can occur only in the allowed direction of the cell order (larger cell first). Order the labels by a linear extension from smaller to larger. The square submatrix whose rows and columns both have nonzero is lower unitriangular; the full rectangular matrix has the same labelled diagonal and the stated vanishing region. This determines only the diagonal and the vanishing region: no off-diagonal entry is computed by cellularity.
Facts & Assumptions
Given: A field , a finite-dimensional unital cellular -algebra with cellular basis , cell modules and cell forms (Cellular bases and cell modules).
Classification (Nonzero cell heads classify the simple modules of a cellular algebra): if and only if if and only if is not identically zero; in that case is simple and is its unique maximal submodule, and is a complete set of pairwise non-isomorphic simple -modules.
Cell-form calculus (The cell form is associative and its radical is a submodule): for a fixed label ; for ; and is the kernel of .
Cellular axioms (Cellular bases and cell modules): is the span of the with , is the span with ; condition (ii) reads and its -image reads .
Composition multiplicities are additive in short exact sequences and well defined by Jordan-Hölder (Composition series and length of a module, Jordan–Hölder theorem for modules).
Proof
Annihilation: if with , then . Indeed and are two-sided ideals by [F3], and their intersection is spanned by the with and ; no such equals , since would give , so the intersection lies in . Hence and, since , every product with lies in ; the right action of on is read off from with unique coefficients, so acts as the zero operator on .
Nontrivial action: if then some element of acts nontrivially on . Since by [F1], there is with , and by [F2] there is with ; then the element satisfies by [F2], so on it sends the nonzero class of to its nonzero multiple .
Off-diagonal vanishing: suppose with . If , then step 1.1 gives ; an element of acting as zero on a module acts as zero on each of its submodules and quotients, hence on every subquotient of , so annihilates the composition factor of . This contradicts step 1.2. Hence .
Diagonal: for every with . The form radical gives the subquotient , and additivity of composition multiplicities [F4] gives , because is simple by [F1]. The span of the annihilates : for and all one has by [F2]. Hence every element of this span acts as zero on and on all its subquotients, so is not a composition factor of ; otherwise step 1.2 would produce an element of acting nontrivially on it. Therefore and .
Assembly: order the labels by a linear extension from smaller to larger, and restrict both rows and columns to labels with nonzero form quotient. Step 2.1 puts every nonzero entry on or below the diagonal of this square submatrix, and step 2.2 gives diagonal entries . For the full rectangular matrix retain the label comparison ; deleting zero-quotient columns need not leave the labelled diagonal on the numerical matrix diagonal. These statements determine only the diagonal and the vanishing region.
Depends on
Used by
Dependency tree · two levels
15 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
- Andrew Mathas, Hecke algebras and Schur algebras of the symmetric group, complete prepublication manuscript (1998; expanded published edition: AMS University Lecture Series 15, 1999); complete 79-page manuscript, SHA-256 8cfeb611a95a3ff25cb95ad22bfd3a68475818301c34b04d131a8480a1b997e0 (standard reference, not scraped)
- Alexander Kleshchev, Representation theory of symmetric groups and related Hecke algebras, arXiv:0909.4844v1, complete 66-page survey (standard reference, not scraped)
- Andrew Mathas and Marcos Soriano, Seminormal forms and Gram determinants for cellular algebras, arXiv:math/0604108; J. reine angew. Math. 619 (2008) 141-173; complete 29-page author-hosted preprint, SHA-256 a2cd21ced7f35dee695388304c26804ef8ac9c54b661a5d624501c80864698a1 (standard reference, not scraped)