Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-12
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 G be finite, k of characteristic p>0, P a p-subgroup and NG(P)HG. The Green correspondence restricts to inverse bijections between isomorphism classes of nonzero indecomposable finite-dimensional G- and H-modules having P itself as a vertex. Restriction errors are relatively Y-projective and induction errors relatively X-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.

[A1]

AC (The Axiom of Choice) is inherited through the Green theorem's finite-length argument.

[F1]

Green's full theorem gives inverse class maps, preserving a specified admissible vertex and the two error families (Green correspondence with exceptional families).

[F2]

Every member of X is proper in P, and PZ (Green exceptional family containment and fusion).

Proof

1.1

By F2, every PsP with sH has order smaller than P. No conjugate of P can be contained in it. Thus the fixed subgroup P belongs to the admissible class Z.

F2given
2.1

Apply F1 under A1 to modules with this vertex. In each direction the distinguished module has the same vertex P, 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 Y- and X-projective as in F1, with no equality between the families asserted. If P=1, then H=G; if H=G directly, the correspondence is the identity and the errors are zero. Nonzero indecomposable inputs and the inherited AC assumption are unchanged.

A1F1step 1.1

Depends on

Used by

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