passagemath-categories 10.6.32__cp314-cp314t-musllinux_1_2_aarch64.whl

sage/categories/examples/commutative_additive_semigroups.py

@@ -0,0 +1,199 @@
+# sage_setup: distribution = sagemath-categories
+"""
+Examples of commutative additive semigroups
+"""
+#*****************************************************************************
+#  Copyright (C) 2008-2009 Nicolas M. Thiery <nthiery at users.sf.net>
+#
+#  Distributed under the terms of the GNU General Public License (GPL)
+#                  http://www.gnu.org/licenses/
+#******************************************************************************
+
+from sage.misc.cachefunc import cached_method
+from sage.structure.parent import Parent
+from sage.structure.element_wrapper import ElementWrapper
+from sage.structure.unique_representation import UniqueRepresentation
+from sage.categories.commutative_additive_semigroups import CommutativeAdditiveSemigroups
+from sage.sets.family import Family
+
+
+class FreeCommutativeAdditiveSemigroup(UniqueRepresentation, Parent):
+    r"""
+    An example of a commutative additive monoid: the free commutative monoid.
+
+    This class illustrates a minimal implementation of a commutative additive monoid.
+
+    EXAMPLES::
+
+        sage: S = CommutativeAdditiveSemigroups().example(); S
+        An example of a commutative semigroup: the free commutative semigroup generated by ('a', 'b', 'c', 'd')
+
+        sage: S.category()
+        Category of commutative additive semigroups
+
+    This is the free semigroup generated by::
+
+        sage: S.additive_semigroup_generators()
+        Family (a, b, c, d)
+
+    with product rule given by `a \times b = a` for all `a, b`::
+
+        sage: (a,b,c,d) = S.additive_semigroup_generators()
+
+    We conclude by running systematic tests on this commutative monoid::
+
+        sage: TestSuite(S).run(verbose = True)
+        running ._test_additive_associativity() . . . pass
+        running ._test_an_element() . . . pass
+        running ._test_cardinality() . . . pass
+        running ._test_category() . . . pass
+        running ._test_construction() . . . pass
+        running ._test_elements() . . .
+          Running the test suite of self.an_element()
+          running ._test_category() . . . pass
+          running ._test_eq() . . . pass
+          running ._test_new() . . . pass
+          running ._test_not_implemented_methods() . . . pass
+          running ._test_pickling() . . . pass
+          pass
+        running ._test_elements_eq_reflexive() . . . pass
+        running ._test_elements_eq_symmetric() . . . pass
+        running ._test_elements_eq_transitive() . . . pass
+        running ._test_elements_neq() . . . pass
+        running ._test_eq() . . . pass
+        running ._test_new() . . . pass
+        running ._test_not_implemented_methods() . . . pass
+        running ._test_pickling() . . . pass
+        running ._test_some_elements() . . . pass
+    """
+
+    def __init__(self, alphabet=('a','b','c','d')):
+        r"""
+        The free commutative monoid.
+
+        INPUT:
+
+        - ``alphabet`` -- tuple of strings; the generators of the semigroup
+
+        EXAMPLES::
+
+            sage: M = CommutativeAdditiveSemigroups().example(alphabet=('a','b','c')); M
+            An example of a commutative semigroup: the free commutative semigroup generated by ('a', 'b', 'c')
+
+        TESTS::
+
+            sage: TestSuite(M).run()
+        """
+        self.alphabet = alphabet
+        Parent.__init__(self, category=CommutativeAdditiveSemigroups())
+
+    def _repr_(self):
+        r"""
+        EXAMPLES::
+
+            sage: M = CommutativeAdditiveSemigroups().example(alphabet=('a','b','c'))
+            sage: M._repr_()
+            "An example of a commutative semigroup: the free commutative semigroup generated by ('a', 'b', 'c')"
+        """
+        return "An example of a commutative semigroup: the free commutative semigroup generated by %s" % (self.alphabet,)
+
+    def summation(self, x, y):
+        r"""
+        Return the product of ``x`` and ``y`` in the semigroup, as per
+        :meth:`CommutativeAdditiveSemigroups.ParentMethods.summation`.
+
+        EXAMPLES::
+
+            sage: F = CommutativeAdditiveSemigroups().example()
+            sage: (a,b,c,d) = F.additive_semigroup_generators()
+            sage: F.summation(a,b)
+            a + b
+            sage: (a+b) + (a+c)
+            2*a + b + c
+        """
+        assert x in self
+        assert y in self
+        return self((a, x.value[a] + y.value[a]) for a in self.alphabet)
+
+    @cached_method
+    def additive_semigroup_generators(self):
+        r"""
+        Return the generators of the semigroup.
+
+        EXAMPLES::
+
+            sage: F = CommutativeAdditiveSemigroups().example()
+            sage: F.additive_semigroup_generators()
+            Family (a, b, c, d)
+        """
+        return Family( [self(((a,1),)) for a in self.alphabet] )
+        # FIXME: use this once the keys argument of FiniteFamily will be honoured
+        # for the specifying the order of the elements in the family
+        # return Family(self.alphabet, lambda a: self(((a,1),)))
+
+    def an_element(self):
+        r"""
+        Return an element of the semigroup.
+
+        EXAMPLES::
+
+            sage: F = CommutativeAdditiveSemigroups().example()
+            sage: F.an_element()
+            a + 2*b + 3*c + 4*d
+        """
+        return self((a, (ord(a)-96)) for a in self.alphabet)
+
+    class Element(ElementWrapper):
+        def __init__(self, parent, iterable):
+            """
+            EXAMPLES::
+
+                sage: F = CommutativeAdditiveSemigroups().example()
+                sage: x = F.element_class(F, (('a',4), ('b', 0), ('a', 2), ('c', 1), ('d', 5)))
+                sage: x
+                2*a + c + 5*d
+                sage: x.value
+                {'a': 2, 'b': 0, 'c': 1, 'd': 5}
+                sage: x.parent()
+                An example of a commutative semigroup: the free commutative semigroup generated by ('a', 'b', 'c', 'd')
+
+            Internally, elements are represented as dense dictionaries which
+            associate to each generator of the monoid its multiplicity. In
+            order to get an element, we wrap the dictionary into an element
+            via :class:`ElementWrapper`::
+
+                sage: x.value
+                {'a': 2, 'b': 0, 'c': 1, 'd': 5}
+            """
+            d = {a: 0 for a in parent.alphabet}
+            d.update(iterable)
+            ElementWrapper.__init__(self, parent, d)
+
+        def _repr_(self) -> str:
+            """
+            EXAMPLES::
+
+                sage: F = CommutativeAdditiveSemigroups().example()
+                sage: F.an_element() # indirect doctest
+                a + 2*b + 3*c + 4*d
+
+                sage: F(())
+                0
+            """
+            d = self.value
+            result = ' + '.join(("%s*%s" % (d[a], a) if d[a] != 1 else a)
+                                for a in sorted(d.keys()) if d[a] != 0)
+            return '0' if not result else result
+
+        def __hash__(self):
+            """
+            EXAMPLES::
+
+                sage: F = CommutativeAdditiveSemigroups().example()
+                sage: type(hash(F.an_element()))
+                <... 'int'>
+            """
+            return hash(tuple(self.value.items()))
+
+
+Example = FreeCommutativeAdditiveSemigroup

