MHB Show that the function is 1-1 and onto

  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Function
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hi! (Smile)

I want to prove that, if $f: A \xrightarrow[\text{onto}]{\text{1-1}} B$, then $f^{-1}: B \xrightarrow[\text{onto}]{\text{1-1}} A$.

That's what I have tried:

Let $x,y \in dom(f)$, with $x \neq y$.
Then, since $f:\text{ 1-1 }$, we have that $f(x) \neq f(y)$.
Also, since $f: \text{ onto } $, $\forall b \in B,\exists x$, such that $b=f(x)$.

Is it right so far?

We want to show that, if $y_1,y_2 \in B$, with $y_1 \neq y_2$, then $f^{-1}(y_1) \neq f^{-1}(y_2)$ and that $\forall x \in A, \exists d$, such that $f^{-1}(x)=d$, right?

If so, how could we show this? :confused:
 
Physics news on Phys.org
Hi,

It's correct except the last equality, $$f^{-1}$$ should be applied in the rhs.

Given $$y \in B$$ and the condition f onto implies that $$f^{-1}(y) $$ is non empty, and 1-1 implies that $$f^{-1}(y)$$ is just one point so the inverse of f is well defined.

Try to reverse this argumentation.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top