Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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.

Algebraicity of the coordinates over the invariant field and non-vanishing of the invariant Jacobian

Statement

Assume the Axiom of Choice. Let (W,S) be a Coxeter system of finite type, n=∣S∣≥1, with VC, A=S/I and a fixed basic family f1,…,fn∈R=SW of degrees di, generating the ideal I=SR+, algebraically independent and generating R, as in Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system; choose C-coordinates x1,…,xn on VC (Polynomial rings in finitely many commuting indeterminates by iteration) and let ∂/∂xj and J=(∂fi/∂xj)1≤i,j≤n be the formal partial derivatives and the Jacobian matrix of Equation rows and coordinate columns in an affine Jacobian. Put L:=C(x1,…,xn) and K:=C(f1,…,fn)⊆L (The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain).

(1) Annihilating orbit polynomials. For each j, the orbit polynomial Pj(T):=∏w∈W(T−w⋅xj)∈S[T] is monic of degree ∣W∣, its coefficients lie in R=C[f1,…,fn]⊆K, and Pj(xj)=0. Hence every xj is algebraic over K in the sense of Algebraic and transcendental elements and algebraic extensions.

(2) Minimal polynomial and its derivative. For each j let mj∈K[T] be the minimal polynomial of xj over K (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element). Then xj∉K; mj is nonconstant; mj′≠0; and mj′(xj)≠0.

(3) Differential bridge. For each j there exist b1j,…,bnj∈L such that, for every k∈{1,…,n}, the identity δjk=∑i=1nbij ∂fi∂xk holds in L (with δjk the Kronecker symbol; equivalently id=B⋅J with B=(bji) over L). Consequently J has rank n over L, and J:=det⁡(∂fi∂xj)∈S is a nonzero polynomial: the invariant Jacobian.

No étale-quotient, scheme-theoretic or transcendental Jacobian criterion is used.

Facts & Assumptions

Given: The Axiom of Choice, the finite type system (W,S) with basic family f1,…,fn, and coordinates x1,…,xn on VC.

[F1]

The fixed family f1,…,fn is a minimal family of homogeneous positive-degree invariants generating I=SR+, generates R as a C-algebra and is algebraically independent, so evaluation gives a graded C-algebra isomorphism C[y1,…,yn]→R, yi↦fi, and every element of R is a polynomial in the fi; also di≥2 (Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system, Finite reflection invariant generators are algebraically independent, Chevalley shephard todd for finite weyl groups).

[F2]

ρC:W→GL(VC) is the complexified canonical representation with dim⁡CVC=n, and VCW={0}; more precisely every W-fixed linear form on VC is zero (Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers (1),(3), The canonical reflection homomorphism, roots, reflections, and the positive cone).

[F3]

The action (g⋅f)(v)=f(ρC(g)−1v) makes S=C[VC] a graded algebra on which W acts by graded algebra automorphisms, with invariant algebra R=SW, positive-degree part R+ and I=SR+; the degree-one part of S is VC∗ and the restricted action is the dual action, so a degree-one element of S is W-fixed exactly when it is an invariant linear form (Finite linear invariant and coinvariant polynomial algebras, Reflection basic invariants form a regular sequence).

[F4]

S=C[x1,…,xn] is the iterated polynomial ring over C, monomials form a basis, and S is a domain with fraction field L=C(x1,…,xn); the subfield generated by f1,…,fn is K=C(f1,…,fn)=Frac⁡(R) (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution, Polynomial rings in finitely many commuting indeterminates by iteration, The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain). Over a field, a positive-sized square matrix is invertible exactly when its determinant is nonzero (A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit); hence det⁡(λI−M)=0 exactly when λ is an eigenvalue.

[F5]

