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.
Positive coroot pairings of a dominant integral weight
Statement
Let be a dominant integral weight and let . Then ; in particular is regular, so the stabilizer of in is trivial and implies . Moreover the pairing is -invariant: for all , , and . Finally every positive coroot is a nonnegative integral combination of the simple coroots, so integrality and positivity are read off on simple coroots and extended by -invariance.
Facts & Assumptions
Given: A finite reduced crystallographic root system with positive system , simple roots and simple coroots , the form on , the weight lattice , the dominant integral weights , the Weyl vector , and the Weyl group generated by the reflections .
The simple roots are a basis of , the simple coroots are a basis of the dual space, the weight lattice is the lattice generated by the dual basis with , and integrality of means for every root (Finite Weyl root system, lattice and chamber conventions, Integral, dominant, and strictly dominant weights).
Each simple reflection permutes and sends to ; ; the form is positive definite and -invariant; every root is -conjugate to a simple root; the only scalar multiples of a root in are itself (Finite Weyl positive roots and simple reflections, Root reflections and the Weyl group action, The root set is a reduced crystallographic root system).
Every positive root is a nonnegative integral combination of the simple roots in which at least one coefficient is positive (The root set is a reduced crystallographic root system, Finite Weyl positive roots and simple reflections).
acts simply transitively on open chambers; equivalently a vector lying on no root hyperplane has trivial stabilizer, and every -orbit meets the closed chamber in exactly one point (Finite Weyl closed chambers and stabilizers).
Proof
For every simple root one has by dominance. Applying to and using that permutes the positive roots other than while gives , whereas . Comparing the two expressions gives , so .
Let and write with , not all zero. Put . Then because and is the coroot of the root , and because and . Since the are a basis of and both sides have the same pairing with every , this gives the identity : every positive coroot is a nonnegative integral combination of the simple coroots, and for at least one is positive.
Combining the two previous steps, is a nonnegative integer combination in which at least one coefficient is positive and every paired simple coroot contributes at least ; hence it lies in . For a negative root one has , so pairs nontrivially with the coroot of every root and is therefore regular: it lies on no root hyperplane.
A regular vector lies in some open chamber, and acts simply transitively on open chambers, so its stabilizer is trivial. If , then and hence ; triviality of the stabilizer gives , that is .
For and one has because preserves the form, and pairing with against equals pairing against because is an isometry. Hence , and since the second displayed identity is the same statement; the nonnegative-integral-combination statement at a simple coroot, transported along , is the "-invariance" used throughout.
Depends on
- Finite Weyl root system, lattice and chamber conventions
- Integral, dominant, and strictly dominant weights
- The Weyl vector rho for a chosen positive system
- Root reflections and the Weyl group action
- Finite Weyl positive roots and simple reflections
- The root set is a reduced crystallographic root system
- Finite Weyl closed chambers and stabilizers
Used by
- The Bruhat graph and the BGG Verma sum in degree k Definition
- The A2 BGG resolution with six Verma summands Example
- Dimension of the kernel modulo n-minus equals the next term (BGG 10.7) Lemma
- Dominant integral dot translates embed canonically in the Verma module Lemma
- Jordan-Holder factors of Verma modules dominate the head (BGG 8.12) Lemma
- Nonzero highest-weight images survive modulo n-minus (BGG 10.6b) Lemma
- The augmentation kernel is the sum of the simple-reflection Verma submodules Lemma
- The BGG differential induces an injection into kernel coinvariants (BGG 10.6) Lemma
- Tor with the trivial module is computed by the weak BGG resolution Lemma
- Weak BGG resolution of the trivial module Lemma
- The BGG resolution of a finite-dimensional simple module Theorem
- Weak BGG resolution Theorem
Dependency tree · two levels
19 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
- Fan Zhou, The classical and the functorial BGG resolutions (Columbia thesis 2021), Part I Sec. 3.1, pp. 9-10 and Sec. 5.3, p. 36 (standard reference, not scraped)
- N. Hemelsoet and R. Voorhaar, A computer algorithm for the BGG resolution, arXiv:1911.00871, Sec. 2.1, p. 3 (standard reference, not scraped)