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 restriction has one distinguished summand

Statement

Assume AC. In the finite-dimensional characteristic-p setting of Green exceptional intersection families, let M be an indecomposable kG-module with vertex QZ. Then ResHGMUE, where U is indecomposable with vertex Q, occurs once, E is relatively Y-projective, and MIndHGU. No other summand has a vertex in Z. The notation XY means that X is isomorphic to a direct summand of Y.

Facts & Assumptions

Given: Such a nonzero M, with QPH.

[A1]

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

[F1]

Exceptional-family conventions are those of Green exceptional intersection families.

[F2]

Admissible subgroups avoid H-conjugate containment in Y, and P is admissible (Green exceptional family containment and fusion).

[F3]

Restriction retains a Q-vertex summand, and separately an inducing H-module with vertex Q exists (Green vertex retention and inducing lift).

[F4]

Relatively P-projective inputs have Y-projective errors after restriction of induction; those errors exclude admissible vertices (Green mackey intersections force proper vertices).

[F6]

Induction is transitive and restriction preserves splittings (Relative projectivity mackey intersections for finite modules).

Proof

1.1

The inducing assertion in F3 supplies an indecomposable H-module U with vertex Q and MIndHGU. Relative projectivity passes up QPH by transitivity of induction, so U is relatively P-projective. F4 gives ResHGIndHGUUE0, where E0 is Y-projective. These inherited existence arguments use the assumed AC.

A1F3F4F6given
1.2

The separate restriction assertion in F3 supplies WResHGM with vertex Q. By F2 and F4 neither W nor U is Y-projective. Thus no indecomposable in E0 is isomorphic to either one.

F2F3F4given
2.1

Restricting the split inclusion from 1.1 makes ResHGM a direct summand of UE0. By F5, its indecomposable multiset is a submultiset of that of UE0. The copy of W from 1.2 cannot lie in E0, so WU. Exactly one copy is available. The remaining multiset is contained in that of E0, giving a complementary EE0. Family-projectivity is summand-closed as proved in F4, so E is Y-projective.

F4F5F6step 1.1step 1.2
3.1

The inducing witness was obtained in 1.1, before any inverse correspondence. Every summand of E has vertices excluded from Z by F2 and F4. If H=G, restriction is the identity and the empty error family forces E=0. If P=1, the normalizer hypothesis forces H=G. The zero module is excluded as an input but permitted as the complement. Since PZ, the case Q=P is included. This proves all claims. [F1, F2, F4, step 1.1, 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