91Ó°ÊÓ

Sei \(f: X \rightarrow Y\) eine Abbildung. Zeigen Sie: a) Ist \(M_{1} \subset M_{2} \subset X\), so folgt \(f\left(M_{1}\right) \subset f\left(M_{2}\right)\). Ist \(N_{1} \subset N_{2} \subset Y\), so folgt \(f^{-1}\left(N_{1}\right) \subset f^{-1}\left(N_{2}\right)\). b) \(M \subset f^{-1}(f(M))\) für \(M \subset X, f\left(f^{-1}(N)\right) \subset N\) für \(N \subset Y\). c) \(f^{-1}(Y \backslash N)=X \backslash f^{-1}(N)\) für \(N \subset Y\). d) Für \(M_{1}, M_{2} \subset X\) und \(N_{1}, N_{2} \subset Y\) gilt: $$ f^{-1}\left(N_{1} \cap N_{2}\right)=f^{-1}\left(N_{1}\right) \cap f^{-1}\left(N_{2}\right), \quad f^{-1}\left(N_{1} \cup N_{2}\right)=f^{-1}\left(N_{1}\right) \cup f^{-1}\left(N_{2}\right) $$ \(f\left(M_{1} \cup M_{2}\right)=f\left(M_{1}\right) \cup f\left(M_{2}\right), \quad f\left(M_{1} \cap M_{2}\right) \subset f\left(M_{1}\right) \cap f\left(M_{2}\right)\) Finden Sic cin Beispiel, in dem \(f\left(M_{1} \cap M_{2}\right) \neq f\left(M_{1}\right) \cap f\left(M_{2}\right)\) gilt!

Step by step solution

01

Prove Part a

To show that if \(M_1 \subset M_2 \subset X\), then \(f(M_1) \subset f(M_2)\), consider any \(y \in f(M_1)\). By definition, there exists an \(x \in M_1\) such that \(f(x) = y\). Since \(M_1 \subset M_2\), \(x \in M_2\) as well. Therefore, \(y \in f(M_2)\).Similarly, to prove \(f^{-1}(N_1) \subset f^{-1}(N_2)\) for \(N_1 \subset N_2 \subset Y\), take any \(x \in f^{-1}(N_1)\). It follows that \(f(x) \in N_1\), and because \(N_1 \subset N_2\), \(f(x) \in N_2\). Consequently, \(x \in f^{-1}(N_2)\). Thus, \(f^{-1}(N_1) \subset f^{-1}(N_2)\).

02

Prove Part b

For \(M \subset X\), observe that any element \(x \in M\) satisfies \(f(x) \in f(M)\). Therefore, \(x \in f^{-1}(f(M))\), showing \(M \subset f^{-1}(f(M))\).For \(N \subset Y\), consider \(y \in f(f^{-1}(N))\). By definition, there is an \(x\) such that \(f(x) = y\) and \(f(x) \in N\). Hence, \(y \in N\), proving \(f(f^{-1}(N)) \subset N\).

03

Prove Part c

We need to show that \(f^{-1}(Y \backslash N) = X \backslash f^{-1}(N)\). Consider an element \(x \in f^{-1}(Y \backslash N)\). It implies \(f(x) \in Y \backslash N\), meaning \(f(x) otin N\), so \(x otin f^{-1}(N)\). Thus, \(x \in X \backslash f^{-1}(N)\).Conversely, if \(x \in X \backslash f^{-1}(N)\), then \(x otin f^{-1}(N)\), implying \(f(x) otin N\) or equivalently, \(f(x) \in Y \backslash N\). Therefore, \(x \in f^{-1}(Y \backslash N)\). Hence, \(f^{-1}(Y \backslash N) = X \backslash f^{-1}(N)\).

04

Prove Part d (Pre-images of Intersections and Unions)

To show \(f^{-1}(N_1 \cap N_2) = f^{-1}(N_1) \cap f^{-1}(N_2)\), consider \(x \in f^{-1}(N_1 \cap N_2)\). This implies \(f(x) \in N_1 \cap N_2\), so \(f(x) \in N_1\) and \(f(x) \in N_2\), leading to \(x \in f^{-1}(N_1)\) and \(x \in f^{-1}(N_2)\). Hence, \(x \in f^{-1}(N_1) \cap f^{-1}(N_2)\).For \(f^{-1}(N_1 \cup N_2) = f^{-1}(N_1) \cup f^{-1}(N_2)\), take \(x \in f^{-1}(N_1 \cup N_2)\). This asserts \(f(x) \in N_1 \cup N_2\), so \(x \in f^{-1}(N_1)\) or \(x \in f^{-1}(N_2)\). Thus, \(x \in f^{-1}(N_1) \cup f^{-1}(N_2)\).

