MATH220 December 2010
• 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.
- If you are stuck on a problem: Read the solution slowly and as soon as you feel you could finish the problem on your own, hide it and work on the problem. Come back later to the solution if you are stuck or if you want to check your work.
- If you want to check your work: Don't only focus on the answer, problems are mostly marked for the work you do, make sure you understand all the steps that were required to complete the problem and see if you made mistakes or forgot some aspects. Your goal is to check that your mental process was correct, not only the result.
|
Solution
|
Found a typo? Is this solution unclear? Let us know here. Please rate my easiness! It's quick and helps everyone guide their studies.
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.
|
Click here for similar questions
MER QGH flag, MER QGQ flag, MER QGS flag, MER RT flag, MER Tag Function properties, Pages using DynamicPageList3 parser function, Pages using DynamicPageList3 parser tag
|
Math Learning Centre
- A space to study math together.
- Free math graduate and undergraduate TA support.
- Mon - Fri: 12 pm - 5 pm in LSK 301&302 and 5 pm - 7 pm online.
Private tutor
|