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.
Virtual Weyl combinations detect q-Schur block separation
Statement
Let be a field, , , and let be the -Schur algebra over with Weyl modules for (The type-A q-Schur algebra and its Weyl modules). Let be a finite dimensional right -module all of whose composition factors lie in a single block of (Blocks of a finite-dimensional algebra via primitive central idempotents), and let integers , , satisfy in the Grothendieck group (Grothendieck group of an essentially small abelian category). Then lies in whenever . In particular no nonzero virtual combination of Weyl classes all of whose terms lie outside can equal the class of a module in .
No choice principle is used.
Facts & Assumptions
Given: A field , , , the algebra with Weyl modules , , a finite dimensional right -module whose composition factors all lie in one block , and integers with in (The type-A q-Schur algebra and its Weyl modules, Grothendieck group of an essentially small abelian category).
Blocks: is the unique decomposition of the identity of into pairwise orthogonal primitive central idempotents, the blocks are the two-sided ideals , and for every right -module one has ; a simple module lies in exactly one block and satisfies for that (Blocks of a finite-dimensional algebra via primitive central idempotents). We write for the idempotent of the block of the statement.
Each Weyl module has nonzero simple head (The type-A q-Schur algebra and its Weyl modules).
The proof of Semistandard weight dimensions detect virtual Weyl classes, steps 1.1 and 3.1, gives additive weight dimensions and the weight matrix . This matrix, restricted to partitions with at most parts, is unitriangular and hence invertible by The Kostka change of basis is dominance-unitriangular. Applying these dimensions to a zero virtual Weyl combination forces every coefficient to vanish. This proves the linear independence used here; no Weyl filtration of an arbitrary module is assumed.
An exact functor between abelian categories induces a homomorphism of Grothendieck groups, and the finite-dimensional -modules form an abelian category in which is computed by composition multiplicities (Grothendieck group of an essentially small abelian category).
Proof
Multiplication by the central idempotent is the projection of every right -module onto its -summand: by [F1], so is that direct summand and is a submodule, and exactly when all composition factors of lie in . The assignment is exact, because it is the projection onto a direct summand of the identity functor: for one has , and , so it preserves kernels and images.
A nonzero finite-dimensional module has a simple quotient: choose a proper submodule of maximal vector-space dimension. If a Weyl module had two nonzero summands, each would have a nonzero head, so its head would not be simple, contrary to [F2]. Thus it is indecomposable. Its block decomposition [F1] has precisely one nonzero summand, the block containing its head ; hence is either or .
Apply the exact projection of step 1.1 to the class identity of the hypothesis. Since by the hypothesis that all composition factors of lie in , and since is or by step 1.2, the induced identity in reads Subtracting it from the given identity yields in .
By the linear independence of the Weyl classes [F3], all coefficients in the vanishing combination of step 2.1 are zero: for every with , which is the contrapositive of the assertion that implies .
Depends on
Used by
Dependency tree · two levels
35 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 79-page prepublication manuscript (1998; expanded AMS University Lecture Series 15 edition, 1999) (standard reference, not scraped)
- Sinead Lyle and Andrew Mathas, Blocks of affine and cyclotomic Hecke algebras, author-hosted complete 19-page preprint (published in Math. Z.) (standard reference, not scraped)