woundedtiger4
- 188
- 0
As the title says.
The discussion centers on the characteristics of functions that are neither injective, surjective, nor bijective, specifically using the function f(x) = x² as an example. It is established that f: ℝ → ℝ is not injective since f(x) = f(-x) and does not cover negative numbers, making it also not surjective. The importance of clearly defining the domain and codomain is emphasized, as it affects the classification of the function. Restricting the domain can transform f(x) = x² into a bijection from the positive reals to themselves.
PREREQUISITESMathematics students, educators, and anyone interested in understanding the properties of functions and their classifications in mathematical analysis.
Yes sir, exactly.Nugatory said:Are you asking what term we would use to describe a mapping that is neither injective, surjective, nor bijective? Or are you asking for an example of suchba mapping?
Thank you sirWWGD said:To be more precise, as nuuskur pointed out, the function ## f : \mathbb R \rightarrow \mathbb R ## defined by ## f(x)= x^2 ## is neither injective nor surjective; f(x)=f(-x) , and no negative number is the image of any number. You need to clearly state your domain and codomain, otherwise every function is trivially surjective onto its image. If you changed/restricted the domain, OTOH, you can make the same _expression_ ##f(x)=x^2 ## a bijection from the positive Reals to themselves. While long-winded, the point is that you must define your domain and codomain in order to define a function and study its properties unambiguously.
nuuskur said:Yes, thank you WWGD. I apologize for my lazy explanation.
woundedtiger4 said:Thank you sir