Science:Math Exam Resources/Courses/MATH220/December 2010/Question 05 (b)
{{#incat:MER QGQ flag|{{#incat:MER QGH flag|{{#incat:MER QGS flag|}}}}}}
• Q1 (a) • Q1 (b) • Q1 (c) • Q1 (d) • Q1 (e) • Q1 (f) • Q2 (a) • Q2 (b) • Q3 (a) • Q3 (b) • Q3 (c) • Q4 (a) • Q4 (b) • Q4 (c) • Q5 (a) • Q5 (b) • Q5 (c) • Q6 (a) • Q6 (b) • Q7 (a) • Q7 (b) • Q8 (a) • Q8 (b) • Q9 (a) • Q9 (b) • Q10 (a) • Q10 (b) • Q10 (c) •
Question 05 (b) |
|---|
|
Prove that the following function is bijective: defined by |
|
Make sure you understand the problem fully: What is the question asking you to do? Are there specific conditions or constraints that you should take note of? How will you know if your answer is correct from your work only? Can you rephrase the question in your own words in a way that makes sense to you? |
|
If you are stuck, check the hint below. Consider it for a while. Does it give you a new idea on how to approach the problem? If so, try it! |
Hint |
|---|
|
Recall that a function is bijective if it is one to one and onto. |
|
Checking a solution serves two purposes: helping you if, after having used the hint, you still are stuck on the problem; or if you have solved the problem and would like to check your work.
|
Solution |
|---|
|
We first show our function is one to one (injective). Let be such that , that is, Cross multiplying gives Simplifying yields and cancelling like terms shows that To show our function is onto, suppose that . We want to know if there is a such that , that is,
If we isolate for our x, we see that
Notice in the last step dividing by is allowed since . Defining implies that . It remains to show that , that is, . Using a proof by contradiction we assume that , which implies
A contradiction! Hence, indeed, and the proof is complete. |
{{#incat:MER CT flag||
}}
