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 vertex retention and inducing lift

Statement

Assume AC. Let G be finite, k a field of characteristic p>0, M a nonzero indecomposable finite-dimensional kG-module, and Q a vertex of M. For Q≤L≤G:

(a) Res⁡LGM has an indecomposable direct summand with vertex Q.

(b) There is an indecomposable kL-module U with vertex Q such that M is a direct summand of Ind⁡LGU.

The two assertions supply separate witnesses. Write X∣Y for being isomorphic to a direct summand.

Facts & Assumptions

Given: The groups and modules in the statement. All modules below are finite dimensional.

[A1]

AC is assumed (The Axiom of Choice); its use is inherited through the chain-condition converse in the finite-length proof underlying Krull–Schmidt, not through finite coset representatives.

[F3]

Finite-dimensional modules have unique finite indecomposable decompositions (Finite-dimensional kG-modules decompose as finite direct sums of indecomposables uniquely up to order and isomorphism).

[F4]

Mackey decomposition, transitivity, preservation of splittings, vertex containment and extraction of an indecomposable from a finite sum hold as in Relative projectivity mackey intersections for finite modules.

Proof

1.1F1F2F4given

Choose a source S at Q. Thus S∣Res⁡QGM and M∣Ind⁡QGS. If S were relatively D-projective for some proper subgroup D<Q, transitivity would make M relatively D-projective, contradicting vertex minimality. Thus S has vertex Q as a kQ-module.

2.1A1F2F3F4step 1.1

Decompose Ind⁡QLS=⨁jUj into indecomposables. Transitivity gives M∣⨁jInd⁡LGUj, so M∣Ind⁡LGUj for some j. Put U=Uj. It is relatively Q-projective. Vertex containment and conjugacy let us choose a vertex T of U with T≤Q. Then M is relatively T-projective by transitivity. Vertex containment for M gives ∣Q∣≤∣T∣, whereas T≤Q gives the reverse inequality. Hence T=Q, proving (b). The decompositions here use the inherited finite-length chain under AC.

2.2A1F3F4step 1.1

Independently decompose Res⁡LGM=⨁jVj. From S∣Res⁡QGM=⨁jRes⁡QLVj, extract a summand V=Vj with S∣Res⁡QLV. Because M∣Ind⁡QGS, Mackey expresses Res⁡LGM as a summand of a finite sum of modules induced from L∩gQ. Extracting V from one term and applying vertex containment shows that any vertex T of V has ∣T∣≤∣Q∣.

3.1F1F2F4step 1.1step 2.2

Relative T-projectivity supplies the counit splitting V∣Ind⁡TLRes⁡TLV from F4. Restrict to Q and use S∣Res⁡QLV. Mackey and summand extraction make S relatively Q∩lT-projective for some l∈L. Its vertex is the whole group Q, by 1.1, so Q=Q∩lT. The inequality in 2.2 forces Q=lT. Conjugacy of vertices now makes Q itself a vertex of V, proving (a).

4.1

All decompositions and coset sums used above are finite, and the two nonzero witnesses are extracted separately. If L=G, the module M itself witnesses both conclusions. If L=Q, the source witnesses both, and its full vertex was checked in 1.1. The same reasoning covers Q=1; zero M is excluded from the statement. Thus both assertions hold with precisely the stated inherited AC assumption. [step 1.1, step 2.1, step 3.1, given] QED

Depends on

Used by

Dependency tree · two levels

12 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