A binary relation is a way to specify which elements of one set are connected to which elements of another set. It formalizes ideas such as “divides,” “is adjacent to,” and “is greater than.”
For sets X and Y, their Cartesian product is
X×Y={(x,y)∣x∈X,y∈Y}.
Thus a relation is simply a selection of pairs from all possible pairs in X×Y. If (x,y)∈R, we say that x is related to y by R, and write xRy.
All flashcards
Active domain and range
The active domain contains first coordinates that occur in relation pairs; the range contains second coordinates that occur.
Homogeneous relation
A relation whose domain and codomain are the same set.
Functional relation
A relation in which each domain element is related to at most one codomain element.
Composition of relations
For R from X to Y and S from Y to Z,x(S∘R)z holds when some y∈Y satisfies xRy and ySz.
Reflexive closure
The smallest reflexive relation containing the given relation; it adds any missing pairs (x,x).
Quiz questions
What does the converse of a relation do to each ordered pair?Answer: It reverses the pair's coordinates.
A relation from X to Y is surjective when which condition holds?Answer: Every element of Y is related to at least one element of $X.
Which properties define an equivalence relation?Answer: Reflexivity, symmetry, and transitivity.
In a Boolean matrix representation of relations, what does Boolean matrix multiplication correspond to?Answer: Composition of relations.
How is an n-ary relation on sets X1,…,Xn defined?Answer: As a subset of X1×⋯×Xn.
Based on the Wikipedia article Binary relation, licensed CC BY-SA 4.0. Adapted into a summary, flashcards and quizzes.