This repository has been archived by the owner on Jan 30, 2023. It is now read-only.
/
coxeter_group.py
907 lines (758 loc) · 29.8 KB
/
coxeter_group.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
"""
Coxeter Groups As Matrix Groups
This implements a general Coxeter group as a matrix group by using the
reflection representation.
AUTHORS:
- Travis Scrimshaw (2013-08-28): Initial version
"""
##############################################################################
# Copyright (C) 2013 Travis Scrimshaw <tscrim at ucdavis.edu>
#
# Distributed under the terms of the GNU General Public License (GPL)
#
# The full text of the GPL is available at:
#
# http://www.gnu.org/licenses/
##############################################################################
from six.moves import range
from sage.structure.unique_representation import UniqueRepresentation
from sage.categories.coxeter_groups import CoxeterGroups
from sage.combinat.root_system.cartan_type import CartanType, CartanType_abstract
from sage.combinat.root_system.coxeter_matrix import CoxeterMatrix
from sage.groups.matrix_gps.finitely_generated import FinitelyGeneratedMatrixGroup_generic
from sage.groups.matrix_gps.group_element import MatrixGroupElement_generic
from sage.graphs.graph import Graph
from sage.matrix.constructor import matrix
from sage.matrix.matrix_space import MatrixSpace
from sage.rings.all import ZZ
from sage.rings.infinity import infinity
from sage.rings.universal_cyclotomic_field import UniversalCyclotomicField
from sage.rings.rational_field import QQ
from sage.rings.number_field.number_field import QuadraticField, is_QuadraticField
from sage.misc.cachefunc import cached_method
from sage.misc.superseded import deprecated_function_alias
from sage.misc.cachefunc import cached_method
class CoxeterMatrixGroup(UniqueRepresentation, FinitelyGeneratedMatrixGroup_generic):
r"""
A Coxeter group represented as a matrix group.
Let `(W, S)` be a Coxeter system. We construct a vector space `V`
over `\RR` with a basis of `\{ \alpha_s \}_{s \in S}` and inner product
.. MATH::
B(\alpha_s, \alpha_t) = -\cos\left( \frac{\pi}{m_{st}} \right)
where we have `B(\alpha_s, \alpha_t) = -1` if `m_{st} = \infty`. Next we
define a representation `\sigma_s : V \to V` by
.. MATH::
\sigma_s \lambda = \lambda - 2 B(\alpha_s, \lambda) \alpha_s.
This representation is faithful so we can represent the Coxeter group `W`
by the set of matrices `\sigma_s` acting on `V`.
INPUT:
- ``data`` -- a Coxeter matrix or graph or a Cartan type
- ``base_ring`` -- (default: the universal cyclotomic field or
a number field) the base ring which contains all values
`\cos(\pi/m_{ij})` where `(m_{ij})_{ij}` is the Coxeter matrix
- ``index_set`` -- (optional) an indexing set for the generators
For finite Coxeter groups, the default base ring is taken to be `\QQ` or
a quadratic number field when possible.
For more on creating Coxeter groups, see
:meth:`~sage.combinat.root_system.coxeter_group.CoxeterGroup`.
.. TODO::
Currently the label `\infty` is implemented as `-1` in the Coxeter
matrix.
EXAMPLES:
We can create Coxeter groups from Coxeter matrices::
sage: W = CoxeterGroup([[1, 6, 3], [6, 1, 10], [3, 10, 1]])
sage: W
Coxeter group over Universal Cyclotomic Field with Coxeter matrix:
[ 1 6 3]
[ 6 1 10]
[ 3 10 1]
sage: W.gens()
(
[ -1 -E(12)^7 + E(12)^11 1]
[ 0 1 0]
[ 0 0 1],
<BLANKLINE>
[ 1 0 0]
[-E(12)^7 + E(12)^11 -1 E(20) - E(20)^9]
[ 0 0 1],
<BLANKLINE>
[ 1 0 0]
[ 0 1 0]
[ 1 E(20) - E(20)^9 -1]
)
sage: m = matrix([[1,3,3,3], [3,1,3,2], [3,3,1,2], [3,2,2,1]])
sage: W = CoxeterGroup(m)
sage: W.gens()
(
[-1 1 1 1] [ 1 0 0 0] [ 1 0 0 0] [ 1 0 0 0]
[ 0 1 0 0] [ 1 -1 1 0] [ 0 1 0 0] [ 0 1 0 0]
[ 0 0 1 0] [ 0 0 1 0] [ 1 1 -1 0] [ 0 0 1 0]
[ 0 0 0 1], [ 0 0 0 1], [ 0 0 0 1], [ 1 0 0 -1]
)
sage: a,b,c,d = W.gens()
sage: (a*b*c)^3
[ 5 1 -5 7]
[ 5 0 -4 5]
[ 4 1 -4 4]
[ 0 0 0 1]
sage: (a*b)^3
[1 0 0 0]
[0 1 0 0]
[0 0 1 0]
[0 0 0 1]
sage: b*d == d*b
True
sage: a*c*a == c*a*c
True
We can create the matrix representation over different base rings and with
different index sets. Note that the base ring must contain all
`2*\cos(\pi/m_{ij})` where `(m_{ij})_{ij}` is the Coxeter matrix::
sage: W = CoxeterGroup(m, base_ring=RR, index_set=['a','b','c','d'])
sage: W.base_ring()
Real Field with 53 bits of precision
sage: W.index_set()
('a', 'b', 'c', 'd')
sage: CoxeterGroup(m, base_ring=ZZ)
Coxeter group over Integer Ring with Coxeter matrix:
[1 3 3 3]
[3 1 3 2]
[3 3 1 2]
[3 2 2 1]
sage: CoxeterGroup([[1,4],[4,1]], base_ring=QQ)
Traceback (most recent call last):
...
TypeError: unable to convert sqrt(2) to a rational
Using the well-known conversion between Coxeter matrices and Coxeter
graphs, we can input a Coxeter graph. Following the standard convention,
edges with no label (i.e. labelled by ``None``) are treated as 3::
sage: G = Graph([(0,3,None), (1,3,15), (2,3,7), (0,1,3)])
sage: W = CoxeterGroup(G); W
Coxeter group over Universal Cyclotomic Field with Coxeter matrix:
[ 1 3 2 3]
[ 3 1 2 15]
[ 2 2 1 7]
[ 3 15 7 1]
sage: G2 = W.coxeter_diagram()
sage: CoxeterGroup(G2) is W
True
Because there currently is no class for `\ZZ \cup \{ \infty \}`, labels
of `\infty` are given by `-1` in the Coxeter matrix::
sage: G = Graph([(0,1,None), (1,2,4), (0,2,oo)])
sage: W = CoxeterGroup(G)
sage: W.coxeter_matrix()
[ 1 3 -1]
[ 3 1 4]
[-1 4 1]
We can also create Coxeter groups from Cartan types using the
``implementation`` keyword::
sage: W = CoxeterGroup(['D',5], implementation="reflection")
sage: W
Finite Coxeter group over Integer Ring with Coxeter matrix:
[1 3 2 2 2]
[3 1 3 2 2]
[2 3 1 3 3]
[2 2 3 1 2]
[2 2 3 2 1]
sage: W = CoxeterGroup(['H',3], implementation="reflection")
sage: W
Finite Coxeter group over Number Field in a with defining polynomial
x^2 - 5 with Coxeter matrix:
[1 3 2]
[3 1 5]
[2 5 1]
"""
@staticmethod
def __classcall_private__(cls, data, base_ring=None, index_set=None):
"""
Normalize arguments to ensure a unique representation.
EXAMPLES::
sage: W1 = CoxeterGroup(['A',2], implementation="reflection", base_ring=ZZ)
sage: W2 = CoxeterGroup([[1,3],[3,1]], index_set=(1,2))
sage: W1 is W2
True
sage: G1 = Graph([(1,2)])
sage: W3 = CoxeterGroup(G1)
sage: W1 is W3
True
sage: G2 = Graph([(1,2,3)])
sage: W4 = CoxeterGroup(G2)
sage: W1 is W4
True
"""
data = CoxeterMatrix(data, index_set=index_set)
if base_ring is None:
if data.is_simply_laced():
base_ring = ZZ
elif data.is_finite():
letter = data.coxeter_type().cartan_type().type()
if letter in ['B', 'C', 'F']:
base_ring = QuadraticField(2)
elif letter == 'G':
base_ring = QuadraticField(3)
elif letter == 'H':
base_ring = QuadraticField(5)
else:
base_ring = UniversalCyclotomicField()
else:
base_ring = UniversalCyclotomicField()
return super(CoxeterMatrixGroup, cls).__classcall__(cls,
data, base_ring, data.index_set())
def __init__(self, coxeter_matrix, base_ring, index_set):
"""
Initialize ``self``.
EXAMPLES::
sage: W = CoxeterGroup([[1,3,2],[3,1,3],[2,3,1]])
sage: TestSuite(W).run() # long time
sage: W = CoxeterGroup([[1,3,2],[3,1,4],[2,4,1]], base_ring=QQbar)
sage: TestSuite(W).run() # long time
sage: W = CoxeterGroup([[1,3,2],[3,1,6],[2,6,1]])
sage: TestSuite(W).run(max_runs=30) # long time
sage: W = CoxeterGroup([[1,3,2],[3,1,-1],[2,-1,1]])
sage: TestSuite(W).run(max_runs=30) # long time
We check that :trac:`16630` is fixed::
sage: CoxeterGroup(['D',4], base_ring=QQ).category()
Category of finite coxeter groups
sage: CoxeterGroup(['H',4], base_ring=QQbar).category()
Category of finite coxeter groups
sage: F = CoxeterGroups().Finite()
sage: all(CoxeterGroup([letter,i]) in F
....: for i in range(2,5) for letter in ['A','B','D'])
True
sage: all(CoxeterGroup(['E',i]) in F for i in range(6,9))
True
sage: CoxeterGroup(['F',4]).category()
Category of finite coxeter groups
sage: CoxeterGroup(['G',2]).category()
Category of finite coxeter groups
sage: all(CoxeterGroup(['H',i]) in F for i in range(3,5))
True
sage: all(CoxeterGroup(['I',i]) in F for i in range(2,5))
True
"""
self._matrix = coxeter_matrix
n = coxeter_matrix.rank()
# Compute the matrix with entries `2 \cos( \pi / m_{ij} )`.
MS = MatrixSpace(base_ring, n, sparse=True)
MC = MS._get_matrix_class()
# FIXME: Hack because there is no ZZ \cup \{ \infty \}: -1 represents \infty
E = UniversalCyclotomicField().gen
if base_ring is UniversalCyclotomicField():
def val(x):
if x == -1:
return 2
else:
return E(2*x) + ~E(2*x)
elif is_QuadraticField(base_ring):
def val(x):
if x == -1:
return 2
else:
return base_ring((E(2*x) + ~E(2*x)).to_cyclotomic_field())
else:
from sage.functions.trig import cos
from sage.symbolic.constants import pi
def val(x):
if x == -1:
return 2
else:
return base_ring(2 * cos(pi / x))
gens = [MS.one() + MC(MS, entries={(i, j): val(coxeter_matrix[index_set[i], index_set[j]])
for j in range(n)},
coerce=True, copy=True)
for i in range(n)]
# Make the generators dense matrices for consistency and speed
gens = [g.dense_matrix() for g in gens]
category = CoxeterGroups()
# Now we shall see if the group is finite, and, if so, refine
# the category to ``category.Finite()``. Otherwise the group is
# infinite and we refine the category to ``category.Infinite()``.
if self._matrix.is_finite():
category = category.Finite()
else:
category = category.Infinite()
self._index_set_inverse = {i: ii for ii,i in enumerate(self._matrix.index_set())}
FinitelyGeneratedMatrixGroup_generic.__init__(self, ZZ(n), base_ring,
gens, category=category)
def _repr_(self):
"""
Return a string representation of ``self``.
EXAMPLES::
sage: CoxeterGroup([[1,3,2],[3,1,4],[2,4,1]])
Finite Coxeter group over Number Field in a with
defining polynomial x^2 - 2 with Coxeter matrix:
[1 3 2]
[3 1 4]
[2 4 1]
"""
rep = "Finite " if self.is_finite() else ""
rep += "Coxeter group over {} with Coxeter matrix:\n{}".format(self.base_ring(), self._matrix)
return rep
def index_set(self):
"""
Return the index set of ``self``.
EXAMPLES::
sage: W = CoxeterGroup([[1,3],[3,1]])
sage: W.index_set()
(1, 2)
sage: W = CoxeterGroup([[1,3],[3,1]], index_set=['x', 'y'])
sage: W.index_set()
('x', 'y')
sage: W = CoxeterGroup(['H',3])
sage: W.index_set()
(1, 2, 3)
"""
return self._matrix.index_set()
def coxeter_matrix(self):
"""
Return the Coxeter matrix of ``self``.
EXAMPLES::
sage: W = CoxeterGroup([[1,3],[3,1]])
sage: W.coxeter_matrix()
[1 3]
[3 1]
sage: W = CoxeterGroup(['H',3])
sage: W.coxeter_matrix()
[1 3 2]
[3 1 5]
[2 5 1]
"""
return self._matrix
def coxeter_diagram(self):
"""
Return the Coxeter diagram of ``self``.
EXAMPLES::
sage: W = CoxeterGroup(['H',3], implementation="reflection")
sage: G = W.coxeter_diagram(); G
Graph on 3 vertices
sage: G.edges()
[(1, 2, 3), (2, 3, 5)]
sage: CoxeterGroup(G) is W
True
sage: G = Graph([(0, 1, 3), (1, 2, oo)])
sage: W = CoxeterGroup(G)
sage: W.coxeter_diagram() == G
True
sage: CoxeterGroup(W.coxeter_diagram()) is W
True
"""
return self._matrix.coxeter_graph()
coxeter_graph = deprecated_function_alias(17798, coxeter_diagram)
def coxeter_type(self):
"""
Return the Coxeter type of ``self``.
EXAMPLES::
sage: W = CoxeterGroup(['H',3])
sage: W.coxeter_type()
Coxeter type of ['H', 3]
"""
return self._matrix.coxeter_type()
def bilinear_form(self):
r"""
Return the bilinear form associated to ``self``.
Given a Coxeter group `G` with Coxeter matrix `M = (m_{ij})_{ij}`,
the associated bilinear form `A = (a_{ij})_{ij}` is given by
.. MATH::
a_{ij} = -\cos\left( \frac{\pi}{m_{ij}} \right).
If `A` is positive definite, then `G` is of finite type (and so
the associated Coxeter group is a finite group). If `A` is
positive semidefinite, then `G` is affine type.
EXAMPLES::
sage: W = CoxeterGroup(['D',4])
sage: W.bilinear_form()
[ 1 -1/2 0 0]
[-1/2 1 -1/2 -1/2]
[ 0 -1/2 1 0]
[ 0 -1/2 0 1]
"""
return self._matrix.bilinear_form(self.base_ring().fraction_field())
def is_finite(self):
"""
Return ``True`` if this group is finite.
EXAMPLES::
sage: [l for l in range(2, 9) if
....: CoxeterGroup([[1,3,2],[3,1,l],[2,l,1]]).is_finite()]
....:
[2, 3, 4, 5]
sage: [l for l in range(2, 9) if
....: CoxeterGroup([[1,3,2,2],[3,1,l,2],[2,l,1,3],[2,2,3,1]]).is_finite()]
....:
[2, 3, 4]
sage: [l for l in range(2, 9) if
....: CoxeterGroup([[1,3,2,2,2], [3,1,3,3,2], [2,3,1,2,2],
....: [2,3,2,1,l], [2,2,2,l,1]]).is_finite()]
....:
[2, 3]
sage: [l for l in range(2, 9) if
....: CoxeterGroup([[1,3,2,2,2], [3,1,2,3,3], [2,2,1,l,2],
....: [2,3,l,1,2], [2,3,2,2,1]]).is_finite()]
....:
[2, 3]
sage: [l for l in range(2, 9) if
....: CoxeterGroup([[1,3,2,2,2,2], [3,1,l,2,2,2], [2,l,1,3,l,2],
....: [2,2,3,1,2,2], [2,2,l,2,1,3], [2,2,2,2,3,1]]).is_finite()]
....:
[2, 3]
"""
# Finite Coxeter groups are marked as finite in
# their ``__init__`` method, so we can just check
# the category of ``self``.
return "Finite" in self.category().axioms()
@cached_method
def order(self):
"""
Return the order of ``self``.
If the Coxeter group is finite, this uses an iterator.
EXAMPLES::
sage: W = CoxeterGroup([[1,3],[3,1]])
sage: W.order()
6
sage: W = CoxeterGroup([[1,-1],[-1,1]])
sage: W.order()
+Infinity
"""
if self.is_finite():
return len(self)
return infinity
def canonical_representation(self):
r"""
Return the canonical faithful representation of ``self``, which
is ``self``.
EXAMPLES::
sage: W = CoxeterGroup([[1,3],[3,1]])
sage: W.canonical_representation() is W
True
"""
return self
def simple_reflection(self, i):
"""
Return the simple reflection `s_i`.
INPUT:
- ``i`` -- an element from the index set
EXAMPLES::
sage: W = CoxeterGroup(['A',3], implementation="reflection")
sage: W.simple_reflection(1)
[-1 1 0]
[ 0 1 0]
[ 0 0 1]
sage: W.simple_reflection(2)
[ 1 0 0]
[ 1 -1 1]
[ 0 0 1]
sage: W.simple_reflection(3)
[ 1 0 0]
[ 0 1 0]
[ 0 1 -1]
"""
return self.gen(self._index_set_inverse[i])
@cached_method
def _positive_roots_reflections(self):
"""
Return a family whose keys are the positive roots
and values are the reflections.
EXAMPLES::
sage: W = CoxeterGroup(['A', 2])
sage: F = W._positive_roots_reflections()
sage: F.keys()
[(1, 0), (1, 1), (0, 1)]
sage: list(F)
[
[-1 1] [ 0 -1] [ 1 0]
[ 0 1], [-1 0], [ 1 -1]
]
"""
if not self.is_finite():
raise NotImplementedError('not available for infinite groups')
word = self.long_element(as_word=True)
N = len(word)
from sage.modules.free_module import FreeModule
simple_roots = FreeModule(self.base_ring(), self.ngens()).gens()
refls = self.simple_reflections()
resu = []
d = {}
for i in range(1, N + 1):
segment = word[:i]
last = segment.pop()
ref = refls[last]
rt = simple_roots[last - 1]
while segment:
last = segment.pop()
cr = refls[last]
ref = cr * ref * cr
rt = refls[last] * rt
rt.set_immutable()
resu += [rt]
d[rt] = ref
from sage.sets.family import Family
return Family(resu, lambda rt: d[rt])
def positive_roots(self, as_reflections=None):
"""
Return the positive roots.
These are roots in the Coxeter sense, that all have the
same norm. They are given by their coefficients in the
base of simple roots, also taken to have all the same
norm.
.. SEEALSO::
:meth:`reflections`
EXAMPLES::
sage: W = CoxeterGroup(['A',3], implementation='reflection')
sage: W.positive_roots()
((1, 0, 0), (1, 1, 0), (0, 1, 0), (1, 1, 1), (0, 1, 1), (0, 0, 1))
sage: W = CoxeterGroup(['I',5], implementation='reflection')
sage: W.positive_roots()
((1, 0),
(-E(5)^2 - E(5)^3, 1),
(-E(5)^2 - E(5)^3, -E(5)^2 - E(5)^3),
(1, -E(5)^2 - E(5)^3),
(0, 1))
"""
if as_reflections is not None:
from sage.misc.superseded import deprecation
deprecation(20027, "as_reflections is deprecated; instead, use reflections()")
return tuple(self._positive_roots_reflections().keys())
def reflections(self):
"""
Return the set of reflections.
The order is the one given by :meth:`positive_roots`.
EXAMPLES::
sage: W = CoxeterGroup(['A',2], implementation='reflection')
sage: list(W.reflections())
[
[-1 1] [ 0 -1] [ 1 0]
[ 0 1], [-1 0], [ 1 -1]
]
"""
return self._positive_roots_reflections()
@cached_method
def roots(self):
"""
Return the roots.
These are roots in the Coxeter sense, that all have the
same norm. They are given by their coefficients in the
base of simple roots, also taken to have all the same
norm.
The positive roots are listed first, then the negative roots
in the same order. The order is the one given by :meth:`roots`.
EXAMPLES::
sage: W = CoxeterGroup(['A',3], implementation='reflection')
sage: W.roots()
((1, 0, 0),
(1, 1, 0),
(0, 1, 0),
(1, 1, 1),
(0, 1, 1),
(0, 0, 1),
(-1, 0, 0),
(-1, -1, 0),
(0, -1, 0),
(-1, -1, -1),
(0, -1, -1),
(0, 0, -1))
sage: W = CoxeterGroup(['I',5], implementation='reflection')
sage: len(W.roots())
10
"""
if not self.is_finite():
raise NotImplementedError('not available for infinite groups')
positive = self.positive_roots()
return positive + tuple([-v for v in positive])
def simple_root_index(self, i):
r"""
Return the index of the simple root `\alpha_i`.
This is the position of `\alpha_i` in the list of all roots
as given be :meth:`roots`.
EXAMPLES::
sage: W = CoxeterGroup(['A',3], implementation='reflection')
sage: [W.simple_root_index(i) for i in W.index_set()]
[0, 2, 5]
"""
roots = self.roots()
rt = roots[0].parent().gen(self._index_set_inverse[i])
return roots.index(rt)
def fundamental_weights(self):
"""
Return the fundamental weights for ``self``.
This is the dual basis to the basis of simple roots.
The base ring must be a field.
EXAMPLES::
sage: W = CoxeterGroup(['A',3], implementation='reflection')
sage: W.fundamental_weights()
{1: (3/2, 1, 1/2), 2: (1, 2, 1), 3: (1/2, 1, 3/2)}
"""
simple_weights = self.bilinear_form().inverse()
return {i: simple_weights[k]
for k, i in enumerate(self.index_set())}
def fundamental_weight(self, i):
r"""
Return the fundamental weight with index ``i``.
EXAMPLES::
sage: W = CoxeterGroup(['A',3], implementation='reflection')
sage: W.fundamental_weight(1)
(3/2, 1, 1/2)
"""
return self.fundamental_weights()[i]
class Element(MatrixGroupElement_generic):
"""
A Coxeter group element.
"""
def first_descent(self, side = 'right', index_set=None, positive=False):
"""
Return the first left (resp. right) descent of ``self``, as
ane element of ``index_set``, or ``None`` if there is none.
See :meth:`descents` for a description of the options.
EXAMPLES::
sage: W = CoxeterGroup(['A',3], implementation="reflection")
sage: a,b,c = W.gens()
sage: elt = b*a*c
sage: elt.first_descent()
1
sage: elt.first_descent(side='left')
2
"""
M = self.matrix()
if side != 'right':
M = ~M
I = self.parent().index_set()
n = len(I)
zero = M.base_ring().zero()
if index_set is None:
index_set = range(n)
else:
I_inv = self.parent()._index_set_inverse
index_set = [I_inv[i] for i in index_set]
if positive:
for i in index_set:
if not _matrix_test_right_descent(M, i, n, zero):
return I[i]
else:
for i in index_set:
if _matrix_test_right_descent(M, i, n, zero):
return I[i]
return None
def descents(self, side='right', index_set=None, positive=False):
"""
Return the descents of ``self``, as a list of elements of the
``index_set``.
INPUT:
- ``index_set`` -- (default: all of them) a subset (as a list
or iterable) of the nodes of the Dynkin diagram
- ``side`` -- (default: ``'right'``) ``'left'`` or ``'right'``
- ``positive`` -- (default: ``False``) boolean
EXAMPLES::
sage: W = CoxeterGroup(['A',3], implementation="reflection")
sage: a,b,c = W.gens()
sage: elt = b*a*c
sage: elt.descents()
[1, 3]
sage: elt.descents(positive=True)
[2]
sage: elt.descents(index_set=[1,2])
[1]
sage: elt.descents(side='left')
[2]
"""
M = self.matrix()
if side != 'right':
M = ~M
I = self.parent().index_set()
n = len(I)
zero = M.base_ring().zero()
if index_set is None:
index_set = range(n)
else:
I_inv = self.parent()._index_set_inverse
index_set = [I_inv[i] for i in index_set]
if positive:
return [I[i] for i in index_set if not _matrix_test_right_descent(M, i, n, zero)]
return [I[i] for i in index_set if _matrix_test_right_descent(M, i, n, zero)]
def has_right_descent(self, i):
r"""
Return whether ``i`` is a right descent of ``self``.
A Coxeter system `(W, S)` has a root system defined as
`\{ w(\alpha_s) \}_{w \in W}` and we define the positive
(resp. negative) roots `\alpha = \sum_{s \in S} c_s \alpha_s`
by all `c_s \geq 0` (resp. `c_s \leq 0`). In particular, we note
that if `\ell(w s) > \ell(w)` then `w(\alpha_s) > 0` and if
`\ell(ws) < \ell(w)` then `w(\alpha_s) < 0`.
Thus `i \in I` is a right descent if `w(\alpha_{s_i}) < 0`
or equivalently if the matrix representing `w` has all entries
of the `i`-th column being non-positive.
INPUT:
- ``i`` -- an element in the index set
EXAMPLES::
sage: W = CoxeterGroup(['A',3], implementation="reflection")
sage: a,b,c = W.gens()
sage: elt = b*a*c
sage: [elt.has_right_descent(i) for i in [1, 2, 3]]
[True, False, True]
"""
i = self.parent()._index_set_inverse[i]
n = len(self.parent().index_set())
M = self.matrix()
zero = M.base_ring().zero()
return _matrix_test_right_descent(M, i, n, zero)
def canonical_matrix(self):
r"""
Return the matrix of ``self`` in the canonical faithful
representation, which is ``self`` as a matrix.
EXAMPLES::
sage: W = CoxeterGroup(['A',3], implementation="reflection")
sage: a,b,c = W.gens()
sage: elt = a*b*c
sage: elt.canonical_matrix()
[ 0 0 -1]
[ 1 0 -1]
[ 0 1 -1]
"""
return self.matrix()
@cached_method
def action_on_root_indices(self, i, side="left"):
"""
Return the action on the set of roots.
The roots are ordered as in the output of the method `roots`.
EXAMPLES::
sage: W = CoxeterGroup(['A',3], implementation="reflection")
sage: w = W.w0
sage: w.action_on_root_indices(0)
11
"""
if side == "left":
w = self
elif side == "right":
w = ~self
else:
raise ValueError('side must be "left" or "right"')
roots = self.parent().roots()
rt = self * roots[i]
return roots.index(rt)
def _matrix_test_right_descent(M, i, n, zero):
"""
Test if the matrix ``M`` has a right ``i``-descent.
INPUT:
- ``M`` -- the matrix
- ``i`` -- the index
- ``n`` -- the size of the matrix
- ``zero`` -- the zero element in the base ring of ``M``
.. NOTE::
This is a helper function for :class:`CoxeterMatrixGroup.Element`
and optimized for speed. Specifically, it is called often and
there is no need to recompute ``n`` (and ``zero``) each time this
function is called.
.. TODO::
Cythonize this function.
EXAMPLES::
sage: from sage.groups.matrix_gps.coxeter_group import _matrix_test_right_descent
sage: W = CoxeterGroup(['A',3], implementation="reflection")
sage: a,b,c = W.gens()
sage: elt = b*a*c
sage: zero = W.base_ring().zero()
sage: [_matrix_test_right_descent(elt.matrix(), i, 3, zero)
....: for i in range(3)]
[True, False, True]
"""
for j in range(n):
c = M[j, i]
if c < zero:
return True
elif c > zero:
return False
raise AssertionError('a zero column, so there must be a bug')