Reduced root pairings #
This file contains basic definitions and results related to reduced root pairings.
Main definitions: #
RootPairing.IsReduced
: A root pairing is said to be reduced if two linearly dependent roots are always related by a sign.RootPairing.linInd_iff_coxeterWeight_ne_four
: for a finite root pairing, two roots are linearly independent iff their Coxeter weight is not four.
Implementation details: #
For convenience we provide two versions of many lemmas, according to whether we know that the root
pairing is valued in a smaller ring (in the sense of RootPairing.IsValuedIn
). For example we
provide both RootPairing.linInd_iff_coxeterWeight_ne_four
and
RootPairing.linInd_iff_coxeterWeightIn_ne_four
.
Several ways to avoid this duplication exist. We leave explorations of this for future work. One
possible solution is to drop RootPairing.pairing
and RootPairing.coxeterWeight
entirely and rely
solely on RootPairing.pairingIn
and RootPairing.coxeterWeightIn
.`
A root pairing is said to be reduced if any linearly dependent pair of roots is related by a sign.
Instances
See also RootPairing.linearIndependent_iff_coxeterWeightIn_ne_four
.
See also RootPairing.coxeterWeightIn_eq_four_iff_not_linearIndependent
.
See also RootPairing.pairingIn_two_two_iff
.
See also RootPairing.pairingIn_one_four_iff
.