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

Statement

Assume AC. Use the finite-dimensional characteristic-p setting and families of Green exceptional intersection families. For an indecomposable kH-module U with vertex Q∈Z,

Ind⁡HGU≅M⊕E,

where M is indecomposable with vertex Q, occurs once, E is relatively X-projective, and U∣Res⁡HGM. Exactly one indecomposable summand has a vertex in Z.

Facts & Assumptions

Given: These groups, modules and vertex; ∣ denotes being isomorphic to a direct summand.

[A1]

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

[F1]

The families and admissible vertex class are defined in Green exceptional intersection families.

[F2]

For subgroups of P, H-Y containment is equivalent to G-X containment (Green exceptional family containment and fusion).

[F3]

Restriction to any subgroup containing a vertex retains that vertex in a summand (Green vertex retention and inducing lift).

[F4]

Mackey error transport holds in both required directions, and Y errors exclude admissible vertices (Green mackey intersections force proper vertices).

[F5]

A Z-vertex G-module has exactly one admissible restriction summand, with the same vertex (Green restriction has one distinguished summand).

[F6]

Transitivity, vertex containment and summand extraction hold (Relative projectivity mackey intersections for finite modules).

Proof

1.1F4F6given

The input U is relatively P-projective by transitivity from Q≤P. F4 gives Res⁡HGInd⁡HGU≅U⊕Y, with Y relatively Y-projective. The exclusion assertion of F4 makes U non-Y-projective. Thus its multiplicity in this restriction is exactly one.

2.1A1F6F7F8step 1.1

Under the inherited AC assumption, decompose Ind⁡HGU=⨁jMj. Comparing restrictions with 1.1 by F7, exactly one index, say j=1, has U∣Res⁡HGM1. For j≠1, every indecomposable of Res⁡HGMj occurs in Y, so this restriction is Y-projective. Each Mj is relatively Q-projective, and vertex containment permits a vertex Tj≤Q after conjugation in G.

3.1F2F3F6step 2.1

For j≠1, F3 retains a Tj-vertex summand in Res⁡HGMj, since Tj≤Q≤H. This summand is Y-projective by 2.1, so F6 gives Tj≤HY. F2 gives Tj≤GX. Transitivity and conjugation of induction therefore make Mj relatively projective for a member of X. Their direct sum is X-projective.

3.2F1F4F5F6F8step 1.1step 2.1

Put M=M1 and T=T1. If M were X-projective, its restriction would be Y-projective by F4, contrary to its summand U from 2.1. Consequently T≤Q≤P is not G-contained in X: such containment would make M X-projective by transitivity. Thus T∈Z. Apply F5 to M. Its unique non-Y restriction summand has vertex T and must be U, by 1.1 and 2.1. Since vertices of U are H-conjugate, T is H-conjugate to Q; hence Q itself is a G-vertex of M.

4.1

The other summands are X-projective by 3.1, so their vertices cannot be in Z, by vertex containment and F1. In particular none is isomorphic to M, proving multiplicity one and uniqueness. We already have U∣Res⁡HGM. When H=G, induction is identified with U by g⊗u↦gu, so the complement is zero. When P=1 this same case is forced. The zero input is excluded; a zero complement is allowed. These statements prove the result. [F1, F6, step 2.1, step 3.1, step 3.2] QED

Depends on

Used by

Dependency tree · two levels

17 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