Set Theory: Proving h is Surjective Implies f & g

Click For Summary
SUMMARY

The discussion centers on the mathematical proof regarding the surjectivity of functions f: X → Y and g: Y → Z, specifically focusing on the composition h = g o f: X → Z. It is established that if h is surjective, then both g and f must also be surjective. The proof for part a) is well-articulated, demonstrating that the existence of an element a in X leads to the conclusion that g must map to every element in Z. However, part b) presents challenges, as participants express uncertainty about how to leverage the proof from part a) to demonstrate the surjectivity of f.

PREREQUISITES
  • Understanding of function composition in mathematics
  • Knowledge of surjective functions and their properties
  • Familiarity with set theory concepts
  • Basic proof techniques in mathematics
NEXT STEPS
  • Study the properties of surjective functions in detail
  • Learn about function composition and its implications in set theory
  • Explore textbooks on mathematical proofs, such as "How to Prove It" by Daniel J. Velleman
  • Investigate counterexamples in function theory to enhance proof strategies
USEFUL FOR

Mathematics students, educators, and anyone interested in deepening their understanding of function properties and proof techniques in set theory.

BubblesAreUs
Messages
43
Reaction score
1

Homework Statement


Let

f: X ----> Y and g: Y ----> Z

be functions and let

h = g o f: X ----> Z

Homework Equations



a. If h is surjective then g is surjective

b. If h is surjective then f is surjective.

The Attempt at a Solution



Here

h: X ----> Z

a.
Suppose h: x ---> z is surjective for ∈ Z. Since h is surjective ∃a ∈ X such that
h(a) = g(f(a)) = k

Now let y = f(a) ∈ Y so...
g(y) = g(f(a)) = k; as declared QED.

b.
Suppose h: x ---> z is surjective for y...I'm not even sure how to start.

PS: To be honest, I really need to find a good textbook on proofs because my lecturer is outright atrocious. If anyone knows of any texts, do post me some recommendations as well.
 
Physics news on Phys.org
BubblesAreUs said:

Homework Statement


Let

f: X ----> Y and g: Y ----> Z

be functions and let

h = g o f: X ----> Z

Homework Equations



a. If h is surjective then g is surjective

b. If h is surjective then f is surjective.

The Attempt at a Solution



Here

h: X ----> Z

a.
Suppose h: x ---> z is surjective for ∈ Z. Since h is surjective ∃a ∈ X such that
h(a) = g(f(a)) = k

Now let y = f(a) ∈ Y so...
g(y) = g(f(a)) = k; as declared QED.

b.
Suppose h: x ---> z is surjective for y...I'm not even sure how to start.

PS: To be honest, I really need to find a good textbook on proofs because my lecturer is outright atrocious. If anyone knows of any texts, do post me some recommendations as well.

Your proof of a) looks quite good. You didn't say what k is, but it's fairly obvious.

Why do you think b) is true?
 
  • Like
Likes   Reactions: BubblesAreUs
k is just an integer that belongs to set Z.

As for b, I think f is surjective because h is. Since f is an input of g, I'm not exactly sure how I can re-utilise my proof from part a.
 
BubblesAreUs said:
k is just an integer that belongs to set Z.

As for b, I think f is surjective because h is. Since f is an input of g, I'm not exactly sure how I can re-utilise my proof from part a.

If I can't see how to prove something, I usually try to disprove it and see what happens.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 24 ·
Replies
24
Views
3K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
2
Views
1K
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
1K