wgzddlmZmZmZmZmZmZddlmZddl m Z m Z m Z ddl mZGdde ZGddeZGd d eZGd d eZGd deZGddeZGddeZGddeZy))SBasicDictSymbolTuplesympify)Str)Set FiniteSetEmptySet)iterableceZdZdZdZy)Classa, The base class for any kind of class in the set-theoretic sense. Explanation =========== In axiomatic set theories, everything is a class. A class which can be a member of another class is a set. A class which is not a member of another class is a proper class. The class `\{1, 2\}` is a set; the class of all sets is a proper class. This class is essentially a synonym for :class:`sympy.core.Set`. The goal of this class is to assure easier migration to the eventual proper implementation of set theory. FN)__name__ __module__ __qualname____doc__ is_propera/home/mcse/projects/flask/flask-venv/lib/python3.12/site-packages/sympy/categories/baseclasses.pyrrsIrrceZdZdZy)Objecta The base class for any kind of object in an abstract category. Explanation =========== While technically any instance of :class:`~.Basic` will do, this class is the recommended way to create abstract objects in abstract categories. N)rrrrrrrrrs rrcBeZdZdZdZedZedZdZdZ y)Morphisma The base class for any morphism in an abstract category. Explanation =========== In abstract categories, a morphism is an arrow between two category objects. The object where the arrow starts is called the domain, while the object where the arrow ends is called the codomain. Two morphisms between the same pair of objects are considered to be the same morphisms. To distinguish between morphisms between the same objects use :class:`NamedMorphism`. It is prohibited to instantiate this class. Use one of the derived classes instead. See Also ======== IdentityMorphism, NamedMorphism, CompositeMorphism ctd)Nz:Cannot instantiate Morphism. Use derived classes instead.NotImplementedError)clsdomaincodomains r__new__zMorphism.__new__?s! HJ Krc |jdS)a# Returns the domain of the morphism. Examples ======== >>> from sympy.categories import Object, NamedMorphism >>> A = Object("A") >>> B = Object("B") >>> f = NamedMorphism(A, B, "f") >>> f.domain Object("A") rargsselfs rr zMorphism.domainC yy|rc |jdS)a' Returns the codomain of the morphism. Examples ======== >>> from sympy.categories import Object, NamedMorphism >>> A = Object("A") >>> B = Object("B") >>> f = NamedMorphism(A, B, "f") >>> f.codomain Object("B") r$r&s rr!zMorphism.codomainUr(rct||S)a Composes self with the supplied morphism. The order of elements in the composition is the usual order, i.e., to construct `g\circ f` use ``g.compose(f)``. Examples ======== >>> from sympy.categories import Object, NamedMorphism >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> g * f CompositeMorphism((NamedMorphism(Object("A"), Object("B"), "f"), NamedMorphism(Object("B"), Object("C"), "g"))) >>> (g * f).domain Object("A") >>> (g * f).codomain Object("C") )CompositeMorphismr'others rcomposezMorphism.composegs2!--rc$|j|S)a Composes self with the supplied morphism. The semantics of this operation is given by the following equation: ``g * f == g.compose(f)`` for composable morphisms ``g`` and ``f``. See Also ======== compose )r/r-s r__mul__zMorphism.__mul__s||E""rN) rrrrr"propertyr r!r/r1rrrrr's?.K"".6 #rrc&eZdZdZdZedZy)IdentityMorphisma9 Represents an identity morphism. Explanation =========== An identity morphism is a morphism with equal domain and codomain, which acts as an identity with respect to composition. Examples ======== >>> from sympy.categories import Object, NamedMorphism, IdentityMorphism >>> A = Object("A") >>> B = Object("B") >>> f = NamedMorphism(A, B, "f") >>> id_A = IdentityMorphism(A) >>> id_B = IdentityMorphism(B) >>> f * id_A == f True >>> id_B * f == f True See Also ======== Morphism c.tj||SN)rr")rr s rr"zIdentityMorphism.__new__s}}S&))rc|jSr6)r r&s rr!zIdentityMorphism.codomains {{rN)rrrrr"r2r!rrrr4r4s 8*rr4c&eZdZdZdZedZy) NamedMorphisma2 Represents a morphism which has a name. Explanation =========== Names are used to distinguish between morphisms which have the same domain and codomain: two named morphisms are equal if they have the same domains, codomains, and names. Examples ======== >>> from sympy.categories import Object, NamedMorphism >>> A = Object("A") >>> B = Object("B") >>> f = NamedMorphism(A, B, "f") >>> f NamedMorphism(Object("A"), Object("B"), "f") >>> f.name 'f' See Also ======== Morphism c|s tdt|ts t|}tj||||S)Nz!Empty morphism names not allowed.) ValueError isinstancer rr")rr r!names rr"zNamedMorphism.__new__s9@A A$$t9D}}S&(D99rc4|jdjS)a Returns the name of the morphism. Examples ======== >>> from sympy.categories import Object, NamedMorphism >>> A = Object("A") >>> B = Object("B") >>> f = NamedMorphism(A, B, "f") >>> f.name 'f' r%r=r&s rr=zNamedMorphism.names yy|   rN)rrrrr"r2r=rrrr9r9s 6:!!rr9c\eZdZdZedZdZedZedZ edZ dZ y) r,a Represents a morphism which is a composition of other morphisms. Explanation =========== Two composite morphisms are equal if the morphisms they were obtained from (components) are the same and were listed in the same order. The arguments to the constructor for this class should be listed in diagram order: to obtain the composition `g\circ f` from the instances of :class:`Morphism` ``g`` and ``f`` use ``CompositeMorphism(f, g)``. Examples ======== >>> from sympy.categories import Object, NamedMorphism, CompositeMorphism >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> g * f CompositeMorphism((NamedMorphism(Object("A"), Object("B"), "f"), NamedMorphism(Object("B"), Object("C"), "g"))) >>> CompositeMorphism(f, g) == g * f True ct|tr||jzSt|tr|S|t |zS)aC Intelligently adds ``morphism`` to tuple ``t``. Explanation =========== If ``morphism`` is a composite morphism, its components are added to the tuple. If ``morphism`` is an identity, nothing is added to the tuple. No composability checks are performed. )r<r, componentsr4r)tmorphisms r _add_morphismzCompositeMorphism._add_morphismsA h 1 2x*** * "2 3HuX& &rc|r,t|dtstj|g|dSt }t ||ddD]j\}}t|trt|ts t d|j|jk7r tdtj||}ltj||d}|s|dSt|dk(r|dStj||S)Nrr*z!All components must be morphisms.zUncomposable morphisms.) r<rr,r"rzip TypeErrorr!r r;rFlenr)rrCnormalised_componentscurrent followings rr"zCompositeMorphism.__new__'s jAA%,,SA:a=A A %"%j*QR."A 0 GYgx0"9h7 CDD9#3#33 !:;;$5$C$C%w%0 ! 0!2 ? ? !:b>!3%a= & '1 ,(+ +}}S"788rc |jdS)a Returns the components of this composite morphism. Examples ======== >>> from sympy.categories import Object, NamedMorphism >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> (g * f).components (NamedMorphism(Object("A"), Object("B"), "f"), NamedMorphism(Object("B"), Object("C"), "g")) rr$r&s rrCzCompositeMorphism.componentsJs&yy|rc4|jdjS)a Returns the domain of this composite morphism. The domain of the composite morphism is the domain of its first component. Examples ======== >>> from sympy.categories import Object, NamedMorphism >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> (g * f).domain Object("A") r)rCr r&s rr zCompositeMorphism.domain_s*q!(((rc4|jdjS)a Returns the codomain of this composite morphism. The codomain of the composite morphism is the codomain of its last component. Examples ======== >>> from sympy.categories import Object, NamedMorphism >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> (g * f).codomain Object("C") rH)rCr!r&s rr!zCompositeMorphism.codomainvs*r"+++rcDt|j|j|S)a Forgets the composite structure of this morphism. Explanation =========== If ``new_name`` is not empty, returns a :class:`NamedMorphism` with the supplied name, otherwise returns a :class:`Morphism`. In both cases the domain of the new morphism is the domain of this composite morphism and the codomain of the new morphism is the codomain of this composite morphism. Examples ======== >>> from sympy.categories import Object, NamedMorphism >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> (g * f).flatten("h") NamedMorphism(Object("A"), Object("C"), "h") )r9r r!)r'new_names rflattenzCompositeMorphism.flattens4T[[$--BBrN) rrrr staticmethodrFr"r2rCr r!rTrrrr,r,sc>''.!9F()),,,,Crr,cXeZdZdZeefdZedZedZedZ dZ dZ y) Categoryad An (abstract) category. Explanation =========== A category [JoyOfCats] is a quadruple `\mbox{K} = (O, \hom, id, \circ)` consisting of * a (set-theoretical) class `O`, whose members are called `K`-objects, * for each pair `(A, B)` of `K`-objects, a set `\hom(A, B)` whose members are called `K`-morphisms from `A` to `B`, * for a each `K`-object `A`, a morphism `id:A\rightarrow A`, called the `K`-identity of `A`, * a composition law `\circ` associating with every `K`-morphisms `f:A\rightarrow B` and `g:B\rightarrow C` a `K`-morphism `g\circ f:A\rightarrow C`, called the composite of `f` and `g`. Composition is associative, `K`-identities are identities with respect to composition, and the sets `\hom(A, B)` are pairwise disjoint. This class knows nothing about its objects and morphisms. Concrete cases of (abstract) categories should be implemented as classes derived from this one. Certain instances of :class:`Diagram` can be asserted to be commutative in a :class:`Category` by supplying the argument ``commutative_diagrams`` in the constructor. Examples ======== >>> from sympy.categories import Object, NamedMorphism, Diagram, Category >>> from sympy import FiniteSet >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> d = Diagram([f, g]) >>> K = Category("K", commutative_diagrams=[d]) >>> K.commutative_diagrams == FiniteSet(d) True See Also ======== Diagram c|s tdt|ts t|}t|ts t|}t j |||t |}|S)Nz%A Category cannot have an empty name.)r;r<r rrr"r )rr=objectscommutative_diagrams new_categorys rr"zCategory.__new__s[DE E$$t9D'5)GnG}}S$%.0D%EG rc4|jdjS)z Returns the name of this category. Examples ======== >>> from sympy.categories import Category >>> K = Category("K") >>> K.name 'K' rr@r&s rr=z Category.namesyy|   rc |jdS)an Returns the class of objects of this category. Examples ======== >>> from sympy.categories import Object, Category >>> from sympy import FiniteSet >>> A = Object("A") >>> B = Object("B") >>> K = Category("K", FiniteSet(A, B)) >>> K.objects Class({Object("A"), Object("B")}) r*r$r&s rrYzCategory.objectss"yy|rc |jdS)aW Returns the :class:`~.FiniteSet` of diagrams which are known to be commutative in this category. Examples ======== >>> from sympy.categories import Object, NamedMorphism, Diagram, Category >>> from sympy import FiniteSet >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> d = Diagram([f, g]) >>> K = Category("K", commutative_diagrams=[d]) >>> K.commutative_diagrams == FiniteSet(d) True r?r$r&s rrZzCategory.commutative_diagramss,yy|rctd)Nz)hom-sets are not implemented in Category.r)r'ABs rhomz Category.hom*s! 79 9rctd)Nz@Obtaining the class of morphisms is not implemented in Category.rr&s r all_morphismszCategory.all_morphisms.s! NP PrN) rrrrr r"r2r=rYrZrbrdrrrrWrWs[5l$,(  ! !$.9PrrWc~eZdZdZedZe d dZdZedZ edZ edZ dZ d Z d Zy ) Diagrama} Represents a diagram in a certain category. Explanation =========== Informally, a diagram is a collection of objects of a category and certain morphisms between them. A diagram is still a monoid with respect to morphism composition; i.e., identity morphisms, as well as all composites of morphisms included in the diagram belong to the diagram. For a more formal approach to this notion see [Pare1970]. The components of composite morphisms are also added to the diagram. No properties are assigned to such morphisms by default. A commutative diagram is often accompanied by a statement of the following kind: "if such morphisms with such properties exist, then such morphisms which such properties exist and the diagram is commutative". To represent this, an instance of :class:`Diagram` includes a collection of morphisms which are the premises and another collection of conclusions. ``premises`` and ``conclusions`` associate morphisms belonging to the corresponding categories with the :class:`~.FiniteSet`'s of their properties. The set of properties of a composite morphism is the intersection of the sets of properties of its components. The domain and codomain of a conclusion morphism should be among the domains and codomains of the morphisms listed as the premises of a diagram. No checks are carried out of whether the supplied object and morphisms do belong to one and the same category. Examples ======== >>> from sympy.categories import Object, NamedMorphism, Diagram >>> from sympy import pprint, default_sort_key >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> d = Diagram([f, g]) >>> premises_keys = sorted(d.premises.keys(), key=default_sort_key) >>> pprint(premises_keys, use_unicode=False) [g*f:A-->C, id:A-->A, id:B-->B, id:C-->C, f:A-->B, g:B-->C] >>> pprint(d.premises, use_unicode=False) {g*f:A-->C: EmptySet, id:A-->A: EmptySet, id:B-->B: EmptySet, id:C-->C: EmptySet, f:A-->B: EmptySet, g:B-->C: EmptySet} >>> d = Diagram([f, g], {g * f: "unique"}) >>> pprint(d.conclusions,use_unicode=False) {g*f:A-->C: {unique}} References ========== [Pare1970] B. Pareigis: Categories and functors. Academic Press, 1970. c.||vr |||z||<y|||<y)a( If ``key`` is in ``dictionary``, set the new value of ``key`` to be the union between the old value and ``value``. Otherwise, set the value of ``key`` to ``value. Returns ``True`` if the key already was in the dictionary and ``False`` otherwise. TFr) dictionarykeyvalues r_set_dict_unionzDiagram._set_dict_unionps- * (o5JsO#JsOrctj|||sSt|tr|r t dy|r^t }t|j }t|j}tj|||tj|||t|jD]u\}} | |z} |j |jk(r||z} tj|| | |j|j k(sZ||z} tj|| | wt|tr3|r0t }|jD]} tj|| ||yyyy)z Adds a morphism and its attributes to the supplied dictionary ``morphisms``. If ``add_identities`` is True, also adds the identity morphisms for the domain and the codomain of ``morphism``. z5Instances of IdentityMorphism cannot have properties.N) rfrkr<r4r;r r r!listitemsr,rC_add_morphism_closure) morphismsrEpropsadd_identitiesrecurse_compositesemptyid_domid_codexisting_morphismexisting_props new_propsleftright components rrozDiagram._add_morphism_closuresk&&y(EB($45 %OQQ )(//:)(*;*;<'' 65A'' 65A59)//:K5L I1!>*U2 ??&7&@&@@#&77D++ItYG$$(9(@(@@-8E++IuiH I($56;M!!)!4!4BI11)Y2@BB nt|ttfrn|jD][\}}|t |j |j z}tj||t|rt |n t |]t|dk\r)|d} t| trt}| D]}t|j|j tj us8t|j|j tj usmtj|||ddnt| ttfrl| jD]Y\}}|j |vs|j |vs$tj||t|rt |n t |dd[t#j$|t|t||S)a Construct a new instance of Diagram. Explanation =========== If no arguments are supplied, an empty diagram is created. If at least an argument is supplied, ``args[0]`` is interpreted as the premises of the diagram. If ``args[0]`` is a list, it is interpreted as a list of :class:`Morphism`'s, in which each :class:`Morphism` has an empty set of properties. If ``args[0]`` is a Python dictionary or a :class:`Dict`, it is interpreted as a dictionary associating to some :class:`Morphism`'s some properties. If at least two arguments are supplied ``args[1]`` is interpreted as the conclusions of the diagram. The type of ``args[1]`` is interpreted in exactly the same way as the type of ``args[0]``. If only one argument is supplied, the diagram has no conclusions. Examples ======== >>> from sympy.categories import Object, NamedMorphism >>> from sympy.categories import IdentityMorphism, Diagram >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> d = Diagram([f, g]) >>> IdentityMorphism(A) in d.premises.keys() True >>> g * f in d.premises.keys() True >>> d = Diagram([f, g], {g * f: "unique"}) >>> d.conclusions[g * f] {unique} r*rr?F)rrrs)r rKr<rmr r r!rfrodictrrnr rcontainsrtruerr") rr%premises conclusionsrY premises_argrtrErqconclusions_args rr"zDiagram.__new__s(V  t9>7L,-! ,MHy(:K:KLLG11(HeLML4,7(4'9'9';hOHey(:K:KLLG11 (%Iu,=V_`eVfhh t9>"1gO/40! /6H !1!1(//!BCqvvM !1!1(2C2C!DEO 55'5/466 6OdD\:(7'<'<'>LOHe 72 ))W4 55'QV9e3D]fgl]m+0U6L L}}S$x.${2CWMMrc |jdS)aL Returns the premises of this diagram. Examples ======== >>> from sympy.categories import Object, NamedMorphism >>> from sympy.categories import IdentityMorphism, Diagram >>> from sympy import pretty >>> A = Object("A") >>> B = Object("B") >>> f = NamedMorphism(A, B, "f") >>> id_A = IdentityMorphism(A) >>> id_B = IdentityMorphism(B) >>> d = Diagram([f]) >>> print(pretty(d.premises, use_unicode=False)) {id:A-->A: EmptySet, id:B-->B: EmptySet, f:A-->B: EmptySet} rr$r&s rrzDiagram.premisess*yy|rc |jdS)a Returns the conclusions of this diagram. Examples ======== >>> from sympy.categories import Object, NamedMorphism >>> from sympy.categories import IdentityMorphism, Diagram >>> from sympy import FiniteSet >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> d = Diagram([f, g]) >>> IdentityMorphism(A) in d.premises.keys() True >>> g * f in d.premises.keys() True >>> d = Diagram([f, g], {g * f: "unique"}) >>> d.conclusions[g * f] == FiniteSet("unique") True r*r$r&s rrzDiagram.conclusions0s4yy|rc |jdS)a Returns the :class:`~.FiniteSet` of objects that appear in this diagram. Examples ======== >>> from sympy.categories import Object, NamedMorphism, Diagram >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> d = Diagram([f, g]) >>> d.objects {Object("A"), Object("B"), Object("C")} r?r$r&s rrYzDiagram.objectsLs(yy|rcVt}t}|jjD]0}|j|k(s|j|k(s#|t |z}2|j jD]0}|j|k(s|j|k(s#|t |z}2||fS)a Returns a 2-tuple of sets of morphisms between objects ``A`` and ``B``: one set of morphisms listed as premises, and the other set of morphisms listed as conclusions. Examples ======== >>> from sympy.categories import Object, NamedMorphism, Diagram >>> from sympy import pretty >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> d = Diagram([f, g], {g * f: "unique"}) >>> print(pretty(d.hom(A, C), use_unicode=False)) ({g*f:A-->C}, {g*f:A-->C}) See Also ======== Object, Morphism )r rkeysr r!r r)r'r`rarrrEs rrbz Diagram.hombs0  **, 0H1$8+<+<+AIh// 0((--/ 3H1$8+<+<+Ay22  3+&&rctfdjD}|sytfdjD}|S)a Checks whether ``diagram`` is a subdiagram of ``self``. Diagram `D'` is a subdiagram of `D` if all premises (conclusions) of `D'` are contained in the premises (conclusions) of `D`. The morphisms contained both in `D'` and `D` should have the same properties for `D'` to be a subdiagram of `D`. Examples ======== >>> from sympy.categories import Object, NamedMorphism, Diagram >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> d = Diagram([f, g], {g * f: "unique"}) >>> d1 = Diagram([f]) >>> d.is_subdiagram(d1) True >>> d1.is_subdiagram(d) False c3|K|]3}|jvxrj|j|k(5ywr6)r.0mdiagramr's r z(Diagram.is_subdiagram..sJ2T]]*A((+t}}Q/??A29<Fc3|K|]3}|jvxrj|j|k(5ywr6)rrs rrz(Diagram.is_subdiagram..sN8 0 00J"..q1T5E5Ea5HHJ8r)allrr)r'rrrs`` r is_subdiagramzDiagram.is_subdiagramsO22 ' 0 0228#*#6#688 rc|j|js tdi}|jj D]t\}}t |j |jtjus;t |j |jtjusp|||<vi}|jj D]t\}}t |j |jtjus;t |j |jtjusp|||<vt||S)a If ``objects`` is a subset of the objects of ``self``, returns a diagram which has as premises all those premises of ``self`` which have a domains and codomains in ``objects``, likewise for conclusions. Properties are preserved. Examples ======== >>> from sympy.categories import Object, NamedMorphism, Diagram >>> from sympy import FiniteSet >>> A = Object("A") >>> B = Object("B") >>> C = Object("C") >>> f = NamedMorphism(A, B, "f") >>> g = NamedMorphism(B, C, "g") >>> d = Diagram([f, g], {f: "unique", g*f: "veryunique"}) >>> d1 = d.subdiagram_from_objects(FiniteSet(A, B)) >>> d1 == Diagram([f], {f: "unique"}) True z2Supplied objects should all belong to the diagram.) is_subsetrYr;rrnrrr rrr!rrf)r'rY new_premisesrErqnew_conclusionss rsubdiagram_from_objectszDiagram.subdiagram_from_objectss,  .DF F #}}224 /OHe))(//:;qvvE))(*;*;<=G). X& / #//557 2OHe))(//:;qvvE))(*;*;<=G,1) 2 |_55rN)TT)rrrrrUrkror"r2rrrYrbrrrrrrfrf3s;x IM15.B.B`eNN,6*"'H$L&6rrfN) sympy.corerrrrrrsympy.core.symbolr sympy.setsr r r sympy.utilities.iterablesr rrrr4r9r,rWrfrrrrs==!//.C& V h#uh#V"x"J5!H5!pxCxCvFPuFPR_6e_6r