05

Prove Part d (Images of Intersections and Unions)

For \(f(M_1 \cup M_2) = f(M_1) \cup f(M_2)\), note that if \(y \in f(M_1 \cup M_2)\), \(y\) is \(f(x)\) for some \(x \in M_1 \cup M_2\). Therefore, \(x\) is in either \(M_1\) or \(M_2\), which means \(y \in f(M_1) \cup f(M_2)\).To show \(f(M_1 \cap M_2) \subset f(M_1) \cap f(M_2)\), observe that if \(y \in f(M_1 \cap M_2)\), there exists \(x \in M_1 \cap M_2\) such that \(f(x) = y\). Thus, \(y \in f(M_1)\) and \(y \in f(M_2)\), so \(y \in f(M_1) \cap f(M_2)\).

06

Find a Counterexample for Part d

Consider a function \(f: \mathbb{R} \to \mathbb{R}\) with \(f(x) = x^2\). Let \(M_1 = [-1, 0]\) and \(M_2 = [0, 1]\). Then, \(M_1 \cap M_2 = \{0\}\). Therefore, \(f(M_1 \cap M_2) = \{0\}\). However, \(f(M_1) = [0, 1]\) and \(f(M_2) = [0, 1]\). So, \(f(M_1) \cap f(M_2) = [0, 1]\). This example shows \(f(M_1 \cap M_2) eq f(M_1) \cap f(M_2)\).

Unlock Step-by-Step Solutions & Ace Your Exams!

• Full Textbook Solutions

  Get detailed explanations and key concepts

• Unlimited Al creation

  Al flashcards, explanations, exams and more...

• Ads-free access

  To over 500 millions flashcards

• Money-back guarantee

  We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

Key Concepts

These are the key concepts you need to understand to accurately answer the question.

Set Theory

Set theory is a critical foundation for understanding different mathematical disciplines. It's all about dealing with collections of objects or "elements." We call these collections "sets." Working with sets involves operations like union, intersection, and complement.
Understanding subsets is essential. For example, when we say a set \( M_1 \) is a subset of \( M_2 \) \((M_1 \subset M_2)\), it means every element of \( M_1 \) is also in \( M_2 \). This concept is crucial for understanding how sets relate within function mappings. Moreover, the inclusion of sets allows for proving set relationships, as seen in the exercise provided.
Set theory provides a versatile language for talking about functions, relations, and structures in mathematics.

Function Mapping

Function mapping is the process of associating each element of one set (domain) to elements in another set (codomain). Symbolically, a function \( f: X \to Y \) implies each \( x \in X \) is related to some \( y \in Y \).
Functions can be thought of as "rules" that assign inputs to outputs. A function might map multiple different inputs to the same output, but each input is mapped to one output only.
In the provided exercise, the mapping of functions onto sets is crucial. This involves understanding both the image, which is the set of outputs a function can give, and the preimage, which is the set of inputs leading to a given output.

Image and Preimage

In function mapping, two key concepts are the image and preimage. The image of a subset \( M \) of the domain through function \( f \) is the set of all outputs \( f(x) \) for \( x \in M \). It's denoted \( f(M) \).
On the other hand, the preimage (or inverse image) involves working backwards. For a subset \( N \) of the codomain, the preimage \( f^{-1}(N) \) includes all inputs in the domain that map to elements in \( N \).
Mathematically, these concepts help us understand relationships between different sets. For example, preimages are used in demonstrating set theory properties in function mappings, such as intersections and unions.

Counterexamples in Mathematics

Counterexamples are powerful tools in mathematics to disprove false assumptions or conjectures. They illustrate how a general statement might fail under certain circumstances.
In mathematics, a single counterexample is enough to show that a statement is not universally true. For example, the function \( f(x) = x^2 \) served as a counterexample in the exercise to show that \( f(M_1 \cap M_2) eq f(M_1) \cap f(M_2) \). Here, \( f \) doesn’t preserve the intersection, emphasizing the importance of checking mathematical statements against diverse conditions.
Thus, counterexamples play a key role in exploring the boundaries of mathematical rules and properties.