Algebraic elements and minimal polynomials: if 0≠P∈K[T] with P(xj)=0 then xj is algebraic over K; the minimal polynomial mj is the unique monic irreducible element generating ker⁡(ev⁡xj)=(mj), and f(xj)=0 holds exactly when mj∣f (Algebraic and transcendental elements and algebraic extensions, The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[F6]

The formal partial derivatives ∂xk are defined on monomials by the Leibniz monomial rule and extended C-linearly, and the univariate formal derivative satisfies (f+g)′=f′+g′, (cf)′=cf′, the product rule, (Ta)′=aTa−1 and the degree bound deg⁡f′≤deg⁡f−1 when f′≠0 (Equation rows and coordinate columns in an affine Jacobian, The formal derivative of a polynomial, Linearity, power rule, Leibniz rule and the degree bound for the formal derivative).

[F7]

The Axiom of Choice is used only to have an n-element basic family as in [F1] (The Axiom of Choice).

Proof

1.1F1F3F4F5

Fix j and form Pj(T)=∏w∈W(T−w⋅xj)∈S[T]. For g∈W one has g⋅(w⋅xj)=(gw)⋅xj (the action is a left action), so g permutes the linear factors and hence fixes Pj; as W acts by graded algebra automorphisms [F3], each coefficient of Pj lies in R=SW. By [F1] R=C[f1,…,fn], so all coefficients lie in K. The polynomial is monic of degree ∣W∣, being a product of ∣W∣ monic linear factors, and Pj(xj)=0 because the factor with w=1 is T−xj. Hence xj is algebraic over K in the sense of [F5].

1.2F6

The operators ∂xk are C-linear on S and satisfy the product rule on monomials by the Leibniz monomial rule, hence on all polynomials by bilinearity; by induction the power rule ∂xk(xja)=axja−1δjk holds for all a≥1, while ∂xk1=0. Consequently, for every polynomial γ∈C[y1,…,yn] and all g1,…,gn∈S, the chain rule ∂xk(γ(g1,…,gn))=∑i=1n(∂yiγ)(g1,…,gn) ∂xkgi holds: expanding γ=∑αcαyα, the product rule gives ∂xk(gα)=∑iαigα−ei∂xkgi, which is the displayed identity because ∂yiγ=∑αcααiyα−ei.

2.1F2F3F5F6step 1.1

Suppose xj∈K. Since W acts on S by algebra automorphisms it acts on the fraction field L by g⋅(a/b)=(g⋅a)/(g⋅b), and this action fixes K pointwise because the fi are invariant; hence g⋅xj=xj for every g. But xj∈VC∗ is a degree-one element of S [F3], so by [F2] the only W-fixed linear form is 0, while xj is a coordinate function and xj≠0: contradiction. So xj∉K; the minimal polynomial mj of xj over K [F5] is therefore nonconstant. Its derivative is nonzero: the top coefficient of mj is nonzero and the degree is ≥1, so in characteristic zero the coefficient deg⁡(mj)⋅cdeg⁡ of mj′ is nonzero, and deg⁡mj′<deg⁡mj by [F6]. If mj′(xj)=0, then the nonzero polynomial mj′∈K[T] of degree <deg⁡mj would have xj as a root, contradicting the minimality of mj [F5]; hence mj′(xj)≠0 in L.

3.1F1F4F6F7step 1.1step 1.2step 2.1∎

Fix j and write mj(T)=∑a=0rcaTa with ca∈K. Since K=Frac⁡(R) [F4], choose 0≠B∈R with βa:=Bca∈R for all a, and put Mj(T):=∑aβaTa∈R[T]. Then Mj(xj)=B mj(xj)=0 and Mj′(T)=B mj′(T), so Mj′(xj)=B mj′(xj)≠0 in L by 2.1. Differentiate the polynomial identity Mj(xj)=∑aβaxja=0 with respect to xk using the product and power rules of 1.2: 0=∑a(∂xkβa) xja+Mj′(xj) ∂xkxj=∑a(∂xkβa)xja+Mj′(xj)δjk, hence δjk=−(∑a(∂xkβa)xja)/Mj′(xj) in L. Each βa∈R=C[f1,…,fn] is βa=γa(f1,…,fn) for a polynomial γa∈C[y1,…,yn] [F1], so the chain rule of 1.2 gives ∂xkβa=∑i(∂yiγa)(f1,…,fn)∂xkfi. Substituting, δjk=∑i=1nbij ∂xkfi,bij:=−∑a(∂yiγa)(f1,…,fn) xjaMj′(xj)∈L, for all j,k; equivalently BJ=id for the matrix B=(bji). Hence J is invertible over the field L, so it has rank n over L, its determinant is nonzero in L, and since S is a domain with fraction field L [F4] the polynomial J=det⁡J∈S is nonzero. For n=0 there is no assertion to make; the only choice principle used is the AC entering the existence of the basic family [F7], and no étale-quotient, scheme-theoretic or transcendental Jacobian criterion is invoked.

Depends on

Used by

Dependency tree · two levels

66 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