Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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 with exceptional families

Statement

Assume AC. Let G be finite, k a field of characteristic p>0, P a p-subgroup and NG(P)HG. Use X,Y,Z from Green exceptional intersection families. Restriction and induction determine inverse bijections f and g between isomorphism classes of nonzero indecomposable finite-dimensional kG-modules and kH-modules having a vertex in Z. Correspondents have a common vertex QZ, and

ResHGMf(M)YM,IndHGUg(U)XU,

where YM is relatively Y-projective and XU relatively X-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.

[A1]

AC (The Axiom of Choice) is inherited through the finite-length decomposition argument.

[F1]

The precise families, class conventions and identity boundaries are in Green exceptional intersection families.

[F2]

Restriction has a unique distinguished summand of the same vertex with Y-projective error (Green restriction has one distinguished summand).

[F3]

Induction has a unique distinguished summand of the same vertex with X-projective error (Green induction has one distinguished summand).

[F4]

These assignments are well defined on isomorphism classes and mutually inverse (Green distinguished summands are mutually inverse).

Proof

1.1

Under the inherited AC assumption, F2 defines f(M) for every module in the G-domain. It has the same specified vertex QZ, so belongs to the H-domain. F2 also gives multiplicity one and exactly the first displayed decomposition.

A1F2given
1.2

F3 defines g(U) for every module in the H-domain. It has the same vertex QZ, belongs to the G-domain, and satisfies multiplicity one and the second displayed decomposition.

F3given
2.1

By F4 these constructions depend only on isomorphism classes and satisfy g(f(M))M and f(g(U))U. The first equality proves injectivity of f and surjectivity of g; the second proves injectivity of g and surjectivity of f. Thus they are inverse bijections with the decompositions and common vertex established in 1.1–1.2.

F4step 1.1step 1.2
3.1

For H=G, F1 gives empty error families and F2–F3 give zero errors, so the assignments are identities on the stated vertex domain. If P=1, then NG(P)=G 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