Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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 regular weight has a unique dominant dot translate

Statement

Let Φ⊆E be a reduced crystallographic root system with positive system Φ+, Weyl group W, and Weyl vector ρ (The Weyl vector), and let λ∈X∗(T) be an integral weight (Integral, dominant, and strictly dominant weights). Let μ=λ+ρ be regular, so ⟨μ,α∨⟩≠0 for every root α, and put N(μ)=#{α∈Φ+:⟨μ,α∨⟩<0}. Then:

  1. there is a unique w∈W with wμ dominant, equivalently a unique w with w⋅λ dominant, and N(μ)=ℓ(w);
  2. if α is simple with ⟨μ,α∨⟩<0 then N(sαμ)=N(μ)−1, while if ⟨μ,α∨⟩>0 then N(sαμ)=N(μ)+1;
  3. consequently there is a reduced expression w=siℓ⋯si1 with ℓ=N(μ) whose partial products wj=sij⋯si1 satisfy N(wjμ)=N(μ)−j and are regular for every j; and if μ is dominant there is a reduced expression w0=siN⋯si1 of the longest element whose partial products wj=sij⋯si1 satisfy N(wjμ)=j for every j and end at the strictly antidominant weight w0μ;
  4. for every w∈W one has ℓ(w0w)=∣Φ+∣−ℓ(w).

The lemma is choice-free: ρ is used only through (ρ,αi∨)=1, and the dot action enters only through the explicit formula w⋅λ=w(λ+ρ)−ρ (Dot-Weyl facets and single-wall translation data).

Facts & Assumptions

Given: A reduced crystallographic root system Φ⊆E with positive system Φ+, simple roots α1,…,αr, Weyl group W, Weyl vector ρ, an integral weight λ and the regular weight μ=λ+ρ with N(μ) as in the Statement.

[F1]

The hyperplane complement E∖⋃αLα has the open Weyl chambers as connected components, W permutes these chambers, the fundamental chamber is C={x∈E:(x,αi)>0 for all i} with closure C‾ cut out by the same inequalities with ≥ in place of >, and for a positive root β=∑iniαi with ni≥0 one has (x,β)=∑ini(x,αi), so a strictly dominant point pairs positively with every positive root (Open and closed Weyl chambers).

[F2]

Every W-orbit in E has exactly one point in C‾; W acts simply transitively on open chambers; there is a unique longest element w0, characterized by w0Φ+=Φ−, with w02=1 and ℓ(w0)=∣Φ+∣; all of this holds without AC (Finite Weyl closed chambers and stabilizers).

[F3]

The inversion set and length are N(w)={α∈Φ+:wα∈Φ−} and ℓ(w)=∣N(w)∣, and ℓ(w) is the minimal number of simple reflections in an expression of w (Length and longest Weyl-group element, Weyl length equals inversion number).

[F4]

Each simple reflection si permutes Φ+∖{αi} and sends αi to −αi; the simple reflections generate W; the simple roots form an integral basis of the root lattice and the simple coroots an integral basis of the coroot lattice, so every coroot is an integral combination of simple coroots (Finite Weyl positive roots and simple reflections).

[F5]

The reflection formula is sα(ν)=ν−⟨ν,α∨⟩α, and the pairing is W-invariant: ⟨wν,(wα)∨⟩=⟨ν,α∨⟩ for all w∈W (Root reflections and the Weyl group action).

[F6]

Dominance means ⟨ν,αi∨⟩≥0 for all i, strict dominance means >0 for all i, and integrality means ⟨λ,αi∨⟩∈Z for all i; the dot action is w⋅λ=w(λ+ρ)−ρ, and regularity of μ=λ+ρ means ⟨μ,α∨⟩≠0 for every root α (Integral, dominant, and strictly dominant weights, Dot-Weyl facets and single-wall translation data).

[F7]

The Weyl vector satisfies (ρ,αi∨)=1 for the simple coroots (The Weyl vector in fundamental coordinates); with the identification of [F1] this is the pairing ⟨ρ,αi∨⟩=1 used below, and it makes ⟨ρ,β∨⟩ an integer for every coroot β∨ by [F4].

Proof

1.1F1F2F4F6F7givenalgebra

Since μ is regular it is not fixed by any reflection, so it lies in exactly one open chamber D of [F1]. By [F2] the orbit Wμ meets the closed chamber C‾ in exactly one point, necessarily regular and hence in C; this gives existence and uniqueness of w with wμ dominant. For that w and each i, ⟨w⋅λ,αi∨⟩=⟨wμ−ρ,αi∨⟩=⟨wμ,αi∨⟩−⟨ρ,αi∨⟩; here ⟨wμ,αi∨⟩=⟨λ,(w−1αi)∨⟩+⟨ρ,(w−1αi)∨⟩ is a nonzero integer by [F4], [F6] and [F7], and ⟨ρ,αi∨⟩=1 by [F7]. Hence w⋅λ is dominant exactly when ⟨wμ,αi∨⟩ is a nonnegative integer for all i, that is exactly when wμ is dominant; uniqueness transfers as well.

