Question

To determine an example of an irreflexive relation on the set of all people.

Short answer

The example is given for irreflexive relation.

Step-by-step solution

Given data

Consider a relation in a set.

Concept used of relation

A relation $\mathbf{\text{R}}$on a set $\mathbf{\text{A}}$is called reflexive if $\mathbf{(}\mathit{a}\mathbf{,}\mathit{a}\mathbf{)}\mathbf{\in }\mathit{R}$for every element $\mathit{a}\mathbf{\in }\mathit{A}$.

A relation $\mathbf{\text{R}}$on a set $\mathbf{\text{A}}$is called symmetric if $\mathbf{(}\mathit{b}\mathbf{,}\mathit{a}\mathbf{)}\mathbf{\in }\mathit{R}$whenever $\mathbf{(}\mathit{a}\mathbf{,}\mathit{b}\mathbf{)}\mathbf{\in }\mathit{R}$, for all $\mathit{a}\mathbf{,}\mathit{b}\mathbf{\in }\mathit{A}$

A relation $\mathbf{\text{R}}$on a set $\mathbf{\text{A}}$such that for all $\mathit{a}\mathbf{,}\mathit{b}\mathbf{\in }\mathit{A}$, if $\mathbf{(}\mathit{a}\mathbf{,}\mathit{b}\mathbf{)}\mathbf{\in }\mathit{R}$and $\mathbf{(}\mathit{b}\mathbf{,}\mathit{a}\mathbf{)}\mathbf{\in }\mathit{R}$then $\mathit{a}\mathbf{=}\mathit{b}$is called anti symmetric.

A relation $\mathbf{\text{R}}$on a set $\mathbf{\text{A}}$is called transitive if whenever $\mathbf{(}\mathit{a}\mathbf{,}\mathit{b}\mathbf{)}\mathbf{\in }\mathit{R}$and $\mathbf{(}\mathit{b}\mathbf{,}\mathit{c}\mathbf{)}\mathbf{\in }\mathit{R}$then $\mathbf{(}\mathit{a}\mathbf{,}\mathit{c}\mathbf{)}\mathbf{\in }\mathit{R}$for all $\mathit{a}\mathbf{,}\mathit{b}\mathbf{,}\mathit{c}\mathbf{\in }\mathit{A}$

Solve for relation

Let $R$be a relation on a set $S$. Then $R$is called Reflexive if for all $x\in S$we have $(x,x)\in R$. "Is the mother of" is a relation on the set of all people. This relation is irreflexive.