Union Homework: Prove f(E U F)=f(E) U f(F)

  • Thread starter Thread starter Bashyboy
  • Start date Start date
  • Tags Tags
    Image Union
Click For Summary
SUMMARY

The discussion centers on proving the set function properties of a function f: A → B, specifically that f(E ∪ F) = f(E) ∪ f(F) and f(E ∩ F) ⊆ f(E) ∩ f(F) for subsets E, F of A. The proof begins by demonstrating that f(E ∪ F) ⊆ f(E) ∪ f(F) is straightforward. The challenge arises in proving the reverse inclusion, where it is clarified that if y belongs to f(E) ∪ f(F), then there exists an x in E ∪ F such that f(x) = y, confirming the equality holds under the defined conditions.

PREREQUISITES
  • Understanding of set theory, particularly union and intersection of sets.
  • Familiarity with functions and their mappings, specifically the notation f: A → B.
  • Knowledge of the definition of image sets, such as f(E) = {f(x) | x ∈ E}.
  • Basic proof techniques in mathematics, including direct proof and contradiction.
NEXT STEPS
  • Study the properties of functions in set theory, focusing on images and pre-images.
  • Explore the concepts of injective and surjective functions to understand their implications on set mappings.
  • Learn about the role of counterexamples in mathematical proofs, particularly in set theory.
  • Investigate advanced topics in set theory, such as cardinality and its relation to functions.
USEFUL FOR

Mathematics students, educators, and anyone studying set theory and functions, particularly those preparing for advanced topics in abstract algebra or real analysis.

Bashyboy
Messages
1,419
Reaction score
5

Homework Statement


Show that if ##f: A \rightarrow B## and ##E,F \subseteq A##, then ##f(E \cup F) = f(E) \cup f(F)##, and ##f(E \cap F) \subseteq f(E) \cap f(F)##.

Homework Equations



##f(E) := \{f(x)~|~ x \in E \}##.

The Attempt at a Solution



Okay, showing ##f(E \cup F) \subseteq f(E) \cup f(F)## is rather easy. Let us look at the second direction. Let ##y \in f(E) \cup f(F)## be arbitrary. Then ##y \in f(E)## or ##y \in f(F)##, which means there exists ##x_1 \in E## and ##x_2 \in F## such that ##f(x_1) = y = f(x_2)##.

It isn't clear why this implies ##y = f(x) \in f(E \cup F) := \{f(x) ~|~ x \in E ~or~ x \in F \}##. Certainly if ##x_1 = x_2 := x## were the case, then I could see this.
 
Physics news on Phys.org
What you proceeded isn't correct.
##y\in f(E)## or ##y\in f(F)## implies that ##\exists x\in E## or ##x\in F,## that is, ##x\in E\cup F,## st. ##f(x)=y.## Hence ##y\in f(E\cup F).##
 
Why wouldn't we have different ##x##'s? For instance, consider ##y=f(x) = x^2##. Given a ##y##, there exist two different ##x##'s.
 
There's no another ##x## in my statement. Just confirm if ##x## belongs to ##E\cup F.##
 

Similar threads

Replies
6
Views
2K
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
20
Views
4K
  • · Replies 12 ·
Replies
12
Views
2K
Replies
3
Views
1K
  • · Replies 0 ·
Replies
0
Views
950