Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

A dominant vector minimises its distance to a dominant weight

Statement

Assume the Axiom of Choice (The Axiom of Choice). Work in the real span E of the roots with its W-invariant positive definite form, and let ξ and η be weights in E that are dominant, so ⟨ξ,αi∨⟩≥0 and ⟨η,αi∨⟩≥0 for every simple root αi (Integral, dominant, and strictly dominant weights). Then ∣ξ−wη∣≥∣ξ−η∣for every w∈W, and equality holds if and only if wη lies in the set Wξη={vη:v∈Wξ}, where Wξ={v∈W:vξ=ξ} is the stabilizer of ξ. In particular, if ξ is regular, so that Wξ={1}, then equality forces wη=η; if ξ=0 then equality holds for every w.

Facts & Assumptions

Given: The Axiom of Choice, the real span E of the roots with its positive definite W-invariant form, and dominant weights ξ,η∈E.

[F1]

The reflection sα acts on h∗ by sα(λ)=λ−⟨λ,α∨⟩α with ⟨λ,α∨⟩=2(λ,α)/(α,α), it is orthogonal for the form on E, and the simple roots form a basis of E; dominance means nonnegativity on the simple coroots (Root reflections and the Weyl group action, The roots form a reduced crystallographic Euclidean root system, Integral, dominant, and strictly dominant weights).

[F2]

Each simple reflection si permutes Φ+∖{αi} and sends αi to −αi; the simple reflections generate W (Finite Weyl positive roots and simple reflections).

[F3]

Every W-orbit in E contains exactly one point of the closed chamber C‾={x∈E:(x,αi)≥0 for all i} (Finite Weyl closed chambers and stabilizers).

Proof

technique · direct, by chamber descent along simple reflections that decrease the number of negative pairings
1.1F1F2F3given

Since η is dominant, the closed chamber is C‾={x∈E:(x,αi)≥0 for all i}, and for x∈W and a simple root αi with ⟨xη,αi∨⟩<0 we set c=−⟨xη,αi∨⟩>0, so that sixη=xη+cαi. Let d(x)=#{β∈Φ+:⟨xη,β∨⟩<0} be the number of positive roots pairing negatively with xη.

2.1step 1.1F1algebra

For such x and αi one has ∣ξ−sixη∣2−∣ξ−xη∣2=−2c (ξ,αi)≤0, because sixη=xη+cαi and expansion gives −2c(ξ−xη,αi)+c2(αi,αi)=−2c(ξ,αi)−c2(αi,αi)+c2(αi,αi), while (ξ,αi)=⟨ξ,αi∨⟩(αi,αi)/2≥0 by dominance of ξ. Thus a descent step never increases the distance from ξ.

2.2F2step 1.1algebra

If ⟨xη,αi∨⟩<0 then d(six)=d(x)−1. Indeed, for β∈Φ+∖{αi} the orthogonality of si gives ⟨sixη,β∨⟩=⟨xη,siβ∨⟩, and by [F2] the map β↦siβ is a bijection of Φ+∖{αi}; the root αi itself pairs negatively with xη but, by siαi=−αi and ⟨xη,−αi∨⟩>0, not with sixη. Hence the negative positive roots at sixη are in bijection with the negative positive roots at xη other than αi, of which there are d(x)−1.

3.1F1F3step 2.1step 2.2given

Starting from x0=w, iterate: if xjη is not in the closed chamber, choose a simple root αi with ⟨xjη,αi∨⟩<0 and set xj+1=sixj. By step 2.1 the distances ∣ξ−xjη∣ are nonincreasing, and by step 2.2 the integer d(xj) drops by one at each step, so the iteration terminates after at most d(w) steps at an element xm with xmη∈C‾. By [F3] the dominant point of the orbit Wη is unique, so xmη=η. Therefore ∣ξ−η∣=∣ξ−xmη∣≤∣ξ−wη∣ for every w∈W.

4.1F1step 2.1step 3.1algebra

Suppose ∣ξ−wη∣=∣ξ−η∣ and run any descent from w as in step 3.1. The values ∣ξ−xjη∣ are nonincreasing and their first and last terms are equal, so every step is an equality, and step 2.1 with c>0 gives (ξ,αij)=0, equivalently sijξ=ξ, for every reflecting root used. Writing xm=sim⋯si1w and xmη=η, the element v:=si1⋯sim fixes ξ, and wη=(si1⋯sim)η=vη; hence wη∈Wξη.

5.1F1step 3.1step 4.1∎

Conversely, if wη=vη with vξ=ξ, then the W-invariance of the form and the orthogonality of v give ∣ξ−wη∣=∣ξ−vη∣=∣v−1(ξ−vη)∣=∣v−1ξ−η∣=∣ξ−η∣. Together with steps 3.1 and 4.1 this proves the inequality for every w∈W with equality exactly when wη∈Wξη; if ξ is regular then no root reflection fixes ξ, so Wξ={1} and equality forces wη=η.

Depends on

Used by

Dependency tree · two levels

33 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