Chapter 12: Problem 5
Consider a function \(f: A \rightarrow B\) and a subset \(X \subseteq A\). We observed in Example 12.14 that \(f^{-1}(f(X)) \neq X\) in general. However \(X \subseteq f^{-1}(f(X))\) is always true. Prove this.
Chapter 12: Problem 5
Consider a function \(f: A \rightarrow B\) and a subset \(X \subseteq A\). We observed in Example 12.14 that \(f^{-1}(f(X)) \neq X\) in general. However \(X \subseteq f^{-1}(f(X))\) is always true. Prove this.
All the tools & learning materials you need for study success - in one app.
Get started for freeA function \(f: \mathbb{Z} \rightarrow \mathbb{Z}\) is defined as \(f(n)=2 n+1\). Verify whether this function is injective and whether it is surjective.
Consider the functions \(f, g: \mathbb{R} \rightarrow \mathbb{R}\) defined as \(f(x)=\sqrt[3]{x+1}\) and \(g(x)=x^{3}\). Find the formulas for \(g \circ f\) and \(f \circ g\).
Consider the cosine function \(\cos : \mathbb{R} \rightarrow \mathbb{R}\). Decide whether this function is injective and whether it is surjective. What if it had been defined as \(\cos : \mathbb{R} \rightarrow[-1,1] ?\)
This problem concerns functions \(f:\\{1,2,3,4,5,6,7\\} \rightarrow\\{0,1,2,3,4\\} .\) How many such functions have the property that \(\left|f^{-1}(\\{3\\})\right|=3\) ?
This question concerns functions \(f:\\{A, B, C, D, E, F, G\\} \rightarrow\\{1,2\\} .\) How many such functions are there? How many of these functions are injective? How many are surjective? How many are bijective?
What do you think about this solution?
We value your feedback to improve our textbook solutions.