Alphabeta Math
TheoremStatement: 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.

The total degree sum, the invariant Jacobian as the discriminant, anti-invariants, and the top coinvariant class

Statement

Assume the Axiom of Choice. Let (W,S) be a finite-type Coxeter system with S finite, n:=∣S∣, and let VC, its faithful real-matrix reflection representation ρC, the positive roots Φ+, and the reflections T be as in Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers, The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone and The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange. Put S0:=C[VC]=C[x1,…,xn], R:=S0W, R+:=⨁d>0Rd, I:=S0R+ and A:=S0/I as in Finite linear invariant and coinvariant polynomial algebras. Fix a homogeneous basic family f1,…,fn of degrees di and exponents ei=di−1 as in Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system, let N:=∣Φ+∣=∣T∣, and choose coordinates x1,…,xn from a B-orthonormal real basis of V; then every matrix ρC(w) is real orthogonal. Define

Δ:=∏α∈Φ+ℓα∈S0,ℓα(x):=BC(x,α),

and let J:=det⁡(∂fi/∂xj)≠0 be the invariant Jacobian of Algebraicity of the coordinates over the invariant field and non-vanishing of the invariant Jacobian. Write det⁡(w):=det⁡(ρC(w)). Then:

(1) Total degree. ∑i=1n(di−1)=N=∣Φ+∣=∣T∣.

(2) The Jacobian is the discriminant. For every w∈W, w⋅J=det⁡(w)J. Each ℓα divides J, and the ℓα are pairwise nonproportional. For some c∈C×,

J=c Δ,deg⁡J=∑i(di−1)=N=deg⁡Δ.

(3) Anti-invariants. If S0det⁡:={p∈S0:w⋅p=det⁡(w)p for every w∈W}, then S0det⁡=ΔR. Each p∈S0det⁡ has a unique expression p=Δq with q∈R.

(4) Top coinvariant class. The top degree of A is N=∑iei, its component AN is one-dimensional, and [Δ]∈AN is nonzero and spans it. The action on this line is w⋅[Δ]=det⁡(w)[Δ].

(5) Conventions. For n=0, W is trivial, Δ=J=1, N=0, and the clauses hold with empty products and determinant. The product defining Δ is independent of the order in which the fixed set Φ+ is listed. Replacing the positive system by its opposite multiplies Δ by (−1)N. The polynomial Δ is coordinate-free; changing orthonormal coordinates substitutes the corresponding orthogonal change into its coordinate expression, while the proportionality scalar in J=cΔ changes by the determinant of that basis change. These are conventions, not proof inputs. No claim is made that A is the regular representation, that it is a Kostant harmonic space, or that it is flag-variety cohomology.

Facts & Assumptions

Given: The Axiom of Choice, a finite-type Coxeter system, a fixed basic family f1,…,fn, and B-orthonormal coordinates.

[F2]

The finite reflecting arrangement has chambers whose interiors have trivial point stabilizer; every nonzero vector lies in a unique open face wCI, and a point of that face has stabilizer wWIw−1; for I={s}, WI={1,s} (The dual action, chambers, faces, and root hyperplanes, Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1),(3)).

[F3]

Under the stated Choice assumption, the invariant Hilbert series is ∏i(1−tdi)−1, the coinvariant Hilbert series is ∏i(1+t+⋯+tdi−1), and the full normalized Molien identity is

∏i(1−tdi)−1=1∣W∣∑w∈Wdet⁡(1−tw∣VC∗)−1

as a formal series (The basic degrees are independent of the chosen family; Hilbert series of the invariants and of the coinvariant algebra; the order formula and the Molien identity (2),(4), Weyl coinvariant hilbert series has order w dimension).

[F6]

S0 is the iterated polynomial ring over C (Polynomial rings in finitely many commuting indeterminates by iteration). Leading monomials show it is a domain. Taking a nonzero linear form ℓ as one coordinate identifies S0/(ℓ) with a polynomial domain in n−1 variables, so (ℓ) is prime. Two linear forms are associates exactly when they are proportional: degree comparison forces any multiplier between them to be constant.

