<exercises xml:id="exercises-sets" xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<title>Exercises</title>
<subexercises>
<title>Warm-up</title>
<introduction>
<p>
This is a meaningless subdivision of the exercises for the sake of testing output.
</p>
</introduction>
<exercisegroup cols="2">
<introduction>
<p>
Suppose that
<md>
<mrow>A & = \{ x : x \in \mathbb N \text{ and } x \text{ is even} \},</mrow>
<mrow>B & = \{x : x \in \mathbb N \text{ and } x \text{ is prime}\},</mrow>
<mrow>C & = \{ x : x \in \mathbb N \text{ and } x \text{ is a multiple of 5}\}.</mrow>
</md>
</p>
<p>
Describe each of the following sets.
</p>
</introduction>
<exercise>
<statement>
<p>
<m>A \cap B</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>B \cap C</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>A \cup B</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>A \cap (B \cup C)</m>
</p>
</statement>
</exercise>
</exercisegroup>
<exercise>
<introduction>
<p>
If <m>A = \{ a, b, c \}</m>, <m>B = \{ 1, 2, 3 \}</m>, <m>C = \{ x \}</m>, and <m>D = \emptyset</m>, list all of the elements in each of the following sets.
</p>
</introduction>
<task>
<statement>
<p>
<m>A \times B</m>
</p>
</statement>
<hint>
<p>
<m>A \times B = \{ (a,1), (a,2), (a,3), (b,1), (b,2), (b,3), (c,1), (c,2), (c,3) \}</m>
</p>
</hint>
</task>
<task>
<statement>
<p>
<m>B \times A</m>
</p>
</statement>
</task>
<task>
<statement>
<p>
<m>A \times B \times C</m>
</p>
</statement>
</task>
<task>
<statement>
<p>
<m>A \times D</m>
</p>
</statement>
<hint>
<p>
<m>A \times D = \emptyset</m>
</p>
</hint>
</task>
</exercise>
<exercise>
<statement>
<p>
Find an example of two nonempty sets <m>A</m> and <m>B</m> for which <m>A \times B = B \times A</m> is true.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \cup \emptyset = A</m> and <m>A \cap \emptyset = \emptyset</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \cup B = B \cup A</m> and <m>A \cap B = B \cap A</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \cup (B \cap C) = (A \cup B) \cap (A \cup C)</m>.
</p>
</statement>
<hint>
<p>
If <m>x \in A \cup (B \cap C)</m>, then either <m>x \in A</m> or <m>x \in B \cap C</m>.
Thus, <m> x \in A \cup B</m> and <m>A \cup C</m>.
Hence, <m> x \in (A \cup B) \cap (A \cup C)</m>.
Therefore, <m> A \cup (B \cap C) \subset (A \cup B) \cap (A \cup C)</m>.
Conversely, if <m>x \in (A \cup B) \cap (A \cup C)</m>, then <m>x \in A \cup B</m> and <m>A \cup C</m>.
Thus, <m>x \in A</m> or <m>x</m> is in both <m>B</m> and <m>C</m>.
So <m>x \in A \cup (B \cap C)</m> and therefore <m>(A \cup B) \cap (A \cup C) \subset A \cup (B \cap C)</m>.
Hence, <m>A \cup (B \cap C) = (A \cup B) \cap (A \cup C)</m>.
</p>
</hint>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \cap (B \cup C) = (A \cap B) \cup (A \cap C)</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \subset B</m> if and only if <m>A \cap B = A</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>(A \cap B)' = A' \cup B'</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \cup B = (A \cap B) \cup (A \setminus B) \cup (B \setminus A)</m>.
</p>
</statement>
<hint>
<p>
<m>(A \cap B) \cup (A \setminus B) \cup (B \setminus A) = (A \cap B) \cup (A \cap B') \cup (B \cap A') = [A \cap (B \cup B')] \cup (B \cap A') = A \cup (B \cap A') = (A \cup B) \cap (A \cup A') = A \cup B</m>.
</p>
</hint>
</exercise>
<exercise>
<statement>
<p>
Prove <m>(A \cup B) \times C = (A \times C ) \cup (B \times C)</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>(A \cap B) \setminus B = \emptyset</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>(A \cup B) \setminus B = A \setminus B</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \setminus (B \cup C) = (A \setminus B) \cap (A \setminus C)</m>.
</p>
</statement>
<hint>
<p>
<m>A \setminus (B \cup C) = A \cap (B \cup C)' = (A \cap A) \cap (B' \cap C') = (A \cap B') \cap (A \cap C') = (A \setminus B) \cap (A \setminus C)</m>.
</p>
</hint>
</exercise>
</subexercises> <subexercises>
<title>More Exercises</title>
<introduction>
<p>
This is a meaningless subdivision of the exercises for the sake of testing output.
</p>
</introduction>
<exercise>
<statement>
<p>
Prove <m>A \cap (B \setminus C) = (A \cap B) \setminus (A \cap C)</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>(A \setminus B) \cup (B \setminus A) = (A \cup B) \setminus (A \cap B)</m>.
</p>
</statement>
</exercise>
<exercisegroup cols="2">
<introduction>
<p>
Which of the following relations <m>f: {\mathbb Q} \rightarrow {\mathbb Q}</m> define a mapping? In each case, supply a reason why <m>f</m> is or is not a mapping.
</p>
</introduction>
<exercise>
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{p+ 1}{p - 2}</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{3p}{3q}</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{p+q}{q^2}</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{3 p^2}{7 q^2} - \frac{p}{q}</m>
</p>
</statement>
</exercise>
</exercisegroup>
<exercise>
<introduction>
<p>
Determine which of the following functions are one-to-one and which are onto.
If the function is not onto, determine its range.
</p>
</introduction>
<task>
<statement>
<p>
<m>f: {\mathbb R} \rightarrow {\mathbb R}</m> defined by <m>f(x) = e^x</m>
</p>
</statement>
<hint>
<p>
<m>f</m> is one-to-one but not onto. <m>f({\mathbb R} ) = \{ x \in {\mathbb R} : x \gt 0 \}</m>.
</p>
</hint>
</task>
<task>
<statement>
<p>
<m>f: {\mathbb Z} \rightarrow {\mathbb Z}</m> defined by <m>f(n) = n^2 + 3</m>
</p>
</statement>
</task>
<task>
<statement>
<p>
<m>f: {\mathbb R} \rightarrow {\mathbb R}</m> defined by <m>f(x) = \sin x</m>
</p>
</statement>
<hint>
<p>
<m>f</m> is neither one-to-one nor onto. <m>f(\mathbb R) = \{ x : -1 \leq x \leq 1 \}</m>.
</p>
</hint>
</task>
<task>
<statement>
<p>
<m>f: {\mathbb Z} \rightarrow {\mathbb Z}</m> defined by <m>f(x) = x^2</m>
</p>
</statement>
</task>
</exercise>
<exercise>
<statement>
<p>
Let <m>f :A \rightarrow B</m> and <m>g : B \rightarrow C</m> be invertible mappings; that is, mappings such that <m>f^{-1}</m> and <m>g^{-1}</m> exist.
Show that <m>(g \circ f)^{-1} =f^{-1} \circ g^{-1}</m>.
</p>
</statement>
</exercise>
<exercise>
<task>
<statement>
<p>
Define a function <m>f: {\mathbb N} \rightarrow {\mathbb N}</m> that is one-to-one but not onto.
</p>
</statement>
<hint>
<p>
<m>f(n) = n + 1</m>.
</p>
</hint>
</task>
<task>
<statement>
<p>
Define a function <m>f: {\mathbb N} \rightarrow {\mathbb N}</m> that is onto but not one-to-one.
</p>
</statement>
</task>
</exercise>
<exercise>
<statement>
<p>
Prove the relation defined on <m>{\mathbb R}^2</m> by <m>(x_1, y_1 ) \sim (x_2, y_2)</m> if <m>x_1^2 + y_1^2 = x_2^2 + y_2^2</m> is an equivalence relation.
</p>
</statement>
</exercise>
<exercise>
<introduction>
<p>
Let <m>f : A \rightarrow B</m> and <m>g : B \rightarrow C</m> be maps.
</p>
</introduction>
<task>
<statement>
<p>
If <m>f</m> and <m>g</m> are both one-to-one functions, show that <m>g \circ f</m> is one-to-one.
</p>
</statement>
<hint>
<p>
Let <m>x, y \in A</m>.
Then <m>g(f(x)) = (g \circ f)(x) = (g \circ f)(y) = g(f(y))</m>.
Thus, <m>f(x) = f(y)</m> and <m>x = y</m>, so <m>g \circ f</m> is one-to-one.
</p>
</hint>
</task>
<task>
<statement>
<p>
If <m>g \circ f</m> is onto, show that <m>g</m> is onto.
</p>
</statement>
<hint>
<p>
Let <m>c \in C</m>, then <m>c = (g \circ f)(x) = g(f(x))</m> for some <m>x \in A</m>.
Since <m>f(x) \in B</m>, <m>g</m> is onto.
</p>
</hint>
</task>
<task>
<statement>
<p>
If <m>g \circ f</m> is one-to-one, show that <m>f</m> is one-to-one.
</p>
</statement>
</task>
<task>
<statement>
<p>
If <m>g \circ f</m> is one-to-one and <m>f</m> is onto, show that <m>g</m> is one-to-one.
</p>
</statement>
</task>
<task>
<statement>
<p>
If <m>g \circ f</m> is onto and <m>g</m> is one-to-one, show that <m>f</m> is onto.
</p>
</statement>
</task>
</exercise>
<exercise>
<statement>
<p>
Define a function on the real numbers by
<md>
f(x) = \frac{x + 1}{x - 1}.
</md>
What are the domain and range of <m>f</m>? What is the inverse of <m>f</m>? Compute <m>f \circ f^{-1}</m> and <m>f^{-1} \circ f</m>.
</p>
</statement>
<!-- commented out for testing, so that only even hints, answers, solutions may appear in the "solutions" --> <!--
<hint>
<p>
<m>f^{-1}(x) = (x+1)/(x-1)</m>.
</p>
</hint>
-->
</exercise>
<exercise>
<introduction>
<p>
Let <m>f: X \rightarrow Y</m> be a map with <m>A_1, A_2 \subset X</m> and <m>B_1, B_2 \subset Y</m>.
</p>
</introduction>
<task>
<statement>
<p>
Prove <m>f( A_1 \cup A_2 ) = f( A_1) \cup f( A_2 )</m>.
</p>
</statement>
<hint>
<p>
Let <m>y \in f(A_1 \cup A_2)</m>.
Then there exists an <m>x \in A_1 \cup A_2</m> such that <m>f(x) = y</m>.
Hence, <m> y \in f(A_1)</m> or <m>f(A_2) </m>.
Therefore, <m> y \in f(A_1) \cup f(A_2)</m>.
Consequently, <m> f(A_1 \cup A_2) \subset f(A_1) \cup f(A_2)</m>.
Conversely, if <m>y \in f(A_1) \cup f(A_2)</m>, then <m> y \in f(A_1)</m> or <m>f(A_2)</m>.
Hence, there exists an <m>x \in A_1</m> or there exists an <m>x \in A_2</m> such that <m>f(x) = y</m>.
Thus, there exists an <m>x \in A_1 \cup A_2</m> such that <m>f(x) = y</m>.
Therefore, <m> f(A_1) \cup f(A_2) \subset f(A_1 \cup A_2)</m>, and <m>f(A_1 \cup A_2) = f(A_1) \cup f(A_2)</m>.
</p>
</hint>
</task>
<task>
<statement>
<p>
Prove <m>f( A_1 \cap A_2 ) \subset f( A_1) \cap f( A_2 )</m>.
Give an example in which equality fails.
</p>
</statement>
</task>
<task>
<statement>
<p>
Prove <m>f^{-1}( B_1 \cup B_2 ) = f^{-1}( B_1) \cup f^{-1}(B_2 )</m>, where
<md>
f^{-1}(B) = \{ x \in X : f(x) \in B \}.
</md>
</p>
</statement>
</task>
<task>
<statement>
<p>
Prove <m>f^{-1}( B_1 \cap B_2 ) = f^{-1}( B_1) \cap f^{-1}( B_2 )</m>.
</p>
</statement>
</task>
<task>
<statement>
<p>
Prove <m>f^{-1}( Y \setminus B_1 ) = X \setminus f^{-1}( B_1)</m>.
</p>
</statement>
</task>
</exercise>
<exercisegroup cols="2">
<introduction>
<p>
Determine whether or not the following relations are equivalence relations on the given set.
If the relation is an equivalence relation, describe the partition given by it.
If the relation is not an equivalence relation, state why it fails to be one.
</p>
</introduction>
<exercise>
<statement>
<p>
<m>x \sim y</m> in <m>{\mathbb R}</m> if <m>x \geq y</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>m \sim n</m> in <m>{\mathbb Z}</m> if <m>mn > 0</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>x \sim y</m> in <m>{\mathbb R}</m> if <m>|x - y| \leq 4</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>m \sim n</m> in <m>{\mathbb Z}</m> if <m>m \equiv n \pmod{6}</m>
</p>
</statement>
</exercise>
</exercisegroup>
<exercise>
<statement>
<p>
Define a relation <m>\sim</m> on <m>{\mathbb R}^2</m> by stating that <m>(a, b) \sim (c, d)</m> if and only if <m>a^2 + b^2 \leq c^2 + d^2</m>.
Show that <m>\sim</m> is reflexive and transitive but not symmetric.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Show that an <m>m \times n</m> matrix gives rise to a well-defined map from <m>{\mathbb R}^n</m> to <m>{\mathbb R}^m</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Find the error in the following argument by providing a counterexample.
<q>The reflexive property is redundant in the axioms for an equivalence relation.
If <m>x \sim y</m>, then <m>y \sim x</m> by the symmetric property.
Using the transitive property, we can deduce that <m>x \sim x</m>.</q>
</p>
</statement>
<hint>
<p>
Let <m>X = {\mathbb N} \cup \{ \sqrt{2}\, \}</m> and define <m>x \sim y</m> if <m>x + y \in {\mathbb N}</m>.
</p>
</hint>
</exercise>
<exercise>
<title>Projective Real Line</title>
<statement>
<p>
Define a relation on <m>{\mathbb R}^2 \setminus \{ (0,0) \}</m> by letting <m>(x_1, y_1) \sim (x_2, y_2)</m> if there exists a nonzero real number <m>\lambda</m> such that <m>(x_1, y_1) = ( \lambda x_2, \lambda y_2)</m>.
Prove that <m>\sim</m> defines an equivalence relation on <m>{\mathbb R}^2 \setminus (0,0)</m>.
What are the corresponding equivalence classes? This equivalence relation defines the projective line, denoted by <m>{\mathbb P}({\mathbb R}) </m>, which is very important in geometry.
</p>
</statement>
</exercise>
</subexercises> </exercises>
Exercises 1.4 Exercises
View Source for exercises
Warm-up
View Source for subexercises
<subexercises xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<title>Warm-up</title>
<introduction>
<p>
This is a meaningless subdivision of the exercises for the sake of testing output.
</p>
</introduction>
<exercisegroup cols="2">
<introduction>
<p>
Suppose that
<md>
<mrow>A & = \{ x : x \in \mathbb N \text{ and } x \text{ is even} \},</mrow>
<mrow>B & = \{x : x \in \mathbb N \text{ and } x \text{ is prime}\},</mrow>
<mrow>C & = \{ x : x \in \mathbb N \text{ and } x \text{ is a multiple of 5}\}.</mrow>
</md>
</p>
<p>
Describe each of the following sets.
</p>
</introduction>
<exercise>
<statement>
<p>
<m>A \cap B</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>B \cap C</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>A \cup B</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>A \cap (B \cup C)</m>
</p>
</statement>
</exercise>
</exercisegroup>
<exercise>
<introduction>
<p>
If <m>A = \{ a, b, c \}</m>, <m>B = \{ 1, 2, 3 \}</m>, <m>C = \{ x \}</m>, and <m>D = \emptyset</m>, list all of the elements in each of the following sets.
</p>
</introduction>
<task>
<statement>
<p>
<m>A \times B</m>
</p>
</statement>
<hint>
<p>
<m>A \times B = \{ (a,1), (a,2), (a,3), (b,1), (b,2), (b,3), (c,1), (c,2), (c,3) \}</m>
</p>
</hint>
</task>
<task>
<statement>
<p>
<m>B \times A</m>
</p>
</statement>
</task>
<task>
<statement>
<p>
<m>A \times B \times C</m>
</p>
</statement>
</task>
<task>
<statement>
<p>
<m>A \times D</m>
</p>
</statement>
<hint>
<p>
<m>A \times D = \emptyset</m>
</p>
</hint>
</task>
</exercise>
<exercise>
<statement>
<p>
Find an example of two nonempty sets <m>A</m> and <m>B</m> for which <m>A \times B = B \times A</m> is true.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \cup \emptyset = A</m> and <m>A \cap \emptyset = \emptyset</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \cup B = B \cup A</m> and <m>A \cap B = B \cap A</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \cup (B \cap C) = (A \cup B) \cap (A \cup C)</m>.
</p>
</statement>
<hint>
<p>
If <m>x \in A \cup (B \cap C)</m>, then either <m>x \in A</m> or <m>x \in B \cap C</m>.
Thus, <m> x \in A \cup B</m> and <m>A \cup C</m>.
Hence, <m> x \in (A \cup B) \cap (A \cup C)</m>.
Therefore, <m> A \cup (B \cap C) \subset (A \cup B) \cap (A \cup C)</m>.
Conversely, if <m>x \in (A \cup B) \cap (A \cup C)</m>, then <m>x \in A \cup B</m> and <m>A \cup C</m>.
Thus, <m>x \in A</m> or <m>x</m> is in both <m>B</m> and <m>C</m>.
So <m>x \in A \cup (B \cap C)</m> and therefore <m>(A \cup B) \cap (A \cup C) \subset A \cup (B \cap C)</m>.
Hence, <m>A \cup (B \cap C) = (A \cup B) \cap (A \cup C)</m>.
</p>
</hint>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \cap (B \cup C) = (A \cap B) \cup (A \cap C)</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \subset B</m> if and only if <m>A \cap B = A</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>(A \cap B)' = A' \cup B'</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \cup B = (A \cap B) \cup (A \setminus B) \cup (B \setminus A)</m>.
</p>
</statement>
<hint>
<p>
<m>(A \cap B) \cup (A \setminus B) \cup (B \setminus A) = (A \cap B) \cup (A \cap B') \cup (B \cap A') = [A \cap (B \cup B')] \cup (B \cap A') = A \cup (B \cap A') = (A \cup B) \cap (A \cup A') = A \cup B</m>.
</p>
</hint>
</exercise>
<exercise>
<statement>
<p>
Prove <m>(A \cup B) \times C = (A \times C ) \cup (B \times C)</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>(A \cap B) \setminus B = \emptyset</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>(A \cup B) \setminus B = A \setminus B</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>A \setminus (B \cup C) = (A \setminus B) \cap (A \setminus C)</m>.
</p>
</statement>
<hint>
<p>
<m>A \setminus (B \cup C) = A \cap (B \cup C)' = (A \cap A) \cap (B' \cap C') = (A \cap B') \cap (A \cap C') = (A \setminus B) \cap (A \setminus C)</m>.
</p>
</hint>
</exercise>
</subexercises>
This is a meaningless subdivision of the exercises for the sake of testing output.
Exercise Group.
View Source for exercisegroup
<exercisegroup cols="2" xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<introduction>
<p>
Suppose that
<md>
<mrow>A & = \{ x : x \in \mathbb N \text{ and } x \text{ is even} \},</mrow>
<mrow>B & = \{x : x \in \mathbb N \text{ and } x \text{ is prime}\},</mrow>
<mrow>C & = \{ x : x \in \mathbb N \text{ and } x \text{ is a multiple of 5}\}.</mrow>
</md>
</p>
<p>
Describe each of the following sets.
</p>
</introduction>
<exercise>
<statement>
<p>
<m>A \cap B</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>B \cap C</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>A \cup B</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>A \cap (B \cup C)</m>
</p>
</statement>
</exercise>
</exercisegroup>
Suppose that
\begin{align*}
A & = \{ x : x \in \mathbb N \text{ and } x \text{ is even} \},\\
B & = \{x : x \in \mathbb N \text{ and } x \text{ is prime}\},\\
C & = \{ x : x \in \mathbb N \text{ and } x \text{ is a multiple of 5}\}.
\end{align*}
Describe each of the following sets.
1.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>A \cap B</m>
</p>
</statement>
</exercise>
\(A \cap B\)
2.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>B \cap C</m>
</p>
</statement>
</exercise>
\(B \cap C\)
3.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>A \cup B</m>
</p>
</statement>
</exercise>
\(A \cup B\)
4.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>A \cap (B \cup C)</m>
</p>
</statement>
</exercise>
\(A \cap (B \cup C)\)
5.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<introduction>
<p>
If <m>A = \{ a, b, c \}</m>, <m>B = \{ 1, 2, 3 \}</m>, <m>C = \{ x \}</m>, and <m>D = \emptyset</m>, list all of the elements in each of the following sets.
</p>
</introduction>
<task>
<statement>
<p>
<m>A \times B</m>
</p>
</statement>
<hint>
<p>
<m>A \times B = \{ (a,1), (a,2), (a,3), (b,1), (b,2), (b,3), (c,1), (c,2), (c,3) \}</m>
</p>
</hint>
</task>
<task>
<statement>
<p>
<m>B \times A</m>
</p>
</statement>
</task>
<task>
<statement>
<p>
<m>A \times B \times C</m>
</p>
</statement>
</task>
<task>
<statement>
<p>
<m>A \times D</m>
</p>
</statement>
<hint>
<p>
<m>A \times D = \emptyset</m>
</p>
</hint>
</task>
</exercise>
If \(A = \{ a, b, c \}\text{,}\) \(B = \{ 1, 2, 3 \}\text{,}\) \(C = \{ x \}\text{,}\) and \(D = \emptyset\text{,}\) list all of the elements in each of the following sets.
(a)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>A \times B</m>
</p>
</statement>
<hint>
<p>
<m>A \times B = \{ (a,1), (a,2), (a,3), (b,1), (b,2), (b,3), (c,1), (c,2), (c,3) \}</m>
</p>
</hint>
</task>
\(A \times B\)
Hint.
View Source for hint
<hint xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<p>
<m>A \times B = \{ (a,1), (a,2), (a,3), (b,1), (b,2), (b,3), (c,1), (c,2), (c,3) \}</m>
</p>
</hint>
\(A \times B = \{ (a,1), (a,2), (a,3), (b,1), (b,2), (b,3), (c,1), (c,2), (c,3) \}\)
(b)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>B \times A</m>
</p>
</statement>
</task>
\(B \times A\)
(c)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>A \times B \times C</m>
</p>
</statement>
</task>
\(A \times B \times C\)
(d)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>A \times D</m>
</p>
</statement>
<hint>
<p>
<m>A \times D = \emptyset</m>
</p>
</hint>
</task>
\(A \times D\)
Hint.
View Source for hint
<hint xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<p>
<m>A \times D = \emptyset</m>
</p>
</hint>
\(A \times D = \emptyset\)
6.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Find an example of two nonempty sets <m>A</m> and <m>B</m> for which <m>A \times B = B \times A</m> is true.
</p>
</statement>
</exercise>
Find an example of two nonempty sets \(A\) and \(B\) for which \(A \times B = B \times A\) is true.
7.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>A \cup \emptyset = A</m> and <m>A \cap \emptyset = \emptyset</m>.
</p>
</statement>
</exercise>
Prove \(A \cup \emptyset = A\) and \(A \cap \emptyset = \emptyset\text{.}\)
8.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>A \cup B = B \cup A</m> and <m>A \cap B = B \cap A</m>.
</p>
</statement>
</exercise>
Prove \(A \cup B = B \cup A\) and \(A \cap B = B \cap A\text{.}\)
9.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>A \cup (B \cap C) = (A \cup B) \cap (A \cup C)</m>.
</p>
</statement>
<hint>
<p>
If <m>x \in A \cup (B \cap C)</m>, then either <m>x \in A</m> or <m>x \in B \cap C</m>.
Thus, <m> x \in A \cup B</m> and <m>A \cup C</m>.
Hence, <m> x \in (A \cup B) \cap (A \cup C)</m>.
Therefore, <m> A \cup (B \cap C) \subset (A \cup B) \cap (A \cup C)</m>.
Conversely, if <m>x \in (A \cup B) \cap (A \cup C)</m>, then <m>x \in A \cup B</m> and <m>A \cup C</m>.
Thus, <m>x \in A</m> or <m>x</m> is in both <m>B</m> and <m>C</m>.
So <m>x \in A \cup (B \cap C)</m> and therefore <m>(A \cup B) \cap (A \cup C) \subset A \cup (B \cap C)</m>.
Hence, <m>A \cup (B \cap C) = (A \cup B) \cap (A \cup C)</m>.
</p>
</hint>
</exercise>
Prove \(A \cup (B \cap C) = (A \cup B) \cap (A \cup C)\text{.}\)
Hint.
View Source for hint
<hint xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<p>
If <m>x \in A \cup (B \cap C)</m>, then either <m>x \in A</m> or <m>x \in B \cap C</m>.
Thus, <m> x \in A \cup B</m> and <m>A \cup C</m>.
Hence, <m> x \in (A \cup B) \cap (A \cup C)</m>.
Therefore, <m> A \cup (B \cap C) \subset (A \cup B) \cap (A \cup C)</m>.
Conversely, if <m>x \in (A \cup B) \cap (A \cup C)</m>, then <m>x \in A \cup B</m> and <m>A \cup C</m>.
Thus, <m>x \in A</m> or <m>x</m> is in both <m>B</m> and <m>C</m>.
So <m>x \in A \cup (B \cap C)</m> and therefore <m>(A \cup B) \cap (A \cup C) \subset A \cup (B \cap C)</m>.
Hence, <m>A \cup (B \cap C) = (A \cup B) \cap (A \cup C)</m>.
</p>
</hint>
If \(x \in A \cup (B \cap C)\text{,}\) then either \(x \in A\) or \(x \in B \cap C\text{.}\) Thus, \(x \in A \cup B\) and \(A \cup C\text{.}\) Hence, \(x \in (A \cup B) \cap (A \cup C)\text{.}\) Therefore, \(A \cup (B \cap C) \subset (A \cup B) \cap (A \cup C)\text{.}\) Conversely, if \(x \in (A \cup B) \cap (A \cup C)\text{,}\) then \(x \in A \cup B\) and \(A \cup C\text{.}\) Thus, \(x \in A\) or \(x\) is in both \(B\) and \(C\text{.}\) So \(x \in A \cup (B \cap C)\) and therefore \((A \cup B) \cap (A \cup C) \subset A \cup (B \cap C)\text{.}\) Hence, \(A \cup (B \cap C) = (A \cup B) \cap (A \cup C)\text{.}\)
10.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>A \cap (B \cup C) = (A \cap B) \cup (A \cap C)</m>.
</p>
</statement>
</exercise>
Prove \(A \cap (B \cup C) = (A \cap B) \cup (A \cap C)\text{.}\)
11.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>A \subset B</m> if and only if <m>A \cap B = A</m>.
</p>
</statement>
</exercise>
Prove \(A \subset B\) if and only if \(A \cap B = A\text{.}\)
12.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>(A \cap B)' = A' \cup B'</m>.
</p>
</statement>
</exercise>
Prove \((A \cap B)' = A' \cup B'\text{.}\)
13.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>A \cup B = (A \cap B) \cup (A \setminus B) \cup (B \setminus A)</m>.
</p>
</statement>
<hint>
<p>
<m>(A \cap B) \cup (A \setminus B) \cup (B \setminus A) = (A \cap B) \cup (A \cap B') \cup (B \cap A') = [A \cap (B \cup B')] \cup (B \cap A') = A \cup (B \cap A') = (A \cup B) \cap (A \cup A') = A \cup B</m>.
</p>
</hint>
</exercise>
Prove \(A \cup B = (A \cap B) \cup (A \setminus B) \cup (B \setminus A)\text{.}\)
Hint.
View Source for hint
<hint xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<p>
<m>(A \cap B) \cup (A \setminus B) \cup (B \setminus A) = (A \cap B) \cup (A \cap B') \cup (B \cap A') = [A \cap (B \cup B')] \cup (B \cap A') = A \cup (B \cap A') = (A \cup B) \cap (A \cup A') = A \cup B</m>.
</p>
</hint>
\((A \cap B) \cup (A \setminus B) \cup (B \setminus A) = (A \cap B) \cup (A \cap B') \cup (B \cap A') = [A \cap (B \cup B')] \cup (B \cap A') = A \cup (B \cap A') = (A \cup B) \cap (A \cup A') = A \cup B\text{.}\)
14.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>(A \cup B) \times C = (A \times C ) \cup (B \times C)</m>.
</p>
</statement>
</exercise>
Prove \((A \cup B) \times C = (A \times C ) \cup (B \times C)\text{.}\)
15.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>(A \cap B) \setminus B = \emptyset</m>.
</p>
</statement>
</exercise>
Prove \((A \cap B) \setminus B = \emptyset\text{.}\)
16.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>(A \cup B) \setminus B = A \setminus B</m>.
</p>
</statement>
</exercise>
Prove \((A \cup B) \setminus B = A \setminus B\text{.}\)
17.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>A \setminus (B \cup C) = (A \setminus B) \cap (A \setminus C)</m>.
</p>
</statement>
<hint>
<p>
<m>A \setminus (B \cup C) = A \cap (B \cup C)' = (A \cap A) \cap (B' \cap C') = (A \cap B') \cap (A \cap C') = (A \setminus B) \cap (A \setminus C)</m>.
</p>
</hint>
</exercise>
Prove \(A \setminus (B \cup C) = (A \setminus B) \cap (A \setminus C)\text{.}\)
Hint.
View Source for hint
<hint xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<p>
<m>A \setminus (B \cup C) = A \cap (B \cup C)' = (A \cap A) \cap (B' \cap C') = (A \cap B') \cap (A \cap C') = (A \setminus B) \cap (A \setminus C)</m>.
</p>
</hint>
\(A \setminus (B \cup C) = A \cap (B \cup C)' = (A \cap A) \cap (B' \cap C') = (A \cap B') \cap (A \cap C') = (A \setminus B) \cap (A \setminus C)\text{.}\)
More Exercises
View Source for subexercises
<subexercises xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<title>More Exercises</title>
<introduction>
<p>
This is a meaningless subdivision of the exercises for the sake of testing output.
</p>
</introduction>
<exercise>
<statement>
<p>
Prove <m>A \cap (B \setminus C) = (A \cap B) \setminus (A \cap C)</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Prove <m>(A \setminus B) \cup (B \setminus A) = (A \cup B) \setminus (A \cap B)</m>.
</p>
</statement>
</exercise>
<exercisegroup cols="2">
<introduction>
<p>
Which of the following relations <m>f: {\mathbb Q} \rightarrow {\mathbb Q}</m> define a mapping? In each case, supply a reason why <m>f</m> is or is not a mapping.
</p>
</introduction>
<exercise>
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{p+ 1}{p - 2}</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{3p}{3q}</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{p+q}{q^2}</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{3 p^2}{7 q^2} - \frac{p}{q}</m>
</p>
</statement>
</exercise>
</exercisegroup>
<exercise>
<introduction>
<p>
Determine which of the following functions are one-to-one and which are onto.
If the function is not onto, determine its range.
</p>
</introduction>
<task>
<statement>
<p>
<m>f: {\mathbb R} \rightarrow {\mathbb R}</m> defined by <m>f(x) = e^x</m>
</p>
</statement>
<hint>
<p>
<m>f</m> is one-to-one but not onto. <m>f({\mathbb R} ) = \{ x \in {\mathbb R} : x \gt 0 \}</m>.
</p>
</hint>
</task>
<task>
<statement>
<p>
<m>f: {\mathbb Z} \rightarrow {\mathbb Z}</m> defined by <m>f(n) = n^2 + 3</m>
</p>
</statement>
</task>
<task>
<statement>
<p>
<m>f: {\mathbb R} \rightarrow {\mathbb R}</m> defined by <m>f(x) = \sin x</m>
</p>
</statement>
<hint>
<p>
<m>f</m> is neither one-to-one nor onto. <m>f(\mathbb R) = \{ x : -1 \leq x \leq 1 \}</m>.
</p>
</hint>
</task>
<task>
<statement>
<p>
<m>f: {\mathbb Z} \rightarrow {\mathbb Z}</m> defined by <m>f(x) = x^2</m>
</p>
</statement>
</task>
</exercise>
<exercise>
<statement>
<p>
Let <m>f :A \rightarrow B</m> and <m>g : B \rightarrow C</m> be invertible mappings; that is, mappings such that <m>f^{-1}</m> and <m>g^{-1}</m> exist.
Show that <m>(g \circ f)^{-1} =f^{-1} \circ g^{-1}</m>.
</p>
</statement>
</exercise>
<exercise>
<task>
<statement>
<p>
Define a function <m>f: {\mathbb N} \rightarrow {\mathbb N}</m> that is one-to-one but not onto.
</p>
</statement>
<hint>
<p>
<m>f(n) = n + 1</m>.
</p>
</hint>
</task>
<task>
<statement>
<p>
Define a function <m>f: {\mathbb N} \rightarrow {\mathbb N}</m> that is onto but not one-to-one.
</p>
</statement>
</task>
</exercise>
<exercise>
<statement>
<p>
Prove the relation defined on <m>{\mathbb R}^2</m> by <m>(x_1, y_1 ) \sim (x_2, y_2)</m> if <m>x_1^2 + y_1^2 = x_2^2 + y_2^2</m> is an equivalence relation.
</p>
</statement>
</exercise>
<exercise>
<introduction>
<p>
Let <m>f : A \rightarrow B</m> and <m>g : B \rightarrow C</m> be maps.
</p>
</introduction>
<task>
<statement>
<p>
If <m>f</m> and <m>g</m> are both one-to-one functions, show that <m>g \circ f</m> is one-to-one.
</p>
</statement>
<hint>
<p>
Let <m>x, y \in A</m>.
Then <m>g(f(x)) = (g \circ f)(x) = (g \circ f)(y) = g(f(y))</m>.
Thus, <m>f(x) = f(y)</m> and <m>x = y</m>, so <m>g \circ f</m> is one-to-one.
</p>
</hint>
</task>
<task>
<statement>
<p>
If <m>g \circ f</m> is onto, show that <m>g</m> is onto.
</p>
</statement>
<hint>
<p>
Let <m>c \in C</m>, then <m>c = (g \circ f)(x) = g(f(x))</m> for some <m>x \in A</m>.
Since <m>f(x) \in B</m>, <m>g</m> is onto.
</p>
</hint>
</task>
<task>
<statement>
<p>
If <m>g \circ f</m> is one-to-one, show that <m>f</m> is one-to-one.
</p>
</statement>
</task>
<task>
<statement>
<p>
If <m>g \circ f</m> is one-to-one and <m>f</m> is onto, show that <m>g</m> is one-to-one.
</p>
</statement>
</task>
<task>
<statement>
<p>
If <m>g \circ f</m> is onto and <m>g</m> is one-to-one, show that <m>f</m> is onto.
</p>
</statement>
</task>
</exercise>
<exercise>
<statement>
<p>
Define a function on the real numbers by
<md>
f(x) = \frac{x + 1}{x - 1}.
</md>
What are the domain and range of <m>f</m>? What is the inverse of <m>f</m>? Compute <m>f \circ f^{-1}</m> and <m>f^{-1} \circ f</m>.
</p>
</statement>
<!-- commented out for testing, so that only even hints, answers, solutions may appear in the "solutions" --> <!--
<hint>
<p>
<m>f^{-1}(x) = (x+1)/(x-1)</m>.
</p>
</hint>
-->
</exercise>
<exercise>
<introduction>
<p>
Let <m>f: X \rightarrow Y</m> be a map with <m>A_1, A_2 \subset X</m> and <m>B_1, B_2 \subset Y</m>.
</p>
</introduction>
<task>
<statement>
<p>
Prove <m>f( A_1 \cup A_2 ) = f( A_1) \cup f( A_2 )</m>.
</p>
</statement>
<hint>
<p>
Let <m>y \in f(A_1 \cup A_2)</m>.
Then there exists an <m>x \in A_1 \cup A_2</m> such that <m>f(x) = y</m>.
Hence, <m> y \in f(A_1)</m> or <m>f(A_2) </m>.
Therefore, <m> y \in f(A_1) \cup f(A_2)</m>.
Consequently, <m> f(A_1 \cup A_2) \subset f(A_1) \cup f(A_2)</m>.
Conversely, if <m>y \in f(A_1) \cup f(A_2)</m>, then <m> y \in f(A_1)</m> or <m>f(A_2)</m>.
Hence, there exists an <m>x \in A_1</m> or there exists an <m>x \in A_2</m> such that <m>f(x) = y</m>.
Thus, there exists an <m>x \in A_1 \cup A_2</m> such that <m>f(x) = y</m>.
Therefore, <m> f(A_1) \cup f(A_2) \subset f(A_1 \cup A_2)</m>, and <m>f(A_1 \cup A_2) = f(A_1) \cup f(A_2)</m>.
</p>
</hint>
</task>
<task>
<statement>
<p>
Prove <m>f( A_1 \cap A_2 ) \subset f( A_1) \cap f( A_2 )</m>.
Give an example in which equality fails.
</p>
</statement>
</task>
<task>
<statement>
<p>
Prove <m>f^{-1}( B_1 \cup B_2 ) = f^{-1}( B_1) \cup f^{-1}(B_2 )</m>, where
<md>
f^{-1}(B) = \{ x \in X : f(x) \in B \}.
</md>
</p>
</statement>
</task>
<task>
<statement>
<p>
Prove <m>f^{-1}( B_1 \cap B_2 ) = f^{-1}( B_1) \cap f^{-1}( B_2 )</m>.
</p>
</statement>
</task>
<task>
<statement>
<p>
Prove <m>f^{-1}( Y \setminus B_1 ) = X \setminus f^{-1}( B_1)</m>.
</p>
</statement>
</task>
</exercise>
<exercisegroup cols="2">
<introduction>
<p>
Determine whether or not the following relations are equivalence relations on the given set.
If the relation is an equivalence relation, describe the partition given by it.
If the relation is not an equivalence relation, state why it fails to be one.
</p>
</introduction>
<exercise>
<statement>
<p>
<m>x \sim y</m> in <m>{\mathbb R}</m> if <m>x \geq y</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>m \sim n</m> in <m>{\mathbb Z}</m> if <m>mn > 0</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>x \sim y</m> in <m>{\mathbb R}</m> if <m>|x - y| \leq 4</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>m \sim n</m> in <m>{\mathbb Z}</m> if <m>m \equiv n \pmod{6}</m>
</p>
</statement>
</exercise>
</exercisegroup>
<exercise>
<statement>
<p>
Define a relation <m>\sim</m> on <m>{\mathbb R}^2</m> by stating that <m>(a, b) \sim (c, d)</m> if and only if <m>a^2 + b^2 \leq c^2 + d^2</m>.
Show that <m>\sim</m> is reflexive and transitive but not symmetric.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Show that an <m>m \times n</m> matrix gives rise to a well-defined map from <m>{\mathbb R}^n</m> to <m>{\mathbb R}^m</m>.
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
Find the error in the following argument by providing a counterexample.
<q>The reflexive property is redundant in the axioms for an equivalence relation.
If <m>x \sim y</m>, then <m>y \sim x</m> by the symmetric property.
Using the transitive property, we can deduce that <m>x \sim x</m>.</q>
</p>
</statement>
<hint>
<p>
Let <m>X = {\mathbb N} \cup \{ \sqrt{2}\, \}</m> and define <m>x \sim y</m> if <m>x + y \in {\mathbb N}</m>.
</p>
</hint>
</exercise>
<exercise>
<title>Projective Real Line</title>
<statement>
<p>
Define a relation on <m>{\mathbb R}^2 \setminus \{ (0,0) \}</m> by letting <m>(x_1, y_1) \sim (x_2, y_2)</m> if there exists a nonzero real number <m>\lambda</m> such that <m>(x_1, y_1) = ( \lambda x_2, \lambda y_2)</m>.
Prove that <m>\sim</m> defines an equivalence relation on <m>{\mathbb R}^2 \setminus (0,0)</m>.
What are the corresponding equivalence classes? This equivalence relation defines the projective line, denoted by <m>{\mathbb P}({\mathbb R}) </m>, which is very important in geometry.
</p>
</statement>
</exercise>
</subexercises>
This is a meaningless subdivision of the exercises for the sake of testing output.
18.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>A \cap (B \setminus C) = (A \cap B) \setminus (A \cap C)</m>.
</p>
</statement>
</exercise>
Prove \(A \cap (B \setminus C) = (A \cap B) \setminus (A \cap C)\text{.}\)
19.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>(A \setminus B) \cup (B \setminus A) = (A \cup B) \setminus (A \cap B)</m>.
</p>
</statement>
</exercise>
Prove \((A \setminus B) \cup (B \setminus A) = (A \cup B) \setminus (A \cap B)\text{.}\)
Exercise Group.
View Source for exercisegroup
<exercisegroup cols="2" xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<introduction>
<p>
Which of the following relations <m>f: {\mathbb Q} \rightarrow {\mathbb Q}</m> define a mapping? In each case, supply a reason why <m>f</m> is or is not a mapping.
</p>
</introduction>
<exercise>
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{p+ 1}{p - 2}</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{3p}{3q}</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{p+q}{q^2}</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{3 p^2}{7 q^2} - \frac{p}{q}</m>
</p>
</statement>
</exercise>
</exercisegroup>
Which of the following relations \(f: {\mathbb Q} \rightarrow {\mathbb Q}\) define a mapping? In each case, supply a reason why \(f\) is or is not a mapping.
20.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{p+ 1}{p - 2}</m>
</p>
</statement>
</exercise>
\(\displaystyle f(p/q) = \frac{p+ 1}{p - 2}\)
21.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{3p}{3q}</m>
</p>
</statement>
</exercise>
\(\displaystyle f(p/q) = \frac{3p}{3q}\)
22.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{p+q}{q^2}</m>
</p>
</statement>
</exercise>
\(\displaystyle f(p/q) = \frac{p+q}{q^2}\)
23.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>\displaystyle f(p/q) = \frac{3 p^2}{7 q^2} - \frac{p}{q}</m>
</p>
</statement>
</exercise>
\(\displaystyle f(p/q) = \frac{3 p^2}{7 q^2} - \frac{p}{q}\)
24.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<introduction>
<p>
Determine which of the following functions are one-to-one and which are onto.
If the function is not onto, determine its range.
</p>
</introduction>
<task>
<statement>
<p>
<m>f: {\mathbb R} \rightarrow {\mathbb R}</m> defined by <m>f(x) = e^x</m>
</p>
</statement>
<hint>
<p>
<m>f</m> is one-to-one but not onto. <m>f({\mathbb R} ) = \{ x \in {\mathbb R} : x \gt 0 \}</m>.
</p>
</hint>
</task>
<task>
<statement>
<p>
<m>f: {\mathbb Z} \rightarrow {\mathbb Z}</m> defined by <m>f(n) = n^2 + 3</m>
</p>
</statement>
</task>
<task>
<statement>
<p>
<m>f: {\mathbb R} \rightarrow {\mathbb R}</m> defined by <m>f(x) = \sin x</m>
</p>
</statement>
<hint>
<p>
<m>f</m> is neither one-to-one nor onto. <m>f(\mathbb R) = \{ x : -1 \leq x \leq 1 \}</m>.
</p>
</hint>
</task>
<task>
<statement>
<p>
<m>f: {\mathbb Z} \rightarrow {\mathbb Z}</m> defined by <m>f(x) = x^2</m>
</p>
</statement>
</task>
</exercise>
Determine which of the following functions are one-to-one and which are onto. If the function is not onto, determine its range.
(a)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>f: {\mathbb R} \rightarrow {\mathbb R}</m> defined by <m>f(x) = e^x</m>
</p>
</statement>
<hint>
<p>
<m>f</m> is one-to-one but not onto. <m>f({\mathbb R} ) = \{ x \in {\mathbb R} : x \gt 0 \}</m>.
</p>
</hint>
</task>
\(f: {\mathbb R} \rightarrow {\mathbb R}\) defined by \(f(x) = e^x\)
Hint.
View Source for hint
<hint xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<p>
<m>f</m> is one-to-one but not onto. <m>f({\mathbb R} ) = \{ x \in {\mathbb R} : x \gt 0 \}</m>.
</p>
</hint>
\(f\) is one-to-one but not onto. \(f({\mathbb R} ) = \{ x \in {\mathbb R} : x \gt 0 \}\text{.}\)
(b)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>f: {\mathbb Z} \rightarrow {\mathbb Z}</m> defined by <m>f(n) = n^2 + 3</m>
</p>
</statement>
</task>
\(f: {\mathbb Z} \rightarrow {\mathbb Z}\) defined by \(f(n) = n^2 + 3\)
(c)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>f: {\mathbb R} \rightarrow {\mathbb R}</m> defined by <m>f(x) = \sin x</m>
</p>
</statement>
<hint>
<p>
<m>f</m> is neither one-to-one nor onto. <m>f(\mathbb R) = \{ x : -1 \leq x \leq 1 \}</m>.
</p>
</hint>
</task>
\(f: {\mathbb R} \rightarrow {\mathbb R}\) defined by \(f(x) = \sin x\)
Hint.
View Source for hint
<hint xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<p>
<m>f</m> is neither one-to-one nor onto. <m>f(\mathbb R) = \{ x : -1 \leq x \leq 1 \}</m>.
</p>
</hint>
\(f\) is neither one-to-one nor onto. \(f(\mathbb R) = \{ x : -1 \leq x \leq 1 \}\text{.}\)
(d)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>f: {\mathbb Z} \rightarrow {\mathbb Z}</m> defined by <m>f(x) = x^2</m>
</p>
</statement>
</task>
\(f: {\mathbb Z} \rightarrow {\mathbb Z}\) defined by \(f(x) = x^2\)
25.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Let <m>f :A \rightarrow B</m> and <m>g : B \rightarrow C</m> be invertible mappings; that is, mappings such that <m>f^{-1}</m> and <m>g^{-1}</m> exist.
Show that <m>(g \circ f)^{-1} =f^{-1} \circ g^{-1}</m>.
</p>
</statement>
</exercise>
Let \(f :A \rightarrow B\) and \(g : B \rightarrow C\) be invertible mappings; that is, mappings such that \(f^{-1}\) and \(g^{-1}\) exist. Show that \((g \circ f)^{-1} =f^{-1} \circ g^{-1}\text{.}\)
26.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<task>
<statement>
<p>
Define a function <m>f: {\mathbb N} \rightarrow {\mathbb N}</m> that is one-to-one but not onto.
</p>
</statement>
<hint>
<p>
<m>f(n) = n + 1</m>.
</p>
</hint>
</task>
<task>
<statement>
<p>
Define a function <m>f: {\mathbb N} \rightarrow {\mathbb N}</m> that is onto but not one-to-one.
</p>
</statement>
</task>
</exercise>
(a)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Define a function <m>f: {\mathbb N} \rightarrow {\mathbb N}</m> that is one-to-one but not onto.
</p>
</statement>
<hint>
<p>
<m>f(n) = n + 1</m>.
</p>
</hint>
</task>
Define a function \(f: {\mathbb N} \rightarrow {\mathbb N}\) that is one-to-one but not onto.
Hint.
View Source for hint
<hint xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<p>
<m>f(n) = n + 1</m>.
</p>
</hint>
\(f(n) = n + 1\text{.}\)
(b)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Define a function <m>f: {\mathbb N} \rightarrow {\mathbb N}</m> that is onto but not one-to-one.
</p>
</statement>
</task>
Define a function \(f: {\mathbb N} \rightarrow {\mathbb N}\) that is onto but not one-to-one.
27.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove the relation defined on <m>{\mathbb R}^2</m> by <m>(x_1, y_1 ) \sim (x_2, y_2)</m> if <m>x_1^2 + y_1^2 = x_2^2 + y_2^2</m> is an equivalence relation.
</p>
</statement>
</exercise>
Prove the relation defined on \({\mathbb R}^2\) by \((x_1, y_1 ) \sim (x_2, y_2)\) if \(x_1^2 + y_1^2 = x_2^2 + y_2^2\) is an equivalence relation.
28.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<introduction>
<p>
Let <m>f : A \rightarrow B</m> and <m>g : B \rightarrow C</m> be maps.
</p>
</introduction>
<task>
<statement>
<p>
If <m>f</m> and <m>g</m> are both one-to-one functions, show that <m>g \circ f</m> is one-to-one.
</p>
</statement>
<hint>
<p>
Let <m>x, y \in A</m>.
Then <m>g(f(x)) = (g \circ f)(x) = (g \circ f)(y) = g(f(y))</m>.
Thus, <m>f(x) = f(y)</m> and <m>x = y</m>, so <m>g \circ f</m> is one-to-one.
</p>
</hint>
</task>
<task>
<statement>
<p>
If <m>g \circ f</m> is onto, show that <m>g</m> is onto.
</p>
</statement>
<hint>
<p>
Let <m>c \in C</m>, then <m>c = (g \circ f)(x) = g(f(x))</m> for some <m>x \in A</m>.
Since <m>f(x) \in B</m>, <m>g</m> is onto.
</p>
</hint>
</task>
<task>
<statement>
<p>
If <m>g \circ f</m> is one-to-one, show that <m>f</m> is one-to-one.
</p>
</statement>
</task>
<task>
<statement>
<p>
If <m>g \circ f</m> is one-to-one and <m>f</m> is onto, show that <m>g</m> is one-to-one.
</p>
</statement>
</task>
<task>
<statement>
<p>
If <m>g \circ f</m> is onto and <m>g</m> is one-to-one, show that <m>f</m> is onto.
</p>
</statement>
</task>
</exercise>
Let \(f : A \rightarrow B\) and \(g : B \rightarrow C\) be maps.
(a)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
If <m>f</m> and <m>g</m> are both one-to-one functions, show that <m>g \circ f</m> is one-to-one.
</p>
</statement>
<hint>
<p>
Let <m>x, y \in A</m>.
Then <m>g(f(x)) = (g \circ f)(x) = (g \circ f)(y) = g(f(y))</m>.
Thus, <m>f(x) = f(y)</m> and <m>x = y</m>, so <m>g \circ f</m> is one-to-one.
</p>
</hint>
</task>
If \(f\) and \(g\) are both one-to-one functions, show that \(g \circ f\) is one-to-one.
Hint.
View Source for hint
<hint xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<p>
Let <m>x, y \in A</m>.
Then <m>g(f(x)) = (g \circ f)(x) = (g \circ f)(y) = g(f(y))</m>.
Thus, <m>f(x) = f(y)</m> and <m>x = y</m>, so <m>g \circ f</m> is one-to-one.
</p>
</hint>
Let \(x, y \in A\text{.}\) Then \(g(f(x)) = (g \circ f)(x) = (g \circ f)(y) = g(f(y))\text{.}\) Thus, \(f(x) = f(y)\) and \(x = y\text{,}\) so \(g \circ f\) is one-to-one.
(b)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
If <m>g \circ f</m> is onto, show that <m>g</m> is onto.
</p>
</statement>
<hint>
<p>
Let <m>c \in C</m>, then <m>c = (g \circ f)(x) = g(f(x))</m> for some <m>x \in A</m>.
Since <m>f(x) \in B</m>, <m>g</m> is onto.
</p>
</hint>
</task>
If \(g \circ f\) is onto, show that \(g\) is onto.
Hint.
View Source for hint
<hint xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<p>
Let <m>c \in C</m>, then <m>c = (g \circ f)(x) = g(f(x))</m> for some <m>x \in A</m>.
Since <m>f(x) \in B</m>, <m>g</m> is onto.
</p>
</hint>
Let \(c \in C\text{,}\) then \(c = (g \circ f)(x) = g(f(x))\) for some \(x \in A\text{.}\) Since \(f(x) \in B\text{,}\) \(g\) is onto.
(c)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
If <m>g \circ f</m> is one-to-one, show that <m>f</m> is one-to-one.
</p>
</statement>
</task>
If \(g \circ f\) is one-to-one, show that \(f\) is one-to-one.
(d)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
If <m>g \circ f</m> is one-to-one and <m>f</m> is onto, show that <m>g</m> is one-to-one.
</p>
</statement>
</task>
If \(g \circ f\) is one-to-one and \(f\) is onto, show that \(g\) is one-to-one.
(e)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
If <m>g \circ f</m> is onto and <m>g</m> is one-to-one, show that <m>f</m> is onto.
</p>
</statement>
</task>
If \(g \circ f\) is onto and \(g\) is one-to-one, show that \(f\) is onto.
29.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Define a function on the real numbers by
<md>
f(x) = \frac{x + 1}{x - 1}.
</md>
What are the domain and range of <m>f</m>? What is the inverse of <m>f</m>? Compute <m>f \circ f^{-1}</m> and <m>f^{-1} \circ f</m>.
</p>
</statement>
<!-- commented out for testing, so that only even hints, answers, solutions may appear in the "solutions" --> <!--
<hint>
<p>
<m>f^{-1}(x) = (x+1)/(x-1)</m>.
</p>
</hint>
-->
</exercise>
Define a function on the real numbers by
\begin{equation*}
f(x) = \frac{x + 1}{x - 1}.
\end{equation*}
What are the domain and range of \(f\text{?}\) What is the inverse of \(f\text{?}\) Compute \(f \circ f^{-1}\) and \(f^{-1} \circ f\text{.}\)
30.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<introduction>
<p>
Let <m>f: X \rightarrow Y</m> be a map with <m>A_1, A_2 \subset X</m> and <m>B_1, B_2 \subset Y</m>.
</p>
</introduction>
<task>
<statement>
<p>
Prove <m>f( A_1 \cup A_2 ) = f( A_1) \cup f( A_2 )</m>.
</p>
</statement>
<hint>
<p>
Let <m>y \in f(A_1 \cup A_2)</m>.
Then there exists an <m>x \in A_1 \cup A_2</m> such that <m>f(x) = y</m>.
Hence, <m> y \in f(A_1)</m> or <m>f(A_2) </m>.
Therefore, <m> y \in f(A_1) \cup f(A_2)</m>.
Consequently, <m> f(A_1 \cup A_2) \subset f(A_1) \cup f(A_2)</m>.
Conversely, if <m>y \in f(A_1) \cup f(A_2)</m>, then <m> y \in f(A_1)</m> or <m>f(A_2)</m>.
Hence, there exists an <m>x \in A_1</m> or there exists an <m>x \in A_2</m> such that <m>f(x) = y</m>.
Thus, there exists an <m>x \in A_1 \cup A_2</m> such that <m>f(x) = y</m>.
Therefore, <m> f(A_1) \cup f(A_2) \subset f(A_1 \cup A_2)</m>, and <m>f(A_1 \cup A_2) = f(A_1) \cup f(A_2)</m>.
</p>
</hint>
</task>
<task>
<statement>
<p>
Prove <m>f( A_1 \cap A_2 ) \subset f( A_1) \cap f( A_2 )</m>.
Give an example in which equality fails.
</p>
</statement>
</task>
<task>
<statement>
<p>
Prove <m>f^{-1}( B_1 \cup B_2 ) = f^{-1}( B_1) \cup f^{-1}(B_2 )</m>, where
<md>
f^{-1}(B) = \{ x \in X : f(x) \in B \}.
</md>
</p>
</statement>
</task>
<task>
<statement>
<p>
Prove <m>f^{-1}( B_1 \cap B_2 ) = f^{-1}( B_1) \cap f^{-1}( B_2 )</m>.
</p>
</statement>
</task>
<task>
<statement>
<p>
Prove <m>f^{-1}( Y \setminus B_1 ) = X \setminus f^{-1}( B_1)</m>.
</p>
</statement>
</task>
</exercise>
Let \(f: X \rightarrow Y\) be a map with \(A_1, A_2 \subset X\) and \(B_1, B_2 \subset Y\text{.}\)
(a)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>f( A_1 \cup A_2 ) = f( A_1) \cup f( A_2 )</m>.
</p>
</statement>
<hint>
<p>
Let <m>y \in f(A_1 \cup A_2)</m>.
Then there exists an <m>x \in A_1 \cup A_2</m> such that <m>f(x) = y</m>.
Hence, <m> y \in f(A_1)</m> or <m>f(A_2) </m>.
Therefore, <m> y \in f(A_1) \cup f(A_2)</m>.
Consequently, <m> f(A_1 \cup A_2) \subset f(A_1) \cup f(A_2)</m>.
Conversely, if <m>y \in f(A_1) \cup f(A_2)</m>, then <m> y \in f(A_1)</m> or <m>f(A_2)</m>.
Hence, there exists an <m>x \in A_1</m> or there exists an <m>x \in A_2</m> such that <m>f(x) = y</m>.
Thus, there exists an <m>x \in A_1 \cup A_2</m> such that <m>f(x) = y</m>.
Therefore, <m> f(A_1) \cup f(A_2) \subset f(A_1 \cup A_2)</m>, and <m>f(A_1 \cup A_2) = f(A_1) \cup f(A_2)</m>.
</p>
</hint>
</task>
Prove \(f( A_1 \cup A_2 ) = f( A_1) \cup f( A_2 )\text{.}\)
Hint.
View Source for hint
<hint xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<p>
Let <m>y \in f(A_1 \cup A_2)</m>.
Then there exists an <m>x \in A_1 \cup A_2</m> such that <m>f(x) = y</m>.
Hence, <m> y \in f(A_1)</m> or <m>f(A_2) </m>.
Therefore, <m> y \in f(A_1) \cup f(A_2)</m>.
Consequently, <m> f(A_1 \cup A_2) \subset f(A_1) \cup f(A_2)</m>.
Conversely, if <m>y \in f(A_1) \cup f(A_2)</m>, then <m> y \in f(A_1)</m> or <m>f(A_2)</m>.
Hence, there exists an <m>x \in A_1</m> or there exists an <m>x \in A_2</m> such that <m>f(x) = y</m>.
Thus, there exists an <m>x \in A_1 \cup A_2</m> such that <m>f(x) = y</m>.
Therefore, <m> f(A_1) \cup f(A_2) \subset f(A_1 \cup A_2)</m>, and <m>f(A_1 \cup A_2) = f(A_1) \cup f(A_2)</m>.
</p>
</hint>
Let \(y \in f(A_1 \cup A_2)\text{.}\) Then there exists an \(x \in A_1 \cup A_2\) such that \(f(x) = y\text{.}\) Hence, \(y \in f(A_1)\) or \(f(A_2) \text{.}\) Therefore, \(y \in f(A_1) \cup f(A_2)\text{.}\) Consequently, \(f(A_1 \cup A_2) \subset f(A_1) \cup f(A_2)\text{.}\) Conversely, if \(y \in f(A_1) \cup f(A_2)\text{,}\) then \(y \in f(A_1)\) or \(f(A_2)\text{.}\) Hence, there exists an \(x \in A_1\) or there exists an \(x \in A_2\) such that \(f(x) = y\text{.}\) Thus, there exists an \(x \in A_1 \cup A_2\) such that \(f(x) = y\text{.}\) Therefore, \(f(A_1) \cup f(A_2) \subset f(A_1 \cup A_2)\text{,}\) and \(f(A_1 \cup A_2) = f(A_1) \cup f(A_2)\text{.}\)
(b)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>f( A_1 \cap A_2 ) \subset f( A_1) \cap f( A_2 )</m>.
Give an example in which equality fails.
</p>
</statement>
</task>
Prove \(f( A_1 \cap A_2 ) \subset f( A_1) \cap f( A_2 )\text{.}\) Give an example in which equality fails.
(c)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>f^{-1}( B_1 \cup B_2 ) = f^{-1}( B_1) \cup f^{-1}(B_2 )</m>, where
<md>
f^{-1}(B) = \{ x \in X : f(x) \in B \}.
</md>
</p>
</statement>
</task>
Prove \(f^{-1}( B_1 \cup B_2 ) = f^{-1}( B_1) \cup f^{-1}(B_2 )\text{,}\) where
\begin{equation*}
f^{-1}(B) = \{ x \in X : f(x) \in B \}.
\end{equation*}
(d)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>f^{-1}( B_1 \cap B_2 ) = f^{-1}( B_1) \cap f^{-1}( B_2 )</m>.
</p>
</statement>
</task>
Prove \(f^{-1}( B_1 \cap B_2 ) = f^{-1}( B_1) \cap f^{-1}( B_2 )\text{.}\)
(e)
View Source for task
<task xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Prove <m>f^{-1}( Y \setminus B_1 ) = X \setminus f^{-1}( B_1)</m>.
</p>
</statement>
</task>
Prove \(f^{-1}( Y \setminus B_1 ) = X \setminus f^{-1}( B_1)\text{.}\)
Exercise Group.
View Source for exercisegroup
<exercisegroup cols="2" xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<introduction>
<p>
Determine whether or not the following relations are equivalence relations on the given set.
If the relation is an equivalence relation, describe the partition given by it.
If the relation is not an equivalence relation, state why it fails to be one.
</p>
</introduction>
<exercise>
<statement>
<p>
<m>x \sim y</m> in <m>{\mathbb R}</m> if <m>x \geq y</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>m \sim n</m> in <m>{\mathbb Z}</m> if <m>mn > 0</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>x \sim y</m> in <m>{\mathbb R}</m> if <m>|x - y| \leq 4</m>
</p>
</statement>
</exercise>
<exercise>
<statement>
<p>
<m>m \sim n</m> in <m>{\mathbb Z}</m> if <m>m \equiv n \pmod{6}</m>
</p>
</statement>
</exercise>
</exercisegroup>
Determine whether or not the following relations are equivalence relations on the given set. If the relation is an equivalence relation, describe the partition given by it. If the relation is not an equivalence relation, state why it fails to be one.
31.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>x \sim y</m> in <m>{\mathbb R}</m> if <m>x \geq y</m>
</p>
</statement>
</exercise>
\(x \sim y\) in \({\mathbb R}\) if \(x \geq y\)
32.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>m \sim n</m> in <m>{\mathbb Z}</m> if <m>mn > 0</m>
</p>
</statement>
</exercise>
\(m \sim n\) in \({\mathbb Z}\) if \(mn > 0\)
33.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>x \sim y</m> in <m>{\mathbb R}</m> if <m>|x - y| \leq 4</m>
</p>
</statement>
</exercise>
\(x \sim y\) in \({\mathbb R}\) if \(|x - y| \leq 4\)
34.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
<m>m \sim n</m> in <m>{\mathbb Z}</m> if <m>m \equiv n \pmod{6}</m>
</p>
</statement>
</exercise>
\(m \sim n\) in \({\mathbb Z}\) if \(m \equiv n \pmod{6}\)
35.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Define a relation <m>\sim</m> on <m>{\mathbb R}^2</m> by stating that <m>(a, b) \sim (c, d)</m> if and only if <m>a^2 + b^2 \leq c^2 + d^2</m>.
Show that <m>\sim</m> is reflexive and transitive but not symmetric.
</p>
</statement>
</exercise>
Define a relation \(\sim\) on \({\mathbb R}^2\) by stating that \((a, b) \sim (c, d)\) if and only if \(a^2 + b^2 \leq c^2 + d^2\text{.}\) Show that \(\sim\) is reflexive and transitive but not symmetric.
36.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Show that an <m>m \times n</m> matrix gives rise to a well-defined map from <m>{\mathbb R}^n</m> to <m>{\mathbb R}^m</m>.
</p>
</statement>
</exercise>
Show that an \(m \times n\) matrix gives rise to a well-defined map from \({\mathbb R}^n\) to \({\mathbb R}^m\text{.}\)
37.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<statement>
<p>
Find the error in the following argument by providing a counterexample.
<q>The reflexive property is redundant in the axioms for an equivalence relation.
If <m>x \sim y</m>, then <m>y \sim x</m> by the symmetric property.
Using the transitive property, we can deduce that <m>x \sim x</m>.</q>
</p>
</statement>
<hint>
<p>
Let <m>X = {\mathbb N} \cup \{ \sqrt{2}\, \}</m> and define <m>x \sim y</m> if <m>x + y \in {\mathbb N}</m>.
</p>
</hint>
</exercise>
Find the error in the following argument by providing a counterexample. βThe reflexive property is redundant in the axioms for an equivalence relation. If \(x \sim y\text{,}\) then \(y \sim x\) by the symmetric property. Using the transitive property, we can deduce that \(x \sim x\text{.}\)β
Hint.
View Source for hint
<hint xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<p>
Let <m>X = {\mathbb N} \cup \{ \sqrt{2}\, \}</m> and define <m>x \sim y</m> if <m>x + y \in {\mathbb N}</m>.
</p>
</hint>
Let \(X = {\mathbb N} \cup \{ \sqrt{2}\, \}\) and define \(x \sim y\) if \(x + y \in {\mathbb N}\text{.}\)
38. Projective Real Line.
View Source for exercise
<exercise xmlns:pi="http://pretextbook.org/2020/pretext/internal">
<title>Projective Real Line</title>
<statement>
<p>
Define a relation on <m>{\mathbb R}^2 \setminus \{ (0,0) \}</m> by letting <m>(x_1, y_1) \sim (x_2, y_2)</m> if there exists a nonzero real number <m>\lambda</m> such that <m>(x_1, y_1) = ( \lambda x_2, \lambda y_2)</m>.
Prove that <m>\sim</m> defines an equivalence relation on <m>{\mathbb R}^2 \setminus (0,0)</m>.
What are the corresponding equivalence classes? This equivalence relation defines the projective line, denoted by <m>{\mathbb P}({\mathbb R}) </m>, which is very important in geometry.
</p>
</statement>
</exercise>
Define a relation on \({\mathbb R}^2 \setminus \{ (0,0) \}\) by letting \((x_1, y_1) \sim (x_2, y_2)\) if there exists a nonzero real number \(\lambda\) such that \((x_1, y_1) = ( \lambda x_2, \lambda y_2)\text{.}\) Prove that \(\sim\) defines an equivalence relation on \({\mathbb R}^2 \setminus (0,0)\text{.}\) What are the corresponding equivalence classes? This equivalence relation defines the projective line, denoted by \({\mathbb P}({\mathbb R}) \text{,}\) which is very important in geometry.

