Recall Some Basic Facts and definition:
1.A binary relation on a set is said to be an Equivalence relation on if it satisfies the following conditions:
2.If and implies .
3. If then for all
SOLUTION:
Given a relation on defined by if and only if there are with and .
Claim: is an equivalence relation.
1. Reflexivity:
For we have and for every . That is, a reflexive relation.
2. Symmetry:
If then there are with and .
Now and implies . [just change the character of ]
So, is Symmetric relation.
3. Transitivity:
If and then there are with .
now .Also given that . These two together implies ___________(i)
. Also given that . these two together implies _______________(ii)
From (i) and (ii) we have and ,Since implies . This implies .
So, is Transitive.
Thus as equivalence relation. hence proved.
Define a relation < on Z by m <n iff |m| < |n| or (\m| = |n| 1 m <n) (a) Prove that < is a partial order on Z. (b) A partial order R on a set S is called a total order (or linear order) iff (Vx, Y ES)(x + y + ((x, y) E R V (y,x) E R)) Prove that is a total order on Z. (c) List the following elements in <-increasing order. –5, 2,...
9. Define R the binary relation on N x N to mean (a, b)R(c, d) iff b|d and alc (a) R is symmetric but not reflexive. (b) R is transitive and symmetric but not reflexive (c) R is reflexive and transitive but not symmetric (d) None of the above 10. Let R be an equivalence relation on a nonempty and finite 9. Define R the binary relation on N x N to mean (a, b)R(c, d) iff b|d and alc...
2. Consider the relation E on Z defined by E n, m) n+ m is even} equivalence relation (a) Prove that E is an (b) Let n E Z. Find [n]. equivalence relation in [N, the equivalence class of 3. We defined a relation on sets A B. Prove that this relation is an (In this view, countable sets the natural numbers under this equivalence relation). exactly those that are are 2. Consider the relation E on Z defined by...
Show the following is an equivalence relation: Define the relation ∼ on Z by a ∼ b iff a − b = 7k for some k ∈ Z. Then ∼ is an equivalence relation
Let R be the relation defined on Z (integers): a R b iff a + b is even. R is an equivalence relation since R is: Group of answer choices Reflexive, Symmetric and Transitive Symmetric and Reflexive or Transitive Reflexive or Transitive Symmetric and Transitive None of the above
Let R be the relation on N defined by xRy iff 2 divides x+y. R is an equivalence relation. You do not have to prove that R is an equivalence relation. True or False: 3 ∈ 4/R.
Let R be the relation defined on Z (integers): a R b iff a + b is even. Then the distinct equivalence classes are: Group of answer choices [1] = multiples of 3 [2] = multiples of 4 [0] = even integers and [1] = the odd integers all the integers None of the above
(10) Define a relation R on Zn (the integers mod n) as follows: lal isR related to [b (i.e. [an Rbn) iff there is [cn E Gn such that a b (a) Show that R is an equivalence relation on Zn (b) Give all the equivalence classes for R when n-12.
2. Let f : A ! B. DeÖne a relation R on A by xRy i§ f (x) = f (y). a. Prove that R is an equivalence relation on A. b. Let Ex = fy 2 A : xRyg be the equivalence class of x 2 A. DeÖne E = fEx : x 2 Ag to be the collection of all equivalence classes. Prove that the function g : A ! E deÖned by g (x) = Ex is...
4. Let S = {1,2,3). Define a relation R on SxS by (a, b)R(c,d) iff a <c and b <d, where is the usual less or equal to on the integers. a. Prove that R is a partial order. Is R a linear order? b. Draw the poset diagram of R.