Structure

category of sets equipped with a symmetric irreflexive binary relation

Notation Binsymm,irr\Bin_{\symm,\irr} Alternative notation Graph\Graph Objects pairs (X,R)(X,R), where XX is a set and R⊆X×XR \subseteq X \times X is a symmetric irreflexive 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\Bin_{\symm}, Binsymm,refl\Bin_{\symm,\refl}, Binirr\Bin_{\irr}, Binrefl\Bin_{\refl}, Quiv\Quiv

Satisfied properties

Assigned properties (12)

Deduced properties (57)

Unsatisfied properties

Assigned properties (6)

Deduced properties (145)*

*This also uses the deduced satisfied properties.

Unknown properties

All 220 category properties are decided, 202 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 symmetric irreflexive binary relation. This indicates that the data may be incomplete or that a distinguishing property may be missing from the database.

Comments