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.
The trivial-defect-group and identity-normalizer boundaries
Example
For , one has , and Brauer's First Main Theorem is the identity bijection on defect-zero blocks. More generally, if , its defect- bijection is the identity, including when the relevant set is empty. No AC is required.
Facts & Assumptions
Given: A finite group and splitting residue field of characteristic , with a fixed -subgroup .
Brauer's First Main Theorem specifies the fixed-defect bijection by induction.
Defect zero blocks are simple algebras identifies trivial-defect blocks with full matrix blocks, each having one projective simple module.
A block induced from a subgroup uses the unique block containing the block-bimodule restriction summand.
Proof
If , restriction from to itself changes no module. A block bimodule occurs in itself. It cannot occur in another block : the central idempotent of acts as identity on and as zero on , hence on all its summands. Thus F3 gives , and F1's map and inverse are the identity on the set of blocks with defect group . This proves both directions of the correspondence directly.
For , every group element normalizes , so step 1.1 applies. The numerical defect is , and F2 says exactly these blocks are full matrix algebras with one projective simple module. If there are no such blocks, the identity has empty domain and codomain: its injectivity condition and the assertion that every codomain element has a preimage are both vacuous. The same reasoning handles an empty defect- set whenever is normal. The zero algebra is not inserted as a block. All these identity and idempotent calculations are choice-free.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
15 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
- Martínez, Representation Theory of Finite Groups, Theorem 4.10, pp. 27–28 (standard reference, not scraped)
- Farrell–Lassueur, Modular Representation Theory of Finite Groups, Theorem 40.4, §40 (printed pp.8–12 of upload17) (standard reference, not scraped)