Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (gpt-5.6-terra)audited 2026-08-28
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 map ε:R[G]R and the augmentation ideal IG=kerε

Definition

Let R be a commutative ring and let G be a group. For an element of R[G] written uniquely as a finite sum x=gFrg[g] (The group ring R[G] of finitely supported formal R-linear combinations of group elements), define the augmentation map ε:R[G]R,ε(x):=gFrg.

Because the expansion in the basis {[g]} is unique, this is a well-defined R-linear map. It is also a ring homomorphism in the sense of Ring homomorphism: additive, multiplicative, and required to send 1 to 1: additivity is immediate, it sends [e] to 1R, and if x=grg[g] and y=hsh[h], then ε(xy)=g,hrgsh=(grg)(hsh)=ε(x)ε(y) by the multiplication formula supplied by The group ring R[G] is a unital R-algebra with basis G, and each gG is a unit of R[G].

The augmentation ideal of R[G] is the kernel IG:=kerε, which is a two-sided ideal by The kernel of a ring homomorphism is a two-sided ideal.

Remarks

  • The basis element [g] always satisfies ε([g])=1R.

  • When G is finite, the element gG[g] is the image under the basis sum of the constant function 1 on G.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 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