Draft:Neocategory

This may take 2 months or more, since drafts are reviewed in no specific order. There are 2,445 pending submissions waiting for review.

Draft:Neocategory
  • Comment: This may be a notable topic, but the article provides almost no background for readers who aren't versed in the topic. Please provide a general introduction as a lead section. WeirdNAnnoyed (talk) 22:08, 8 August 2026 (UTC)


Group-like structures
Total Associative Identity Divisible
Partial magma Unneeded Unneeded Unneeded Unneeded
Semigroupoid Unneeded Required Unneeded Unneeded
Small category Unneeded Required Required Unneeded
Groupoid Unneeded Required Required Required
Magma Required Unneeded Unneeded Unneeded
Quasigroup Required Unneeded Unneeded Required
Unital magma Required Unneeded Required Unneeded
Loop Required Unneeded Required Required
Semigroup Required Required Unneeded Unneeded
Associative quasigroup Required Required Unneeded Required
Monoid Required Required Required Unneeded
Group Required Required Required Required

A neocategory (Ehresmann, who introduced this notion, called it a multiplicative graph [in French: graphe multiplicatif] [1]) is a generalization of an ordinary category in which associative law of composition is weakened to a partial law of composition. While an ordinary category is a concept combining a directed graph and a monoidal structure, a neocategory is a partial magma-like structure. Namely, it is a structure in one‑to‑one correspondence with the nodes of a directed graph, and is equipped with partial law of composition that satisfies only left and right identities.[1] Cury is studying enriched neocategories under the term graphe multiplicatif enrichi.[2] As a more general notion, there is the compositional graph, and neocategories can be seen as strongly identitive composition graphs.[3]

This notion first appears in Ehresmann's book Catégories et structures. For the notion of a sketch which he himself introduced, Ehresmann needed to define a category-like structure that avoided redundant axioms as much as possible.[4] This structure is the neocategory, and this is a type of relaxed notion of category, such as a semicategory.

Definition

For comparison, a typical ordinary category is shown in the diagram. If there is no composition of arrows, it is simply a directed graph. In an ordinary category, the composition of any pair of consecutive arrows exists, whereas in a neocategory, a pair of consecutive arrows is not necessarily composable.[5]

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

  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[7][8]): 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[9][8]): If the composite is defined, then:

From the condition 2, the graph is uniquely defined.

Example

  • 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.[10][1]

See also

Notes

  1. ^ a b c d Bastiani & Ehresmann 1972, §1. Neocategories and neofunctors.
  2. ^ Cury 1979
  3. ^ Mateus, Sernadas & Sernadas 1999
  4. ^ Cury 2004, INTRODUCTION
  5. ^ Cury 2004
  6. ^ Ehresmann 1965, ch. I, §.B) Graphes multiplicatifs et catègories. For the definition of "classe multiplicative", see ch. I, § A) Classes multiplicatives.
  7. ^ Ehresmann 1965, ch. I, Dèfinition 8. (G1)
  8. ^ a b Coppey 1980, 1. Graphes multiplicatifs, foncteurs, transformations naturelles.
  9. ^ Ehresmann 1965, ch. I, Dèfinition 8. (G2)
  10. ^ Ehresmann 1965, ch. I, Dèfinition 11.

References

  • 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 (in French). 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 (in French). Vol. 92. pp. 74–104. doi:10.1007/BFb0080766. ISBN 978-3-540-04611-0.
  • Ehresmann, Charles (1965). Catégories et structures (in French).
  • Coppey, L.; Lair, C. (1984). "Leçons de théorie des esquisses" (PDF). Diagrammes (in French). 12 (4). ISSN 0224-3911.
  • Cury, F. (1979). "Systèmes de générateurs et relations pour les catégories enrichies" (PDF). Diagrammes (in French). 1.
  • Cury, F. (1978). Graphes multiplicatifs enrichis (Thesis) (in French).

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.