Type theory MOC
Typal equivalence
Let 𝐴,𝐵 be types.
A function 𝑓 :𝐴 →𝐵 is said to be an equivalence iff it has contractible fibres, #m/def/type i.e.
isEquiv(𝑓):=∏𝑥:𝐵isContr(∑𝑦:𝐴(𝑓𝑦≡𝐵𝑥))
Intuitively, this says that for every 𝑥 :𝐵 there exists a unique 𝑦 :𝐴 in its fibre.
We also refer to the type 𝐴 ≃𝐵 of equivalences between 𝐴 and 𝐵, so
𝐴≃𝐵:=∑𝑓:𝐴→𝐵isEquiv(𝑓)
#state/develop | #lang/en | #SemBr