sage/categories/examples/coxeter_groups.py

@@ -0,0 +1,8 @@
+# sage_setup: distribution = sagemath-categories
+"""
+Examples of Coxeter groups
+"""
+# temporary until someone implements an appropriate example
+
+from . import finite_weyl_groups
+Example = finite_weyl_groups.Example

sage/categories/examples/crystals.py

@@ -0,0 +1,236 @@
+# sage_setup: distribution = sagemath-categories
+# sage.doctest: needs sage.combinat sage.graphs sage.modules
+r"""
+Example of a crystal
+"""
+# ****************************************************************************
+#  Copyright (C) 2010 Anne Schilling <anne at math.ucdavis.edu>
+#
+#  Distributed under the terms of the GNU General Public License (GPL)
+#                  https://www.gnu.org/licenses/
+# *****************************************************************************
+from sage.structure.parent import Parent
+from sage.structure.element_wrapper import ElementWrapper
+from sage.structure.unique_representation import UniqueRepresentation
+from sage.categories.classical_crystals import ClassicalCrystals
+from sage.graphs.digraph import DiGraph
+from sage.categories.enumerated_sets import EnumeratedSets
+from sage.combinat.root_system.cartan_type import CartanType
+
+
+class HighestWeightCrystalOfTypeA(UniqueRepresentation, Parent):
+    r"""
+    An example of a crystal: the highest weight crystal of type `A_n`
+    of highest weight `\omega_1`.
+
+    The purpose of this class is to provide a minimal template for
+    implementing crystals. See
+    :class:`~sage.combinat.crystals.letters.CrystalOfLetters` for a
+    full featured and optimized implementation.
+
+    EXAMPLES::
+
+        sage: C = Crystals().example()
+        sage: C
+        Highest weight crystal of type A_3 of highest weight omega_1
+        sage: C.category()
+        Category of classical crystals
+
+    The elements of this crystal are in the set `\{1,\ldots,n+1\}`::
+
+        sage: C.list()
+        [1, 2, 3,  4]
+        sage: C.module_generators[0]
+        1
+
+    The crystal operators themselves correspond to the elementary
+    transpositions::
+
+        sage: b = C.module_generators[0]
+        sage: b.f(1)
+        2
+        sage: b.f(1).e(1) == b
+        True
+
+    Only the following basic operations are implemented:
+
+    - :meth:`~sage.categories.crystals.Crystals.cartan_type` or an attribute _cartan_type
+    - an attribute module_generators
+    - :meth:`.Element.e`
+    - :meth:`.Element.f`
+
+    All the other usual crystal operations are inherited from the
+    categories; for example::
+
+        sage: C.cardinality()
+        4
+
+    TESTS::
+
+        sage: C = Crystals().example()
+        sage: TestSuite(C).run(verbose = True)
+        running ._test_an_element() . . . pass
+        running ._test_cardinality() . . . pass
+        running ._test_category() . . . pass
+        running ._test_construction() . . . pass
+        running ._test_elements() . . .
+          Running the test suite of self.an_element()
+          running ._test_category() . . . pass
+          running ._test_eq() . . . pass
+          running ._test_new() . . . pass
+          running ._test_not_implemented_methods() . . . pass
+          running ._test_pickling() . . . pass
+          running ._test_stembridge_local_axioms() . . . pass
+          pass
+        running ._test_elements_eq_reflexive() . . . pass
+        running ._test_elements_eq_symmetric() . . . pass
+        running ._test_elements_eq_transitive() . . . pass
+        running ._test_elements_neq() . . . pass
+        running ._test_enumerated_set_contains() . . . pass
+        running ._test_enumerated_set_iter_cardinality() . . . pass
+        running ._test_enumerated_set_iter_list() . . . pass
+        running ._test_eq() . . . pass
+        running ._test_fast_iter() . . . pass
+        running ._test_new() . . . pass
+        running ._test_not_implemented_methods() . . . pass
+        running ._test_pickling() . . . pass
+        running ._test_some_elements() . . . pass
+        running ._test_stembridge_local_axioms() . . . pass
+    """
+
+    def __init__(self, n=3):
+        """
+        EXAMPLES::
+
+            sage: C = sage.categories.examples.crystals.HighestWeightCrystalOfTypeA(n=4)
+            sage: C == Crystals().example(n=4)
+            True
+        """
+        Parent.__init__(self, category=ClassicalCrystals())
+        self.n = n
+        self._cartan_type = CartanType(['A', n])
+        self.module_generators = [self(1)]
+
+    def _repr_(self):
+        """
+        EXAMPLES::
+
+            sage: Crystals().example()
+            Highest weight crystal of type A_3 of highest weight omega_1
+        """
+        return "Highest weight crystal of type A_%s of highest weight omega_1" % (self.n)
+
+    # temporary workaround while an_element is overridden by Parent
+    _an_element_ = EnumeratedSets.ParentMethods._an_element_
+
+    class Element(ElementWrapper):
+
+        def e(self, i):
+            r"""
+            Return the action of `e_i` on ``self``.
+
+            EXAMPLES::
+
+                sage: C = Crystals().example(4)
+                sage: [[c,i,c.e(i)] for i in C.index_set() for c in C if c.e(i) is not None]
+                [[2, 1, 1], [3, 2, 2], [4, 3, 3], [5, 4, 4]]
+            """
+            assert i in self.index_set()
+            if self.value == i+1:
+                return self.parent()(self.value-1)
+            else:
+                return None
+
+        def f(self, i):
+            r"""
+            Return the action of `f_i` on ``self``.
+
+            EXAMPLES::
+
+                sage: C = Crystals().example(4)
+                sage: [[c,i,c.f(i)] for i in C.index_set() for c in C if c.f(i) is not None]
+                [[1, 1, 2], [2, 2, 3], [3, 3, 4], [4, 4, 5]]
+            """
+            assert i in self.index_set()
+            if self.value == i:
+                return self.parent()(self.value+1)
+            else:
+                return None
+
+
+class NaiveCrystal(UniqueRepresentation, Parent):
+    r"""
+    This is an example of a "crystal" which does not come from any kind of
+    representation, designed primarily to test the Stembridge local rules with.
+    The crystal has vertices labeled 0 through 5, with 0 the highest weight.
+
+    The code here could also possibly be generalized to create a class that
+    automatically builds a crystal from an edge-colored digraph, if someone
+    feels adventurous.
+
+    Currently, only the methods :meth:`highest_weight_vector`, :meth:`e`, and :meth:`f` are
+    guaranteed to work.
+
+    EXAMPLES::
+
+        sage: C = Crystals().example(choice='naive')
+        sage: C.highest_weight_vector()
+        0
+    """
+    def __init__(self):
+        """
+        EXAMPLES::
+
+            sage: C = sage.categories.examples.crystals.NaiveCrystal()
+            sage: C == Crystals().example(choice='naive')
+            True
+        """
+        Parent.__init__(self, category=ClassicalCrystals())
+        self.n = 2
+        self._cartan_type = CartanType(['A', 2])
+        self.G = DiGraph(5)
+        self.G.add_edges([[0, 1, 1], [1, 2, 1], [2, 3, 1],
+                          [3, 5, 1], [0, 4, 2], [4, 5, 2]])
+        self.module_generators = [self(0)]
+
+    def __repr__(self):
+        """
+        EXAMPLES::
+
+            sage: Crystals().example(choice='naive')
+            A broken crystal, defined by digraph, of dimension five.
+        """
+        return "A broken crystal, defined by digraph, of dimension five."
+
+    class Element(ElementWrapper):
+        def e(self, i):
+            r"""
+            Return the action of `e_i` on ``self``.
+
+            EXAMPLES::
+
+                sage: C = Crystals().example(choice='naive')
+                sage: [[c,i,c.e(i)] for i in C.index_set() for c in [C(j) for j in [0..5]] if c.e(i) is not None]
+                [[1, 1, 0], [2, 1, 1], [3, 1, 2], [5, 1, 3], [4, 2, 0], [5, 2, 4]]
+            """
+            assert i in self.index_set()
+            for edge in self.parent().G.edges(sort=False):
+                if edge[1] == int(str(self)) and edge[2] == i:
+                    return self.parent()(edge[0])
+            return None
+
+        def f(self, i):
+            r"""
+            Return the action of `f_i` on ``self``.
+
+            EXAMPLES::
+
+                sage: C = Crystals().example(choice='naive')
+                sage: [[c,i,c.f(i)] for i in C.index_set() for c in [C(j) for j in [0..5]] if c.f(i) is not None]
+                [[0, 1, 1], [1, 1, 2], [2, 1, 3], [3, 1, 5], [0, 2, 4], [4, 2, 5]]
+            """
+            assert i in self.index_set()
+            for edge in self.parent().G.edges_incident(int(str(self))):
+                if edge[2] == i:
+                    return self.parent()(edge[1])
+            return None

sage/categories/examples/cw_complexes.py

@@ -0,0 +1,163 @@
+# sage_setup: distribution = sagemath-categories
+"""
+Examples of CW complexes
+"""
+# ****************************************************************************
+#  Copyright (C) 2015 Travis Scrimshaw <tscrim at ucdavis.edu>
+#
+#  Distributed under the terms of the GNU General Public License (GPL)
+#                  https://www.gnu.org/licenses/
+# *****************************************************************************
+from sage.structure.parent import Parent
+from sage.structure.unique_representation import UniqueRepresentation
+from sage.structure.element import Element
+from sage.categories.cw_complexes import CWComplexes
+from sage.sets.family import Family
+
+
+class Surface(UniqueRepresentation, Parent):
+    r"""
+    An example of a CW complex: a (2-dimensional) surface.
+
+    This class illustrates a minimal implementation of a CW complex.
+
+    EXAMPLES::
+
+        sage: from sage.categories.cw_complexes import CWComplexes
+        sage: X = CWComplexes().example(); X
+        An example of a CW complex: the surface given by the boundary map (1, 2, 1, 2)
+
+        sage: X.category()
+        Category of finite finite dimensional CW complexes
+
+    We conclude by running systematic tests on this manifold::
+
+        sage: TestSuite(X).run()
+    """
+    def __init__(self, bdy=(1, 2, 1, 2)):
+        r"""
+        EXAMPLES::
+
+            sage: from sage.categories.cw_complexes import CWComplexes
+            sage: X = CWComplexes().example((1, 2)); X
+            An example of a CW complex: the surface given by the boundary map (1, 2)
+
+        TESTS::
+
+            sage: TestSuite(X).run()
+        """
+        self._bdy = bdy
+        self._edges = frozenset(bdy)
+        Parent.__init__(self, category=CWComplexes().Finite())
+
+    def _repr_(self):
+        r"""
+        TESTS::
+
+            sage: from sage.categories.cw_complexes import CWComplexes
+            sage: CWComplexes().example()
+            An example of a CW complex: the surface given by the boundary map (1, 2, 1, 2)
+        """
+        return "An example of a CW complex: the surface given by the boundary map {}".format(self._bdy)
+
+    def cells(self):
+        """
+        Return the cells of ``self``.
+
+        EXAMPLES::
+
+            sage: from sage.categories.cw_complexes import CWComplexes
+            sage: X = CWComplexes().example()
+            sage: C = X.cells()
+            sage: sorted((d, C[d]) for d in C.keys())
+            [(0, (0-cell v,)),
+             (1, (0-cell e1, 0-cell e2)),
+             (2, (2-cell f,))]
+        """
+        d = {0: (self.element_class(self, 0, 'v'),)}
+        d[1] = tuple([self.element_class(self, 0, 'e'+str(e)) for e in self._edges])
+        d[2] = (self.an_element(),)
+        return Family(d)
+
+    def an_element(self):
+        r"""
+        Return an element of the CW complex, as per
+        :meth:`Sets.ParentMethods.an_element`.
+
+        EXAMPLES::
+
+            sage: from sage.categories.cw_complexes import CWComplexes
+            sage: X = CWComplexes().example()
+            sage: X.an_element()
+            2-cell f
+        """
+        return self.element_class(self, 2, 'f')
+
+    class Element(Element):
+        """
+        A cell in a CW complex.
+        """
+        def __init__(self, parent, dim, name):
+            """
+            Initialize ``self``.
+
+            EXAMPLES::
+
+                sage: from sage.categories.cw_complexes import CWComplexes
+                sage: X = CWComplexes().example()
+                sage: f = X.an_element()
+                sage: TestSuite(f).run()
+            """
+            Element.__init__(self, parent)
+            self._dim = dim
+            self._name = name
+
+        def _repr_(self):
+            """
+            Return a string representation of ``self``.
+
+            EXAMPLES::
+
+                sage: from sage.categories.cw_complexes import CWComplexes
+                sage: X = CWComplexes().example()
+                sage: X.an_element()
+                2-cell f
+            """
+            return "{}-cell {}".format(self._dim, self._name)
+
+        def __eq__(self, other):
+            """
+            Check equality.
+
+            EXAMPLES::
+
+                sage: from sage.categories.cw_complexes import CWComplexes
+                sage: X = CWComplexes().example()
+                sage: f = X.an_element()
+                sage: f == X(2, 'f')
+                True
+                sage: e1 = X(1, 'e1')
+                sage: e1 == f
+                False
+            """
+            return (isinstance(other, Surface.Element)
+                    and self.parent() is other.parent()
+                    and self._dim == other._dim
+                    and self._name == other._name)
+
+        def dimension(self):
+            """
+            Return the dimension of ``self``.
+
+            EXAMPLES::
+
+                sage: from sage.categories.cw_complexes import CWComplexes
+                sage: X = CWComplexes().example()
+                sage: f = X.an_element()
+                sage: f.dimension()
+                2
+            """
+            return self._dim
+
+
+Example = Surface