Discrete Math - Relations
A relation from set S to set T is a subset of the cartesian product of S and T. R is a relation from S to T iff R⊆(S×T). It is also a subset of the cartesian plane. A binary relation is a relation between 2 sets, this is the most common relation in natural language. The most common example is the following: All coins have an associated value, (∀x)(∃y)Pxy⊆(Coins×Value),I(P)={(Penny,1),(Nickle,5),(Dime,10),(Quarter,25)}.
- A is the domain of R, where $ A_1⊆A $
- B is the codomain of R, where $ B_1⊆B, B_1 $ is the range of R.
We can represent this where certain sets have elements which map onto each other.
Figure 37
The image is the elements in the range. The pre-image is the elements in the domain used in the relation. Relations allow for more than 1 image per pre-image (unlike functions). If (x,y) are in relation R, we can write: xRy, or R(x,y).
An inverse takes a relation between (x,y), and inverts it to (y,x). It can also be written as, R^(-1)={(y,x)|(x,y)∈R}.
A relation R on S is anti-symmetric iff for every x and y in S, if (x,y) is in R and (y,x) is in R, then x is identical to y. In other words, xRy and yRx together imply that x=y.
Instead of stating a relation between A to B, we can look at relations of A to itself. A relation is reflexive if it relates to itself, or xRx,∀x∈A. In the following directed graph, all elements are related to itself, so all elements are reflexive:
Figure 39
A relation on A is symmetric if xRy, then yRx (given ∀x,y∈A).
Figure 40
A relation on A is transitive if xRy∧yRz, then xRz (given ∀x,y,z∈A).
Figure 41
An equivalence relation on a set is a relation that is reflexive, symmetric, and transitive. Example: 3 is equal to 3 where are equal on different sides.
Comments
Post a Comment