Homotopy Type Theory equivalence > history (Rev #3, changes)

Showing changes from revision #2 to #3: Added | Removed | Changed

Idea

A There function are multiple definitions of equivalence that are valid inf:ABf : A \to Bhomotopy type theory is an equivalence if it has inverses whose composition with ff is homotopic to the corresponding identity map.

Definition

Let A,BA,B be types, and f:ABf : A \to B a function. We define the property of ff being an equivalence as follows:

Bijective correspondences

isequiv(f)( g:BAfgid B)×( h:BAhfid A)isequiv(f) \equiv \left( \sum_{g : B \to A} f \circ g \sim id_B \right) \times \left( \sum_{h : B \to A} h \circ f \sim id_A \right)

Let A,BA,B be types, and R:(A×B)𝒰R : (A \times B) \to \mathcal{U} be a correspondence?. We define the property of RR being bijective as follows:

The above type could also be defined as

isBijective(R)( a:AisContr( b:BR(a,b)))×( b:BisContr( a:AR(a,b)))isBijective(R) \coloneqq \left(\prod_{a:A} \mathrm{isContr}\left(\sum_{b:B} R(a,b)\right)\right) \times \left(\prod_{b:B} \mathrm{isContr}\left(\sum_{a:A} R(a,b)\right)\right)
isequiv(f) b:BisContr(fiber(f))isequiv(f) \equiv \prod_{b:B} isContr(fiber(f))

We define the type of equivalences from AA to BB as

where fiber(f,b)fiber(f, b) is the fiber of ff over a term b:Bb:B

(AB) R:(A×B)𝒰isBijective(R)(A \simeq B) \equiv \sum_{R : (A \times B) \to \mathcal{U}} isBijective(R)

We define the type of equivalences from AA to BB as

Contractible fibers

(AB) f:ABisequiv(f)(A \simeq B) \equiv \sum_{f : A \to B} isequiv(f)

Bi-invertible maps

or, phrased differently, the type of witnesses to AA and BB being equivalent types.

Quasi-inverses

Properties

Half adjoint equivalences

Every equivalence is a 00-monic function.

Examples

  • Every bijective relation is an equivalence.

See also

References

Revision on April 29, 2022 at 15:52:58 by Anonymous?. See the history of this page for a list of all contributions to it.