Purchase Solution

Equivalence Relation on the set R of all Real Numbers

Not what you're looking for?

Ask Custom Question

Show that == (where == is the equivalence relation defined below) is an equivalence on A, and find a (well-defined) bijection %: A== -> B, where

(a) A = R (the set of all real numbers)

(b) B={x: x is an element of R and 0 <= x < 1}

(c) for real numbers x and y, "x==y" (x is equivalent to y) if and only if x - y is an element of Z (the set of all integers)

(d) "A==" denotes the set of all equivalence classes

Purchase this Solution
Solution Summary

The solution consists of a review of what an equivalence relation is, a step-by-step proof that the given binary relation is indeed an equivalence relation, the definition of a mapping from the set of equivalence classes (for the given equivalence relation) to the set {x: x is a real number and 0 <= x < 1}, and a step-by-step proof that that mapping is a well-defined bijection.

Solution Preview

The following are the steps in the solution of this problem:

1. To show that == is an equivalence relation, we need to show that == is reflexive, symmetric, and transitive.

a. To show that == is reflexive, we show that for every real number x: x == x (i.e., x - x is in Z).

If x is any real number, then x - x = 0. Since 0 is in Z, we have x == x.

b. To show that == is symmetric, we show that for any real numbers x, y: if x == y (i.e., x - y is in Z), then y == x (i.e., y - x is in Z).

Let x and y be real numbers such that x==y. Then x - y is an integer. Let i = x - y. Then y - x = -(x - y) = -i. Since i is an integer, -i is also an integer, so y==x.

c. To show that == is transitive, we show that for any real numbers x, y, z: if x == y (i.e., x - y is in Z) and y == z (i.e., y - z is in Z), then x == z (i.e., x - z is in ...

Solution provided by:
Georgia Martin, PhD
Education
  • AB, Hood College
  • PhD, The Catholic University of America
  • PhD, The University of Maryland at College Park
Recent Feedback
  • "Thanks for your assistance. "
  • "Thank you. I understand now."
  • "Super - Thank You"
  • "Very clear. I appreciate your help. Thank you."
  • "Great. thank you so much!"
Purchase this Solution
Free BrainMass Quizzes
Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Probability Quiz

Some questions on probability

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

View More Free Quizzes
Related BrainMass Solutions

  • Equivalence Relation and Equivalence Sets

    147741 Equivalence Relation and Equivalence Sets Topology Sets and Functions (XLVI) Functions In the set R of all real numbers, let x ~ y means that x - y is an integer.

  • Equivalence Relations

    110998 Equivalence Relations H is the relation on the set of all people given by H = {(a,b)|a and b are the same height}. Is H an equivalence relation? Explain your answer.

  • Equivalence Relations

    11366 Equivalence Relations and Class Verify that each of the following are equivalence relations on the plane R^2 (where R are real numbers) and describe the equivalence classes geometrically. 1) (x1,y1)R(x2,y2) if and only if x1 = x2 2) (x1,y1

  • Equivalence relations, surjective maps, partitions and fibers.

    The subsets {-a; a}= f-1(y) are equivalence classes (or "fibers") containing two elements (excepting 0, which is a single element in its class) and they define a partition of set R (real numbers) into such a subsets, which can be denoted, for example

  • Set Relations Binary Relations

    F is the relation defined on Z as follows: for all m, n  Z, m F n  4 | (m - n). 10. Give a real-world example of a relation which is (and justify why it is): symmetric Relations 1.

  • Definitions of Equivalence & Groups

    Examples: all cyclic groups, the integers, the real numbers under addition, a subgroup of an abelian group. A non-abelian group not commutative. In non-abelian groups, the order in which the binary operation is performed matters.

  • Modular Arithmetic and Equivalence Relations

    If R an equivalence relation on S? 50.) Let S be the set of integers. If a, b ε S, define aRb if a + b is even. Prove that R is an equivalence relation and determine the equivalence classes of S.

  • Relations and partitions

    To show that R is an equivalence relation of the power set of S. We need to show that R is (a) Reflexive: For any Proof: For any is true trivially, as A and A have the same size.

  • Discrete Mathematics and Functions

    The edge (a,d) is from a to d and this edge works for transitivity. The other 4 edges work for reflexivity. Problem #5 There are two equivalent classes. One is the set of all white-color box and the other is the set of all black-color box.

View More Related Solutions