Ordering a Kostant weight basis #
The positive-root triangularity results for Kostant root subgroups require an integral weight basis ordered so that adding a positive multiple of a root moves to a smaller index. This file constructs such an ordering from a degree functional which is positive on the chosen roots.
For a finite weight-basis index η, orderedWeightIndexEquiv degree wt numbers the indices by
Fin (Fintype.card η). It first orders indices by decreasing value of degree (wt x) and uses an
arbitrary finite numbering only to break ties. Thus the mathematical property of the numbering
does not depend on the tie-breaker: orderedWeight_lt_of_eq_add_nsmul proves that every positive
weight shift moves strictly towards the beginning.
The final results apply this construction to the existing triangularity API. In particular,
range_kostantRootSubgroupMatrix_le_upperUnitriangular_orderedWeightBasis places each root
subgroup whose root has positive degree in the upper-unitriangular group without retaining an
ordering hypothesis.
Main definitions #
TauCeti.UniversalEnvelopingAlgebra.orderedWeightIndexEquiv: a finite numbering by decreasing degree.TauCeti.UniversalEnvelopingAlgebra.orderedWeightBasis: a weight basis reindexed by that numbering.TauCeti.UniversalEnvelopingAlgebra.orderedWeight: the corresponding weight function.
Main results #
TauCeti.UniversalEnvelopingAlgebra.orderedWeight_lt_of_eq_add_nsmul: a positive root shift strictly decreases the numbered index.isUpperUnitriangular_kostantRootSubgroupMatrix_orderedWeightBasis: a positive-degree root subgroup is upper unitriangular in the ordered basis.
References #
- J. E. Humphreys, Introduction to Lie Algebras and Representation Theory, §§21, 26--27.
- R. W. Carter, Simple Groups of Lie Type, §§4.4 and 8.2.
This supplies the ordered positive-root basis needed by the Borel component of the pinned
Chevalley--Demazure construction in Layer 9 of TauCetiRoadmap/ReductiveGroups/README.md, which
is consumed by milestone L0 of TauCetiRoadmap/CFSGStatement/README.md.
Ordering finite weight indices #
Number a finite family of weights by decreasing value under degree. Indices of equal degree
are ordered by an arbitrary finite numbering; no theorem below depends on that tie-breaker.
Equations
Instances For
A strictly larger weight degree receives a strictly smaller ordered index.
Adding a positive multiple of a positive-degree root strictly decreases the ordered index.
The ordered basis and its weights #
A finite basis reindexed by decreasing degree of its recorded weights.
Equations
Instances For
The weight attached to an index of orderedWeightBasis.
Equations
- TauCeti.UniversalEnvelopingAlgebra.orderedWeight degree wt = wt ∘ ⇑(TauCeti.UniversalEnvelopingAlgebra.orderedWeightIndexEquiv degree wt).symm
Instances For
The ordered basis has the same weight-vector property as the original basis.
In the reindexed weight basis, adding a positive multiple of a positive-degree root moves strictly towards the beginning. This is the order hypothesis used by positive-root triangularity.
Positive root subgroups in the ordered basis #
Reindexing a subgroup basis preserves its weight-vector property after coercion to the ambient rational representation.
A root operator of positive degree is strictly upper triangular in every positive divided power when the underlying weight basis is reordered by decreasing degree.
A root subgroup of positive degree is upper unitriangular in the weight basis ordered by decreasing degree. The choice used to order equal-degree weight spaces does not enter the proof.
The image of every positive-degree root subgroup lies in the upper-unitriangular subgroup after reindexing the weight basis by decreasing degree.