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 mackey intersections force proper vertices
Statement
Assume AC. Use the finite group , characteristic- field , , , and of Green exceptional intersection families. All modules are finite dimensional. Then:
(a) If a -module is relatively -projective, with relatively -projective.
(b) Restriction to takes relatively -projective modules to relatively -projective modules.
(c) If an -module is both relatively -projective and relatively -projective, its induction to is relatively -projective.
Only the intersections necessarily have order less than ; the condition excludes the admissible vertices up to -conjugacy.
Facts & Assumptions
Given: These groups, fields and finite-dimensional modules.
AC (The Axiom of Choice) is used through the inherited finite-length argument for Krull–Schmidt.
Family-projectivity quantifies over indecomposable summands (Green exceptional intersection families).
For subgroups of , - and - containments are equivalent, members are proper, and admissible vertices avoid (Green exceptional family containment and fusion).
Mackey, transitivity, split-map preservation, vertex containment and finite summand extraction are supplied by Relative projectivity mackey intersections for finite modules.
Unique finite decompositions allow cancellation and summand extraction (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).
Higman's relative trace criterion holds (Higman's criterion characterizes relative projectivity through the relative trace idempotent test).
Proof
If is relatively -projective, F6 gives of relative trace . In the tensor model the map splits : reindexing the finite cosets proves -linearity, and their composite is the relative trace. Thus with we have for a finite-dimensional .
Finite indecomposable decomposition and uniqueness make the family predicate closed under finite direct sums and direct summands: decompose each summand, and compare the resulting multisets. In particular, if a module is induced from a subgroup contained in a member of a family, transitivity makes each indecomposable summand relatively projective for that member. These uses of finite-length decomposition inherit AC.
Mackey for splits the identity double coset from the others. The identity term is ; every remaining term is induced from with , so their sum is -projective by 1.2. Separately, Mackey for induction from gives and the analogous decomposition, since the identity double coset contributes exactly the original module. Transitivity and 1.1 now give . Cancellation by uniqueness in F4 gives . Hence is -projective. This proves (a), including its complement assertion rather than just containment of .
For (b), first take a module relatively projective for with . Use the finite inducing witness supplied in F3 and apply Mackey on restriction. Its terms are induced from subgroups . At least one of lies outside , since otherwise . Thus each such subgroup is contained in a member of . Step 1.2 proves the required family-projectivity for the restriction and for its summands. Decompose a general -projective module and apply this argument to each indecomposable; this proves (b).
For (c), decompose the given -module into indecomposables . Each is relatively -projective, so F3 and F5 let us choose its vertex inside . Since is also -projective, vertex containment gives . By F2, . Transitivity makes relatively -projective and hence relatively projective for a member of : conjugating the inducing subgroup does not change the induced summand property, as follows also by multiplying its tensor representatives by the conjugator. Step 1.2 and finite additivity prove (c).
The last assertion follows from F2; no order bound on was used. When , Mackey has only the identity coset, so in (a). The empty-family predicate holds only for the zero finite-dimensional module, by existence of finite decompositions; hence (b) and (c) also hold. When , the normalizer condition forces . Zero input modules give zero errors in all three assertions. This finishes the proof under the inherited AC assumption. [F2, F4, step 2.1, step 2.2, step 2.3] QED
Depends on
- Green exceptional intersection families
- Green exceptional family containment and fusion
- Relative projectivity mackey intersections for finite modules
- Finite-dimensional kG-modules decompose as finite direct sums of indecomposables uniquely up to order and isomorphism
- Vertices exist for indecomposable modules, are conjugate in G, and sources are conjugate by the appropriate normalizer
- Higman's criterion characterizes relative projectivity through the relative trace idempotent test
- 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)