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 correspondence with exceptional families
Statement
Assume AC. Let be finite, a field of characteristic , a -subgroup and . Use from Green exceptional intersection families. Restriction and induction determine inverse bijections and between isomorphism classes of nonzero indecomposable finite-dimensional -modules and -modules having a vertex in . Correspondents have a common vertex , and
where is relatively -projective and relatively -projective. The distinguished summands have multiplicity one. No common-source assertion is included.
Facts & Assumptions
Given: The finite groups, field and finite-dimensional indecomposable domains above.
AC (The Axiom of Choice) is inherited through the finite-length decomposition argument.
The precise families, class conventions and identity boundaries are in Green exceptional intersection families.
Restriction has a unique distinguished summand of the same vertex with -projective error (Green restriction has one distinguished summand).
Induction has a unique distinguished summand of the same vertex with -projective error (Green induction has one distinguished summand).
These assignments are well defined on isomorphism classes and mutually inverse (Green distinguished summands are mutually inverse).
Proof
Under the inherited AC assumption, F2 defines for every module in the -domain. It has the same specified vertex , so belongs to the -domain. F2 also gives multiplicity one and exactly the first displayed decomposition.
F3 defines for every module in the -domain. It has the same vertex , belongs to the -domain, and satisfies multiplicity one and the second displayed decomposition.
By F4 these constructions depend only on isomorphism classes and satisfy and . The first equality proves injectivity of and surjectivity of ; the second proves injectivity of and surjectivity of . Thus they are inverse bijections with the decompositions and common vertex established in 1.1–1.2.
For , F1 gives empty error families and F2–F3 give zero errors, so the assignments are identities on the stated vertex domain. If , then forces this case. Zero modules are outside both indecomposable domains; zero errors are allowed. The two families remain distinct in general, and no assertion about sources follows or is required. This completes the theorem. [F1, F2, F3, step 2.1] QED
Depends on
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)