Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 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.

The symmetric polynomials as the invariant ring of the symmetric group, seen through Noether's finiteness theorem

Example

Let k be a field, let n1 and let Symn act on C=k[x1,,xn] by permuting the indeterminates (Symmetric polynomials as the invariants of variable permutations). This is an action by k-algebra automorphisms, and its invariant subring (A group acting on a ring by automorphisms and its invariant subring) is the ring k[x1,,xn]Symn of symmetric polynomials.

Noether's finiteness theorem (Noether's finiteness theorem: the invariants of a finite group acting on a finite-type algebra over a Noetherian ring form an algebra of finite type) says that this ring is of finite type over k. It names no generators. Fundamental theorem of symmetric polynomials: unique expression as a polynomial in e1,,en says strictly more: the substitution Tjej is a k-algebra isomorphism k[T1,,Tn]k[x1,,xn]Symn, so the elementary symmetric polynomials generate, there are n of them, and the expression of a symmetric polynomial in them is unique.

The orbit polynomial of For a finite group of ring automorphisms the orbit polynomial is monic over the invariant subring, so the ring is integral over its invariants at x1 is

Px1(T)=σSymn(Txσ(1))=(i=1n(Txi))q,q=Symnn,

and the coefficients of i=1n(Txi) are the elementary symmetric polynomials in x1,,xn up to sign.

Facts & Assumptions

Given: A field k, an integer n1, the iterated polynomial ring C=k[x1,,xn] (Polynomial rings in finitely many commuting indeterminates by iteration) with k identified with the subring of constants, and the group Symn of permutations of {1,,n}.

[L1]

Every permutation σSym({1,,n}) acts on R[x1,,xn] by σf(x1,,xn)=f(xσ(1),,xσ(n)), a polynomial is symmetric when σf=f for every σ, and the symmetric polynomials form the fixed subset R[x1,,xn]Symn (Symmetric polynomials as the invariants of variable permutations).

[L2]

For an action of a group G on a commutative ring C by ring automorphisms, CG={cC:gc=c for every gG} is a subring of C; when C is an A-algebra and every g fixes the image of A pointwise, the action is by A-algebra automorphisms and ACGC (A group acting on a ring by automorphisms and its invariant subring).

[L3]

A left action satisfies ec=c and (gh)c=g(hc) (Left group actions, transitive actions, and faithful actions).

[L4]

In a group every element has a two-sided inverse and the operation is associative (Group and abelian group).

[L5]

For commutative rings R,S, a unital ring homomorphism φ ⁣:RS and sS, there is a unique unital ring homomorphism R[x]S extending φ on constants and sending x to s (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism).

[L7]

An algebra is of finite type over R when it equals R[a1,,am] for a finite list (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras).

[L8]

For A Noetherian, C a commutative A-algebra of finite type with A a subring of C, and G a finite group acting on C by A-algebra automorphisms, the invariant subring CG is of finite type over A (Noether's finiteness theorem: the invariants of a finite group acting on a finite-type algebra over a Noetherian ring form an algebra of finite type).

[L9]

For every commutative ring R and every nN, substitution Tkek is an R-algebra isomorphism R[T1,,Tn]R[x1,,xn]Symn; equivalently, every symmetric polynomial has a unique expression Q(e1,,en) (Fundamental theorem of symmetric polynomials: unique expression as a polynomial in e1,,en).

[L10]

For 0kn the k-th elementary symmetric polynomial is ek(x1,,xn)=1i1<<iknxi1xik, with e0=1 (The elementary symmetric polynomials e0,e1,,en).

[L11]

In R[x1,,xn,t] one has i=1n(txi)=k=0n(1)kek(x1,,xn)tnk (Vieta expansion: i=1n(txi)=k=0n(1)kektnk).

[L12]

For a finite group G acting by ring automorphisms on a nonzero commutative ring C and xC, the polynomial gG(Tgx) is monic of degree G with all coefficients in CG, and C is integral over CG (For a finite group of ring automorphisms the orbit polynomial is monic over the invariant subring, so the ring is integral over its invariants).

Verification

technique · direct
1.1

The permutation action is by k-algebra automorphisms. For σSymn the map Φσ sending xj to xσ(j) and fixing k is a unital ring homomorphism, obtained by iterating the universal property of a polynomial ring along the tower defining C; composing, ΦσΦτ sends xj to xσ(τ(j)), so ΦσΦτ=Φστ and Φσ is bijective with inverse Φσ1. Each Φσ fixes the constants, so the action is by k-algebra automorphisms, and the invariant subring CSymn is by definition the set of f with σf=f for all σ, which is the ring of symmetric polynomials.

L1L2L3L4L5given
2.1

Noether's theorem applies. The ring k is Noetherian, C=k[x1,,xn] is of finite type over k with the indeterminates as generators, k is a subring of C, and Symn is a finite group acting on C by k-algebra automorphisms. So CSymn is of finite type over k: some finite list of symmetric polynomials generates it as a k-algebra. The theorem exhibits no such list.

L6L7L8step 1.1
3.1

The classical theorem gives strictly more, and the two agree where they overlap. Substitution Tjej is a k-algebra isomorphism onto CSymn, so CSymn=k[e1,,en], which in particular is a finite generating list and so reproves finite type. The extra content is twofold: the generators are named, and the isomorphism is injective, so the expression of a symmetric polynomial as a polynomial in e1,,en is unique. Nothing in Noether's theorem gives either.

L7L9L10step 2.1
4.1

The orbit polynomial at x1 is a power of the Vieta product. By the action formula σx1=xσ(1), so Px1(T)=σ(Txσ(1)), in which the factor Txi occurs once for each σ with σ(1)=i. For indices ii, composing with the transposition exchanging i and i is a bijection between the permutations with σ(1)=i and those with σ(1)=i, so all these counts are equal, say to q; summing over i gives nq=Symn. Hence Px1(T)=(i=1n(Txi))q, and the coefficients of i=1n(Txi) are the elementary symmetric polynomials in x1,,xn up to sign, the coefficient of Tnk being (1)kek. Every coefficient of Px1 is therefore a polynomial in e1,,en, consistent with the general statement that the coefficients lie in the invariant subring.

L4L10L11L12step 1.1step 3.1

Remarks

  • Noether's theorem is much weaker here, and that is the point of comparing them. Its proof runs through integrality and the Artin–Tate lemma and applies to any finite group acting on any finite-type algebra over any Noetherian ring; the fundamental theorem is special to the symmetric group acting on a polynomial ring by permutations, and pays for that with an exact description.

  • The exponent q is not an artefact. The orbit polynomial is a product over the group, not over the set of distinct values σx1, so the repetition is built into For a finite group of ring automorphisms the orbit polynomial is monic over the invariant subring, so the ring is integral over its invariants; the smaller polynomial i=1n(Txi) is also monic with invariant coefficients, and it is the one Vieta's expansion describes.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

44 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