Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

Jump to content

Draft:Neocategory

From Wikipedia, the free encyclopedia

A neocategory (Ehresmann, who introduced this notion, called it a graphe multiplicatif[1] [2]) is a generalization of an ordinary category where associative law of composition is weakened to partial magma. Namely, it is the following structure:a one‑to‑one correspondence with the nodes of a directed graph, equipped with partial law of composition that satisfies only left and right identities.[3] As a more general notion, there is the compositional graph, and neocategories can be seen as strongly identitive composition graphs.[4]

Definition

[edit]

A neocategory is couple formed by a set denoted by , and a partial law of composition on satisfying the following axioms:[3]

  1. is a mapping from a subset of (denoted by and called the set of composable couples) into ; instead of , we write and we call the composite of .
  2. There exists a graph (i.e. and are retractions from onto a subset of , denoted by ), such that:
(existence of units[2]): For each element of , the composites and are defined, and we have
Here, is the right identity of and is called the source of , while is the left identity of and is called the target of ;
(coherence of dom/cod[2]): If the composite is defined, then:

From the condition 2, the graph is uniquely defined.

Example

[edit]
  • An ordinary category is a neocategory in which all the couples where are composable (so that is the pullback of ), the law of composition being furthermore associative.[3]

See also

[edit]

Notes

[edit]
  1. ^ Ehresmann 1969
  2. ^ a b c Coppey 1980, 1. Graphes multiplicatifs, foncteurs, transformations naturelles.
  3. ^ a b c Bastiani & Ehresmann 1972, §1. Neocategories and neofunctors.
  4. ^ Mateus, Sernadas & Sernadas 1999

References

[edit]
  • Bastiani, Andrée; Ehresmann, Charles (1972). "Categories of sketched structures" (PDF). Cahiers de Topologie et Géométrie Différentielle Catégoriques. 13 (2). ISSN 1245-530X.
  • Coppey, L. (1980). "Quelques problèmes typiques concernant les graphes multiplicatifs" (PDF). Diagrammes. 3 (2). ISSN 0224-3911.
  • Mateus, Paulo; Sernadas, Amílcar; Sernadas, Cristina (1999). "Precategories for Combining Probabilistic Automata". Electronic Notes in Theoretical Computer Science. 29: 169–186. doi:10.1016/S1571-0661(05)80315-9.
  • Ehresmann, Charles (1969). "Construction de structures libres". Category Theory, Homology Theory and their Applications II. Lecture Notes in Mathematics. Vol. 92. pp. 74–104. doi:10.1007/BFb0080766. ISBN 978-3-540-04611-0.
  • Ehresmann, Charles (1965). Catégories et structures.
  • Coppey, L.; Lair, C. (1984). "Leçons de théorie des esquisses" (PDF). Diagrammes. 12 (4). ISSN 0224-3911.
[edit]