Is the solution to this problem as trivial as I think?

Click For Summary
SUMMARY

The discussion centers on the properties of functions and their preimages, specifically addressing the statements that for sets ##M, N## and a function ##f : M \rightarrow N##, it holds that ##L \subseteq f^{-1}(f(L))## and ##f^{-1}(f(P)) \subseteq P## for subsets ##L \subseteq M## and ##P \subseteq N##. The initial confusion regarding the notation ##f^{-1}## being interpreted as an inverse function is clarified; it is actually a set representing preimages. The participants confirm that the proofs of these statements are straightforward and emphasize the importance of understanding preimages over inverse functions.

PREREQUISITES
  • Understanding of set theory and functions
  • Familiarity with the concept of preimages in mathematics
  • Knowledge of mathematical notation for functions and sets
  • Basic proficiency in mathematical proofs
NEXT STEPS
  • Study the properties of preimages in set theory
  • Learn about the differences between inverse functions and preimages
  • Explore examples of functions and their preimages, such as ##f:\mathbb{R} \to \mathbb{R}## defined by ##f(x)=x^2##
  • Review set identities and relations to deepen understanding of function properties
USEFUL FOR

Mathematicians, students studying set theory, and anyone interested in the properties of functions and their preimages will benefit from this discussion.

PhysicsRock
Messages
121
Reaction score
19
The problem goes as follows: Let ##M, N## be sets and ##f : M \rightarrow N##. Further let ##L \subseteq M## and ##P \subseteq N##. Then show that ##L \subseteq f^{-1}(f(L))## and ##f^{-1}(f(P)) \subseteq P##.
Obviously, I would simply use the definition of a functions inverse to obtain ##f^{-1}(f(L)) = L \subseteq L## and vice versa for ##P##. This seems quite trivial to me though, so am I doing this correctly or is there a mistake in my thoughts?

Thank you everyone and have a great day.
 
Physics news on Phys.org
PhysicsRock said:
The problem goes as follows: Let ##M, N## be sets and ##f : M \rightarrow N##. Further let ##L \subseteq M## and ##P \subseteq N##. Then show that ##L \subseteq f^{-1}(f(L))## and ##f^{-1}(f(P)) \subseteq P##.
Obviously, I would simply use the definition of a functions inverse to obtain ##f^{-1}(f(L)) = L \subseteq L## and vice versa for ##P##. This seems quite trivial to me though, so am I doing this correctly or }1is there a mistake in my thoughts?

Thank you everyone and have a great day.
You have a typo in the ##P## statement.

##f^{-1}## is not the inverse function. It is a set, namely ##f^{-1}(L)=\{m\in M\,|\,f(m)\in L\}.##

It isn't difficult to prove these statements, but it's not about inverse functions, just preimages.
 
fresh_42 said:
You have a typo in the ##P## statement.

##f^{-1}## is not the inverse function. It is a set, namely ##f^{-1}(L)=\{m\in M\,|\,f(m)\in L\}.##

It isn't difficult to prove these statements, but it's not about inverse functions, just preimages.
That clears things up, thank you :)
 
As an example if you're still confused, ##f:\mathbb{,R} \to \mathbb{R}## defined by ##f(x)=x^2##. Try computing ##f^{-1}(f(L))## for ##L=[0,1]##
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 18 ·
Replies
18
Views
2K
  • · Replies 5 ·
Replies
5
Views
993
  • · Replies 2 ·
Replies
2
Views
612