Date | May 2011 | Marks available | 11 | Reference code | 11M.3srg.hl.TZ0.4 |
Level | HL only | Paper | Paper 3 Sets, relations and groups | Time zone | TZ0 |
Command term | Show that | Question number | 4 | Adapted from | N/A |
Question
The function f:R+×R+→R+×R+ is defined by f(x, y)=(xy2,xy).
Show that f is a bijection.
Markscheme
for f to be a bijection it must be both an injection and a surjection R1
Note: Award this R1 for stating this anywhere.
injection:
let f(a, b)=f(c, d) so that (M1)
ab2=cd2 and ab=cd A1
dividing the equations,
b3=d3 so b=d A1
substituting,
a = c A1
it follows that f is an injection because f(a, b)=f(c, d)⇒(a, b)=(c, d) R1
surjection:
let f(a, b)=(c, d) where (c, d)∈R+×R+ (M1)
then c=ab2 and d=ab A1
dividing,
b3=cd so b=3√cd A1
substituting,
a=d×3√cd A1
it follows that f is a surjection because
given (c, d)∈R+×R+ , there exists (a, b)∈R+×R+ such that f(a, b)=(c, d) R1
therefore f is a bijection AG
[11 marks]
Examiners report
Candidates who knew that they were required to give a rigorous demonstration that f was injective and surjective were generally successful, although the formality that is needed in this style of demonstration was often lacking. Some candidates, however, tried unsuccessfully to give a verbal explanation or even a 2-D version of the horizontal line test. In 2-D, the only reliable method for showing that a function f is injective is to show that f(a, b)=f(c, d)⇒(a, b)=(c, d).