Processing math: 100%

Reflexive relations

Abbreviation: RefRel

Definition

A \emph{reflexive relation} is a structure X=X,R such that R is a \emph{binary relation on X} (i.e. RX×X) that is

reflexive: xRx

Morphisms

Let X and Y be reflexive relations. A morphism from X to Y is a function h:AB that is a homomorphism: xRXyh(x)RYh(y)

Definition

Examples

Example 1:

Basic results

Properties

Finite members

$\begin{array}{lr}

f(1)= &1\\
f(2)= &\\
f(3)= &\\
f(4)= &\\
f(5)= &\\

\end{array}\begin{array}{lr}

f(6)= &\\
f(7)= &\\
f(8)= &\\
f(9)= &\\
f(10)= &\\

\end{array}$

Subclasses

Superclasses

Directed graphs supervariety

References


QR Code
QR Code reflexive_relations (generated for current page)