[F7]

The polynomial action is the contragredient substitution action, invariants form the graded subalgebra R, and I=S0R+ is homogeneous (Finite linear invariant and coinvariant polynomial algebras, Nonnegatively graded rings and modules, homogeneous elements, and twists).

[F8]

Formal partial derivatives obey the monomial rule and chain rule, and the Jacobian determinant is the determinant of the matrix of those partials (The formal derivative of a polynomial, Equation rows and coordinate columns in an affine Jacobian). Determinants satisfy det⁡(AB)=det⁡(A)det⁡(B) (For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)).

[F9]

Complex conjugation and the linear-first inner-product convention are those of Real and imaginary parts, complex conjugation, and modulus and Real and complex inner product spaces, with the inner product linear in the first argument. The coefficient-factorial pairing used below is constructed in step 5.1.

Proof

technique · Compare the first two Laurent coefficients of the normalized Molien identity, then use reflection divisibility and a coefficient-factorial pairing. All calculations are in polynomial rings or finite-dimensional spaces
1.1givenF1F3

If n=0, then W={1}, S0=R=A=C, and every family and product is empty; all clauses follow. If n=1, the Coxeter group is W={1,s}, T={s} and N=1. For its single degree d1, [F3] gives 11−td1=12(11−t+11+t). With δ=1−t, the left side is d1−1δ−1+(d1−1)/(2d1)+O(δ) and the right side is 12δ−1+14+O(δ); comparing the δ−1 and constant coefficients gives d1=2 and d1−1=1=N. In rank one, write the unit positive-root form as Δ=εx1 with ε=±1. Invariance under x1↦−x1 gives R=C[x12]; the degree-two basic generator is f1=ax12 with a≠0, so I=(x12), J=2ax1=(2a/ε)Δ, and the anti-invariant polynomials are precisely the odd polynomials ΔR. The quotient has basis 1,[x1], so its top component is the nonzero sign line spanned by [Δ]. This proves every clause for n=1. In the rest of the proof assume n≥2.

1.2F1F2algebra

For n≥2, let g≠1 have fixed space of codimension one in VC. Because its matrix is real, the real and complex fixed spaces have the same codimension, so H:=Fix⁡V(g) is a real hyperplane. If H were not in the finite reflecting arrangement, a point x∈H outside every arrangement hyperplane could be chosen: for each proper subspace cut out on H, choose a nonzero linear form vanishing there; their product is a nonzero polynomial on H, which cannot vanish everywhere over R (by induction on dim⁡H). It would lie in a chamber interior, whose point stabilizer is trivial by [F2], contrary to gx=x. Hence H is an arrangement hyperplane. The same finite-union argument chooses x∈H outside all other distinct arrangement hyperplanes; x is nonzero. By [F2], x∈w0CI for some I⊊S. Since x lies on an arrangement hyperplane, I is nonempty; the walls indexed by I are distinct because their normals are the images of distinct basis vectors under the invertible map ρ(w0). They all pass through x, so ∣I∣=1. For I={s}, [F2] gives Stab⁡W(x)=w0{1,s}w0−1; since g≠1 fixes x, it is the reflection w0sw0−1∈T. Conversely every element of T has a fixed hyperplane by [F1]. Thus the nonidentity elements with fixed-space codimension one are exactly the reflections.

2.1F3F5step 1.2algebra

Assume n≥2 and put δ=1−t. The left side of [F3] expands as ∏i(1−tdi)−1=δ−n∏idi(1+δ2∑i(di−1)+O(δ2)). In the normalized sum on its right, the identity contributes ∣W∣−1δ−n. Each of the N reflections contributes ∣W∣−1δ−(n−1)/(1+t)=12∣W∣δ−(n−1)+O(δ−(n−2)). For every other element, [F5] and step 1.2 give at most n−2 eigenvalues equal to 1 on VC∗: indeed rank⁡(M−T−I)=rank⁡(M−I), so the fixed dimensions on a representation and its dual agree. Its Molien term is therefore O(δ−(n−2)). Comparing the coefficients of δ−n and δ−(n−1) first gives ∏idi=∣W∣ and then ∑i(di−1)=N. The identity is a finite sum of rational functions, so these Laurent expansions compare coefficients without an infinite-limit interchange.

