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.
Induced blocks have controlled defect
Statement
If a block of has defect group and is defined, then is contained in a -conjugate of a defect group of . No equality of defect groups is asserted.
Facts & Assumptions
Given: finite, a splitting residue field , and the stated induced block .
A block induced from a subgroup gives .
Block bimodule has a diagonal vertex supplies a diagonal vertex of .
Mackey, summand extraction and vertex containment are Relative projectivity mackey intersections for finite modules.
Defect group and numerical defect of a block identifies a defect group precisely by vertex .
Proof
Choose a defect group of by F2 and F4. Relative -projectivity writes as a summand of a module induced from . Restrict it to and apply F3. By F1 and finite summand extraction, is relatively -projective for some . Since is a vertex by F4, F3 places it in an -conjugate of that intersection, hence in a -conjugate of .
Write that conjugating element as . Projecting onto the first coordinate gives . Conjugating a diagonal vertex simultaneously by shows this conjugate of is again a defect group of . This proves the required containment. If the conclusion is automatic; if , F1 gives and equality is possible. Neither argument infers equality in general. All selections involve finite subgroup sets and finite decompositions, with no additional AC.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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
- Saunders, Modular Representation Theory, Lemma 5.14(i) (standard reference, not scraped)
- Farrell–Lassueur, Modular Representation Theory of Finite Groups, Proposition 40.3(i), §40 (printed pp.8–12 of upload17) (standard reference, not scraped)