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.
Local block projection controls p-section character support
Statement
Assume the Axiom of Choice. Let be a splitting -modular system for a finite group , with algebraically closed. Let be a block of , let , let be a -element, and put . For a block of , let and write for its ordinary character, where is a simple -module affording . If , then for every -regular .
Facts & Assumptions
Given: AC and the modular system, blocks, character, element, and local component in the Statement.
Integral block lifts exist uniquely (Block idempotents lift uniquely from kH to OH), and ordinary irreducibles belong to unique blocks (Blocks partition the ordinary and Brauer irreducible characters).
The subsection convention makes every defined (Brauer subsections and B-subsections). Nagao supplies , every indecomposable summand of belonging to a block with , and every indecomposable summand of having no vertex containing (Nagao decomposition for restriction to a centralizer).
Every indecomposable Nagao error summand has zero trace at (Nagao error terms have zero trace on the relevant p-section), under the algebraically closed residue-field hypothesis (An algebraically closed field: every nonconstant polynomial has a root in the field).
AC is available (The Axiom of Choice) and is used through the AC-stated suppliers F2–F3. The lattice construction and projection below are finite.
Proof
Choose a -basis of and set This is a finitely generated, -stable, torsion-free -module spanning over , hence is finite free because is a DVR. Thus is an -lattice affording . Since belongs to , F1 says that acts as the identity on , and therefore .
Apply Nagao with and . Its hypotheses hold because is central in and . Suppose . Each indecomposable summand of belongs by F2 to a block with . Thus , so orthogonality of the lifted block idempotents from F1 gives . Consequently [F1, F2] which is a direct summand of . Decompose into finitely many indecomposable -lattices. Each is therefore an indecomposable summand of , so F3 makes its character zero at .
Scalar extension commutes with the idempotent projection: Adding the finitely many zero traces from step 1.2 proves . This also shows that the character component is independent of the chosen stable lattice. If the character is zero identically; if , Nagao has no error part, so the antecedent forces this zero case. Algebraic closedness and AC are used exactly through F3 and the AC-stated block contracts.
Depends on
- Block idempotents lift uniquely from kH to OH
- Brauer subsections and B-subsections
- Nagao decomposition for restriction to a centralizer
- Nagao error terms have zero trace on the relevant p-section
- Blocks partition the ordinary and Brauer irreducible characters
- An algebraically closed field: every nonconstant polynomial has a root in the field
- The Axiom of Choice
Used by
- Brauer's Second Main Theorem Theorem
Dependency tree · two levels
25 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, Lemma 2.21 and Theorem 2.22, pp. 29–30 (standard reference, not scraped)
- Meierfrankenfeld, MTH 912 Class Notes, Lemmas 6.7.8–6.7.14, pp. 164–169 (standard reference, not scraped)