nLab
pasting diagram

Context

Higher category theory

higher category theory

Basic concepts

Basic theorems

Applications

Models

Morphisms

Functors

Universal constructions

Extra properties and structure

1-categorical presentations

Contents

Idea

Given an ordinary category CC, a pasting diagram in CC is a sequence of composable morphisms in CC

a 1f 1a 2f 2f na n+1. a_1 \stackrel{f_1}{\to} a_2 \stackrel{f_2}{\to} \cdots \stackrel{f_n}{\to} a_{n+1} \,.

We think of these arrows as not yet composed, but pasted together at their objects, such as to form a composable sequence, and then say the value of the sequence is the composite morphism in CC. Or, we could say that a pasting diagram is a specified decomposition of whatever morphism ff it evaluates to, thus breaking down ff into morphisms f if_i which, in practice, are usually “more basic” than ff relative to some type of structure on CC. For example, if CC is a monoidal category, the f if_i might be instances of associativity isomorphisms.

Pasting decompositions become more elaborate in higher categories. An example of a pasting diagram in a (let’s say strict) 2-category is a pasting of two squares

a b c d e f. \array{ a &\to& b &\to& c \\ \downarrow &\swArrow& \downarrow &\swArrow& \downarrow \\ d &\to& e &\to& f } \,.

To evaluate this diagram as a single 2-morphism, we read this diagram explicitly as the vertical composite of the 2-morphism

a b c e f \array{ a &\to& b &\to& c \\ && \downarrow &\swArrow& \downarrow \\ && e &\to& f }

with the 2-morphism

a b d e f. \array{ a &\to& b && \\ \downarrow &\swArrow& \downarrow && \\ d &\to& e &\to& f } \,.

(Notice that the two halves of the boundary of each of these two 2-morphisms are themselves 1-dimensional pasting diagrams.) Similarly, there can be situations where one pastes together other shapes (triangles, pentagons, etc.), and there may be multiple paths on the way to resolving the diagram into a single 2-morphism, but the idea is that all such paths evaluate to the same 2-morphism, at least in a strict 2-category. General theorems which refer to the uniqueness of pastings are called pasting theorems.

On the other hand, the following diagram is not a pasting diagram:

a b c d e f. \array{ a &\to& b &\to& c \\ \downarrow &\neArrow& \downarrow &\swArrow& \downarrow \\ d &\to& e &\to& f } \,.

Thus, formal definitions of pasting diagram include conditions which impose a consistent “directionality” of the cells so they can be pasted together.

In an n-category a pasting diagram is similarly a collection of n-morphisms with a prescribed way how they are to fit together at their boundaries. There are a number of ways of formalizing pasting diagrams, depending partly on the constituent shapes one allows, and also on the technical hypotheses that allow proofs of pasting theorems, which include directionality conditions but usually also “loop-freeness” conditions to ensure there exists a unique way to resolve or evaluate the diagram. (N.B.: usually a completely unambiguous evaluation is only possible in a strict nn-category; in a weak nn-category, one allows uniqueness up to a “contractible space of choices”.)

Despite some technical differences among the formalizations, the core idea throughout is that the overall geometric shapes of pasting diagrams should be (contractible) nn-dimensional polyhedra, broken down into smaller polyhedral cells which come equipped with directionality or orientations, that can be sensibly pasted together as in the above descriptions once the cells have been assigned values in an nn-category.

Notions of pasting diagrams

Various formalisms for pasting diagrams have been proposed. They include

Each of these formalisms involve graded sets {C n} n0\{C_n\}_{n \geq 0} together with maps n +:C n+1P(C n)\partial^+_n: C_{n+1} \to P(C_n), n :C n+1P(C n)\partial^-_n: C_{n+1} \to P(C_n). This goes under various names; here we call it a parity structure. It should be thought of as assigning to each “cell” of dimension n+1n+1 a collection of positive boundary cells and negative boundary cells in dimension nn. The formalisms above are distinguished by the choice of axioms on parity structures, but there is definite kinship among them.

Also related are various notions of categories of shapes, including

References

The notion of pasting in a 2-category was introduced in

  • Jean Benabou, Introduction to bicategories , in Lecture Notes in Mathematics Vol. 47, pp. l-77, Springer-Verlag, New York/Berlin, (1967)

An survey discussion of pasting in 2-categories is in

from definition 2.10 on. Details are in

  • John Power, A 2-categorical pasting theorem , Journal of Algebra Volume 129, Issue 2, March 1990, Pages 439-445

Dominic Verity gave a bicategorical pasting theorem in

  • Dominic Verity, Enriched categories, internal categories, and change of base, PhD thesis, Cambridge University, 1992. Reprinted in TAC (link).

A definition and discussion of pasting diagrams in strict omega-categories is in

  • Sjoerd Crans, Pasting presentation for Omega-categories (web)

  • Sjoerd Crans, Pasting schemes for the monoidal biclosed structure on ω\omega-Cat\mathbf{Cat} (web, ps, pdf)

The notion of pasting scheme used by Crans was introduced by Johnson,

  • Michael Johnson, The combinatorics of categorical pasting, J. Pure Appl. Alg. 62 (1989), 211-225.

Other notions of pasting presentations have been given by Street and by Steiner,

  • Street, Parity complexes, Cahiers Top. Géom Diff. Catégoriques 32 (1991), 315-343. (link) Corrigenda, Cahiers Top. Géom Diff. Catégoriques 35 (1994), 359-361. (link)

  • Richard Steiner, The algebra of directed complexes, Appl. Cat. Struct. 1 (1993), 247-284.

For an online link to the notion of directed complex, see

  • Sjoerd Crans and Richard Steiner, Presentations of omega-categories by directed complexes, Journal of the Australian Mathematical Society (Series A), (1997), 63 : pp 47-77. (link)

There is also

For a cubical approach to multiple compositions and other references see the paper

  • Philip J. Higgins, Thin elements and commutative shells in cubical omega-categories, Theory and Applications of Categories, Vol. 14, 2005, No. 4, pp 60-74. (link)

Revised on December 2, 2013 03:01:31 by Urs Schreiber (145.116.128.226)