Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge 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 group ring R[G] is a unital R-algebra with basis G, and each g∈G is a unit of R[G]

Statement

Let R be a commutative ring and let G be a group. Write [g]∈R[G] for the basis vector of The group ring R[G] of finitely supported formal R-linear combinations of group elements indexed by g∈G.

There is a unique R-bilinear multiplication on R[G] satisfying [g][h]=[gh](g,h∈G). With this product, R[G] is a unital R-algebra whose underlying R-module has basis {[g]:g∈G}. Its identity is [e], where e is the identity of G, and every basis element [g] is a unit with inverse [g−1].

Facts & Assumptions

Given: A commutative ring R and a group G with identity e.

[L1]

The module R[G] is free on the set G, with basis vectors [g], and every element has a unique finite expansion ∑g∈Frg[g] (The group ring R[G] of finitely supported formal R-linear combinations of group elements).

[L2]

Every set map from a set X to a left R-module M extends uniquely to an R-module homomorphism from the free module R(X) (Universal property of the free module on a set).

[L3]

An R-algebra is a unital ring equipped with a central unital map R→A, and the multiplication is R-bilinear (Algebras over a commutative ring, central structure maps, and algebra homomorphisms).

Proof

technique · constructive
1.1L1L2givenconstruct

For each fixed g∈G, the set map ug:G→R[G], ug(h):=[gh], extends uniquely by [L2] to an R-linear map λg:R[G]→R[G] with λg([h])=[gh] for every h∈G.

2.1step 1.1L1L2givenconstruct

For each fixed y∈R[G], the set map vy:G→R[G], vy(g):=λg(y), extends uniquely by [L2] to an R-linear map my:R[G]→R[G]. Define the product by xy:=my(x).

3.1step 1.1step 2.1L1

By construction, [g][h]=m[h]([g])=λg([h])=[gh]. The map x↦xy is R-linear because my is, and if x=∑g∈Frg[g] then xy=∑g∈Frgλg(y), so the R-linearity of each λg makes y↦xy linear as well. Thus the product is R-bilinear.

4.1step 3.1L1givenalgebra

For fixed y,z∈R[G], the maps x↦(xy)z and x↦x(yz) are R-linear by step 3.1, so it is enough to compare them on basis elements [g]. For fixed g,z the maps y↦([g]y)z and y↦[g](yz) are likewise linear, so it is enough to compare them on basis elements [h]. Repeating once more in the variable z reduces associativity to basis triples, where ([g][h])[k]=[(gh)k]=[g(hk)]=[g]([h][k]) by associativity in G. Hence the product on R[G] is associative.

4.2step 3.1L1givenalgebra

The same bilinear reduction shows that [e] is a two-sided identity, because [e][g]=[eg]=[g] and [g][e]=[ge]=[g] for every basis element. Likewise [g][g−1]=[e]=[g−1][g], so each [g] is a unit with inverse [g−1].

5.1step 3.1step 4.2L1givenalgebra

The map η:R→R[G] defined by η(r)=r[e] is additive and satisfies η(rs)=(r[e])(s[e])=rs[e] and η(1R)=1R[e]=[e] by steps 3.1 and 4.2. For every basis element [g], one has η(r)[g]=r[g]=[g]η(r); bilinearity extends this equality to every element of R[G].

6.1step 3.1step 4.1step 4.2step 5.1L3discharge-construct∎

If ∗ is any other R-bilinear product with [g]∗[h]=[gh], then for x=∑g∈Frg[g] and y=∑h∈Esh[h] bilinearity forces x∗y=∑g∈F∑h∈Ergsh[gh], which is exactly the product already constructed in steps 1.1-3.1. Therefore the multiplication is unique, and with steps 4.1-5.1 it makes R[G] a unital R-algebra as in [L3].

Depends on

Used by

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