Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 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.

The regular module of Cp in characteristic p is indecomposable with a unique simple quotient

Example

Let Cp=⟨g⟩ and let k have characteristic p. Then the regular kCp-module is indecomposable, and its unique simple quotient is the trivial module k.

Facts & Assumptions

Given: The cyclic group Cp and a field k of characteristic p.

[L1]

Over every field of characteristic p, the group algebra of a finite p-group is local (For a finite group and a field of characteristic p, the group algebra is local exactly when the group is a p-group).

Verification

technique · direct
1.1L1givenalgebra

By [L1], the algebra A:=kCp is local. A nontrivial decomposition of the left regular module would give a nontrivial idempotent projection in End⁡A(AA)≅Aop, but a local algebra has no nontrivial idempotents. Hence the regular module is indecomposable.

2.1L1step 1.1algebra∎

The augmentation ideal is maximal because its quotient is k, and it is the unique maximal left ideal because A is local. Every simple quotient of the regular module has a maximal left ideal as its kernel, so it is the augmentation quotient k, with the trivial Cp-action. Thus the regular module has the asserted unique simple quotient.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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