Lesson plan

Multiplicative graph

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 = \text{cod} (f) = \text{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. |class=notpageimage In mathematics, a multiplicative graph (in French: or neocategory 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 vertices of a directed graph, and each object has left and right identity morphisms, but composability is partial, and, moreover, associativity is not required. Arrow composition in an ordinary category satisfies the following property: if arrows f and g connect in the sense that \text{dom} (g) = \text{cod} (f), their composition g \circ f is defined, and, moreover, \text{dom} (g \circ f) = \text{dom} (f) and \text{cod} (g \circ f) = \text{cod} (g).…

Back to article

Article summary

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 = \text{cod} (f) = \text{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. |class=notpageimage In mathematics, a multiplicative graph (in French: or neocategory 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 vertices of a directed graph, and each object has left and right identity morphisms, but composability is partial, and, moreover, associativity is not required. Arrow composition in an ordinary category satisfies the following property: if arrows f and g connect in the sense that \text{dom} (g) = \text{cod} (f), their composition g \circ f is defined, and, moreover, \text{dom} (g \circ f) = \text{dom} (f) and \text{cod} (g \circ f) = \text{cod} (g).…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.