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 and let have characteristic . Then the regular -module is indecomposable, and its unique simple quotient is the trivial module .
Facts & Assumptions
Given: The cyclic group and a field of characteristic .
Over every field of characteristic , the group algebra of a finite -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
By [L1], the algebra is local. A nontrivial decomposition of the left regular module would give a nontrivial idempotent projection in , but a local algebra has no nontrivial idempotents. Hence the regular module is indecomposable.
The augmentation ideal is maximal because its quotient is , and it is the unique maximal left ideal because is local. Every simple quotient of the regular module has a maximal left ideal as its kernel, so it is the augmentation quotient , with the trivial -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
- Peter Webb, A Course in Finite Group Representation Theory (23 Feb 2016 draft) (standard reference, not scraped)