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.
Defect groups are maximal Brauer support
Statement
A -subgroup is a defect group of if and only if and is maximal among -subgroups with nonzero Brauer image. Every subgroup with nonzero image is contained in a conjugate of any defect group.
Facts & Assumptions
Given: A block idempotent and -subgroups of .
Defect groups are minimal -subgroups giving . (Block relative trace characterizes diagonal projectivity)
The Brauer kernel is the proper trace sum, and nonzero trace support forces subgroup containment up to conjugacy. (Brauer kernel and relative trace support)
A finite trace-ideal sum containing the block identity has one ideal containing it. (Block centre locality and trace ideal sums)
Defect groups and their conjugates are exactly one conjugacy class. (Defect groups of a block are conjugate)
Proof
Choose a defect group and with . If , [F2] writes . Multiplying by if necessary puts in . Since is central and is -fixed, trace transitivity gives . Each term lies in its trace ideal of . By [F3], belongs to one proper- trace ideal, contradicting minimality of . Thus its image is nonzero.
For any with , the same trace expression for and [F2] imply for some . A subgroup containing with nonzero image therefore has order at most , proving maximality of . Conversely a maximal with nonzero image lies in , whose image is nonzero since it too is a defect group by [F4] and step 1.1. Maximality gives equality, and [F4] makes a defect group.
Sources
Webb, A Course in Finite Group Representation Theory, §§11.3, 11.6 and 12.3–12.5, especially pp.240–245. Local argument and conventions as displayed above.
Depends on
Used by
- Blocks and defect groups of s3 Example
- Brauer correspondence for a defect-D8 block of S7 in characteristic 2 Example
- Brauer correspondence for SL2(Fp) in defining characteristic Example
- Defect and Brauer pairs for a4 in characteristic three Example
- A global block of defect D determines a local block of defect D Lemma
- Every local full-defect block induces to a global block of defect D Lemma
- Maximal Brauer pairs detect defect groups Theorem
- Maximal Brauer pairs exist and are conjugate Theorem
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
- Webb, A Course in Finite Group Representation Theory, §§11.3, 11.6 and 12.3–12.5, especially pp.240–245 (standard reference, not scraped)