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.
A block induced from a subgroup
Definition
Fix a splitting -modular system for finite , with residue field , and . For a primitive central idempotent of , write as the indecomposable double-group module of Block bimodule for the double group. A block of is induced from , denoted , if it is the unique block for which Here means there are module maps , with ; equivalently .
Blocks are the actual ideals belonging to p-blocks from primitive central idempotents, not a choice of isomorphic copies. Distinct blocks are nonisomorphic as bimodules: left multiplication by is the identity on the first and zero on the second, and every bimodule isomorphism would intertwine these operators. The finite multiplicities of indecomposable summands are well-defined by Finite-dimensional kG-modules decompose as finite direct sums of indecomposables uniquely up to order and isomorphism.
If no block, or more than one block, has the splitting property, is undefined. The definition never assigns a value in those cases. For the indecomposable block is its own unique such block, so . No infinite family of choices is required by this definition. A central-character formula is a further theorem under additional hypotheses, not part of this definition.
Depends on
Used by
- Centralizer containment is sufficient but not necessary Counterexample
- The trivial-defect-group and identity-normalizer boundaries Example
- Block induction is transitive when both stages are defined Lemma
- Centralizer containment makes block induction well-defined Lemma
- Induced blocks have controlled defect Lemma
- Brauer–Green block compatibility Theorem
Dependency tree · two levels
6 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, Definition 5.13 (standard reference, not scraped)
- Farrell–Lassueur, Modular Representation Theory of Finite Groups, Definition 40.1, §40 (printed pp.8–12 of upload17) (standard reference, not scraped)