B Onto set mapping is the surjective set mapping, and into injective?

  • B
  • Thread starter Thread starter mcastillo356
  • Start date Start date
mcastillo356
Gold Member
Messages
637
Reaction score
342
TL;DR Summary
I'm almost sure, but need to check it with the forum. It's about the first chapter of "Introduction to topology and modern analysis" I am reading online.
The textbook is being fine. I asked the forum for some introduction to topology, and decided to start with Simmon`s. This naive question is due to ignorance of the words into and onto, which I don't distinguish in Spanish. A quick browsing sugests I'm right.
 
Physics news on Phys.org
Say, we have ##f\, : \,A\longrightarrow B.##

##f## is onto if it is surjective, i.e., ##\forall\,b\in B\,\exists\,a\in A\, : \,b=f(a).##
##f## is into if it is injective, i.e., ##f(a)=f(a')\Longrightarrow a=a'.##

However, the English language is not always very exact when it comes to "in", "to", or "into". I have seen examples where into just meant ##f(A)\subseteq B## without the requirement of being injective. So, onto equals surjective is always true, into equals injective depends on the author. At least to my experience.

In German, we would use "auf" = "onto" = surjective, "in"="into"=injective, and "nach"="to"= ##f(A)\subseteq B.##
 
  • Like
Likes mcastillo356
fresh_42 said:
Say, we have ##f\, : \,A\longrightarrow B.##

##f## is onto if it is surjective, i.e., ##\forall\,b\in B\,\exists\,a\in A\, : \,b=f(a).##
##f## is into if it is injective, i.e., ##f(a)=f(a')\Longrightarrow a=a'.##
Yes.
fresh_42 said:
However, the English language is not always very exact when it comes to "in", "to", or "into". I have seen examples where into just meant ##f(A)\subseteq B## without the requirement of being injective. So, onto equals surjective is always true, into equals injective depends on the author. At least to my experience.
Simmons is being precise. Into means inyective.
fresh_42 said:
In German, we would use "auf" = "onto" = surjective, "in"="into"=injective, and "nach"="to"= ##f(A)\subseteq B.##
That's accurate, indeed.
Thanks, @fresh_42 !
 
mcastillo356 said:
The textbook is being fine. I asked the forum for some introduction to topology, and decided to start with Simmon`s. This naive question is due to ignorance of the words into and onto, which I don't distinguish in Spanish. A quick browsing sugests I'm right.
To be on the set means occupying the whole set in a particular way and the word “onto” follows the definition of a surjective function at all.
To be in the set means occupying the part of the set but it does not mean that every element of the part of the set is occupied only once and this is the main reason for confusion. The word “into” does not completely follow the definition of an injective function.
 
  • Like
  • Informative
Likes PeroK and mcastillo356
Whether you use into and/or onto is upto you!
 
  • Haha
Likes mcastillo356
I'm working on the Schroether-Bernstein theorem, this is, the next step in the textbook "Introduction to topology and modern analysis", by Simmons. We assume that ##f:\,X\rightarrow{Y}## is a one-to-one mapping of ##X## into ##Y##, and that ##g:\,Y\rightarrow{X}## is a one-to-one mapping of ##Y## into ##X##. Our task is to produce a mapping ##F:\,X\rightarrow{Y}## which is one-to-one onto.
Apologies for my reaction to the previous post.
 
You need to understand the words. As I see it, Simmons uses the following terms:

##f\, : \,X\longrightarrow Y## mapping

##X## is the domain of ##f.##

##f(X)## is the range of ##f.##

##f## maps ##X## into ##Y## means ##f(X)\subseteq Y.##

##f## maps ##X## onto ##Y## means ##f(X)= Y,## surjective.

##f## maps ##X## one-to-one into ##Y## means ##x\neq x' \Longrightarrow f(x)\neq f(x'),## injective.

##f## maps ##X## one-to-one onto ##Y## means ##f## is injective, and surjective, i.e., bijective.

So we have two injective embeddings ##f\, : \,X\hookrightarrow Y## and ##g\, : \,Y\hookrightarrow X## and want to define a bijection ##F\, : \,X \longrightarrow Y,## i.e. a mapping that is also surjective.
 
  • Like
Likes mcastillo356
For example, ##X = Y = \mathbb R## and ##f = g## are both the exponential function. Then how to construct ##F##?
 
PeroK said:
For example, ##X = Y = \mathbb R## and ##f = g## are both the exponential function. Then how to construct ##F##?
In this case you take the identity map. 😉
 
  • #10
PeroK said:
For example, ##X = Y = \mathbb R## and ##f = g## are both the exponential function. Then how to construct ##F##?
No idea. I can only attempt at it: ##F## could be the identity function? @martinbn says so.
Another doubt: The Axiom of Choice is needed?
 
  • #11
mcastillo356 said:
No idea. I can only attempt at it: ##F## could be the identity function? @martinbn says so.
Another doubt: The Axiom of Choice is needed?
No. What do you get from ##g\circ f##?
 
  • #12
mcastillo356 said:
No idea. I can only attempt at it: ##F## could be the identity function? @martinbn says so.
Another doubt: The Axiom of Choice is needed?
I looked it up. The AC is not needed.
 
  • #13
fresh_42 said:
No. What do you get from ##g\circ f##?
##\mathbb{R}^+##?


Real.webp
 
Last edited:
  • #14
mcastillo356 said:
##\mathbb{R}^+##?


View attachment 365430
No. We have ##f\, : \,X\longrightarrow Y## and ##g\, : \,Y\longrightarrow X.## No real numbers anywhere.

I had ##F=f\circ g\circ f## in mind, but I'm not sure whether this is necessary. Try to figure out what you need, when you assume the existence of an element ##y\in Y## that is not in the range of ##f.##
 
  • Like
Likes mcastillo356
  • #15
fresh_42 said:
No. We have ##f\, : \,X\longrightarrow Y## and ##g\, : \,Y\longrightarrow X.## No real numbers anywhere.

I had ##F=f\circ g\circ f## in mind
Does that work?
 
  • #16
PeroK said:
Does that work?
I don't know, I haven't solved it. The idea was born from the fact that the problem statement introduced ##F.## I thought ##f## would already do since ##fg## should be a permutation.
 
  • #17
fresh_42 said:
I don't know, I haven't solved it. The idea was born from the fact that the problem statement introduced ##F.## I thought ##f## would already do since ##fg## should be a permutation.
I suspect the proof is non trivial!
 
  • #18
PeroK said:
Does that work?
It need not work. The image will be contained in the image of ##f##, which need not be onto.
 
  • #19
PeroK said:
I suspect the proof is non trivial!
Indeed. I looked it up. There is really some work to do. I quote:
This seemingly obvious statement is surprisingly difficult to prove.
 
  • #20
fresh_42 said:
Indeed. I looked it up. There is really some work to do. I quote:
That's why i checked about the AC. Think about how awkward it is to get a bijection between ##\mathbb R## and ##\mathbb R^2##.
 
Back
Top