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.

Restriction to a containing p subgroup retains a vertex

Statement

Let H be finite, k a field of characteristic p, and M a nonzero indecomposable finite-dimensional kH-module with vertex Q and source S at Q. If QRH and R is a p-subgroup, then ResRHM has a nonzero indecomposable direct summand U for which Q itself is a vertex.

Facts & Assumptions

Given: The group, field, module, vertex, source and containing p-subgroup in the statement.

[F1]

A source is an indecomposable summand on restriction which induces a module containing M; vertices are minimal relative-projectivity subgroups. (A vertex is a minimal p-subgroup for relative projectivity, and a source is an indecomposable inducing summand there)

[F2]
[F3]

Mackey restriction has intersection subgroups; indecomposable extraction and induction transitivity preserve the stated relative-projectivity witnesses. (Relative projectivity mackey intersections for finite modules)

[F4]

Indecomposable finite-dimensional summands can be extracted from a finite decomposition. (Finite-dimensional kG-modules decompose as finite direct sums of indecomposables uniquely up to order and isomorphism)

[F5]

Relative projectivity supplies a split induction counit from the restriction to that subgroup. (Higman's criterion characterizes relative projectivity through the relative trace idempotent test)

Proof

technique · direct
1.1

Write XY to mean that X is a direct summand of Y. The source S cannot be relatively E-projective for any E<Q: otherwise transitivity of induction and MIndQHS make M relatively E-projective, contrary to minimality of its vertex Q. Hence S, as a kQ-module, has full vertex Q.

F1F3
1.2

Decompose ResRHM=Uj into nonzero indecomposables. Since SResQHM=ResQRUj, [F4] gives one U=Uj with SResQRU. This uses finite decomposition after further restricting each Uj, not an assertion that its restriction is indecomposable.

F1F4
2.1

Restrict the split inclusion MIndQHS to R. The selected U is a summand of its right side. Mackey and indecomposable extraction in [F3] supply an hH for which U is relatively Lh=RhQh1-projective. In particular LhQ.

F3step 1.2
3.1

Choose an inclusion-minimal subgroup T of Lh relative to which U is projective. The set is finite and nonempty since it includes Lh. Any proper subgroup of T would also be a subgroup of Lh, so this minimality makes T a vertex of U. Thus TQ. Put W=ResTRU; [F5] gives UIndTRW.

F1F5step 2.1
4.1

Restrict this last splitting to Q and use step 1.2. Then SResQRIndTRW. A second Mackey decomposition and indecomposable extraction give rR such that S is relatively E=QrTr1-projective as a kQ-module. Step 1.1 forces E=Q, so QrTr1.

F3step 1.1step 1.2step 3.1
5.1

Now QTQ implies Q=rTr1. Conjugating a split induction witness inside R preserves its splitting and minimality, and the inner conjugate of a kR-module is isomorphic to itself by multiplication by r. Thus this conjugate of the vertex T is itself a vertex of the same U, consistently with [F2]. This is the claimed literal subgroup Q, without changing U by an outside conjugation.

F2step 3.1step 4.1

Sources

Webb, A Course in Finite Group Representation Theory, §§11.3, 11.6 and 12.3–12.5, especially pp.240–245. Local argument and conventions as displayed above.

Depends on

Used by

Dependency tree · two levels

10 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