1.2F4F5F6givenalgebra

Let α be simple. By [F4] the map β↦sαβ is an involution of Φ+∖{α} and sends α to −α. For β∈Φ+∖{α} the W-invariance [F5] gives ⟨sαμ,sαβ∨⟩=⟨μ,β∨⟩, while ⟨sαμ,α∨⟩=−⟨μ,α∨⟩. Since sα permutes Φ+∖{α}, summing the defining conditions of N over Φ+ gives N(sαμ)=#{β∈Φ+∖{α}:⟨μ,β∨⟩<0}+[⟨μ,α∨⟩>0], that is N(sαμ)=N(μ)−[⟨μ,α∨⟩<0]+[⟨μ,α∨⟩>0]; regularity of μ makes exactly one bracket equal to 1, which gives the two asserted values.

2.1F2F3F5step 1.1algebra

For α∈Φ+ one has ⟨μ,α∨⟩<0 if and only if ⟨wμ,(wα)∨⟩<0 by W-invariance [F5]. As α runs over Φ+, wα runs over wΦ+; since wμ is strictly dominant, it pairs negatively with wα exactly when wα∈Φ−. Thus N(μ)=#{α∈Φ+:wα∈Φ−}=∣Inv⁡(w)∣=ℓ(w) by [F3].

3.1F1F3F5F6step 1.1step 2.1step 1.2algebra

Write M=N(μ) and let w be as in step 1.1, so ℓ(w)=M by step 2.1. Assume wj=sij⋯si1 has been constructed with N(wjμ)=M−j and j<M. Then wjμ is regular, because W-invariance [F5] shows ⟨wjμ,γ∨⟩=0 only if ⟨μ,(wj−1γ)∨⟩=0, and wj−1γ runs over all roots. Also N(wjμ)=M−j>0, so wjμ is not dominant: if it were dominant then every positive root would pair nonnegatively with it by [F1], contradicting N(wjμ)>0. As dominance is tested on the simple coroots [F6] and wjμ is regular, some simple α has ⟨wjμ,α∨⟩<0; put sij+1=sα, so step 1.2 gives N(wj+1μ)=M−j−1. Starting at j=0 this produces wM with N(wMμ)=0, so wMμ is strictly dominant and hence wM=w by the uniqueness in step 1.1. To see the word is reduced, apply step 1.1 to the regular weight wjμ: the unique element uj with ujwjμ dominant satisfies ℓ(uj)=N(wjμ)=M−j by step 2.1 and ujwjμ=wμ, so ujwj=w by uniqueness; hence ℓ(wwj−1)=M−j, while ℓ(w)=M and subadditivity give M=ℓ(wwj−1wj)≤ℓ(wwj−1)+ℓ(wj)=M−j+ℓ(wj), that is ℓ(wj)≥j. Since wj is a product of j simple reflections, ℓ(wj)≤j by [F3], so ℓ(wj)=j and the expression is reduced. This proves the first part of (iii) with ℓ=M.

4.1F1F2F3F6step 1.2algebra

Now suppose in addition that μ is dominant, so N(μ)=0 and μ is strictly dominant by regularity. Repeat the construction of step 3.1 with the opposite choice: given wj with N(wjμ)=j<N, the regular weight wjμ is not strictly antidominant, and strict antidominance is tested on the simple coroots [F6]; hence some simple α has ⟨wjμ,α∨⟩>0, and step 1.2 increases N by one. Starting at j=0 produces wN with N(wNμ)=N=∣Φ+∣: every positive root pairs negatively with wNμ by [F1], so wNμ lies in the chamber of w0μ by [F2]; regularity gives wN=w0, and wNμ=w0μ is strictly antidominant. The word has N factors and wN=w0 has length N by [F2], so it is reduced.

5.1F2F3givenalgebra∎

Let w∈W and α∈Φ+. Since w0 sends positive roots to negative roots and negative roots to positive roots [F2], the root w0wα is negative exactly when wα is positive. Counting positive roots gives ℓ(w0w)=#{α∈Φ+:w0wα∈Φ−}=#{α∈Φ+:wα∈Φ+}=∣Φ+∣−ℓ(w), which is (iv). All the cited inputs are choice-free, and no step invokes a choice principle.

Depends on

Used by

Dependency tree · two levels

27 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