◀ ▲ ▶Branches / Set-theory / Definition: Reflexive, Symmetric and Transitive Binary Relations

If the two sets of a binary relation are in fact one and the same set, other properties become relevant. The following properties are fundamental to the concept of equivalence relations, which we will learn about later.

Definition: Reflexive, Symmetric and Transitive Binary Relations

Let \(V\) be a set and \(R\subseteq V\times V\) be a binary relation \(R\) is called:

1. reflexive, if \(xRx\) for all \(x\in V\)
2. symmetric, if from \(xRy\) it follows that $yRx$ for all \(x,y\in V\).
3. symmetric, if from \(xRy\) it follows that $yRx$ for all \(x,y\in V\).

Mentioned in:

Chapters: 1
Definitions: 2 3 4 5 6
Examples: 7 8
Explanations: 9 10
Proofs: 11 12 13 14 15 16
Propositions: 17 18
Solutions: 19

Thank you to the contributors under CC BY-SA 4.0!

Github: