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 of the roots with its -invariant positive definite form, and let and be weights in that are dominant, so and for every simple root (Integral, dominant, and strictly dominant weights). Then and equality holds if and only if lies in the set , where is the stabilizer of . In particular, if is regular, so that , then equality forces ; if then equality holds for every .
Facts & Assumptions
Given: The Axiom of Choice, the real span of the roots with its positive definite -invariant form, and dominant weights .
The reflection acts on by with , it is orthogonal for the form on , and the simple roots form a basis of ; 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).
Each simple reflection permutes and sends to ; the simple reflections generate (Finite Weyl positive roots and simple reflections).
Every -orbit in contains exactly one point of the closed chamber (Finite Weyl closed chambers and stabilizers).
Proof
Since is dominant, the closed chamber is , and for and a simple root with we set , so that . Let be the number of positive roots pairing negatively with .
For such and one has , because and expansion gives , while by dominance of . Thus a descent step never increases the distance from .
If then . Indeed, for the orthogonality of gives , and by [F2] the map is a bijection of ; the root itself pairs negatively with but, by and , not with . Hence the negative positive roots at are in bijection with the negative positive roots at other than , of which there are .
Starting from , iterate: if is not in the closed chamber, choose a simple root with and set . By step 2.1 the distances are nonincreasing, and by step 2.2 the integer drops by one at each step, so the iteration terminates after at most steps at an element with . By [F3] the dominant point of the orbit is unique, so . Therefore for every .
Suppose and run any descent from as in step 3.1. The values are nonincreasing and their first and last terms are equal, so every step is an equality, and step 2.1 with gives , equivalently , for every reflecting root used. Writing and , the element fixes , and ; hence .
Conversely, if with , then the -invariance of the form and the orthogonality of give . Together with steps 3.1 and 4.1 this proves the inequality for every with equality exactly when ; if is regular then no root reflection fixes , so and equality forces .
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
- Pavel Etingof, Representations of Lie Groups (18.757, Fall 2023), Lemma 23.4 and its proof (standard reference, not scraped)
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., Proposition 2.67 and Corollary 2.68 (standard reference, not scraped)