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 vertex retention and inducing lift
Statement
Assume AC. Let be finite, a field of characteristic , a nonzero indecomposable finite-dimensional -module, and a vertex of . For :
(a) has an indecomposable direct summand with vertex .
(b) There is an indecomposable -module with vertex such that is a direct summand of .
The two assertions supply separate witnesses. Write for being isomorphic to a direct summand.
Facts & Assumptions
Given: The groups and modules in the statement. All modules below are finite dimensional.
AC is assumed (The Axiom of Choice); its use is inherited through the chain-condition converse in the finite-length proof underlying Krull–Schmidt, not through finite coset representatives.
Vertices and sources have the minimality and two-summand meanings of A vertex is a minimal p-subgroup for relative projectivity, and a source is an indecomposable inducing summand there.
A source exists at a fixed vertex, and vertices are conjugate (Vertices exist for indecomposable modules, are conjugate in G, and sources are conjugate by the appropriate normalizer).
Finite-dimensional modules have unique finite indecomposable decompositions (Finite-dimensional kG-modules decompose as finite direct sums of indecomposables uniquely up to order and isomorphism).
Mackey decomposition, transitivity, preservation of splittings, vertex containment and extraction of an indecomposable from a finite sum hold as in Relative projectivity mackey intersections for finite modules.
Proof
Choose a source at . Thus and . If were relatively -projective for some proper subgroup , transitivity would make relatively -projective, contradicting vertex minimality. Thus has vertex as a -module.
Decompose into indecomposables. Transitivity gives , so for some . Put . It is relatively -projective. Vertex containment and conjugacy let us choose a vertex of with . Then is relatively -projective by transitivity. Vertex containment for gives , whereas gives the reverse inequality. Hence , proving (b). The decompositions here use the inherited finite-length chain under AC.
Independently decompose . From , extract a summand with . Because , Mackey expresses as a summand of a finite sum of modules induced from . Extracting from one term and applying vertex containment shows that any vertex of has .
Relative -projectivity supplies the counit splitting from F4. Restrict to and use . Mackey and summand extraction make relatively -projective for some . Its vertex is the whole group , by 1.1, so . The inequality in 2.2 forces . Conjugacy of vertices now makes itself a vertex of , proving (a).
All decompositions and coset sums used above are finite, and the two nonzero witnesses are extracted separately. If , the module itself witnesses both conclusions. If , the source witnesses both, and its full vertex was checked in 1.1. The same reasoning covers ; zero is excluded from the statement. Thus both assertions hold with precisely the stated inherited AC assumption. [step 1.1, step 2.1, step 3.1, given] QED
Depends on
- A vertex is a minimal p-subgroup for relative projectivity, and a source is an indecomposable inducing summand there
- Vertices exist for indecomposable modules, are conjugate in G, and sources are conjugate by the appropriate normalizer
- Finite-dimensional kG-modules decompose as finite direct sums of indecomposables uniquely up to order and isomorphism
- Relative projectivity mackey intersections for finite modules
- The Axiom of Choice
Used by
Dependency tree · two levels
10 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)