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 and put . Then , , and for the half-sum of positive roots . If satisfies , then .
Facts & Assumptions
Given: The finite reduced crystallographic root system with positive system , the Weyl group generated by the , the length function , the Weyl vector , and the dot action .
For a positive-root reflection : if and only if , and for a simple reflection one has ; also (Finite Weyl strong exchange and deletion).
Every positive root is a nonnegative integral combination of the simple roots, with at least one positive coefficient. Each simple reflection permutes and sends to ; the reflections act on (Finite Weyl positive roots and simple reflections, Root reflections and the Weyl group action).
is the half-sum of the positive roots and the dot action is (The Weyl vector rho for a chosen positive system, The rho-shift intertwines the dot and ordinary Weyl actions).
Proof
If , choose a reduced word with . The product is represented by a word of length , so ; by [F1] the length changes by exactly one, so and, with , the criterion of [F1] gives . Write with , so and .
For as in step 1.1 one has by [F2] and because . Hence , so is a disjoint union.
Induction on proves the three identities simultaneously. For all three sides vanish. For , apply step 2.1 and the induction hypothesis to : ; similarly , using ; and therefore .
It remains to prove uniqueness. Let with . We induct on . For , and the assumed sum of 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 . For use the element of step 1.1. If , put . Then by [F2], and using step 3.1 for and linearity of one computes . By induction , hence .
If , then , so and is a disjoint union with . By induction , but because by step 1.1. This contradiction rules out , so the previous case applies and 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
- J. van Ekeren, Topics in representation theory (IMPA 2024), Sec. 29 Lemmas 29.2 and 29.6, printed pp. 123-125 (standard reference, not scraped)
- Fan Zhou, The classical and the functorial BGG resolutions (Columbia thesis 2021), Part I Fact 9.8, p. 34 (standard reference, not scraped)