nLab Rezk type

Definition

In simplicial type theory, a Segal type $A$ is a Rezk type if for all elements $x:A$ and $y:A$ there is an equivalence between the identity type $x =_A y$ and the type of isomorphisms in a Segal type $x \cong_A y$:

$$x:A, y:A \vdash \mathrm{RezkComplete}(x, y):\mathrm{isEquiv}(\mathrm{idToIso}(x, y))$$

where

$$\mathrm{idToIso}(x, y) \;\colon\; (x =_A y) \; \to \; (x \cong_A y)$$

$$\mathrm{idToIso}(x, y) \big( \mathrm{refl}_A(x) \big) \;\coloneqq\; \mathrm{id}_A(x)$$

Related concepts

• Segal type
• isomorphism in a Segal type
• discrete Segal type
• univalent category

References

• Emily Riehl, Michael Shulman, A type theory for synthetic $\infty$-categories $[$arXiv:1705.07442$]$