nLab conjunction

Redirected from "conjunctions".
Contents

This page is about conjunctions in double (or higher) categories; see logical conjunction for the meet of truth values.


Contents

Idea

A conjunction (sometimes called adjunction, e.g. by Grandis and Parè) in a double category is a way of saying that a tight and a loose arrow are adjoint, even though they do not live in the same 2-category.

Definition

Let f:ABf\colon A \to B be a tight arrow and g:BAg\colon B \nrightarrow A a loose arrow in a double category. These arrows are said to be a conjunction if they come equipped with 2-cells:

such that ε λη=id f\varepsilon \circ_\lambda \eta = id_f and η τε=id g\eta \circ_\tau \varepsilon = id_g, where λ\circ_\lambda and τ\circ_\tau denote, respectively, loose and tight composition of 2-cells.

Given such a conjunction, we say that ff and gg are conjoints of each other, and that gg is the right conjoint of ff and that ff is the left conjoint of gg.

Examples

Remarks

  • The horizontal (or vertical) dual of a conjunction is a companion pair.

  • Conjunctions (and companion pairs) have a mate correspondence generalizing the calculus of mates in 2-categories.

  • If every vertical arrow in some double category DD has a right conjoint, then the functor fgf\mapsto g is a pseudofunctor LD opTDL D^{op}\to T D from the loose bicategory to the tight 2-category, which is the identity on objects, and locally fully faithful by the mate correspondence. If every tight arrow also has a companion, then this makes DD into a proarrow equipment, or equivalently a framed bicategory.

  • A double category \mathbb{C} admits all conjoints iff the underlying spans C 0sC 1tC 0C_0 \xleftarrow{s} C_1 \xrightarrow{t} C_0 is a two-sided opfibration, i.e. if its opposite span is a two-sided fibration. See at companion pair for a sketch of the proof of why this is the case.

References

The concept is due to (there called orthogonal adjoint):

The terminology “conjoint” is due to:

Last revised on August 14, 2024 at 09:08:24. See the history of this page for a list of all contributions to it.