You can edit almost every page by Creating an account and confirming your email.

Multiplicative graph

From EverybodyWiki Bios & Wiki


  • 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)



For comparison, this diagram shows a typical arrow composition in an ordinary category. (Without arrow composition, it is simply a directed graph.) The arrows f and g in the diagram are consecutive; they connect in B=cod(f)=dom(g). In an ordinary category, the composition of any pair of consecutive arrows exists, whereas in a multiplicative graph, a pair of consecutive arrows is not necessarily composable.[1]

In mathematics, a multiplicative graph (in French:graphe multiplicatif or neocategory[2] in some English-language papers) is an algebraic structure in category theory. It is a generalization of an ordinary category in the sense that neither the associativity of arrow composition nor the composibility of a pair of connected arrows are assumed. While an ordinary category is a notion combining a directed graph and a monoidal structure, a multiplicative graph 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.[2]

Arrow composition in an ordinary category satisfies the following property: if arrows f and g connect in the sense that dom(g)=cod(f), their composition g∘f is defined, and, moreover, dom(g∘f)=dom(f) and cod(g∘f)=cod(g). In a multiplicative graph, however, condition dom(g)=cod(f) does not guarantee the existence of g∘f within that structure without further assumptions – but if this composition exists, it also satisfies dom(g∘f)=dom(f) and cod(g∘f)=cod(g).[3] When drawing a diagram for a multiplicative graph, it is almost always necessary to explicitly draw all existing arrows that play a role in the argument. For example, as shown in Coppey (1980), square diagrams in a multiplicative graph can take one of five types depending on which potential compositions in the diagram are actually defined.[4]

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

Cury is studying enriched multiplicative graph.[8] As a more general notion, there is the compositional graph, and multiplicative graphs can be seen as strongly identitive compositional graphs.[7]

Definition

Template:Group-like structures A multiplicative graph Σ is couple formed by a set denoted by Σ_, and a partial law of composition κ on Σ_ satisfying the following axioms:[2][9]

  1. κ is a mapping from a subset of Σ_×Σ_ (denoted by Σ*Σ and called the set of composable couples) into Σ_; instead of κ(y,x), we write y∘x and we call y∘x the composite of (y,x).
  2. There exists a reflexive graph[10] (Σ_,β,α) (i.e. α and β are retractions from Σ_ onto a subset of Σ_, denoted by Σ0), such that:
(existence of units[11][12]): For each element x of Σ_, the composites x∘α(x) and β(x)∘x are defined, and we have
x∘α(x)=x=β(x)∘x.
Here, α(x) is the right identity of x and is called the source of x, while β(x) is the left identity of x and is called the target of x;
(coherence of dom/cod[12][13]): If the composite y∘x is defined, then:
α(y∘x)=α(x), β(y∘x)=β(y), and α(y)=β(x).

From the condition 2, the reflexive graph (Σ,β,α) is uniquely defined.

Example

  • An ordinary category is a multiplicative graph in which all the couples (y,x) where α(y)=β(x) are composable (so that Σ*Σ is the pullback of (α,β)), the law of composition being furthermore associative.[2][12][14]

See also

Notes

  1. ↑ Cury 2004
  2. ↑ 2.0 2.1 2.2 2.3 Bastiani & Ehresmann 1972, §1. Neocategories and neofunctors.
  3. ↑ Coppey 1980, Introduction.
  4. ↑ Coppey 1980, 2. Produits tensoriels (unitaires) et fermetures.
  5. ↑ Ehresmann 1965, ch. I, Dèfinition 8.
  6. ↑ Cury 2004, INTRODUCTION
  7. ↑ 7.0 7.1 Mateus, Sernadas & Sernadas 1999
  8. ↑ Cury 1979
  9. ↑ Ehresmann 1965, ch. I, §.B) Graphes multiplicatifs et catègories. For the definition of "classe multiplicative", see ch. I, § A) Classes multiplicatives.
  10. ↑ Wells 2009, 11.3 Compositive graphs
  11. ↑ Ehresmann 1965, ch. I, Dèfinition 8. (G1)
  12. ↑ 12.0 12.1 12.2 Coppey 1980, 1. Graphes multiplicatifs, foncteurs, transformations naturelles.
  13. ↑ Ehresmann 1965, ch. I, Dèfinition 8. (G2)
  14. ↑ Ehresmann 1965, ch. I, Dèfinition 11.

References


This article "Multiplicative graph" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Multiplicative graph. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.