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.
Relative projectivity and vertices for integral group lattices
Definition
Fix a splitting -modular system , let be finite, let , and let be an -lattice in the sense of An OG-lattice is a finite free module over the valuation ring with G-action, and reduction modulo the maximal ideal produces a kG-module. The lattice is relatively -projective if it is an -direct summand of
A vertex of a nonzero indecomposable -lattice is a -subgroup that is minimal under inclusion among the subgroups for which is relatively -projective. Vertices exist. Indeed, if is a Sylow -subgroup of , then is a unit of . For a left transversal of in , the induction counit is split by the -linear map
Thus every is relatively -projective, and the finite set of -subgroups with this property has a minimal member. All direct summands, inductions, and restrictions here are taken in the category of finite-free -lattices. The construction uses only finite sums and finite minimization, not the Axiom of Choice.
Depends on
Used by
- Integral Mackey decomposition and Higman's criterion for group lattices Lemma
- Relative projectivity forces character vanishing off the controlling p-section Lemma
- Green indecomposability for index-p integral induction Theorem
- Krull-Schmidt holds for finite-rank OH-lattices Theorem
- Nagao decomposition for restriction to a centralizer Theorem
Dependency tree · two levels
3 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
- Craven, The Brauer Correspondence, sections 2.1–2.2, pp. 19–22 (standard reference, not scraped)
- Aschbacher–Kessar–Oliver, Fusion Systems in Algebra and Topology, Definition 4.1 and Theorem 5.4 proof, pp. 264 and 276–277 (standard reference, not scraped)