Can the choice of codomain affect the surjectivity of a function?

  • Thread starter Thread starter dijkarte
  • Start date Start date
  • Tags Tags
    Function
dijkarte
Messages
190
Reaction score
0
Given a function f(x) f:A --> B, can the choice of codomain affect whether or not the function is surjective? For instance, f(x) = exp(x), f:R --> R is an injection but not surjection. However, assuming we can vary the co-domain, and let's make it f: R --> (0, inf), f(x) is now bijection. Is this correct?
 
Mathematics news on Phys.org
Yes. The codomain pretty much determines by itself whether or not the function is surjective.
 
Got it. Thanks.
 
dijkarte said:
Got it. Thanks.

I should probably qualify my previous post. The codomain determines surjectivity in the sense that if you define the codomain to be the same as the range of the function, then your function becomes surjective. In fact, given any function, you can restrict the codomain in such a way as to make the function surjective (you can also restrict the domain in such a way to make it injective). A different function with the same codomain obviously may not be surjective.
 
But there's no rule which restricts the specification of the codomain based on the mapping rule itself as long as the range is a subset of the codomain. For instance, f(x) = sin(x) can be specified as:

f: R --> R
f: R --> [-2, 2)
f: R --> [-1, 1]

but not as f: R --> [0, 4]
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top