Alphabeta Math
LemmaStatement: 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 distinguished summands are mutually inverse

Statement

Assume AC. In the finite-group characteristic-p setting, let f(M) be the distinguished restriction summand of a nonzero indecomposable G-module with a vertex in Z, and let g(U) be the distinguished induced summand of an analogous H-module. Then g(f(M))M and f(g(U))U. Both assignments depend only on module isomorphism classes.

Facts & Assumptions

Given: The admissible finite-dimensional modules and assignments above.

[A1]

AC (The Axiom of Choice) is inherited from the decomposition arguments.

[F1]

Restriction gives a unique admissible summand f(M) with the same vertex and with MIndHGf(M) (Green restriction has one distinguished summand).

[F2]

Induction gives a unique admissible summand g(U) with the same vertex and with UResHGg(U) (Green induction has one distinguished summand).

[F3]

Admissible vertices avoid both exceptional containment classes (Green exceptional family containment and fusion).

Proof

1.1

By F1, MIndHGf(M). Applying F2 to f(M) gives exactly one summand with vertex in Z, namely g(f(M)). The module M is indecomposable with such a vertex, and F3 excludes it from the exceptional part. Comparing indecomposable multiplicities by F4 forces Mg(f(M)). The use of F1, F2 and F4 carries the assumed AC.

A1F1F2F3F4given
1.2

Conversely, F2 gives UResHGg(U). By F1 this restriction has exactly one admissible indecomposable summand, f(g(U)). Since U is admissible and F3 excludes it from the error, F4 gives Uf(g(U)).

F1F2F3F4given
2.1

An isomorphism of G-modules restricts to an H-isomorphism. An H-isomorphism a:UU induces an isomorphism xuxa(u), with inverse induced by a1. Thus each functor preserves the whole module isomorphism class. By F1, F2 and F4 its unique admissible summand has an isomorphism class independent of every chosen decomposition. Hence both assignments descend to isomorphism classes and 1.1–1.2 make them inverse there.

F1F2F4step 1.1step 1.2
3.1

If H=G, both functors and assignments are identities on the stated domain and both errors are zero. If P=1, the normalizer hypothesis forces H=G. Zero modules are not indecomposable inputs. No canonical vector-space representatives or simultaneous choices of representatives of all isomorphism classes are needed: uniqueness defines the maps on classes. This proves the assertion with precisely the inherited AC assumption. [F1, F2, step 2.1] QED

Depends on

Used by

Dependency tree · two levels

13 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