Can you find a counterexample for this set theory statement?

  • Context: MHB 
  • Thread starter Thread starter Romono
  • Start date Start date
Click For Summary
SUMMARY

The discussion focuses on disproving the set theory statement that if z ∈ (f(X) ∩ f(Y)), then z ∈ f(X ∩ Y) for a function f: A -> B, where X, Y ⊆ A. A counterexample is provided using the function f: {1, 2} -> {1, 2} defined by f(1) = 1 and f(2) = 1, with X = {1} and Y = {2}. This example demonstrates that while 1 is in f(X) ∩ f(Y), it is not in f(X ∩ Y) since X ∩ Y = ∅. The discussion emphasizes the utility of constant functions and the image of the empty set in constructing counterexamples.

PREREQUISITES
  • Understanding of set theory concepts, particularly intersections and images of sets.
  • Familiarity with functions and their mappings, specifically finite functions.
  • Knowledge of counterexamples in mathematical proofs.
  • Basic comprehension of the properties of empty sets in relation to functions.
NEXT STEPS
  • Explore the properties of constant functions in set theory.
  • Study the implications of the image of the empty set under various functions.
  • Learn about finite domains and codomains in function theory.
  • Investigate additional counterexamples to similar set theory statements.
USEFUL FOR

Mathematicians, students of set theory, and anyone interested in understanding the nuances of function mappings and counterexamples in mathematical proofs.

Romono
Messages
5
Reaction score
0
How would you disprove if z ∈ (f(X) ∩ f(Y)) then z ∈ f(X ∩ Y)? (Where f: A -> B, if X, Y ⊆ A.) I'm just not sure how to approach this.
 
Last edited:
Physics news on Phys.org
Romono said:
How would you disprove if z ∈ (f(X) ∩ f(Y)) then z ∈ f(X ∩ Y)? (Where f: A -> B, if X, Y ⊆ A.) I'm just now sure how to approach this.

Hi again Romono,

When facing questions like these, try starting with a function that has a finite domain and codomain. In this question for example, you can consider the function $f : \{1, 2\} \to \{1, 2\}$ given by $f(1) = 1$ and $f(2) = 1$. Let $X = \{1\}$ and $Y = \{2\}$. Then $X \cap Y = \emptyset$, so $f(X\cap Y) = \emptyset$. On the other hand, since $f(X) = \{1\}$ and $f(Y) = \{1\}$, $f(X) \cap f(Y) = \{1\}$. So we have $1 \in f(X) \cap f(Y)$, but $1\notin f(X \cap Y)$. Can you find another example?
 
In general an easy way to come up with a counterexample here is to exploit the fact that the image of the empty set under any function $f$ is empty. Hence it suffices to find a function $f$ and two disjoint $X$ and $Y$ such that $f(X) \cap f(Y)$ is non-empty, and you are done. The constant function is probably the simplest example.​
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K