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 for modules of vertex exactly p
Statement
Assume AC. Let be finite, of characteristic , a -subgroup and . The Green correspondence restricts to inverse bijections between isomorphism classes of nonzero indecomposable finite-dimensional - and -modules having itself as a vertex. Restriction errors are relatively -projective and induction errors relatively -projective, with the families in the full Green theorem. These need not be the same subgroup family.
Facts & Assumptions
Given: The groups, field and fixed vertex above.
AC (The Axiom of Choice) is inherited through the Green theorem's finite-length argument.
Green's full theorem gives inverse class maps, preserving a specified admissible vertex and the two error families (Green correspondence with exceptional families).
Every member of is proper in , and (Green exceptional family containment and fusion).
Proof
By F2, every with has order smaller than . No conjugate of can be contained in it. Thus the fixed subgroup belongs to the admissible class .
Apply F1 under A1 to modules with this vertex. In each direction the distinguished module has the same vertex , so both maps preserve the fixed-vertex subclasses. Their two inverse identities remain valid on these subclasses, proving the required bijection. The error decompositions remain respectively - and -projective as in F1, with no equality between the families asserted. If , then ; if directly, the correspondence is the identity and the errors are zero. Nonzero indecomposable inputs and the inherited AC assumption are unchanged.
Depends on
Used by
- Every block contains a module whose vertex is a full defect group Corollary
- Brauer correspondence for SL2(Fp) in defining characteristic Example
- Green correspondence identity boundaries Example
- Green restriction summand with the same vertex Example
- Corresponding block bimodules are Green correspondents Theorem
Dependency tree · two levels
8 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)