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.
Nagao error terms have zero trace on the relevant p-section
Statement
Assume the Axiom of Choice. Let be a splitting -modular system for a finite group , with algebraically closed. Let be a -element and put . Let be a block of , and let be a finite-free -lattice satisfying . Apply the Nagao decomposition with : If and are the ordinary characters of and , then for every -regular , More precisely, the ordinary character of every indecomposable summand of is zero at .
Facts & Assumptions
Given: AC and the system, element, centralizer, block, lattice, and characters in the Statement.
The commuting - and -parts of a finite-order element are unique (Every finite-group element has unique commuting p- and p-prime parts), and their use here places in the -section (The p-section of a p-element).
In the Nagao error part for , no vertex of an indecomposable summand contains (Nagao decomposition for restriction to a centralizer).
Over the algebraically closed residue field, a relatively -projective lattice has zero character at an element whose -part is not conjugate into (Relative projectivity forces character vanishing off the controlling p-section and An algebraically closed field: every nonconstant polynomial has a root in the field).
AC is available (The Axiom of Choice) and is used only through the AC-stated suppliers F2–F3; trace additivity below is finite.
Proof
The subgroup is central in , and , so F2 applies. Decompose the finite-rank lattice into indecomposable -lattices . If , then and F2 says no vertex of an error summand contains , which is impossible; thus and the result is immediate.
Suppose . For each , choose a vertex . By F2, . Since is central in , every -conjugate of is itself; hence is not -conjugate to an element of . Because and the -regular element commute, F1 says that the -part of is exactly . Each is relatively -projective by the definition of a vertex, so F3 gives
Scalar extension preserves the finite direct sum, and trace is additive. Step 1.2 proves the more precise assertion in the Statement. Therefore the character of is zero at . Taking traces in gives the required equality. The case is the empty finite sum, already covered, and algebraic closedness is used exactly through F3.
Depends on
- Every finite-group element has unique commuting p- and p-prime parts
- The p-section of a p-element
- Relative projectivity forces character vanishing off the controlling p-section
- Nagao decomposition for restriction to a centralizer
- An algebraically closed field: every nonconstant polynomial has a root in the field
- The Axiom of Choice
Used by
Dependency tree · two levels
21 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 proof, p. 29 (standard reference, not scraped)
- Aschbacher–Kessar–Oliver, Fusion Systems in Algebra and Topology, proof of Theorem 5.4, pp. 276–277 (standard reference, not scraped)