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

The augmentation ideal and Loewy series of kCp can be written explicitly

Example

For Cp=⟨g⟩ over a field k of characteristic p, write x=g−1. Then

kCp≅k[x]/(xp),

the augmentation ideal is (x), and the Loewy series of the regular module is

kCp⊃(x)⊃(x2)⊃⋯⊃(xp−1)⊃(xp)=0.

Facts & Assumptions

Given: The cyclic group Cp=⟨g⟩ and a field k of characteristic p.

[F1]

The head and Loewy series are the quotient by the radical and its iterated powers (The radical, socle, head, and Loewy series of a finite-dimensional module).

[L1]

Over every field of characteristic p, the group algebra kCp 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.1givenalgebra

In characteristic p, one has gp−1=(g−1)p=xp, so the relation gp=1 becomes xp=0. Every element of kCp is a polynomial in g, hence in x=g−1, and the basis 1,g,…,gp−1 becomes the basis 1,x,…,xp−1. Therefore kCp≅k[x]/(xp).

2.1F1L1step 1.1algebra∎

Under that identification, the augmentation map kills x and sends 1 to 1, so its kernel is (x). Since [L1] makes the ring local, (x) is its radical. Therefore [F1] gives the displayed Loewy series by successive powers of (x).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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