Yet another category of setoids with equality on objects

preprint2013arXivOpen access

Abstract

When formalizing mathematics in (generalized predicative) constructive type theories, or more practically in proof assistants such as Coq or Agda, one is often using setoids (types with explicit equivalence relations). In this note we consider two categories of setoids with equality on objects and show that they are isomorphic. Both categories are constructed from a fixed proof-irrelevant family FF of setoids. The objects of the categories are the index setoid II of the family, whereas the definition of arrows differs. The first category has for arrows triples (a,b,f:F(a)→F(b))(a,b,f:F(a) \to F(b)) where ff is an extensional function. Two such arrows are identified if appropriate composition with transportation maps (given by FF) makes them equal. In the second category the arrows are triples (a,b,R↪Σ(I,F)2)(a,b,R \hookrightarrow Σ(I,F)^2) where RR is a total functional relation between the subobjects F(a),F(b)↪Σ(I,F)F(a), F(b) \hookrightarrow Σ(I,F) of the setoid sum of the family. This category is simpler to use as the transportation maps disappear. Moreover we also show that the full image of a category along an E-functor into an E-category is category.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.