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 mackey intersections force proper vertices

Statement

Assume AC. Use the finite group G, characteristic-p field k, P, H, and X,Y,Z of Green exceptional intersection families. All modules are finite dimensional. Then:

(a) If a kH-module U is relatively P-projective, Res⁡HGInd⁡HGU≅U⊕E with E relatively Y-projective.

(b) Restriction to H takes relatively X-projective modules to relatively Y-projective modules.

(c) If an H-module is both relatively P-projective and relatively Y-projective, its induction to G is relatively X-projective.

Only the X intersections necessarily have order less than ∣P∣; the Y condition excludes the admissible vertices up to H-conjugacy.

Facts & Assumptions

Given: These groups, fields and finite-dimensional modules.

[A1]

AC (The Axiom of Choice) is used through the inherited finite-length argument for Krull–Schmidt.

[F1]

Family-projectivity quantifies over indecomposable summands (Green exceptional intersection families).

[F2]

For subgroups of P, G-X and H-Y containments are equivalent, X members are proper, and admissible vertices avoid Y (Green exceptional family containment and fusion).

[F3]

Mackey, transitivity, split-map preservation, vertex containment and finite summand extraction are supplied by Relative projectivity mackey intersections for finite modules.

[F4]

Proof

1.1F6given

If U is relatively P-projective, F6 gives α∈End⁡kP(U) of relative trace 1U. In the tensor model the map u↦∑t∈H/Pt⊗α(t−1u) splits h⊗u↦hu: reindexing the finite cosets proves H-linearity, and their composite is the relative trace. Thus with W=Res⁡PHU we have Ind⁡PHW≅U⊕U′ for a finite-dimensional U′.

1.2A1F1F3F4

Finite indecomposable decomposition and uniqueness make the family predicate closed under finite direct sums and direct summands: decompose each summand, and compare the resulting multisets. In particular, if a module is induced from a subgroup contained in a member of a family, transitivity makes each indecomposable summand relatively projective for that member. These uses of finite-length decomposition inherit AC.

2.1F1F3F4step 1.1step 1.2

Mackey for Res⁡HGInd⁡PGW splits the identity double coset from the others. The identity term is Ind⁡PHW; every remaining term is induced from H∩gP with g∉H, so their sum E0 is Y-projective by 1.2. Separately, Mackey for induction from H gives Res⁡HGInd⁡HGU≅U⊕E and the analogous U′⊕E′ decomposition, since the identity double coset contributes exactly the original module. Transitivity and 1.1 now give U⊕U′⊕E⊕E′≅U⊕U′⊕E0. Cancellation by uniqueness in F4 gives E⊕E′≅E0. Hence E is Y-projective. This proves (a), including its complement assertion rather than just containment of U.

2.2F1F3F4step 1.2

For (b), first take a module relatively projective for D=P∩sP with s∉H. Use the finite inducing witness supplied in F3 and apply Mackey on restriction. Its terms are induced from subgroups H∩tD=H∩tP∩tsP. At least one of t,ts lies outside H, since otherwise s=t−1(ts)∈H. Thus each such subgroup is contained in a member of Y. Step 1.2 proves the required family-projectivity for the restriction and for its summands. Decompose a general X-projective module and apply this argument to each indecomposable; this proves (b).

2.3F2F3F4F5step 1.2

For (c), decompose the given H-module into indecomposables V. Each is relatively P-projective, so F3 and F5 let us choose its vertex Q inside P. Since V is also Y-projective, vertex containment gives Q≤HY. By F2, Q≤GX. Transitivity makes Ind⁡HGV relatively Q-projective and hence relatively projective for a member of X: conjugating the inducing subgroup does not change the induced summand property, as follows also by multiplying its tensor representatives by the conjugator. Step 1.2 and finite additivity prove (c).

3.1

The last assertion follows from F2; no order bound on Y was used. When H=G, Mackey has only the identity coset, so E=0 in (a). The empty-family predicate holds only for the zero finite-dimensional module, by existence of finite decompositions; hence (b) and (c) also hold. When P=1, the normalizer condition forces H=G. Zero input modules give zero errors in all three assertions. This finishes the proof under the inherited AC assumption. [F2, F4, step 2.1, step 2.2, step 2.3] QED

Depends on

Used by

Dependency tree · two levels

16 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