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.
Block induction is transitive when both stages are defined
Statement
For and a block of , if all three blocks , and are defined, then .
Facts & Assumptions
Given: The stated subgroup chain and all three defined induced blocks.
A block induced from a subgroup defines induction by a unique block with a split restriction summand.
Proof
Put and . By F1 there are split inclusions and retractions , back, and , back, with and . Restricting to retains their composite identity. Therefore and have composite , exhibiting as a summand of .
Since is defined, F1 makes it the unique global block with this summand property. Step 1.1 proves that has that property, so . The same map composition works when two or all three groups coincide. The proof assumes the existence of all three blocks and does not deduce the third definedness from the first two. It composes finitely many given maps and uses no AC.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
4 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(ii) (standard reference, not scraped)
- Farrell–Lassueur, Modular Representation Theory of Finite Groups, Proposition 40.3(ii), §40 (printed pp.8–12 of upload17) (standard reference, not scraped)