Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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.

A group acting on a ring by automorphisms and its invariant subring

Definition

Let G be a group (Group and abelian group) and C a commutative ring. An action of G on C by ring automorphisms is a left action G×CC (Left group actions, transitive actions, and faithful actions), written (g,c)gc, such that for every gG the map cgc is a ring homomorphism (Ring homomorphism: additive, multiplicative, and required to send 1 to 1). Each such map is then automatically bijective, with inverse the map given by g1, since g1(gc)=(g1g)c=c and likewise in the other order; so each g acts as a ring automorphism, and in particular g1C=1C and g0C=0C.

The invariant subring is

CG:={cC  :  gc=c  for every gG}.

It is a subring of C (Subring: a subset containing 1R and closed under addition, additive inverses and multiplication). It contains 1C, because every g acts as a unital ring homomorphism; and for c,cCG and gG one has g(c+c)=gc+gc=c+c, g(c)=(gc)=c and g(cc)=(gc)(gc)=cc, so CG satisfies (T1) to (T4).

Actions by algebra automorphisms. When C is a commutative A-algebra with structure map ηC ⁣:AC (Algebras over a commutative ring, central structure maps, and algebra homomorphisms), an action by A-algebra automorphisms is one in which every g fixes ηC(A) pointwise: gηC(a)=ηC(a) for all gG and aA. Then ηC(A)CG, so CG is an A-subalgebra of C and ACGC whenever A is a subring of C.

The trivial group. If G={e} then ec=c for every c, so CG=C.

Remarks

  • This agrees with the notation already in use for symmetric polynomials, and does not compete with it. Symmetric polynomials as the invariants of variable permutations lets σSymn act on R[x1,,xn] by σf(x1,,xn)=f(xσ(1),,xσ(n)) and writes R[x1,,xn]Symn for the fixed subset. That is exactly CG for C=R[x1,,xn] and G=Symn: the same set, under the same notation, and the definition here is the general form of it.

  • Only invariance is asked for, not any finiteness. G may be infinite, and CG may then be small; the finiteness of G is a hypothesis of the results about CG, not part of this definition.

Depends on

Used by

Dependency tree · two levels

17 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