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.
Generalized decomposition columns have corresponding block support
Statement
Assume the Axiom of Choice. Let be a splitting -modular system for a finite group , with algebraically closed. Fix a -element , put , let be a block of , and let . If for a block of , then Thus the generalized-decomposition column indexed by has nonzero rows in at most the single global block ; in particular it cannot have nonzero entries in two distinct global blocks.
Facts & Assumptions
Given: AC and the modular system, element, centralizer, local block, Brauer character, and row in the Statement.
Brauer's Second Main Theorem gives the required block-support implication for each row (Brauer's Second Main Theorem).
Every ordinary irreducible belongs to one and only one global block (Blocks partition the ordinary and Brauer irreducible characters).
The algebraically closed residue-field condition and AC are the hypotheses of F1 (An algebraically closed field: every nonconstant polynomial has a root in the field and The Axiom of Choice).
Proof
Apply F1 to the row and the fixed local character . A nonzero entry gives , proving the displayed implication.
By F2 each row has a unique global block. Therefore any two nonzero rows in this column both belong to and cannot lie in distinct blocks. The argument permits the whole column to be zero and does not assert that any allowed entry is nonzero. The row set is finite; AC and algebraic closedness are used only through F1.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
14 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
- Craven, The Brauer Correspondence, Theorem 2.22, pp. 29–30 (standard reference, not scraped)
- Meierfrankenfeld, MTH 912 Class Notes, Theorem 6.7.15, pp. 169–171 (standard reference, not scraped)