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 be a reduced crystallographic root system with positive system , Weyl group , and Weyl vector (The Weyl vector), and let be an integral weight (Integral, dominant, and strictly dominant weights). Let be regular, so for every root , and put Then:
- there is a unique with dominant, equivalently a unique with dominant, and ;
- if is simple with then , while if then ;
- consequently there is a reduced expression with whose partial products satisfy and are regular for every ; and if is dominant there is a reduced expression of the longest element whose partial products satisfy for every and end at the strictly antidominant weight ;
- for every one has .
The lemma is choice-free: is used only through , and the dot action enters only through the explicit formula (Dot-Weyl facets and single-wall translation data).
Facts & Assumptions
Given: A reduced crystallographic root system with positive system , simple roots , Weyl group , Weyl vector , an integral weight and the regular weight with as in the Statement.
The hyperplane complement has the open Weyl chambers as connected components, permutes these chambers, the fundamental chamber is with closure cut out by the same inequalities with in place of , and for a positive root with one has , so a strictly dominant point pairs positively with every positive root (Open and closed Weyl chambers).
Every -orbit in has exactly one point in ; acts simply transitively on open chambers; there is a unique longest element , characterized by , with and ; all of this holds without AC (Finite Weyl closed chambers and stabilizers).
The inversion set and length are and , and is the minimal number of simple reflections in an expression of (Length and longest Weyl-group element, Weyl length equals inversion number).
Each simple reflection permutes and sends to ; the simple reflections generate ; 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).
The reflection formula is , and the pairing is -invariant: for all (Root reflections and the Weyl group action).
Dominance means for all , strict dominance means for all , and integrality means for all ; the dot action is , and regularity of means for every root (Integral, dominant, and strictly dominant weights, Dot-Weyl facets and single-wall translation data).
The Weyl vector satisfies for the simple coroots (The Weyl vector in fundamental coordinates); with the identification of [F1] this is the pairing used below, and it makes an integer for every coroot by [F4].
Proof
Since is regular it is not fixed by any reflection, so it lies in exactly one open chamber of [F1]. By [F2] the orbit meets the closed chamber in exactly one point, necessarily regular and hence in ; this gives existence and uniqueness of with dominant. For that and each , ; here is a nonzero integer by [F4], [F6] and [F7], and by [F7]. Hence is dominant exactly when is a nonnegative integer for all , that is exactly when is dominant; uniqueness transfers as well.
Let be simple. By [F4] the map is an involution of and sends to . For the -invariance [F5] gives , while . Since permutes , summing the defining conditions of over gives , that is ; regularity of makes exactly one bracket equal to , which gives the two asserted values.
For one has if and only if by -invariance [F5]. As runs over , runs over ; since is strictly dominant, it pairs negatively with exactly when . Thus by [F3].
Write and let be as in step 1.1, so by step 2.1. Assume has been constructed with and . Then is regular, because -invariance [F5] shows only if , and runs over all roots. Also , so is not dominant: if it were dominant then every positive root would pair nonnegatively with it by [F1], contradicting . As dominance is tested on the simple coroots [F6] and is regular, some simple has ; put , so step 1.2 gives . Starting at this produces with , so is strictly dominant and hence by the uniqueness in step 1.1. To see the word is reduced, apply step 1.1 to the regular weight : the unique element with dominant satisfies by step 2.1 and , so by uniqueness; hence , while and subadditivity give , that is . Since is a product of simple reflections, by [F3], so and the expression is reduced. This proves the first part of (iii) with .
Now suppose in addition that is dominant, so and is strictly dominant by regularity. Repeat the construction of step 3.1 with the opposite choice: given with , the regular weight is not strictly antidominant, and strict antidominance is tested on the simple coroots [F6]; hence some simple has , and step 1.2 increases by one. Starting at produces with : every positive root pairs negatively with by [F1], so lies in the chamber of by [F2]; regularity gives , and is strictly antidominant. The word has factors and has length by [F2], so it is reduced.
Let and . Since sends positive roots to negative roots and negative roots to positive roots [F2], the root is negative exactly when is positive. Counting positive roots gives , which is (iv). All the cited inputs are choice-free, and no step invokes a choice principle.
Depends on
- Finite Weyl closed chambers and stabilizers
- Weyl length equals inversion number
- Length and longest Weyl-group element
- Open and closed Weyl chambers
- Finite Weyl positive roots and simple reflections
- Root reflections and the Weyl group action
- Dot-Weyl facets and single-wall translation data
- The Weyl vector
- Integral, dominant, and strictly dominant weights
- The Weyl vector in fundamental coordinates
Used by
- Borel-Weil-Bott is compatible with Serre duality Proposition
- The Borel-Weil theorem Theorem
- The Borel-Weil-Bott theorem Theorem
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
- Jacob Lurie, A Proof of the Borel-Weil-Bott Theorem (standard reference, not scraped)
- George Boxer and Vincent Pilloni, Notes on Higher Coleman Theory (Montreal 2020) (standard reference, not scraped)