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 restriction has one distinguished summand
Statement
Assume AC. In the finite-dimensional characteristic- setting of Green exceptional intersection families, let be an indecomposable -module with vertex . Then , where is indecomposable with vertex , occurs once, is relatively -projective, and . No other summand has a vertex in . The notation means that is isomorphic to a direct summand of .
Facts & Assumptions
Given: Such a nonzero , with .
AC (The Axiom of Choice) is retained through the inherited finite-length decomposition argument.
Exceptional-family conventions are those of Green exceptional intersection families.
Admissible subgroups avoid -conjugate containment in , and is admissible (Green exceptional family containment and fusion).
Restriction retains a -vertex summand, and separately an inducing -module with vertex exists (Green vertex retention and inducing lift).
Relatively -projective inputs have -projective errors after restriction of induction; those errors exclude admissible vertices (Green mackey intersections force proper vertices).
Finite indecomposable multiplicities are unique (Finite-dimensional kG-modules decompose as finite direct sums of indecomposables uniquely up to order and isomorphism).
Induction is transitive and restriction preserves splittings (Relative projectivity mackey intersections for finite modules).
Proof
The inducing assertion in F3 supplies an indecomposable -module with vertex and . Relative projectivity passes up by transitivity of induction, so is relatively -projective. F4 gives , where is -projective. These inherited existence arguments use the assumed AC.
The separate restriction assertion in F3 supplies with vertex . By F2 and F4 neither nor is -projective. Thus no indecomposable in is isomorphic to either one.
Restricting the split inclusion from 1.1 makes a direct summand of . By F5, its indecomposable multiset is a submultiset of that of . The copy of from 1.2 cannot lie in , so . Exactly one copy is available. The remaining multiset is contained in that of , giving a complementary . Family-projectivity is summand-closed as proved in F4, so is -projective.
The inducing witness was obtained in 1.1, before any inverse correspondence. Every summand of has vertices excluded from by F2 and F4. If , restriction is the identity and the empty error family forces . If , the normalizer hypothesis forces . The zero module is excluded as an input but permitted as the complement. Since , the case is included. This proves all claims. [F1, F2, F4, step 1.1, step 2.1] QED
Depends on
- Relative projectivity mackey intersections for finite modules
- Green exceptional intersection families
- Green exceptional family containment and fusion
- Green vertex retention and inducing lift
- Green mackey intersections force proper vertices
- 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
14 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)