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.
Green induction has one distinguished summand
Statement
Assume AC. Use the finite-dimensional characteristic- setting and families of Green exceptional intersection families. For an indecomposable -module with vertex ,
where is indecomposable with vertex , occurs once, is relatively -projective, and . Exactly one indecomposable summand has a vertex in .
Facts & Assumptions
Given: These groups, modules and vertex; denotes being isomorphic to a direct summand.
AC (The Axiom of Choice) is inherited through the finite-length decomposition argument.
The families and admissible vertex class are defined in Green exceptional intersection families.
For subgroups of , - containment is equivalent to - containment (Green exceptional family containment and fusion).
Restriction to any subgroup containing a vertex retains that vertex in a summand (Green vertex retention and inducing lift).
Mackey error transport holds in both required directions, and errors exclude admissible vertices (Green mackey intersections force proper vertices).
A -vertex -module has exactly one admissible restriction summand, with the same vertex (Green restriction has one distinguished summand).
Transitivity, vertex containment and summand extraction hold (Relative projectivity mackey intersections for finite modules).
Finite indecomposable decompositions have unique multiplicities (Finite-dimensional kG-modules decompose as finite direct sums of indecomposables uniquely up to order and isomorphism).
Vertices exist and are conjugate (Vertices exist for indecomposable modules, are conjugate in G, and sources are conjugate by the appropriate normalizer).
Proof
The input is relatively -projective by transitivity from . F4 gives , with relatively -projective. The exclusion assertion of F4 makes non--projective. Thus its multiplicity in this restriction is exactly one.
Under the inherited AC assumption, decompose . Comparing restrictions with 1.1 by F7, exactly one index, say , has . For , every indecomposable of occurs in , so this restriction is -projective. Each is relatively -projective, and vertex containment permits a vertex after conjugation in .
For , F3 retains a -vertex summand in , since . This summand is -projective by 2.1, so F6 gives . F2 gives . Transitivity and conjugation of induction therefore make relatively projective for a member of . Their direct sum is -projective.
Put and . If were -projective, its restriction would be -projective by F4, contrary to its summand from 2.1. Consequently is not -contained in : such containment would make -projective by transitivity. Thus . Apply F5 to . Its unique non- restriction summand has vertex and must be , by 1.1 and 2.1. Since vertices of are -conjugate, is -conjugate to ; hence itself is a -vertex of .
The other summands are -projective by 3.1, so their vertices cannot be in , by vertex containment and F1. In particular none is isomorphic to , proving multiplicity one and uniqueness. We already have . When , induction is identified with by , so the complement is zero. When this same case is forced. The zero input is excluded; a zero complement is allowed. These statements prove the result. [F1, F6, step 2.1, step 3.1, step 3.2] QED
Depends on
- Vertices exist for indecomposable modules, are conjugate in G, and sources are conjugate by the appropriate normalizer
- Green exceptional intersection families
- Green exceptional family containment and fusion
- Green vertex retention and inducing lift
- Green mackey intersections force proper vertices
- Green restriction has one distinguished summand
- Relative projectivity mackey intersections for finite modules
- Finite-dimensional kG-modules decompose as finite direct sums of indecomposables uniquely up to order and isomorphism
- The Axiom of Choice
Used by
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
- Saunders, Modular Representation Theory, Lemmas 4.18–4.19 and 4.35–4.38, Theorem 4.34 (standard reference, not scraped)
- Lassueur–Farrell, Chapter 7, §29, Theorem 29.4 and proof (standard reference, not scraped)