-
-
Notifications
You must be signed in to change notification settings - Fork 405
/
moebius_algebra.py
771 lines (620 loc) · 25.7 KB
/
moebius_algebra.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
# -*- coding: utf-8 -*-
r"""
Möbius Algebras
"""
#*****************************************************************************
# Copyright (C) 2014 Travis Scrimshaw <tscrim at ucdavis.edu>,
#
# Distributed under the terms of the GNU General Public License (GPL)
#
# This code is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# General Public License for more details.
#
# The full text of the GPL is available at:
#
# http://www.gnu.org/licenses/
#*****************************************************************************
from sage.misc.cachefunc import cached_method
from sage.misc.bindable_class import BindableClass
from sage.structure.parent import Parent
from sage.structure.unique_representation import UniqueRepresentation
from sage.categories.algebras import Algebras
from sage.categories.realizations import Realizations, Category_realization_of_parent
from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
from sage.combinat.free_module import CombinatorialFreeModule
from sage.rings.polynomial.laurent_polynomial_ring import LaurentPolynomialRing
from sage.rings.all import ZZ
class BasisAbstract(CombinatorialFreeModule, BindableClass):
"""
Abstract base class for a basis.
"""
def __getitem__(self, x):
"""
Return the basis element indexed by ``x``.
INPUT:
- ``x`` -- an element of the lattice
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: E = L.moebius_algebra(QQ).E()
sage: E[5]
E[5]
sage: C = L.quantum_moebius_algebra().C()
sage: C[5]
C[5]
"""
L = self.realization_of()._lattice
return self.monomial(L(x))
class MoebiusAlgebra(Parent, UniqueRepresentation):
r"""
The Möbius algebra of a lattice.
Let `L` be a lattice. The *Möbius algebra* `M_L` was originally
constructed by Solomon [Solomon67]_ and has a natural basis
`\{ E_x \mid x \in L \}` with multiplication given by
`E_x \cdot E_y = E_{x \vee y}`. Moreover this has a basis given by
orthogonal idempotents `\{ I_x \mid x \in L \}` (so
`I_x I_y = \delta_{xy} I_x` where `\delta` is the Kronecker delta)
related to the natural basis by
.. MATH::
I_x = \sum_{x \leq y} \mu_L(x, y) E_y,
where `\mu_L` is the Möbius function of `L`.
.. NOTE::
We use the join `\vee` for our multiplication, whereas [Greene73]_
and [Etienne98]_ define the Möbius algebra using the meet `\wedge`.
This is done for compatibility with :class:`QuantumMoebiusAlgebra`.
REFERENCES:
.. [Solomon67] Louis Solomon.
*The Burnside Algebra of a Finite Group*.
Journal of Combinatorial Theory, **2**, 1967.
:doi:`10.1016/S0021-9800(67)80064-4`.
.. [Greene73] Curtis Greene.
*On the Möbius algebra of a partially ordered set*.
Advances in Mathematics, **10**, 1973.
:doi:`10.1016/0001-8708(73)90106-0`.
.. [Etienne98] Gwihen Etienne.
*On the Möbius algebra of geometric lattices*.
European Journal of Combinatorics, **19**, 1998.
:doi:`10.1006/eujc.1998.0227`.
"""
def __init__(self, R, L):
"""
Initialize ``self``.
TESTS::
sage: L = posets.BooleanLattice(4)
sage: M = L.moebius_algebra(QQ)
sage: TestSuite(M).run()
"""
cat = Algebras(R).Commutative().WithBasis()
if L in FiniteEnumeratedSets():
cat = cat.FiniteDimensional()
self._lattice = L
self._category = cat
Parent.__init__(self, base=R, category=self._category.WithRealizations())
def _repr_(self):
"""
Return a string representation of ``self``.
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: L.moebius_algebra(QQ)
Moebius algebra of Finite lattice containing 16 elements over Rational Field
"""
return "Moebius algebra of {} over {}".format(self._lattice, self.base_ring())
def a_realization(self):
r"""
Return a particular realization of ``self`` (the `B`-basis).
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: M = L.moebius_algebra(QQ)
sage: M.a_realization()
Moebius algebra of Finite lattice containing 16 elements
over Rational Field in the natural basis
"""
return self.E()
def lattice(self):
"""
Return the defining lattice of ``self``.
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: M = L.moebius_algebra(QQ)
sage: M.lattice()
Finite lattice containing 16 elements
sage: M.lattice() == L
True
"""
return self._lattice
class E(BasisAbstract):
r"""
The natural basis of a Möbius algebra.
Let `E_x` and `E_y` be basis elements of `M_L` for some lattice `L`.
Multiplication is given by `E_x E_y = E_{x \vee y}`.
"""
def __init__(self, M, prefix='E'):
"""
Initialize ``self``.
TESTS::
sage: L = posets.BooleanLattice(4)
sage: M = L.moebius_algebra(QQ)
sage: TestSuite(M.E()).run()
"""
self._basis_name = "natural"
CombinatorialFreeModule.__init__(self, M.base_ring(),
tuple(M._lattice),
prefix=prefix,
category=MoebiusAlgebraBases(M))
@cached_method
def _to_idempotent_basis(self, x):
"""
Convert the element indexed by ``x`` to the idempotent basis.
EXAMPLES::
sage: M = posets.BooleanLattice(4).moebius_algebra(QQ)
sage: E = M.E()
sage: all(E(E._to_idempotent_basis(x)) == E.monomial(x)
....: for x in E.basis().keys())
True
"""
M = self.realization_of()
I = M.idempotent()
return I.sum_of_monomials(M._lattice.order_filter([x]))
def product_on_basis(self, x, y):
"""
Return the product of basis elements indexed by ``x`` and ``y``.
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: E = L.moebius_algebra(QQ).E()
sage: E.product_on_basis(5, 14)
E[15]
sage: E.product_on_basis(2, 8)
E[10]
TESTS::
sage: M = posets.BooleanLattice(4).moebius_algebra(QQ)
sage: E = M.E()
sage: I = M.I()
sage: all(I(x)*I(y) == I(x*y) for x in E.basis() for y in E.basis())
True
"""
return self.monomial(self.realization_of()._lattice.join(x, y))
@cached_method
def one(self):
"""
Return the element ``1`` of ``self``.
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: E = L.moebius_algebra(QQ).E()
sage: E.one()
E[0]
"""
elts = self.realization_of()._lattice.minimal_elements()
return self.sum_of_monomials(elts)
natural = E
class I(BasisAbstract):
r"""
The (orthogonal) idempotent basis of a Möbius algebra.
Let `I_x` and `I_y` be basis elements of `M_L` for some lattice `L`.
Multiplication is given by `I_x I_y = \delta_{xy} I_x` where
`\delta_{xy}` is the Kronecker delta.
"""
def __init__(self, M, prefix='I'):
"""
Initialize ``self``.
TESTS::
sage: L = posets.BooleanLattice(4)
sage: M = L.moebius_algebra(QQ)
sage: TestSuite(M.I()).run()
Check that the transition maps can be pickled::
sage: L = posets.BooleanLattice(4)
sage: M = L.moebius_algebra(QQ)
sage: E = M.E()
sage: I = M.I()
sage: phi = E.coerce_map_from(I)
sage: loads(dumps(phi))
Generic morphism:
...
"""
self._basis_name = "idempotent"
CombinatorialFreeModule.__init__(self, M.base_ring(),
tuple(M._lattice),
prefix=prefix,
category=MoebiusAlgebraBases(M))
## Change of basis:
E = M.E()
self.module_morphism(self._to_natural_basis,
codomain=E, category=self.category(),
triangular='lower', unitriangular=True,
key=M._lattice._element_to_vertex
).register_as_coercion()
E.module_morphism(E._to_idempotent_basis,
codomain=self, category=self.category(),
triangular='lower', unitriangular=True,
key=M._lattice._element_to_vertex
).register_as_coercion()
@cached_method
def _to_natural_basis(self, x):
"""
Convert the element indexed by ``x`` to the natural basis.
EXAMPLES::
sage: M = posets.BooleanLattice(4).moebius_algebra(QQ)
sage: I = M.I()
sage: all(I(I._to_natural_basis(x)) == I.monomial(x)
....: for x in I.basis().keys())
True
"""
M = self.realization_of()
N = M.natural()
moebius = M._lattice.moebius_function
return N.sum_of_terms((y, moebius(x,y)) for y in M._lattice.order_filter([x]))
def product_on_basis(self, x, y):
"""
Return the product of basis elements indexed by ``x`` and ``y``.
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: I = L.moebius_algebra(QQ).I()
sage: I.product_on_basis(5, 14)
0
sage: I.product_on_basis(2, 2)
I[2]
TESTS::
sage: M = posets.BooleanLattice(4).moebius_algebra(QQ)
sage: E = M.E()
sage: I = M.I()
sage: all(E(x)*E(y) == E(x*y) for x in I.basis() for y in I.basis())
True
"""
if x == y:
return self.monomial(x)
return self.zero()
@cached_method
def one(self):
"""
Return the element ``1`` of ``self``.
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: I = L.moebius_algebra(QQ).I()
sage: I.one()
I[0] + I[1] + I[2] + I[3] + I[4] + I[5] + I[6] + I[7] + I[8]
+ I[9] + I[10] + I[11] + I[12] + I[13] + I[14] + I[15]
"""
return self.sum_of_monomials(self.realization_of()._lattice)
def __getitem__(self, x):
"""
Return the basis element indexed by ``x``.
INPUT:
- ``x`` -- an element of the lattice
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: I = L.moebius_algebra(QQ).I()
sage: I[5]
I[5]
"""
L = self.realization_of()._lattice
return self.monomial(L(x))
idempotent = I
class QuantumMoebiusAlgebra(Parent, UniqueRepresentation):
r"""
The quantum Möbius algebra of a lattice.
Let `L` be a lattice, and we define the *quantum Möbius algebra* `M_L(q)`
as the algebra with basis `\{ E_x \mid x \in L \}` with
multiplication given by
.. MATH::
E_x E_y = \sum_{z \geq a \geq x \vee y} \mu_L(a, z)
q^{\operatorname{crk} a} E_z,
where `\mu_L` is the Möbius function of `L` and `\operatorname{crk}`
is the corank function (i.e., `\operatorname{crk} a =
\operatorname{rank} L - \operatorname{rank}` a). At `q = 1`, this
reduces to the multiplication formula originally given by Solomon.
"""
def __init__(self, L, q=None):
"""
Initialize ``self``.
TESTS::
sage: L = posets.BooleanLattice(4)
sage: M = L.quantum_moebius_algebra()
sage: TestSuite(M).run() # long time
"""
if not L.is_lattice():
raise ValueError("L must be a lattice")
if q is None:
q = LaurentPolynomialRing(ZZ, 'q').gen()
self._q = q
R = q.parent()
cat = Algebras(R).WithBasis()
if L in FiniteEnumeratedSets():
cat = cat.Commutative().FiniteDimensional()
self._lattice = L
self._category = cat
Parent.__init__(self, base=R, category=self._category.WithRealizations())
def _repr_(self):
"""
Return a string representation of ``self``.
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: L.quantum_moebius_algebra()
Quantum Moebius algebra of Finite lattice containing 16 elements
with q=q over Univariate Laurent Polynomial Ring in q over Integer Ring
"""
return "Quantum Moebius algebra of {} with q={} over {}".format(
self._lattice, self._q, self.base_ring())
def a_realization(self):
r"""
Return a particular realization of ``self`` (the `B`-basis).
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: M = L.quantum_moebius_algebra()
sage: M.a_realization()
Quantum Moebius algebra of Finite lattice containing 16 elements
with q=q over Univariate Laurent Polynomial Ring in q
over Integer Ring in the natural basis
"""
return self.E()
def lattice(self):
"""
Return the defining lattice of ``self``.
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: M = L.quantum_moebius_algebra()
sage: M.lattice()
Finite lattice containing 16 elements
sage: M.lattice() == L
True
"""
return self._lattice
class E(BasisAbstract):
r"""
The natural basis of a quantum Möbius algebra.
Let `E_x` and `E_y` be basis elements of `M_L` for some lattice `L`.
Multiplication is given by
.. MATH::
E_x E_y = \sum_{z \geq a \geq x \vee y} \mu_L(a, z)
q^{\operatorname{crk} a} E_z,
where `\mu_L` is the Möbius function of `L` and `\operatorname{crk}`
is the corank function (i.e., `\operatorname{crk} a =
\operatorname{rank} L - \operatorname{rank}` a).
"""
def __init__(self, M, prefix='E'):
"""
Initialize ``self``.
TESTS::
sage: L = posets.BooleanLattice(4)
sage: M = L.quantum_moebius_algebra()
sage: TestSuite(M.E()).run() # long time
"""
self._basis_name = "natural"
CombinatorialFreeModule.__init__(self, M.base_ring(),
tuple(M._lattice),
prefix=prefix,
category=MoebiusAlgebraBases(M))
def product_on_basis(self, x, y):
"""
Return the product of basis elements indexed by ``x`` and ``y``.
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: E = L.quantum_moebius_algebra().E()
sage: E.product_on_basis(5, 14)
E[15]
sage: E.product_on_basis(2, 8)
q^2*E[10] + (q-q^2)*E[11] + (q-q^2)*E[14] + (1-2*q+q^2)*E[15]
"""
L = self.realization_of()._lattice
q = self.realization_of()._q
moebius = L.moebius_function
rank = L.rank_function()
R = L.rank()
j = L.join(x,y)
return self.sum_of_terms(( z, moebius(a,z) * q**(R - rank(a)) )
for z in L.order_filter([j])
for a in L.closed_interval(j, z))
@cached_method
def one(self):
"""
Return the element ``1`` of ``self``.
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: E = L.quantum_moebius_algebra().E()
sage: all(E.one() * b == b for b in E.basis())
True
"""
L = self.realization_of()._lattice
q = self.realization_of()._q
moebius = L.moebius_function
rank = L.rank_function()
R = L.rank()
return self.sum_of_terms((x, moebius(y,x) * q**(rank(y) - R))
for x in L for y in L.order_ideal([x]))
natural = E
class C(BasisAbstract):
r"""
The characteristic basis of a quantum Möbius algebra.
The characteristic basis `\{ C_x \mid x \in L \}` of `M_L`
for some lattice `L` is defined by
.. MATH::
C_x = \sum_{a \geq x} P(F^x; q) E_a,
where `F^x = \{ y \in L \mid y \geq x \}` is the principal order
filter of `x` and `P(F^x; q)` is the characteristic polynomial
of the (sub)poset `F^x`.
"""
def __init__(self, M, prefix='C'):
"""
Initialize ``self``.
TESTS::
sage: L = posets.BooleanLattice(3)
sage: M = L.quantum_moebius_algebra()
sage: TestSuite(M.C()).run() # long time
"""
self._basis_name = "characteristic"
CombinatorialFreeModule.__init__(self, M.base_ring(),
tuple(M._lattice),
prefix=prefix,
category=MoebiusAlgebraBases(M))
## Change of basis:
E = M.E()
phi = self.module_morphism(self._to_natural_basis,
codomain=E, category=self.category(),
triangular='lower', unitriangular=True,
key=M._lattice._element_to_vertex)
phi.register_as_coercion()
(~phi).register_as_coercion()
@cached_method
def _to_natural_basis(self, x):
"""
Convert the element indexed by ``x`` to the natural basis.
EXAMPLES::
sage: M = posets.BooleanLattice(4).quantum_moebius_algebra()
sage: C = M.C()
sage: all(C(C._to_natural_basis(x)) == C.monomial(x)
....: for x in C.basis().keys())
True
"""
M = self.realization_of()
N = M.natural()
q = M._q
R = M.base_ring()
L = M._lattice
poly = lambda x,y: L.subposet(L.closed_interval(x, y)).characteristic_polynomial()
# This is a workaround until #17554 is fixed...
subs = lambda p,q: R.sum( c * q**e for e,c in enumerate(p.list()) )
# ...at which point, we can do poly(x,y)(q=q)
return N.sum_of_terms((y, subs(poly(x,y), q))
for y in L.order_filter([x]))
characteristic_basis = C
class KL(BasisAbstract):
r"""
The Kazhdan-Lusztig basis of a quantum Möbius algebra.
The Kazhdan-Lusztig basis `\{ B_x \mid x \in L \}` of `M_L`
for some lattice `L` is defined by
.. MATH::
B_x = \sum_{y \geq x} P_{x,y}(q) E_a,
where `P_{x,y}(q)` is the Kazhdan-Lusztig polynomial of `L`,
following the definition given in [EPW14]_.
EXAMPLES:
We construct some examples of Proposition 4.5 of [EPW14]_::
sage: M = posets.BooleanLattice(4).quantum_moebius_algebra()
sage: KL = M.KL()
sage: KL[4] * KL[5]
(q^2+q^3)*KL[5] + (q+2*q^2+q^3)*KL[7] + (q+2*q^2+q^3)*KL[13]
+ (1+3*q+3*q^2+q^3)*KL[15]
sage: KL[4] * KL[15]
(1+3*q+3*q^2+q^3)*KL[15]
sage: KL[4] * KL[10]
(q+3*q^2+3*q^3+q^4)*KL[14] + (1+4*q+6*q^2+4*q^3+q^4)*KL[15]
"""
def __init__(self, M, prefix='KL'):
"""
Initialize ``self``.
TESTS::
sage: L = posets.BooleanLattice(4)
sage: M = L.quantum_moebius_algebra()
sage: TestSuite(M.KL()).run() # long time
"""
self._basis_name = "Kazhdan-Lusztig"
CombinatorialFreeModule.__init__(self, M.base_ring(),
tuple(M._lattice),
prefix=prefix,
category=MoebiusAlgebraBases(M))
## Change of basis:
E = M.E()
phi = self.module_morphism(self._to_natural_basis,
codomain=E, category=self.category(),
triangular='lower', unitriangular=True,
key=M._lattice._element_to_vertex)
phi.register_as_coercion()
(~phi).register_as_coercion()
@cached_method
def _to_natural_basis(self, x):
"""
Convert the element indexed by ``x`` to the natural basis.
EXAMPLES::
sage: M = posets.BooleanLattice(4).quantum_moebius_algebra()
sage: KL = M.KL()
sage: all(KL(KL._to_natural_basis(x)) == KL.monomial(x) # long time
....: for x in KL.basis().keys())
True
"""
M = self.realization_of()
L = M._lattice
E = M.E()
q = M._q
R = M.base_ring()
rank = L.rank_function()
# This is a workaround until #17554 is fixed...
subs = lambda p,q: R.sum( c * q**e for e,c in enumerate(p.list()) )
return E.sum_of_terms((y, q**(rank(y) - rank(x)) *
subs(L.kazhdan_lusztig_polynomial(x, y), q**-2))
for y in L.order_filter([x]))
kazhdan_lusztig = KL
class MoebiusAlgebraBases(Category_realization_of_parent):
r"""
The category of bases of a Möbius algebra.
INPUT:
- ``base`` -- a Möbius algebra
TESTS::
sage: from sage.combinat.posets.moebius_algebra import MoebiusAlgebraBases
sage: M = posets.BooleanLattice(4).moebius_algebra(QQ)
sage: bases = MoebiusAlgebraBases(M)
sage: M.E() in bases
True
"""
def _repr_(self):
r"""
Return the representation of ``self``.
EXAMPLES::
sage: from sage.combinat.posets.moebius_algebra import MoebiusAlgebraBases
sage: M = posets.BooleanLattice(4).moebius_algebra(QQ)
sage: MoebiusAlgebraBases(M)
Category of bases of Moebius algebra of Finite lattice
containing 16 elements over Rational Field
"""
return "Category of bases of {}".format(self.base())
def super_categories(self):
r"""
The super categories of ``self``.
EXAMPLES::
sage: from sage.combinat.posets.moebius_algebra import MoebiusAlgebraBases
sage: M = posets.BooleanLattice(4).moebius_algebra(QQ)
sage: bases = MoebiusAlgebraBases(M)
sage: bases.super_categories()
[Category of finite dimensional commutative algebras with basis over Rational Field,
Category of realizations of Moebius algebra of Finite lattice
containing 16 elements over Rational Field]
"""
return [self.base()._category, Realizations(self.base())]
class ParentMethods:
def _repr_(self):
"""
Text representation of this basis of a Möbius algebra.
EXAMPLES::
sage: M = posets.BooleanLattice(4).moebius_algebra(QQ)
sage: M.E()
Moebius algebra of Finite lattice containing 16 elements
over Rational Field in the natural basis
sage: M.I()
Moebius algebra of Finite lattice containing 16 elements
over Rational Field in the idempotent basis
"""
return "{} in the {} basis".format(self.realization_of(), self._basis_name)
def product_on_basis(self, x, y):
"""
Return the product of basis elements indexed by ``x`` and ``y``.
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: C = L.quantum_moebius_algebra().C()
sage: C.product_on_basis(5, 14)
q^3*C[15]
sage: C.product_on_basis(2, 8)
q^4*C[10]
"""
R = self.realization_of().a_realization()
return self(R(self.monomial(x)) * R(self.monomial(y)))
@cached_method
def one(self):
"""
Return the element ``1`` of ``self``.
EXAMPLES::
sage: L = posets.BooleanLattice(4)
sage: C = L.quantum_moebius_algebra().C()
sage: all(C.one() * b == b for b in C.basis())
True
"""
R = self.realization_of().a_realization()
return self(R.one())
class ElementMethods:
pass