3.1F1F4F6F8step 2.1algebra

Write M=ρC(w) in the chosen orthonormal coordinates. The tuple F=(f1,…,fn) satisfies F(Mx)=F(x); differentiating gives DF(Mx)M=DF(x) and hence J(Mx)=det⁡(M)−1J(x)=det⁡(M)J(x), since M is real orthogonal. If x lies on the fixed hyperplane of tα, then J(x)=J(ρC(tα)x)=−J(x), so J vanishes there. After taking ℓα as one coordinate, restriction to ℓα=0 is the zero polynomial; thus ℓα divides J. If ℓα and ℓβ are proportional, nondegeneracy of BC gives α=cβ; since both roots are real with B-norm one, c=±1, and positivity of both roots gives c=1, so α=β. Thus the forms are pairwise nonproportional primes by [F6], and Δ divides J. Every determinant term of the Jacobian matrix has degree ∑i(di−1); [F4] makes this the degree of its nonzero determinant. Since deg⁡Δ=N, step 2.1 gives deg⁡J=deg⁡Δ, so J=cΔ for a nonzero scalar c. This proves (2), including anti-invariance of Δ. If an orthonormal basis changes by P, its coordinate expressions satisfy Δnew(y)=Δold(Py) and Jnew(y)=det⁡(P)Jold(Py). Listing the fixed roots in a different order leaves the product unchanged; replacing Φ+ by −Φ+ multiplies it by (−1)N.

4.1F1F6F7step 3.1algebra

If p∈S0det⁡, every reflection tα acts by determinant −1, so p vanishes on its fixed hyperplane and each ℓα divides p. The same pairwise-prime argument as in step 3.1 gives p=Δq for some q∈S0. By step 3.1, Δ is anti-invariant; applying any w to p=Δq and cancelling Δ in the domain S0 then gives w⋅q=q. Conversely, if q∈R, the product Δq is anti-invariant. The quotient q is unique because S0 is a domain and Δ≠0.

5.1F3F6F7F8F9step 2.1step 3.1step 4.1algebra∎

By [F3] the Hilbert series of A is ∏i(1+t+⋯+tdi−1), whose top degree is ∑i(di−1)=N by step 2.1 and whose top coefficient is 1, so AN is one-dimensional. For f=∑∣a∣=Nfaxa and g=∑∣a∣=Ngaxa in (S0)N, set ⟨f,g⟩:=∑∣a∣=Na! faga‾ with a!:=∏jaj!; this is positive definite. If p∈Rd is homogeneous with d>0 and f∈(S0)N−d, direct monomial expansion gives ⟨pf,Δ⟩=⟨f,p‾(∂)Δ⟩, where p‾(∂) conjugates the coefficients of p and substitutes the formal partial derivatives for its variables. For a real orthogonal matrix M, the chain rule, first on linear symbols and then by products and linearity, gives p‾(∂x)(q∘M)=(p‾(MT∂)q)∘M. Since MT=M−1∈W and real matrices preserve coefficientwise conjugation, p‾ is invariant and p‾(MT∂)=p‾(∂); thus this differential operator commutes with substitution by M. Since Δ∘M=det⁡(M)Δ by step 3.1, p‾(∂)Δ is anti-invariant. If d≤N it has degree N−d<N, so step 4.1 forces it to be zero; if d>N the derivative is already zero. Every homogeneous element of IN is a sum of such products pf, hence Δ is orthogonal to IN. But Δ is a nonzero real-coefficient polynomial, so ⟨Δ,Δ⟩>0; consequently Δ∉IN and [Δ]≠0 in AN. It spans this one-dimensional component and has the determinant action by step 3.1.

Depends on

Used by

Dependency tree · two levels

164 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