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 and the augmentation ideal
Definition
Let be a commutative ring and let be a group. For an element of written uniquely as a finite sum (The group ring of finitely supported formal -linear combinations of group elements), define the augmentation map
Because the expansion in the basis is unique, this is a well-defined -linear map. It is also a ring homomorphism in the sense of Ring homomorphism: additive, multiplicative, and required to send to : additivity is immediate, it sends to , and if and , then by the multiplication formula supplied by The group ring is a unital -algebra with basis , and each is a unit of .
The augmentation ideal of is the kernel which is a two-sided ideal by The kernel of a ring homomorphism is a two-sided ideal.
Remarks
-
The basis element always satisfies .
-
When is finite, the element is the image under the basis sum of the constant function on .
Depends on
- The group ring $R[G]$ of finitely supported formal $R$-linear combinations of group elements
- Ring homomorphism: additive, multiplicative, and required to send $1$ to $1$
- The group ring $R[G]$ is a unital $R$-algebra with basis $G$, and each $g\in G$ is a unit of $R[G]$
- The kernel of a ring homomorphism is a two-sided ideal
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
- Peter Webb, A Course in Finite Group Representation Theory, Chapter 6 Section 6.3 (standard reference, not scraped)