Given two binary relations $R$ and $S$ over sets $A$ and $B$,then $R$ is said to be contained in $S$ if $$\forall a,b: (a,b) \in R \implies (a,b) \in S$$
Moreover $R$ is considered to be smaller than $S$ if $R$ is contained in $S$,but $S$ is not contained in $R$,e.g.$$R ⊊ S$$
Wikipedia gives an example:
On the rational numbers, the relation $>$ is smaller than $≥$, and equal to the composition $> ∘ >$.
I don't understand the example,why $>$ is smaller than $≥$?
And what is the composition relation given by $> ∘ >$?
If $a>b$ then we also have $a\geq b$, so $>$ is contained in $\geq$. Additionally, $1$ is a rational number such that $1 \geq 1$ but $1\not>1$, so $>$ is smaller than $\geq$.
By transitivity, $a > b$ and $b > c$ implies $a > c$ so it follows that $> \circ >$ is contained in $>$. On the other hand, if $a>b$ where $a,b$ are rational, then $m = \frac{a+b}{2}$ is also rational and $a > m > b$, so $>$ is contained in $> \circ >$. Therefore, $> \circ >$ equals $>$.