Structure

category of sets equipped with a reflexive binary relation

Notation Binrefl\Bin_{\refl} Alternative notation DiGraphrefl\DiGraph_{\refl} Objects pairs (X,R)(X,R), where XX is a set and R⊆X×XR \subseteq X \times X is a reflexive binary relation Morphisms A morphism (X,R)→(Y,S)(X,R) \to (Y,S) is a relation-preserving map, i.e. a map f:X→Yf : X \to Y such that (x,x′)∈R(x,x') \in R implies (f(x),f(x′))∈S(f(x),f(x')) \in S. Related Bin\Bin, Binsymm,refl\Bin_{\symm,\refl}, Binsymm\Bin_{\symm}, Binsymm,irr\Bin_{\symm,\irr}, Binirr\Bin_{\irr}, PreOrd\PreOrd

Satisfied properties

Assigned properties (11)

Deduced properties (110)

Unsatisfied properties

Assigned properties (2)

Deduced properties (97)*

*This also uses the deduced satisfied properties.

Unknown properties

All 220 category properties are decided, 207 of them by deduction.

—

Special objects

Special morphisms

Indistinguishable categories

These categories in the database currently have exactly the same properties as the category of sets equipped with a reflexive binary relation. This indicates that the data may be incomplete or that a distinguishing property may be missing from the database.

Comments