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 exceptional intersection families
Definition
Fix a finite group , a field of characteristic , a -subgroup , and . All modules considered on this page are finite dimensional left modules; indecomposable means nonzero and not a direct sum of two nonzero submodules. Put and define the finite subgroup families
For a subgroup and a family , write if some and satisfy . Define
For a family of subgroups of an ambient group , a -module is relatively -projective when each of its indecomposable direct summands is relatively -projective for some , in the sense of A module is relatively H-projective when it is a direct summand of one induced from H. This quantifies over summands without choosing a decomposition. The zero module qualifies for every family, including the empty family.
Having a vertex in means that at least one vertex, as defined in A vertex is a minimal p-subgroup for relative projectivity, and a source is an indecomposable inducing summand there, is literally a member of . For the families are empty and consists of all subgroups of . If , then , so . Members of are subgroups of ; this definition makes no smaller-order assertion about them.
The definition uses only the inducing-summand clause of relative projectivity, not its arbitrary-dimensional projectivity comparison. No choice principle or existence theorem for vertices is asserted here.
Depends on
Used by
Dependency tree · two levels
5 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)