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.

Weight subsets with equal root sums are unique

Statement

Let w∈W and put Πw={α∈Φ+:w−1α∈Φ−}. Then #Πw=ℓ(w), w∘0=−∑α∈Πwα, and for ρ the half-sum of positive roots ρ−wρ=∑α∈Πwα. If S⊆Φ+ satisfies ∑α∈Sα=∑α∈Πwα, then S=Πw.

Facts & Assumptions

Given: The finite reduced crystallographic root system Φ with positive system Φ+, the Weyl group W generated by the sα, the length function ℓ, the Weyl vector ρ=12∑α∈Φ+α, and the dot action w∘0=wρ−ρ.

[F1]

For a positive-root reflection sα: ℓ(sαw)<ℓ(w) if and only if w−1α<0, and for a simple reflection si one has ℓ(siw)=ℓ(w)±1; also ℓ(w−1)=ℓ(w) (Finite Weyl strong exchange and deletion).

[F2]

Every positive root is a nonnegative integral combination of the simple roots, with at least one positive coefficient. Each simple reflection permutes Φ+∖{αi} and sends αi to −αi; the reflections sα(λ)=λ−⟨λ,α∨⟩α act on E (Finite Weyl positive roots and simple reflections, Root reflections and the Weyl group action).

[F3]

ρ is the half-sum of the positive roots and the dot action is w∘0=w(ρ)−ρ (The Weyl vector rho for a chosen positive system, The rho-shift intertwines the dot and ordinary Weyl actions).

Proof

1.1F1givenalgebra

If w≠1, choose a reduced word w=si1⋯sik with k=ℓ(w)>0. The product si1w=si2⋯sik is represented by a word of length k−1, so ℓ(si1w)≤k−1=ℓ(w)−1; by [F1] the length changes by exactly one, so ℓ(si1w)=ℓ(w)−1 and, with α:=αi1, the criterion of [F1] gives w−1α<0. Write w=sαw′ with w′=sαw, so ℓ(w)=ℓ(w′)+1 and α∈Πw.

2.1F2step 1.1algebra

For α as in step 1.1 one has sα(Φ+∖{α})=Φ+∖{α} by [F2] and α∉w′(Φ−) because (w′)−1α=w−1sαα=−w−1α>0. Hence sα(Πw′)=sα(Φ+)∩sα(w′(Φ−))=((Φ+∖{α})∪{−α})∩w(Φ−)=(Φ+∖{α})∩w(Φ−)=Πw∖{α}, so Πw=sα(Πw′)∪{α} is a disjoint union.

3.1F1F2F3step 2.1induction

Induction on ℓ(w) proves the three identities simultaneously. For w=1 all three sides vanish. For w≠1, apply step 2.1 and the induction hypothesis to w′: #Πw=#Πw′+1=ℓ(w′)+1=ℓ(w); similarly ρ−wρ=(ρ−sαρ)+sα(ρ−w′ρ)=α+sα∑β∈Πw′β=α+∑β∈Πw′sαβ=∑γ∈Πwγ, using sαρ=ρ−α; and therefore w∘0=wρ−ρ=−∑α∈Πwα.

4.1F2step 2.1step 3.1inductionalgebra

It remains to prove uniqueness. Let S⊆Φ+ with ∑α∈Sα=∑α∈Πwα. We induct on ℓ(w). For w=1, Π1=∅ and the assumed sum of S is zero. Every positive root has nonnegative simple-root coefficients with at least one positive coefficient, so a nonempty set of positive roots has a sum with at least one positive coefficient and cannot sum to zero. Thus S=∅=Π1. For w≠1 use the element α of step 1.1. If α∈S, put S′=sα(S∖{α}). Then S′⊆Φ+ by [F2], and using step 3.1 for w′ and linearity of sα one computes ∑β∈S′β=sα(∑β∈Sβ−α)=sα(ρ−wρ−α)=ρ−w′ρ=∑β∈Πw′β. By induction S′=Πw′, hence S=sα(Πw′)∪{α}=Πw.

5.1step 2.1step 3.1step 4.1algebra∎

If α∉S, then S⊆Φ+∖{α}, so sα(S)⊆Φ+∖{α} and sα(S)∪{α}⊆Φ+ is a disjoint union with ∑β∈sα(S)∪{α}β=sα(ρ−wρ)+α=ρ−w′ρ=∑β∈Πw′β. By induction sα(S)∪{α}=Πw′, but α∉Πw′ because (w′)−1α=−w−1α>0 by step 1.1. This contradiction rules out α∉S, so the previous case applies and S=Πw always.

Depends on

Used by

Dependency tree · two levels

9 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