nLab equivalence in a 2-category

Redirected from "1-equivalence".
Contents

Context

2-Category theory

Equality and Equivalence

Contents

Idea

A 1-morphism in a 2-category is an equivalence if there exists another 1-morphism the other way around, such that the two are inverses of each other up to invertible 2-morphisms.

Definition

A 1-morphism f:xyf: x \to y in a 2-category is called an equivalence if there exists a 1-morphism g:yxg: y \to x and invertible 2-morphisms η:1 yfg\eta : 1_y \xrightarrow{\sim} f g, ϵ:gf1 x\epsilon: g f \xrightarrow{\sim} 1_x.

Alternatively, some use equivalence to denote the whole 4-tuple

(f:xy,g:yx,η:1 yfg,ϵ:gf1 x)(f: x \to y, g: y \to x, \eta : 1_y \xrightarrow{\sim} f g, \epsilon: g f \xrightarrow{\sim} 1_x)

Then being an equivalence is an extra structure put on a 1-morphism f:xyf: x \to y in a 2-category, not merely an extra property.

Such a 4-tuple is called an adjoint equivalence if it obeys the zigzag identities, and in that case (and only in that case) η\eta is called the unit and ϵ\epsilon is called the counit. Given an equivalence in a 2-category, it can always be ‘improved’ to become an adjoint equivalence, simply by redefining ϵ\epsilon or η\eta.

Equivalences in a 2-category are sometimes also called “1-equivalences”, to distinguish them from invertible 2-morphisms, which are also called “2-isomorphisms”.

Examples

Last revised on November 13, 2024 at 07:46:47. See the history of this page for a list of all contributions to it.