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 be a Coxeter system of finite type, , with , and a fixed basic family of degrees , generating the ideal , algebraically independent and generating , as in Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system; choose -coordinates on (Polynomial rings in finitely many commuting indeterminates by iteration) and let and be the formal partial derivatives and the Jacobian matrix of Equation rows and coordinate columns in an affine Jacobian. Put and (The field of fractions of an integral domain).
(1) Annihilating orbit polynomials. For each , the orbit polynomial is monic of degree , its coefficients lie in , and . Hence every is algebraic over in the sense of Algebraic and transcendental elements and algebraic extensions.
(2) Minimal polynomial and its derivative. For each let be the minimal polynomial of over (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element). Then ; is nonconstant; ; and .
(3) Differential bridge. For each there exist such that, for every , the identity holds in (with the Kronecker symbol; equivalently with over ). Consequently has rank over , and 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 with basic family , and coordinates on .
The fixed family is a minimal family of homogeneous positive-degree invariants generating , generates as a -algebra and is algebraically independent, so evaluation gives a graded -algebra isomorphism , , and every element of is a polynomial in the ; also (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).
is the complexified canonical representation with , and ; more precisely every -fixed linear form on 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).
The action makes a graded algebra on which acts by graded algebra automorphisms, with invariant algebra , positive-degree part and ; the degree-one part of is and the restricted action is the dual action, so a degree-one element of is -fixed exactly when it is an invariant linear form (Finite linear invariant and coinvariant polynomial algebras, Reflection basic invariants form a regular sequence).
is the iterated polynomial ring over , monomials form a basis, and is a domain with fraction field ; the subfield generated by is (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 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 exactly when is an eigenvalue.
Algebraic elements and minimal polynomials: if with then is algebraic over ; the minimal polynomial is the unique monic irreducible element generating , and holds exactly when (Algebraic and transcendental elements and algebraic extensions, The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
The formal partial derivatives are defined on monomials by the Leibniz monomial rule and extended -linearly, and the univariate formal derivative satisfies , , the product rule, and the degree bound when (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).
The Axiom of Choice is used only to have an -element basic family as in [F1] (The Axiom of Choice).
Proof
Fix and form . For one has (the action is a left action), so permutes the linear factors and hence fixes ; as acts by graded algebra automorphisms [F3], each coefficient of lies in . By [F1] , so all coefficients lie in . The polynomial is monic of degree , being a product of monic linear factors, and because the factor with is . Hence is algebraic over in the sense of [F5].
The operators are -linear on and satisfy the product rule on monomials by the Leibniz monomial rule, hence on all polynomials by bilinearity; by induction the power rule holds for all , while . Consequently, for every polynomial and all , the chain rule holds: expanding , the product rule gives , which is the displayed identity because .
Suppose . Since acts on by algebra automorphisms it acts on the fraction field by , and this action fixes pointwise because the are invariant; hence for every . But is a degree-one element of [F3], so by [F2] the only -fixed linear form is , while is a coordinate function and : contradiction. So ; the minimal polynomial of over [F5] is therefore nonconstant. Its derivative is nonzero: the top coefficient of is nonzero and the degree is , so in characteristic zero the coefficient of is nonzero, and by [F6]. If , then the nonzero polynomial of degree would have as a root, contradicting the minimality of [F5]; hence in .
Fix and write with . Since [F4], choose with for all , and put . Then and , so in by 2.1. Differentiate the polynomial identity with respect to using the product and power rules of 1.2: hence in . Each is for a polynomial [F1], so the chain rule of 1.2 gives . Substituting, for all ; equivalently for the matrix . Hence is invertible over the field , so it has rank over , its determinant is nonzero in , and since is a domain with fraction field [F4] the polynomial is nonzero. For 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
- Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system
- Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Finite linear invariant and coinvariant polynomial algebras
- Finite reflection invariant generators are algebraically independent
- Reflection basic invariants form a regular sequence
- Chevalley shephard todd for finite weyl groups
- The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution
- Polynomial rings in finitely many commuting indeterminates by iteration
- The formal derivative of a polynomial
- Linearity, power rule, Leibniz rule and the degree bound for the formal derivative
- Equation rows and coordinate columns in an affine Jacobian
- The field of fractions $\operatorname{Frac}(D)=(D\setminus\{0\})^{-1}D$ of an integral domain
- Algebraic and transcendental elements and algebraic extensions
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- The Axiom of Choice
- A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit
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
- Pavel Etingof, Representations of Lie Groups (MIT 18.757 course notes, 162-page PDF) (standard reference, not scraped)
- Josh Swanson, On eigenvalues of representations of reflection groups and wreath products (University of Washington CAT seminar notes, 7-page PDF) (standard reference, not scraped)