nLab equivalence



Equality and Equivalence

Category theory



In general two objects are considered equivalent if they may be replaced by one another in all contexts under consideration (see also the principle of equivalence).

At the propositional level, the general theory of equivalence is discussed at equivalence relation, but that leaves us with the question of the correct definition of equivalence in various situations. Furthermore, we can work on a higher level and ask what the equivalences are, not just whether things are equivalent.

In higher category theory

In higher category theory an equivalence often means a morphism which is invertible in a maximally weak sense (that is, up to all higher equivalences). Two objects are equivalent if there is an equivalence between them. For example:

  • In a set (a 00-category), equivalence is just equality.

  • In a category (a 11-category), an equivalence is an isomorphism.

  • In a (possibly weak) 22-category, an equivalence is a morphism f:xyf : x \to y such that there exists a morphism g:yxg : y\to x and 22-cell isomorphisms fg1 yf g \cong 1_y and gf1 xg f \cong 1_x. In the 22-category Cat this reduces to the usual notion of equivalence of categories (although one must define Cat\Cat carefully using anafunctors if one wants to avoid the axiom of choice).

  • In a (possibly weak) 33-category, an equivalence is a morphism f:xyf : x \to y such that there exists a morphism g:yxg : y\to x and 2-cells fg1 yf g \to 1_y and gf1 xg f \to 1_x which are equivalences in the appropriate hom-2-categories. In the (weak) 3-category BicatBicat of bicategories, pseudofunctors, pseudonatural transformations, and modifications, such equivalences are often called biequivalences, and that term is sometimes also used for an equivalence in any 33-category.

  • In a (possibly weak) \infty-category, an equivalence is a morphism f:xyf : x \to y such that there exists a morphism g:yxg : y\to x and 2-cells fg1 yf g \to 1_y and gf1 xg f \to 1_x which are equivalences in the appropriate hom-\infty-categories. This can be made rigorous as a corecursive definition.

There is also the more structured/coherent notion of an adjoint equivalence, but one hopes to have a theorem that any equivalence can be improved to an adjoint one. This is known in some cases, including 2-categories, 3-categories, strict ω\omega-categories, and some models for (,1)(\infty,1)-categories.

In addition to this, there is the notion of equivalence of categories (and higher categories), which is on a separate page. But it is related: properly done, two nn-categories are equivalent if and only if they're equivalent as objects in the (n+1)(n+1)-category of nn-categories.

In homotopy theory

In the category Top of topological spaces, notions weaker than isomorphism become very important: homotopy equivalence and weak homotopy equivalence. The latter notion is generalized to weak equivalence for objects in any model category. There is also a notion of equivalence between model categories: Quillen equivalence.

These can be understood to some extent using higher categories. For example, topological spaces should be weakly homotopy-equivalent if and only if they have equivalent fundamental infinity-groupoids. Similarly, Quillen equivalent model categories give rise to equivalent (infinity,1)-categories.

See equivalence in an (infinity,1)-category.

In homotopy type theory

In homotopy type theory equivalences can be axiomatized as those terms of function types all whose homotopy fibers are contractible.

See equivalence in homotopy type theory.

\phantom{-}symbol\phantom{-}\phantom{-}in logic\phantom{-}
A\phantom{A}\inA\phantom{A}element relation
A\phantom{A}:\,:A\phantom{A}typing relation
A\phantom{A}\vdashA\phantom{A}A\phantom{A}entailment / sequentA\phantom{A}
A\phantom{A}\topA\phantom{A}A\phantom{A}true / topA\phantom{A}
A\phantom{A}\botA\phantom{A}A\phantom{A}false / bottomA\phantom{A}
A\phantom{A}\LeftrightarrowA\phantom{A}logical equivalence
A\phantom{A}\neqA\phantom{A}negation of equality / apartnessA\phantom{A}
A\phantom{A}\notinA\phantom{A}negation of element relation A\phantom{A}
A\phantom{A}¬¬\not \notA\phantom{A}negation of negationA\phantom{A}
A\phantom{A}\existsA\phantom{A}existential quantificationA\phantom{A}
A\phantom{A}\forallA\phantom{A}universal quantificationA\phantom{A}
A\phantom{A}\wedgeA\phantom{A}logical conjunction
A\phantom{A}\veeA\phantom{A}logical disjunction
symbolin type theory (propositions as types)
A\phantom{A}\toA\phantom{A}function type (implication)
A\phantom{A}×\timesA\phantom{A}product type (conjunction)
A\phantom{A}++A\phantom{A}sum type (disjunction)
A\phantom{A}00A\phantom{A}empty type (false)
A\phantom{A}11A\phantom{A}unit type (true)
A\phantom{A}==A\phantom{A}identity type (equality)
A\phantom{A}\simeqA\phantom{A}equivalence of types (logical equivalence)
A\phantom{A}\sumA\phantom{A}dependent sum type (existential quantifier)
A\phantom{A}\prodA\phantom{A}dependent product type (universal quantifier)
symbolin linear logic
A\phantom{A}\multimapA\phantom{A}A\phantom{A}linear implicationA\phantom{A}
A\phantom{A}\otimesA\phantom{A}A\phantom{A}multiplicative conjunctionA\phantom{A}
A\phantom{A}\oplusA\phantom{A}A\phantom{A}additive disjunctionA\phantom{A}
A\phantom{A}&\&A\phantom{A}A\phantom{A}additive conjunctionA\phantom{A}
A\phantom{A}\invampA\phantom{A}A\phantom{A}multiplicative disjunctionA\phantom{A}
A\phantom{A}!\;!A\phantom{A}A\phantom{A}exponential conjunctionA\phantom{A}

Last revised on October 3, 2021 at 05:18:14. See the history of this page for a list of all contributions to it.