3
$\begingroup$

Determine whether each of these functions is a bijection from $\mathbb{R}$ to $\mathbb{R}$

a) $f(x)=-3x+4$

So I know that a function is bijective if it is both injective (one-to-one) and surjective (onto).

A function is one-to-one if every $x$ has a unique $y$.

And it is onto if for every $y$ there is an $x$ such that $f(a)=b$.

But I don't know how write it down and show that $f(x)=-3x+4$ is bijective

$\endgroup$
6
  • 1
    $\begingroup$ Take $y=f(x)$ and determine x in terms of y. $\endgroup$
    – Pratyush
    Commented Apr 16, 2015 at 11:40
  • 2
    $\begingroup$ Do you want a formal proof? Actually, a linear function $f(x) = ax+b$ is always bijective $\endgroup$
    – Alex Silva
    Commented Apr 16, 2015 at 11:41
  • 1
    $\begingroup$ Please read the definition of injectivity: a function is one-to-one if every $y$ has at most one $x$. $\endgroup$
    – Siminore
    Commented Apr 16, 2015 at 11:43
  • 1
    $\begingroup$ @AlexSilva (if $a\ne0$) $\endgroup$ Commented Apr 16, 2015 at 12:20
  • 1
    $\begingroup$ @MarioCarneiro, Yes! You're right Thanks! $\endgroup$
    – Alex Silva
    Commented Apr 16, 2015 at 12:46

4 Answers 4

2
$\begingroup$

You allready received nice answers focused on injectivity and surjectivity. Here a slightly different route.

Can you find a function $g:\mathbb R\rightarrow \mathbb R$ such that $f(g(x))=x$ for each $x\in\mathbb R$?

If you have found such $g$ then check whether it is also true that $g(f(x))=x$ for each $x\in\mathbb R$.

If so then you are ready because you have shown that $f$ is "invertible" (i.e. has an inverse). A function is bijective if and only if it is invertible.

You could also take the opposite route: finding a function $g:\mathbb R\rightarrow \mathbb R$ such that $g(f(x))=x$ for each $x\in\mathbb R$ and checking whether it is also true that $f(g(x))=x$ for each $x\in\mathbb R$.

$\endgroup$
7
  • $\begingroup$ FYI the correct term for "has an inverse" is invertible. Also your two routes involve exactly the same checks - what's the difference? $\endgroup$ Commented Apr 16, 2015 at 12:21
  • $\begingroup$ @MarioCarneiro Thank you, I corrected. As you said there is no essential difference between the two routes. The OP can decide what is most easy for him: finding $g$ based on $f\circ g=1$ (and check $g\circ f=1$) or finding $g$ based on $g\circ f=1$ (and check $f\circ g=1$). $\endgroup$
    – drhab
    Commented Apr 16, 2015 at 13:15
  • 1
    $\begingroup$ @Valentino There are lots of cases in which it is quite difficult to find the inverse itself. Essential here is not finding it, but proving that it exists, which actually comes to the same as proving injectivity and surjectivity. I gave this answer because in this case it is easy to find the inverse. Secondly in my view it is good to emphasize that 'being invertible' is exactly the same thing as 'being bijective'. $\endgroup$
    – drhab
    Commented Apr 16, 2015 at 14:32
  • 1
    $\begingroup$ @ drhab I completely agree! I think things start going a lot more smoothly later on once one learns that being invertible is exactly the same thing as being bijective. That fact comes up probably every day. However, I was wondering if you have tried to prove cardinality type problems like this. If so, was it easier or harder, or just the same? $\endgroup$
    – Valentino
    Commented Apr 16, 2015 at 14:34
  • 1
    $\begingroup$ @Valentino My experience in this is very 'poor'. I am just too lazy for doing things like that :) So my answer is: "no, I never tried that." I hope that it is not disappointing for you. $\endgroup$
    – drhab
    Commented Apr 16, 2015 at 14:38
1
$\begingroup$
  1. Surjective: For any $y\in \Bbb R$, there exists $x=\frac{4-y}{3}$ such that $f(x)=y$.

  2. Injective: For any $a\not=b$, does it $-3a+4=-3b+4$ hold?

$\endgroup$
1
$\begingroup$

Let the function $f:\mathbb{R}\to \mathbb{R}$ be defined by $f(x)=-3x+4$.

We say that a function $f$ is injective if $\forall x_{1},x_2 $ $f(x_{1})=f(x_2)$ implies $x_1 = x_2$. Hence, after some algebra we can see that $-3x_{1}+4= -3x_2+4$ implies $x_1=x_2$. So our function is injective.

Now, we say a function is surjective if for all $y\in \mathbb{R}$(range) there is some $x\in \mathbb{R}$ (domain) such that $f(x)=y$. Choose $x = \frac{4-y}{3}$, then we can see that $f(x)=y$.

A function is bijective if it is both surjective and injective. Hence, $f$ is bijective.

If you have any further questions please let me know.

$\endgroup$
1
  • 1
    $\begingroup$ The last word of your second paragraph was supposed to be injective. $\endgroup$ Commented Apr 17, 2015 at 1:57
0
$\begingroup$

One-to-one:

Suppose there are two values $x_1,x_2$ such that $f(x_1)=f(x_2)$. Show that $x_1=x_2$ necessarily.

Onto:

Take $y=-3x+4$ and try to obtain $x$ in terms of $y$.

$\endgroup$
1
  • 1
    $\begingroup$ If I try to obtain $x$ in terms of $y$ I am actually inverting it. $\endgroup$ Commented Apr 16, 2015 at 11:51

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .