much better

Author: fchapoton

src/sage/categories/category_with_axiom.py

@@ -1690,12 +1690,11 @@ class ``Sets.Finite``), or in a separate file (typically in a class
                "Commutative", "Cocommutative", "Associative",
                "Inverse", "Unital", "Division", "NoZeroDivisors", "Cellular",
                "AdditiveCommutative", "AdditiveAssociative", "AdditiveInverse", "AdditiveUnital",
-               "Distributive",
+               "Extremal", "Trim", "Semidistributive", "CongruenceUniform",
+               "Distributive", "Stone",
                "Endset",
                "Pointed",
-               "Stratified",
-               "Stone", "CongruenceUniform", "Semidistributive",
-               "Trim", "Extremal",
+               "Stratified"
                )
 
 

src/sage/categories/finite_lattice_posets.py

@@ -11,7 +11,7 @@
 
 from sage.categories.category_with_axiom import CategoryWithAxiom
 from sage.misc.cachefunc import cached_method
-from sage.categories.category_singleton import Category_singleton
+
 
 class FiniteLatticePosets(CategoryWithAxiom):
     r"""
@@ -242,264 +242,3 @@ def is_lattice_morphism(self, f, codomain) -> bool:
                 if f(self.meet(x, y)) != codomain.meet(f(x), f(y)):
                     return False
             return True
-
-    class SubcategoryMethods:
-        def Stone(self):
-            r"""
-            A Stone lattice `(L, \vee, \wedge)` is a pseudo-complemented
-            distributive lattice such that `a^* \vee a^{**} = 1`.
-
-            See :wikipedia:`Stone algebra`.
-
-            EXAMPLES::
-
-                sage: P = posets.DivisorLattice(24)
-                sage: P in FiniteLatticePosets().Stone()
-                True
-            """
-            return self._with_axioms(("Semidistributive", "CongruenceUniform",
-                                      "Distributive", "Stone"))
-
-        def Distributive(self):
-            r"""
-            A lattice `(L, \vee, \wedge)` is distributive if meet
-            distributes over join: `x \wedge (y \vee z) = (x \wedge y)
-            \vee (x \wedge z)` for every `x,y,z \in L`.
-
-            From duality in lattices, it follows that then also join
-            distributes over meet.
-
-            See :wikipedia:`Distributive lattice`.
-
-            EXAMPLES::
-
-                sage: P = posets.ChainPoset(2).order_ideals_lattice()
-                sage: P in FiniteLatticePosets().Distributive()
-                True
-            """
-            return self._with_axioms(("Semidistributive", "CongruenceUniform",
-                                     "Distributive"))
-
-        def CongruenceUniform(self):
-            r"""
-            A finite lattice `(L, \vee, \wedge)` is congruence uniform if it
-            can be constructed by a sequence of interval doublings
-            starting with the lattice with one element.
-
-            EXAMPLES::
-
-                sage: P = posets.TamariLattice(2)
-                sage: P in FiniteLatticePosets().CongruenceUniform()
-                True
-            """
-            return self._with_axioms(("Semidistributive", "CongruenceUniform"))
-
-        def Semidistributive(self):
-            r"""
-            A finite lattice `(L, \vee, \wedge)` is semidistributive if
-            it is both join-semidistributive and meet-semidistributive.
-
-            A finite lattice is join-semidistributive if
-            for all elements `e, x, y` in the lattice we have
-
-            .. MATH::
-
-                e \vee x = e \vee y \implies e \vee x = e \vee (x \wedge y)
-
-            Meet-semidistributivity is the dual property.
-
-            EXAMPLES::
-
-                sage: P = posets.TamariLattice(2)
-                sage: P in FiniteLatticePosets().Semidistributive()
-                True
-            """
-            return self._with_axiom("Semidistributive")
-
-        def Trim(self):
-            r"""
-            A finite lattice `(L, \vee, \wedge)` is trim if it is extremal
-            and left modular.
-
-            This notion is defined in [Thom2006]_.
-
-            EXAMPLES::
-
-                sage: P = posets.TamariLattice(2)
-                sage: P in FiniteLatticePosets().Trim()
-                True
-            """
-            return self._with_axioms(["Extremal", "Trim"])
-
-        def Extremal(self):
-            r"""
-            A finite lattice `(L, \vee, \wedge)` is extremal if
-            if it has a chain of length `n` (containing `n+1` elements)
-            and exactly `n` join-irreducibles and `n` meet-irreducibles.
-
-            This notion was defined by George Markowsky.
-
-            EXAMPLES::
-
-                sage: P = posets.TamariLattice(2)
-                sage: P in FiniteLatticePosets().Extremal()
-                True
-            """
-            return self._with_axiom("Extremal")
-
-    class Semidistributive(CategoryWithAxiom):
-        """
-        The category of semidistributive lattices.
-
-        EXAMPLES::
-
-            sage: cat = FiniteLatticePosets().Semidistributive(); cat
-            Category of finite semidistributive lattice posets
-
-            sage: cat.super_categories()
-            [Category of finite lattice posets]
-        """
-        class ParentMethods:
-            def is_semidistributive(self):
-                """
-                Return whether ``self`` is a semidistributive lattice.
-
-                EXAMPLES::
-
-                    sage: posets.TamariLattice(4).is_semidistributive()
-                    True
-                """
-                return True
-
-        class CongruenceUniform(CategoryWithAxiom):
-            """
-            The category of congruence uniform lattices.
-
-            EXAMPLES::
-
-                sage: cat = FiniteLatticePosets().CongruenceUniform(); cat
-                Category of finite congruence uniform semidistributive lattice posets
-                sage: cat.super_categories()
-                [Category of finite semidistributive lattice posets]
-            """
-            class ParentMethods:
-                def is_congruence_uniform(self):
-                    """
-                    Return whether ``self`` is a congruence uniform lattice.
-
-                    EXAMPLES::
-
-                        sage: posets.TamariLattice(4).is_congruence_uniform()
-                        True
-                    """
-                    return True
-
-            class Distributive(CategoryWithAxiom):
-                """
-                The category of distributive lattices.
-
-                EXAMPLES::
-
-                    sage: cat = FiniteLatticePosets().Distributive(); cat
-                    Category of finite distributive lattice posets
-
-                    sage: cat.super_categories()
-                    [Category of finite lattice posets]
-                """
-                @cached_method
-                def extra_super_categories(self):
-                    r"""
-                    Return a list of the super categories of ``self``.
-
-                    This encode implications between properties.
-
-                    EXAMPLES::
-
-                        sage: FiniteLatticePosets().Distributive().super_categories()
-                        [Category of finite lattice posets]
-                    """
-                    return [FiniteLatticePosets().Trim()]
-
-                class ParentMethods:
-                    def is_distributive(self):
-                        """
-                        Return whether ``self`` is a distributive lattice.
-
-                        EXAMPLES::
-
-                            sage: P = posets.Crown(4).order_ideals_lattice()
-                            sage: P.is_distributive()
-                            True
-                        """
-                        return True
-
-                class Stone(CategoryWithAxiom):
-                    """
-                    The category of Stone lattices.
-
-                    EXAMPLES::
-
-                        sage: cat = FiniteLatticePosets().Stone(); cat
-                        Category of finite distributive stone lattice posets
-
-                        sage: cat.super_categories()
-                        [Category of finite distributive lattice posets]
-                    """
-                    class ParentMethods:
-                        def is_stone(self):
-                            """
-                            Return whether ``self`` is a Stone lattice.
-
-                            EXAMPLES::
-
-                                sage: posets.DivisorLattice(12).is_stone()
-                                True
-                            """
-                            return True
-
-    class Extremal(CategoryWithAxiom):
-        """
-        The category of extremal uniform lattices.
-
-        EXAMPLES::
-
-            sage: cat = FiniteLatticePosets().Extremal(); cat
-            Category of finite extremal lattice posets
-
-            sage: cat.super_categories()
-            [Category of finite lattice posets]
-        """
-        class ParentMethods:
-            def is_extremal(self):
-                """
-                Return whether ``self`` is an extremal lattice.
-
-                EXAMPLES::
-
-                    sage: posets.TamariLattice(4).is_extremal()
-                    True
-                """
-                return True
-
-        class Trim(CategoryWithAxiom):
-            """
-            The category of trim uniform lattices.
-
-            EXAMPLES::
-
-                sage: cat = FiniteLatticePosets().Trim(); cat
-                Category of finite trim extremal lattice posets
-                sage: cat.super_categories()
-                [Category of finite extremal lattice posets]
-            """
-            class ParentMethods:
-                def is_trim(self):
-                    """
-                    Return whether ``self`` is a trim lattice.
-
-                    EXAMPLES::
-
-                        sage: posets.TamariLattice(4).is_trim()
-                        True
-                    """
-                    return True