Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

Weyl anti invariants are divisible by the discriminant

Statement

For the finite Weyl reflection action on S=C[V], put Sdet⁡={p:w⋅p=det⁡(w)p for all w∈W}. Then Sdet⁡=ΔSW. The invariant quotient is unique. This includes rank zero and the zero polynomial, and is choice-free.

Facts & Assumptions

Given: The finite Weyl action and polynomial conventions.

[F1]

The discriminant is nonzero, has one nonproportional linear factor per reflecting hyperplane and satisfies w⋅Δ=det⁡(w)Δ, by Weyl discriminant and reflecting hyperplane arrangement.

[F2]

Polynomial functions and the substitution action are those of Finite linear invariant and coinvariant polynomial algebras.

Proof

1.1F1F2givenalgebra

Let p∈Sdet⁡ and let ℓα be any factor of Δ. On its reflecting hyperplane sαv=v, so p(v)=p(sαv)=−p(v) and therefore p(v)=0. Extend ℓα to a linear coordinate system x1=ℓα,x2,…,xr. The constant coefficient in x1 vanishes at every (x2,…,xr), hence is the zero polynomial by F2's polynomial-function faithfulness. Thus ℓα divides p.

1.2F2algebra

In a polynomial ring over a field a nonzero product is nonzero: choose, for example, the lexicographically highest monomial of each factor, whose product is the unique highest monomial of the product and has nonzero coefficient. Also the ideal generated by a nonzero linear form is prime, since a linear coordinate change identifies its quotient with a polynomial ring in one fewer variable, which is a domain by that same argument. Two nonproportional linear forms do not divide each other, since a quotient between degree-one polynomials would have degree zero. Consequently if each of finitely many pairwise nonproportional linear forms divides p, their product divides p: induct, and use primeness to divide the remaining quotient by the next factor, since it divides none of the preceding factors. These statements include p=0 by taking quotient zero.

2.1step 1.1step 1.2F1F2algebra∎

Steps 1.1–1.2 give p=Δq. For w∈W, F1 and anti-invariance yield det⁡(w)Δ(w⋅q)=w⋅p=det⁡(w)Δq. The determinant is nonzero and the polynomial ring is a domain, so w⋅q=q. Thus q∈SW, and domain cancellation also proves uniqueness. Conversely if q is invariant, F1 gives w⋅(Δq)=det⁡(w)Δq, so it is anti-invariant. When the rank is zero, Δ=1 and both sides are C. All coordinate extensions and products are finite, so no AC enters.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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