Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Finite linear invariant and coinvariant polynomial algebras

Definition

Let V be a finite-dimensional complex vector space and GGL(V) finite. Write S=C[V]=Sym(V) for its polynomial algebra. Concretely, after a finite choice of linear coordinates x1,,xr, this is the iterated polynomial ring C[x1,,xr] of The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution, with finite monomial sums, total degree and substitution of linear forms. Under a change of coordinates, the two invertible linear substitutions are inverse algebra homomorphisms, so the construction is independent of that choice.

Define (gf)(v)=f(g1v). Substitution respects sums and products, preserves total degree, and (g(hf))(v)=f(h1g1v)=((gh)f)(v), so this is an action by graded algebra automorphisms. Let R=SG={fS:gf=f for every gG},R+=d>0Rd,I=SR+. The invariant polynomial algebra is R; the coinvariant algebra is the graded quotient S/I. The notation SR+ means finite sums of products fp with fS and pR+. Because the action is graded, homogeneous parts of an invariant are invariant. Thus R+ is an ideal of R, I is a homogeneous ideal of S, and the quotient grading is well-defined.

The Reynolds operator is R(f)=G1gGgf. The group is nonempty and G is invertible in C. Left multiplication permutes its finite elements, so every R(f) is invariant. For invariant f all summands equal f, hence R(f)=f and R2=R. For pR, R(pf)=pR(f) termwise. It is therefore a graded R-linear projection onto R.

The polynomial-function notation is faithful over C: a univariate nonzero degree-d polynomial has at most d roots by repeated division by xa, and induction on the number of variables, viewing the last variable's coefficients as polynomials in the others, shows that a polynomial vanishing everywhere is zero. Thus the substitution formulas can be checked either formally or on points.

If V=0, then S=R=C, G is the trivial subgroup, R+=I=0 and the coinvariant algebra is C. If G={1} in positive dimension, R=S and I=(x1,,xr), so again S/I=C. Constants survive in every case because I has positive degree. All averages and coordinate choices are finite; no AC is used.

Depends on

Used by

Dependency tree · two levels

3 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