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 identity boundaries
Example
Assume AC for the inherited correspondence and relative-/projective comparison. In the finite-dimensional characteristic- Green setting, if then restriction and induction are identity functors up to the displayed natural isomorphism below, and the Green maps are identities on their stated vertex domains. Both exceptional families are empty. If , the normalizer hypothesis forces , and the exact- correspondence is the identity on projective indecomposables.
Facts & Assumptions
Given: The finite group, field, -subgroup and normalizer hypothesis of the full correspondence.
AC (The Axiom of Choice) is inherited in F1–F3.
Green correspondence and its error clauses hold (Green correspondence with exceptional families).
The fixed- version holds on modules having as a vertex (Green correspondence for modules of vertex exactly p).
Under AC, relative -projectivity is equivalent to projectivity (A module is relatively H-projective when it is a direct summand of one induced from H).
Verification
Suppose . Restriction leaves every action unchanged. The map , , is balanced, since . Its inverse is : the tensor relation verifies the other composite. Thus induction is naturally isomorphic to the identity. Also is empty, so and .
For a nonzero indecomposable input in this domain, the identity module has just itself as an indecomposable summand: any proposed nonzero complement contradicts indecomposability. Thus both distinguished assignments are identity maps and the errors vanish. This also follows from the empty-family clauses of F1. AC is retained for the general theorem used to identify these assignments, not for the explicit tensor maps in 1.1.
If , then every element normalizes , so and necessarily . A nonzero indecomposable has vertex exactly when it is relatively -projective: one implication is part of vertex minimality, and the other follows because has no proper subgroup. By F3 these are exactly the projective indecomposables. F2 therefore restricts the identity map from 2.1 to precisely that domain. Zero remains outside the domain, and zero errors cause no exception. This proves both boundary assertions.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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)