Subsection 7.1.1 (00TL): Foundations

Preferences

Font:

PDF Style:

Here's a breakdown of the differences between each PDF style:

Style	Class	Font	Theorem Environments
Style 1	`book`	Alegreya Sans	`tcbthm`
Style 2	`book`	Alegreya Sans	`amsthm`
Style 3	`book`	Arno*	`amsthm`
Style 4	`book`	Computer Modern	`amsthm`

*To be replaced with Linus Romer's Elemaints when it is released.

Let $A$ be a set.

A reflexive relation is equivalently:^[1]

An $\mathbb {E}_{0}$-monoid in $\webleft (\mathrm{N}_{\bullet }\webleft (\mathbf{Rel}\webleft (A,A\webright )\webright ),\chi _{A}\webright )$.
A pointed object in $\webleft (\mathbf{Rel}\webleft (A,A\webright ),\chi _{A}\webright )$.

In detail, a relation $R$ on $A$ is reflexive if we have an inclusion

\[ \eta _{R}\colon \chi _{A}\subset R \]

of relations in $\mathbf{Rel}\webleft (A,A\webright )$, i.e. if, for each $a\in A$, we have $a\sim _{R}a$.

Let $A$ be a set.

The set of reflexive relations on $A$ is the subset $\smash {\mathrm{Rel}^{\mathrm{refl}}\webleft (A,A\webright )}$ of $\mathrm{Rel}\webleft (A,A\webright )$ spanned by the reflexive relations.
The poset of relations on $A$ is is the subposet $\smash {\mathbf{Rel}^{\mathsf{refl}}\webleft (A,A\webright )}$ of $\mathbf{Rel}\webleft (A,A\webright )$ spanned by the reflexive relations.

Let $R$ and $S$ be relations on $A$.

Interaction With Inverses. If $R$ is reflexive, then so is $R^{\dagger }$.
Interaction With Composition. If $R$ and $S$ are reflexive, then so is $S\mathbin {\diamond }R$.

Proof of Proposition 7.1.1.1.4.

Item 1: Interaction With Inverses

Clear.

Item 2: Interaction With Composition

Clear.