Proving f(f-1(B))=B: Understanding Preimages and Set Inclusion

  • Thread starter Thread starter SMA_01
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around the properties of functions and their preimages, specifically addressing the statement that for a function f: S → T and a subset B of T, f(f-1(B)) = B. Participants are exploring the conditions under which this equality holds and the implications of set inclusion.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants are questioning whether the proof should involve demonstrating set inclusion in both directions. There is also discussion about the necessity of additional assumptions on the function f, particularly regarding its surjectivity.

Discussion Status

Some participants have provided insights into the need for extra assumptions for the equality to hold, while others are exploring the implications of these assumptions. There is an ongoing examination of specific examples to illustrate the points being made.

Contextual Notes

Participants note that the equality f(f-1(B)) = B may not hold without certain conditions on the function f, such as surjectivity. The discussion includes examples that highlight these constraints.

SMA_01
Messages
215
Reaction score
0

Homework Statement



Define f:S→T, where B\subseteqT. Let f-1(B)={x\inS:f(x)\inB} be the preimage of B.

Demonstrate that for any such map f, f(f-1(B))=B.

My main question is, would I prove this using set inclusion both ways?

I was going to begin by letting an element be in the preimage of B, and explain what that means, then mapping that element to B. Would this be correct?

I just need a push in the right direction.

Thank you.
 
Physics news on Phys.org
SMA_01 said:

Homework Statement



Define f:S→T, where B\subseteqT. Let f-1(B)={x\inS:f(x)\inB} be the preimage of B.

Demonstrate that for any such map f, f(f-1(B))=B.

My main question is, would I prove this using set inclusion both ways?

I was going to begin by letting an element be in the preimage of B, and explain what that means, then mapping that element to B. Would this be correct?

I just need a push in the right direction.

Thank you.
Generally, yes. To show set equality you need to show inclusion in both directions.
 
Define f:S→T, where B\subseteqT. Let f-1(B)={x\inS:f(x)\inB} be the preimage of B.

Demonstrate that for any such map f, f(f-1(B))=B.
Just to let you know, but that equality is false in general. You need extra assumptions on f.
 
SammyS- Thank you

Micromass- Yes, the function needs to be surjective, right? I'm not sure why there were no assumptions...
 
micromass said:
Just to let you know, but that equality is false in general. You need extra assumptions on f.
I'm very reluctant to question you, micromass.

But isn't the extra assumption of f needed for f^{-1}\left(f(A)\right)=A rather than for f\left(f^{-1}(B)\right)=B\ ?
 
SammyS said:
I'm very reluctant to question you, micromass.

But isn't the extra assumption of f needed for f^{-1}\left(f(A)\right)=A rather than for f\left(f^{-1}(B)\right)=B\ ?

An extra assumption is needed for both. Consider f(x)=x^2 and B=[-1,0]. Then f^{-1}(B)=\{0\} and thus f(f^{-1}(B))=\{0\}. The problem is that f is not surjective.
 
micromass said:
An extra assumption is needed for both. Consider f(x)=x^2 and B=[-1,0]. Then f^{-1}(B)=\{0\} and thus f(f^{-1}(B))=\{0\}. The problem is that f is not surjective.
Well, my reluctance was well founded!

Thanks as always.
 

Similar threads

Replies
6
Views
2K
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K