Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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 reflection invariant generators are algebraically independent

Statement

Let GGL(V) be a finite group generated by complex reflections, where a complex reflection is a nonidentity element fixing a hyperplane pointwise. Put S=C[V], R=SG and I=SR+. A finite minimal set of homogeneous positive-degree invariants f1,,fr generating I exists. Every such set generates R as an algebra and is algebraically independent. Here minimal means that no fj belongs to the S-ideal generated by the others. No finiteness or freeness assertion for S/I is used in this proof.

Facts & Assumptions

Given: The stated finite complex reflection group and its polynomial algebra.

[F1]

The grading, invariant ideal and graded R-linear Reynolds projection are defined in Finite linear invariant and coinvariant polynomial algebras.

[F2]

Polynomial rings over Noetherian commutative rings are Noetherian (Hilbert basis theorem: if R is Noetherian then R[x] is Noetherian).

[F3]

Noetherianity is equivalent to finite generation of every ideal, in the choice-free 12 branch of A commutative ring is Noetherian exactly when every ideal is finitely generated, exactly when its ideals satisfy the ascending chain condition, and exactly when every nonempty set of ideals has a maximal member. Its separate DC-dependent maximal-condition implication is not used.

Proof

1.1

A field has only ideals 0 and itself: an ideal containing nonzero a contains a1a=1. They are generated by the empty set and by 1. Thus C is Noetherian by F3, and finitely many applications of F2 make S Noetherian. F3 supplies finite generators for I. Each is a finite sum of multiples of positive-degree invariants by F1; replace each invariant by its finitely many homogeneous components. The resulting finite family of homogeneous positive-degree invariants still generates I. Successively discard a redundant member until none remains, producing the required minimal family. If an invariant homogeneous f has degree d>0, write f=jsjfj with sj homogeneous of degree ddegfj<d, discarding negative-degree terms. Reynolds gives f=jR(sj)fj. Induction on d, starting with constants at degree zero, proves that all invariants are polynomials in the fj.

F1F2F3given
1.2

We prove a relation fact. Suppose homogeneous invariants F1,,Fm satisfy F1(F2,,Fm)S, and homogeneous coefficients obey jgjFj=0. Then g1I. Induct on D=degg1 when g10; the zero case is immediate. At D=0, a nonzero scalar g1 would solve for F1 in the other ideal, impossible. For D>0 and a generating reflection σ, choose a nonzero linear equation α for its fixed hyperplane. Each σgjgj vanishes there, hence equals αhj: take α as a coordinate and set that coordinate to zero in the polynomial, so the constant term in it is zero. Since σFj=Fj, subtracting the original relation from its transform and canceling the nonzero factor α gives jhjFj=0. Cancellation is valid since a polynomial ring over a field is a domain, as its leading monomial products have nonzero leading coefficient. Now degh1=D1 if it is nonzero, so induction yields h1I, hence σg1g1I. The ideal I is G-stable by F1. Writing any gG as a product of generating reflections and telescoping therefore gives gg1g1I. Averaging gives R(g1)g1I, while R(g1) is either zero or a positive-degree invariant, hence in I. Therefore g1I.

F1given
2.1

Suppose a nonzero polynomial relation H(f1,,fr)=0 exists. Give its variables weights dj=degfj>0. Separating weighted homogeneous parts and choosing least positive weighted degree gives such an H of minimal degree D. Some partial derivative Hj=H/yj is nonzero in characteristic zero. Its weighted degree is Ddj<D, so Hj(f)0 by minimality (a nonzero constant also cannot evaluate to zero). From the finite family Hj(f) choose a minimal subfamily generating their S-ideal and relabel it H1(f),,Hm(f), with m1. For i>m write Hi(f)=j=1maijHj(f), taking homogeneous coefficients of degrees djdi and zero coefficients when this number is negative.

step 1.1given
3.1

Differentiate H(f)=0 with respect to each coordinate xk. The chain rule, verified on monomials, gives jHj(f)kfj=0. Substituting 2.1 yields j=1mHj(f)(kfj+i>maijkfi)=0. Minimality of the derivative generating subfamily gives H1(f)(H2(f),,Hm(f))S. Apply 1.2 to obtain kf1+i>mai1kfiI. It is homogeneous of degree d11, so by 1.1 write it jqjkfj with degqjk=d1dj1, again zero in negative degrees. In particular q1k=0.

step 1.1step 1.2step 2.1
4.1

Multiply these identities by xk and sum over k. The monomial identity kxkkfj=djfj gives d1f1+i>mai1difi=j1(kxkqjk)fj. Since d1 is a nonzero integer, this puts f1 in the ideal of the other basic generators, contrary to their minimality. Thus no polynomial relation exists, proving algebraic independence. The precise exclusion of the self-coefficient is degq1k=1, not a positivity claim about arbitrary invariant forms. If I=0, step 1.1 gives R=C and the empty generating set is algebraically independent. The argument allows degree-one invariants and the trivial group; for V=0 it gives that empty set. All selections are finite or least positive degrees. F2 uses only the finite-generation and ascending-chain consequences in its proof, and F3 is invoked only in its explicitly choice-free branch; no AC is needed.

F2F3step 1.1step 2.1step 3.1

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