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.

For a commutative ring R, R-linear G-actions are exactly the compatible left R[G]-module structures

Statement

Let R be a commutative ring, let G be a group, and let M be a left R-module. Then:

  1. every R-linear action of G on M extends uniquely to a left R[G]-module structure on M satisfying (r[e])⋅m=rm(r∈R, m∈M);
  2. every left R[G]-module structure on M satisfying (r[e])⋅m=rm(r∈R, m∈M) restricts to an R-linear action of G on M;
  3. these two constructions are inverse to each other.

Moreover, if M and N carry the corresponding structures, then an R-linear map f:M→N is G-equivariant if and only if it is an R[G]-module homomorphism.

Facts & Assumptions

Given: A commutative ring R, a group G, and left R-modules M and N.

[L1]

The group ring R[G] has basis vectors [g], multiplication [g][h]=[gh], identity [e], and central scalar copy r↦r[e] (The group ring R[G] is a unital R-algebra with basis G, and each g∈G is a unit of R[G], The group ring R[G] of finitely supported formal R-linear combinations of group elements).

[L2]

An R-linear G-module is a left R-module together with a group action whose each g-operator is R-linear (An R-linear action of G on a left R-module, and a G-module over R).

[L3]

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

[L4]

An R[G]-module homomorphism is a map compatible with addition and with the scalar action of every element of R[G] (Module homomorphism and isomorphism, kernel, image and cokernel, Unital left and right modules over a ring; unqualified module means left module).

Proof

technique · constructive
1.1L1L2L3givenconstruct

Assume first that M is an R-linear G-module. For each m∈M, the map um:G→M, um(g):=g⋅m, extends uniquely by [L3] to an R-linear map u~m:R[G]→M. Define a⋅m:=u~m(a) for a∈R[G].

2.1step 1.1L1L2

For basis elements, [g]⋅m=g⋅m by construction. If a=∑g∈Frg[g], then a⋅m=∑g∈Frg(g⋅m), so the action is additive in a and, because each g-operator is R-linear by [L2], also additive in m and compatible with the scalar action of R on M.

3.1step 2.1L1L2givenalgebra

For g,h∈G, one has ([g][h])⋅m=[gh]⋅m=(gh)⋅m=g⋅(h⋅m)=[g]⋅([h]⋅m). Since both sides are R-bilinear in the two group-ring variables, the equality extends to (ab)⋅m=a⋅(b⋅m) for all a,b∈R[G]. Also [e]⋅m=e⋅m=m, so the identity of R[G] acts as the identity on M, and (r[e])⋅m=r(e⋅m)=rm. Thus the construction of steps 1.1-2.1 gives a compatible left R[G]-module structure on M.

4.1step 3.1L1L2L4givenalgebra

Conversely, assume M is a left R[G]-module compatible with the given R-module structure, meaning that (r[e])⋅m=rm for all r∈R and m∈M. Define g⋅m:=[g]⋅m. Then e⋅m=[e]⋅m=m, and (gh)⋅m=[gh]⋅m=([g][h])⋅m=[g]⋅([h]⋅m)=g⋅(h⋅m), so this is a group action. For r∈R, one has g⋅(rm)=[g]⋅((r[e])⋅m)=(([g](r[e]))⋅m)=(((r[e])[g])⋅m)=(r[e])⋅([g]⋅m)=r(g⋅m). Thus the restricted action is R-linear.

5.1step 2.1step 4.1L1L4givenalgebra

Let f:M→N be R-linear. If f is an R[G]-module homomorphism, then f(g⋅m)=f([g]⋅m)=[g]⋅f(m)=g⋅f(m), so f is G-equivariant. Conversely, if f is G-equivariant and a=∑g∈Frg[g], then f(a⋅m)=∑g∈Frgf(g⋅m)=∑g∈Frg(g⋅f(m))=a⋅f(m), so f is an R[G]-module homomorphism.

6.1step 2.1step 4.1step 5.1L1discharge-construct∎

In the first construction, the recovered action of a basis element [g] is the original action of g by step 2.1, so the recovered G-action is unchanged. In the second construction, the recovered R[G]-action agrees with the original one on each basis element [g], and it has the same scalar action because the compatibility condition fixes (r[e])⋅m=rm. Therefore the two constructions are inverse.

Depends on

Used by

Dependency tree · two levels

15 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