Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

A projective indecomposable module has trivial vertex

Statement

Let G be finite and let k have characteristic p. If P is an indecomposable finite-dimensional projective kG-module, then its vertex is the trivial subgroup 1.

Facts & Assumptions

Given: A finite group G, a field k of characteristic p, and an indecomposable finite-dimensional projective kG-module P.

[L2]

Induction from the trivial subgroup preserves projectives, and projectives are direct summands of free modules (Restriction and induction along a subgroup preserve projective modules, Equivalent characterizations of projective modules).

Proof

technique · direct
1.1

Choose a finite k-basis of P. It gives a surjection from a finite free kG-module (kG)n onto P, and projectivity splits that surjection. Thus P is a direct summand of (kG)n. But (kG)n is induced from the trivial subgroup, namely from the n-dimensional k-module. Hence P is relatively 1-projective.

L2givenalgebra
2.1

By [L1], P has a vertex Q. Since vertices are minimal p-subgroups for relative projectivity by [F1], and step 1.1 shows that 1 already works, one must have Q=1.

F1L1step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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