(3) Proof that Q is transitive: Construct a proof by selecting sentences from the following scrambled list and putting them in the correct order. By definition of Q, (w, x) Q (y, z). By definition of Q, x = v and v = z. By definition of Q, w = u and u = y. By the transitive property of equality, x = Z. By definition of Q, (x, w) Q (z, y). By the transitive property of equality, w = y Proof: 1. Suppose (w, x), (u, v), and (y, z) are any ordered pairs of real numbers such that (w, x) Q (u, v) and (u, v) Q (y, z). Select--- 2. 3. 4. Select--- Select--- 5. Hence, Q is transitive. (4) Conclusion: Since Q is reflexive, symmetric, and transitive, it is an equivalence relation. (b) What are the distinct equivalence classes of Q? Each equivalence class has which of the following forms? O {(x, y) | x = b for some real number b} O {(x, y) | y= b for some real number b} O {(x, y) | x = y = b for some real number b} There are as many equivalence classes as there are which of the following? (Select all that apply.) ☐ distinct vertical lines in the plane ☐ distinct integers ☐ distinct horizontal lines in the plane ☐ distinct real numbers Define a relation Q on the set R x R as follows. For all ordered pairs (w, x) and (y, z) in Rx R, (w, x) Q (y, z) ⇒ x = z. (a) Prove that Q is an equivalence relation. To prove that Q is an equivalence relation, it is necessary to show that Q is reflexive, symmetric, and transitive. Proof that Q is an equivalence relation: (1) Proof that Q is reflexive: Construct a proof by selecting sentences from the following scrambled list and putting them in the correct order. By the symmetric property of equality, w = w. By the reflexive property of equality, x = x By the symmetric property of equality, x = x. By the reflexive property of equality, w = w. By definition of Q, (w, x) = (w, x). Proof: 1. Suppose (w, x) is any ordered pair of real numbers. 2. ---Select--- 3. ---Select--- 4. Hence, Q is reflexive. (2) Proof that Q is symmetric: Construct a proof by selecting sentences from the following scrambled list and putting them in the correct order. By definition of Q, (z, y) Q (x, w). By definition of Q, (y, z) Q (w, x). By the symmetric property of equality, y = w. By definition of Q, x = z. By the symmetric property of equality, z = x. By definition of Q, w = y. Proof: 1. Suppose (w, x) and (y, z) are any ordered pairs of real numbers such that (w, x) Q (y, z). 2. ---Select--- 3. Select--- 4. Select--- 5. Hence, Q is symmetric.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Question

need help

(3) Proof that Q is transitive:
Construct a proof by selecting sentences from the following scrambled list and putting them in the correct order.
By definition of Q, (w, x) Q (y, z).
By definition of Q, x = v and v = z.
By definition of Q, w = u and u = y.
By the transitive property of equality, x = Z.
By definition of Q, (x, w) Q (z, y).
By the transitive property of equality, w = y
Proof:
1. Suppose (w, x), (u, v), and (y, z) are any ordered pairs of real numbers such that (w, x) Q (u, v) and (u, v) Q (y, z).
Select---
2.
3.
4.
Select---
Select---
5. Hence, Q is transitive.
(4) Conclusion: Since Q is reflexive, symmetric, and transitive, it is an equivalence relation.
(b) What are the distinct equivalence classes of Q?
Each equivalence class has which of the following forms?
O {(x, y) | x = b for some real number b}
O {(x, y) | y= b for some real number b}
O {(x, y) | x = y = b for some real number b}
There are as many equivalence classes as there are which of the following? (Select all that apply.)
☐ distinct vertical lines in the plane
☐ distinct integers
☐ distinct horizontal lines in the plane
☐ distinct real numbers
Transcribed Image Text:(3) Proof that Q is transitive: Construct a proof by selecting sentences from the following scrambled list and putting them in the correct order. By definition of Q, (w, x) Q (y, z). By definition of Q, x = v and v = z. By definition of Q, w = u and u = y. By the transitive property of equality, x = Z. By definition of Q, (x, w) Q (z, y). By the transitive property of equality, w = y Proof: 1. Suppose (w, x), (u, v), and (y, z) are any ordered pairs of real numbers such that (w, x) Q (u, v) and (u, v) Q (y, z). Select--- 2. 3. 4. Select--- Select--- 5. Hence, Q is transitive. (4) Conclusion: Since Q is reflexive, symmetric, and transitive, it is an equivalence relation. (b) What are the distinct equivalence classes of Q? Each equivalence class has which of the following forms? O {(x, y) | x = b for some real number b} O {(x, y) | y= b for some real number b} O {(x, y) | x = y = b for some real number b} There are as many equivalence classes as there are which of the following? (Select all that apply.) ☐ distinct vertical lines in the plane ☐ distinct integers ☐ distinct horizontal lines in the plane ☐ distinct real numbers
Define a relation Q on the set R x R as follows.
For all ordered pairs (w, x) and (y, z) in Rx R, (w, x) Q (y, z) ⇒ x = z.
(a) Prove that Q is an equivalence relation.
To prove that Q is an equivalence relation, it is necessary to show that Q is reflexive, symmetric, and transitive.
Proof that Q is an equivalence relation:
(1) Proof that Q is reflexive:
Construct a proof by selecting sentences from the following scrambled list and putting them in the correct order.
By the symmetric property of equality, w = w.
By the reflexive property of equality, x = x
By the symmetric property of equality, x = x.
By the reflexive property of equality, w = w.
By definition of Q, (w, x) = (w, x).
Proof:
1. Suppose (w, x) is any ordered pair of real numbers.
2. ---Select---
3. ---Select---
4. Hence, Q is reflexive.
(2) Proof that Q is symmetric:
Construct a proof by selecting sentences from the following scrambled list and putting them in the correct order.
By definition of Q, (z, y) Q (x, w).
By definition of Q, (y, z) Q (w, x).
By the symmetric property of equality, y = w.
By definition of Q, x = z.
By the symmetric property of equality, z = x.
By definition of Q, w = y.
Proof:
1. Suppose (w, x) and (y, z) are any ordered pairs of real numbers such that (w, x) Q (y, z).
2. ---Select---
3. Select---
4.
Select---
5. Hence, Q is symmetric.
Transcribed Image Text:Define a relation Q on the set R x R as follows. For all ordered pairs (w, x) and (y, z) in Rx R, (w, x) Q (y, z) ⇒ x = z. (a) Prove that Q is an equivalence relation. To prove that Q is an equivalence relation, it is necessary to show that Q is reflexive, symmetric, and transitive. Proof that Q is an equivalence relation: (1) Proof that Q is reflexive: Construct a proof by selecting sentences from the following scrambled list and putting them in the correct order. By the symmetric property of equality, w = w. By the reflexive property of equality, x = x By the symmetric property of equality, x = x. By the reflexive property of equality, w = w. By definition of Q, (w, x) = (w, x). Proof: 1. Suppose (w, x) is any ordered pair of real numbers. 2. ---Select--- 3. ---Select--- 4. Hence, Q is reflexive. (2) Proof that Q is symmetric: Construct a proof by selecting sentences from the following scrambled list and putting them in the correct order. By definition of Q, (z, y) Q (x, w). By definition of Q, (y, z) Q (w, x). By the symmetric property of equality, y = w. By definition of Q, x = z. By the symmetric property of equality, z = x. By definition of Q, w = y. Proof: 1. Suppose (w, x) and (y, z) are any ordered pairs of real numbers such that (w, x) Q (y, z). 2. ---Select--- 3. Select--- 4. Select--- 5. Hence, Q is symmetric.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 1 steps with 2 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,