Functions: Domain, Range, Composition and Inverses
~55 min · WMA13 · 1.2
WMA13 · 1.2 · 55 min
A function is not a formula — it is a formula plus a , and an inverse is not a new function you find, it is the same mapping walked backwards, which only works if nothing had two ways to get there. Every mark this topic loses is one of those two ideas going unstated: a domain the algebra never needed but the mark scheme was still waiting for, or an inverse attempted on a function that was never one-one to begin with.
Key terms in this lesson
Before you read on
Two or three questions on exactly what this lesson teaches. Being wrong here is fine — it's the fastest way to find out what to pay attention to next.
What a function actually is, and the one distinction the whole topic runs on
A function is a rule that assigns to every input exactly one output. This course's own transcription of the spec's own guidance puts it as "the concept of a function as a one-one or many-one mapping from (or a subset of ) to " — every input to a genuine function has exactly one output, which is why is not a function of (the input gives two outputs, and ) even though is one (every gives exactly one ). Written as or , the two notations mean the same thing; the spec expects both to be recognised.
The domain is the set of inputs the function is actually applied to — what you are allowed to put in. The range is the set of outputs that actually come out — not a set you choose, but a consequence of the domain and the rule together. This is the distinction the third prequestion question above was built to expose: an unrestricted domain (" can be anything") says nothing on its own about whether the range is unrestricted too. A quadratic with domain all of still has a range bounded on one side, because its graph has a turning point; a fraction with domain all of except one value has a range that is missing a value too, for a related reason met later in this lesson.
The distinction the spec singles out by name — "one-one or many-one" — is about how many inputs share an output. A function is one-one if every output comes from exactly one input: no two different -values ever give the same . A function is many-one if at least one output is shared by more than one input. on all of is , because : two different inputs, one output. on all of is : solving forces , so no two different inputs can ever share an output. This is not a side classification — it is the single fact the rest of this lesson is built to use, because whether a function has an inverse (as a function, not just as a reversed rule) depends on nothing else.
A graphical shortcut for one-one-ness, standard in this topic though not named in the spec's own wording: sketch the curve and draw a horizontal line at any height. If every horizontal line meets the curve at most once, the function is one-one; if some horizontal line meets it twice, it is many-one. For , the line meets the curve at both and — visibly many-one. This is the same fact as the algebraic test above, seen from the picture instead of the equation, and it is worth having both: the picture is faster to check, the algebra is what a mark scheme actually credits.
Composition — building one function out of two
Given two functions and , the composite function is formed by applying first and then applying to the result. This course's own research transcribes the spec's own guidance verbatim: "students should know that means 'do g first, then f'." So means — read the notation right to left, applied left to right: the letter closest to the bracket, , acts on first.
Concretely, with and : — take 's output, , and feed it into . Going the other way, . These are genuinely different functions, not two ways of writing the same thing — , while . Composition order is not a notational nicety to get right for its own sake; and are different rules with, in general, different domains, different ranges, and different values everywhere except where they happen to coincide by accident.
The domain of a is not automatically the domain of its outer function. is only defined where is itself a valid input to — so if 's own domain is restricted, that restriction becomes a condition on , not on directly, and has to be translated back into a condition on . Take restricted to (met properly, with its inverse, later in this lesson), composed with on all of : only makes sense where , i.e. where , i.e. — a restriction on that came entirely from 's own restricted domain, filtered through what does to first. Forgetting this is a real and easy trap: a composite built from a domain-restricted function inherits a domain restriction of its own, translated through the inner function, not copied unchanged.
Why some machines can't be run backwards — before the algebra
In plain terms
Picture a machine that squares whatever number you post into it. Post in 3, it hands you back 9. Post in −3, it also hands you back 9 — two different starting numbers, one and the same output. Now walk round to the OUTPUT slot, holding a 9, and try to run the machine in reverse: what number was originally posted in? There is no single right answer — it could have been 3, it could have been −3, and both are equally true. That is the whole problem with reversing this machine: reversing means handing back one number, and here there are genuinely two correct ones. Now change the rule at the input slot: only non-negative numbers allowed in — 0, 1, 2, 3, 4, and so on, nothing negative ever accepted. Post in 3, get 9. Post in 0, get 0. Post in 4, get 16. Every number you're now allowed to post gives a different output from every other one you're allowed to post, because the negative twin that used to share its output (−3, −4, ...) has been locked out at the door. Walk round to the output slot again, holding a 9: this time exactly one number could have produced it and still have been allowed in — 3. Reversing now works, every time, with no ambiguity. There's a second thing worth noticing while the numbers are still in front of you. Reversing the machine means: take an output (say 9), hand back its non-negative square root (3). The numbers the reversed machine is allowed to accept as input are exactly the numbers the original machine could actually produce as output — 0, 1, 4, 9, 16, and so on, never anything negative, because the squaring machine never outputs a negative number either. And the numbers the reversed machine hands back are exactly the numbers the original machine was allowed to accept — 0, 1, 2, 3, 4, .... The 'allowed in' list and the 'comes out' list have swapped jobs completely between the two machines.
Name what just happened. A machine (a function) is many-one when two different inputs — like 3 and −3 — share a single output, like 9; a many-one machine cannot be run in reverse, because reversing it would have to hand back two different numbers for the one input it was just given, and a machine that gives more than one answer for the same input has stopped being a function at all, reversed or not. Banning the negative inputs turned the squaring machine one-one: every input left allowed now owns its output alone, nobody sharing it with anyone else. The list of allowed inputs is the machine's ; the list of outputs it can actually produce is its . Building the reverse machine swaps the two lists over completely — whatever could go IN to the original becomes what comes OUT of the reverse, and whatever used to come OUT becomes what's now allowed IN.
Formally
An inverse function exists only where is one-one on its domain: if for some , then would have to map that shared output to both and , which violates the one-input-one-output requirement that defines a function in the first place. Restricting a many-one function's domain to a single branch — for , exactly as above — makes it one-one and gives it an inverse, . Because finding means swapping and in , this domain restriction has a direct consequence: the domain of equals the range of , and the range of equals the domain of . The mechanism below derives this rigorously and applies it to the restricted quadratics this course actually examines.
Mechanism
Why an inverse needs one-one — and why domain and range swap places
An is meant to undo : feed it an output of , and it should hand back the input that produced it. Follow that requirement to its logical end and one-one-ness stops being a rule to memorise and becomes unavoidable. Suppose is many-one: some output is shared by two different inputs, and , with and . Feed into and ask what comes out. It has to be , because is meant to undo . It also has to be , because is meant to undo . One input, , with two required outputs — but that is precisely the property that disqualifies something from being a function at all, the same one-input-one-output requirement the very first teach block opened with. So exists as a function if and only if is one-one: not a separate condition bolted onto the definition, but the definition of "function" applied to the reversed rule. This is exactly why domain restriction matters so much in this topic — on all of is many-one and has no inverse function, but restricted to is one-one (every non-negative output now comes from exactly one non-negative input), and that restricted version does have an inverse: . Nothing about the formula changed; what changed is which inputs are on offer. Now follow the mechanics of actually finding , and a second fact falls out for free. The standard method is: write , swap and (this is the "walk it backwards" step — the new equation asks "what produces this ?" using the old equation's own rule), then rearrange to make the subject again. Because the swap literally exchanges the two letters' roles, whatever set of values was allowed to range over becomes the set ranges over in the new equation, and vice versa. Translated back into function language: the domain of is the range of , and the range of is the domain of . This is not a separate fact to memorise alongside "swap and " — it is what swapping and *means*. It is also why the spec's own guidance, transcribed verbatim during this course's own research pass, states : applying and then (or the other way round) walks forward along the rule and then immediately back along it, landing exactly where it started, for every in the appropriate domain.
x-axis: x · y-axis: y
- C1 · y = f(x), a one-one restricted quadratic
- An upward parabola shown only on its increasing branch, from its vertex rightward — the domain restriction (x ≥ the vertex's x-coordinate) is what makes this branch one-one, since no horizontal line crosses it twice. The curve starts at the vertex and rises without bound to the right.
- C2 · y = f⁻¹(x), the reflection of C1 in the line y = x
- The mirror image of C1 in the diagonal line y = x. Every point (p, q) on C1 becomes the point (q, p) on C2 — literally swapping the coordinates, which is the geometric picture of algebraically swapping x and y. It starts at the reflected vertex and rises, but now reading left to right along the OTHER axis from where C1's growth was unbounded.
- C3 · y = x, the mirror line itself
- Drawn as a thin diagonal reference line. C1 and C2 are symmetric about it — fold the page along this line and the two curves land exactly on each other. Neither curve needs to touch this line anywhere for the reflection relationship to hold.
- Vertex of f, (v, m), and its mirror image (m, v) on f⁻¹
- Coordinates literally swap. If the vertex of the restricted quadratic is at (v, m) — v is where the domain restriction starts, m is the minimum output — the corresponding point on f⁻¹ is (m, v): m is now an input, v is now an output. This single swapped point is the fastest way to sanity-check a claimed inverse.
- Domain of f = range of f⁻¹; range of f = domain of f⁻¹
- The mechanism block derives this from the x/y swap directly. On the picture, it shows up as: whatever interval of the x-axis C1's domain covers, C2's range covers the same interval on the y-axis — because C2 is C1 with the axes' roles exchanged.
- Only the ONE surviving branch reflects into a function
- If the full parabola (both branches, unrestricted domain) were reflected in y = x, the mirror image would fail the vertical-line test — it would be many-valued, not a function. The domain restriction on f is what guarantees the reflection is a genuine function rather than just a mirrored curve.
Common error: Drawing f⁻¹ as a translation or a different-shaped curve altogether, rather than the exact mirror image of f in y = x — or omitting the y = x line entirely, so the reflection relationship is asserted rather than shown.
Correct: f⁻¹'s graph is not a new curve to invent; every point on it is a specific, mechanically determined reflection of a point on f. Sketching y = x first and reflecting f's key points across it (the endpoint, and one or two further points) is faster and safer than trying to picture the inverse shape from scratch.
Worked, in full
Find f⁻¹(x) and state its domain, for f(x) = x² − 4x + 7, x ≥ 2
- 01
Confirm f has an inverse before doing anything else. Complete the square: half of is , and is too big, so and . The vertex is at , and the stated domain starts exactly there — this is the increasing branch, so is one-one on this domain and does have an inverse. Without this domain restriction, would be the full, many-one parabola and no inverse function would exist at all.
Earns: B1 — a correct explanation that f is one-one on the given domain (increasing from the vertex, or equivalently: no repeated outputs on x ≥ 2). Independent of every mark below — an entirely separate B mark for the reasoning, per the general marking guidance's own definition of a B mark as needing no method attached to it.
- 02
Having confirmed the completed-square form is needed anyway, use it: state the range of directly from . The square is zero at (the left end of the domain) and grows without bound as increases, so .
Earns: B1 — states the range of f, f(x) ≥ 3. This mark matters beyond itself: the mechanism block above established that the domain of f⁻¹ IS the range of f, so this line is not a detour, it is the answer to the final stage of this chain, found early because the completed-square form makes it available for free.
- 03
Let and swap and : . This is the "walk it backwards" step from the mechanism block, applied mechanically.
Earns: M1 — attempts the swap-and-rearrange method for an inverse: writes y = f(x) (or works directly from f(x)) and swaps the roles of x and y, or equivalently rearranges directly for x in terms of y without the explicit swap. Either presentation earns this mark; what is being checked is the method, not the notation used to display it.
- 04
Rearrange for : , so . Two branches appear, and the original domain restriction is what decides between them: the stated domain was , i.e. once relabelled, so — which selects the positive square root. .
Earns: dM1 — correctly resolves the ± ambiguity using the original domain restriction, dependent on the method mark above. This is the step a rushed answer skips entirely: writing 2 ± √(x−3) and stopping is not yet an inverse function, since a function cannot return two values for one input — exactly the one-input-one-output requirement from the very first teach block, now applied to the answer itself.
- 05
State the result in function notation: .
Earns: A1 — the correct expression for f⁻¹(x), cao. Check it against the mechanism block's own test: swapping x and y should reflect (2,3), the vertex of f, into (3,2) on f⁻¹ — and indeed f⁻¹(3) = 2 + √0 = 2. ✓
- 06
State the domain of : it is the range of , already found in stage 2. Domain of : .
Earns: B1 — the domain of f⁻¹, independent of the algebra above (it is read from stage 2's range of f, not derived from the formula for f⁻¹ itself). This is the exact structure this course's own research verifies from a real mark scheme (Jan 2023 Q1(c), which finds g⁻¹(x) rather than f⁻¹(x) — the function tested there is a fraction, not a quadratic, but the mark structure is identical): M1 A1 for the algebra of the inverse, and a separate, independent B1 for its domain — and that same research pass's per-topic findings record this specific mark, across three separate series, as the one most often left unclaimed even by candidates who got everything above it right.
Complete it yourself
Complete the chain — f⁻¹(x) and its domain, for f(x) = (x + 1)² − 6, x ≤ −1
- 01
is already in completed-square form: vertex . The domain is the branch running from up to the vertex — the LEFT arm, where the curve is decreasing as increases towards . This branch is one-one (each output on it comes from exactly one input), so has an inverse here, even though the full unrestricted parabola would not.
- 02
Range of on this domain: the square is zero at , the right-hand end of the domain, and grows without bound as decreases from there — so the minimum value is still attained, and .
In your own words
In one sentence: why does swapping x and y to find an inverse automatically mean the domain of f⁻¹ has to equal the range of f, rather than this being two separate facts to remember?
Marked, line by line
, . (a) Express in the form , and hence state the range of . (3) (b) Explain why has an inverse function, find , and state its domain. (4) (c) for . Find in the form , and hence write down the minimum value of . (3) — VERIDIAN-original question, inspired by the real structure this course's own research confirms for this sub-topic: a completing-the-square part feeding a 'hence' inverse-function part with its own separately-marked domain (the exact shape verified from Jan 2023 Q1(c)'s M1 A1 / B1 split), followed by a composition part. Not a reproduction of any past-paper question; the per-line mark allocations are modelled on verified mark-scheme conventions, not copied from a real scheme.
10 marks available
(a) — 3 marks
- 01B1
: factor 2 out of the first two terms only. .
Independent accuracy mark — a can be written down by inspection, needing no method, which is exactly the general marking guidance's own definition of a B mark.
- 02M1
Half of is , and is 9 too big, so and .
Method mark for the completing-the-square structure: half the coefficient of x inside the bracket, its square subtracted outside. Earned for the structure, whatever the arithmetic does next.
- 03A1
. Range: for all , with equality at the left end of the domain, , so .
Accuracy mark, cao, and unavailable without the M mark above. The −9 sat inside the bracket, so multiplying out by the 2 makes it −18, not −9 — this is the single most-lost mark in the part, and it is checkable in five seconds by expanding the answer back out.
(b) — 4 marks
- 101B1
is defined on , which is exactly where the completed-square form is increasing (the branch to the right of the vertex), so no two values of in this domain give the same output — is one-one, and therefore has an inverse function.
Independent mark for a correct explanation of why f⁻¹ exists — needs no numerical method, so it survives untouched by any arithmetic error made anywhere else in the question, in either direction.
- 102M1
Let , swap and : .
Method mark for the swap-and-rearrange approach to finding an inverse, applied to their part (a) answer.
- 103A1
. The domain means once relabelled, so : take the root. .
Accuracy mark, cao (oe — an equivalent surd form such as 3 + √(2x−2)/2 is accepted; the mark scheme abbreviation for this, verified against the primary mark scheme, is exactly 'oe' — or equivalent). Check: the vertex (3,1) on f reflects to (1,3) on f⁻¹, and f⁻¹(1) = 3 + 0 = 3. ✓
- 104B1
Domain of = range of (from part (a)) = .
Independent mark for the domain — read directly from part (a)'s range, not derived from the formula for f⁻¹ itself. This is the exact real-verified structure (Jan 2023 Q1(c)): algebra earns M1 A1, domain earns its own separate B1.
(c) — 3 marks
- 201M1
means "do first, then ": .
Method mark for substituting g(x) into f in the correct order — f(g(x)), not g(f(x)). Reversing this order is a real and different function; the mark is specifically for getting the order right, which is why the spec's own guidance is quoted verbatim in the teach block above.
- 202A1
.
Accuracy mark for the simplified form, cao. Equally acceptable expanded: 2x² − 16x + 33 — the two are the same function, and the completed-square form is what makes the next line immediate rather than a fresh piece of work.
- 203B1 ft
always, so the minimum value of is , at .
Independent mark, follow through their completed-square form from this part — reading a minimum off a correctly-structured a(x−p)²+q form needs no further method, the same B-mark pattern used for reading a turning point in the previous lesson's marked solution.
Named traps
- domain-of-inverse-omitted
- The single most consistently reported error anywhere in the WMA13 archive for this sub-topic, confirmed across at least three separate series. Verified verbatim, Jun 2022 Q2: "Despite being a standard question, the majority of candidates still failed to state the domain for their inverse function and did not achieve the B mark." Verified verbatim, Jan 2022 Q6: "a majority of candidates were not aware that the domain was required, and therefore by far the most common score seen was 2/3" (out of 3) — independently confirmed again in Oct 2021 Q1(b). The mechanism is structural, not carelessness alone: the domain of f⁻¹ is an independent B mark (see the next trap), so getting every line of algebra correct still leaves it unclaimed unless it is written down as its own separate statement.
- domain-of-inverse-derived-from-scratch-not-recognised-as-range-of-f
- A distinct pattern from simply omitting the domain: some candidates DO attempt to state a domain for f⁻¹, but re-derive it from first principles on the new expression rather than recognising it is already sitting in the answer to an earlier part of the question, as the range of f. Verified, Oct 2022 Q2(b) — the report notes candidates deriving the inverse's domain "from scratch" instead of using the range of f they had, or could have had, already. This costs time even where it does not cost the mark outright, and it is the exact opposite of the efficient route the worked chain above demonstrates: find the range of f early, and the domain of f⁻¹ is already answered before the algebra for f⁻¹(x) itself has even begun.
- inverse-algebra-and-its-domain-are-independently-marked
- Not an error a candidate makes so much as a fact about the mark scheme that, misunderstood, produces one: the domain of an inverse function is not a bonus tacked onto the M1 A1 for finding its formula, and it is not lost automatically if the algebra goes wrong, or gained automatically if it goes right. This course's own research verifies this directly from a real mark scheme, Jan 2023 Q1(c) (there, finding g⁻¹(x) for a fraction g rather than f⁻¹(x) for a quadratic, but the structure is identical to every example in this lesson): the scheme awards M1 A1 for finding the inverse and a SEPARATE, independent B1 for the domain. Treating the domain as "the last part of finding the inverse" rather than its own distinct, separately-earned statement is the root cause behind both traps above.
- inverse-rearrangement-shown-as-calculator-output-with-no-algebra
- WMA13 carries an explicit, paper-wide, verbatim rubric on exactly this kind of algebra: certain questions state "In this question you must show all stages of your working. Solutions relying entirely on calculator technology are not acceptable" (verified verbatim from the January 2023 question paper, and confirmed recurring across multiple series). Finding f⁻¹(x) is a rearrangement — precisely the kind of step a calculator or an equation solver can shortcut silently. Where a question carries this instruction, arriving at a correct f⁻¹(x) with no visible swap-and-rearrange working risks the method mark outright, whatever the final expression says.
- inverse-answer-attached-to-the-wrong-function-letter
- A distinct, purely notational failure mode, confirmed directly in a real mark scheme rather than an examiner report. When a question defines more than one function — exactly the situation in every worked example, chain drill and marked solution in this lesson, since composition and inverses are normally taught and tested together — a correctly-derived inverse can still lose its accuracy mark if it is labelled with the wrong function's letter. Verified verbatim, Jan 2023 Q1(c), which defines both f(x) and g(x) and asks specifically for g⁻¹(x): the scheme's note on the A1 mark reads "Condone y = (3−x)/(2x) o.e and even g⁻¹ = (3−x)/(2x) but NOT f⁻¹ = (3−x)/(2x) o.e." Right rearrangement, right final expression, zero marks — because f is the letter more often inverted in practice, and writing "f⁻¹(x) = ..." out of habit when the question asked for g⁻¹(x) is an easy, silent slip that the algebra itself never reveals.
Beyond the spec
The spec asks only that a student can find a composite function, find an inverse function of a one-one function, and state domains and ranges correctly (spec 1.2) — nothing in it requires knowing WHY some functions are their own inverse, or what property guarantees a composite is one-one. This is not needed to score full marks on any WMA13 question, but it reframes "swap x and y" from a memorised recipe into a visible symmetry, which is exactly the kind of thing that makes the domain-of-inverse trap above harder to fall into by accident.
A function that is its own inverse — for every in its domain — is called self-inverse or an involution. Geometrically, this means its graph is symmetric about the line on its own, without needing a second curve reflected onto it: (for ) is the standard example, since swapping and in gives , i.e. again — the equation is unchanged by the swap. So is , and so is for any constant (swap and rearrange: , identical to the start). What all three share is that reflecting them in produces the same curve, not a different one — which is a genuinely useful thing to notice fast in an exam: if a question's f(x) reflects into itself, f⁻¹(x) = f(x) is the whole of part (b) with no rearrangement needed at all, though the domain still has to be checked and stated separately exactly as usual. (This shortcut applies to the specific function given, not as a general labour-saving assumption — most functions on this paper are not self-inverse, and assuming one is without checking is its own way to lose the accuracy mark.)
Retrieval — with feedback on every choice
, . Find and state its domain.
and , both with domain . What is ?
Which of the following functions, each with domain , is one-one?
, , . What is the domain of , and why?
, . Given that exists on this domain, which statement about it is correct?
- Function: one input → exactly one output. One-one: no two inputs share an output. Many-one: some do.
- fg(x) = f(g(x)) — do g first, then f. fg ≠ gf in general.
- f⁻¹ exists as a function only if f is one-one (restrict the domain if it isn't).
- Swap x and y to find f⁻¹ ⇒ domain of f⁻¹ = range of f; range of f⁻¹ = domain of f. Always state both.
- f⁻¹f(x) = ff⁻¹(x) = x. Graph of f⁻¹ is the reflection of f's graph in y = x.
Not affiliated with or endorsed by Pearson Edexcel. Every quotation and figure attributed to a mark scheme or examiner report in this lesson was independently verified against the primary Pearson document, not carried over from prior course material. Every question in this lesson — prequestion, worked chain, chain drill, marked solution and MCQ alike — is VERIDIAN-original wording, inspired by confirmed real question types, never a reproduction of a real Pearson question; and because the questions are original, the per-line mark allocations attached to them are modelled on verified mark-scheme conventions (what M, A and B marks mean, when follow-through applies, the independent-B-mark structure for a stated domain) rather than transcribed from a real mark scheme, which for an original question does not exist.
, . Find and state its domain.
- , domain
Correct. ; the domain means , selecting the root. The domain of is the range of : since the vertex is the left end of the domain, the range is , so the domain of is .
- B, domain
The algebra is entirely correct and the domain is missing — exactly the single most-attested error in this whole topic. The domain of is a separate, independently-marked statement (the range of f, here ), not something a correct formula for automatically supplies.
- C, domain
The domain is right and the branch is wrong. The original domain means once the letters are swapped, which selects the POSITIVE root, not the negative one. Check: should equal the vertex's x-value, — this formula instead gives , which happens to still work at this one point, but , and ... except is not in f's domain () at all, so cannot be a valid output of here.
- D, domain
The sign inside the square root is wrong. Rearranging gives — subtract 2 from both sides, since 2 is being added on the right, not subtracted. This is the same 'reverse the operation, not repeat it' error as undoing by adding 4 instead of subtracting it.
Traps tested: Domain of inverse omitted · Wrong branch of square root selected · Order of undoing not reversed
and , both with domain . What is ?
Correct. — apply first (the letter next to ), then feed its output into .
- B
This computes instead: , not even matching this option exactly, which suggests the composition order AND the arithmetic have both gone wrong. The notation means apply first, then — the letter closest to the bracket acts first.
- C
This is closer to : — even this doesn't match, so this option applies the wrong function order (f applied to g's output) and still slips on the arithmetic. Whichever function sits closest to the bracket in is the one applied to first.
- D
The order is right (f applied first, then g) but the middle term of has vanished: , not — the cross term from expanding the bracket has been dropped.
Traps tested: Composition order reversed · Cross term dropped when expanding
Which of the following functions, each with domain , is one-one?
Correct. Suppose : . Two inputs can only share an output if they were already the same input, so no two different inputs ever do — one-one. Graphically, every horizontal line meets this straight, non-horizontal line at most once.
- B
Many-one: and , two different inputs sharing one output, and this holds for every nonzero input in the same way. The horizontal-line test confirms it visually — any horizontal line above the vertex meets the curve twice.
- C
Many-one: and . The modulus function folds every negative input onto the positive value it started as the mirror image of, so every nonzero output (except the vertex) is shared by exactly two inputs.
- D
Many-one: this is a quadratic, so it has a turning point and the same two-inputs-one-output structure as option B once expanded. and already show two different inputs sharing an output directly, without needing to expand anything.
Traps tested: Many one mistaken for one one
, , . What is the domain of , and why?
- All real except , because the denominator would be zero there and division by zero is undefined
Correct — and it is worth noticing this domain was already given in the question ( is stated explicitly). A function with a fraction excludes wherever its denominator is zero; here that is the single point , so the domain is every other real number.
- BAll real except , because a fraction is undefined at
This is the rule for a denominator that IS (like ), applied to the wrong function. Here the denominator is , not itself, and is perfectly well defined — the restriction has to be found from the actual denominator in front of you, not assumed by pattern.
- C only, because the function needs a positive denominator
There is no such requirement — a fraction is defined for a negative denominator just as well as a positive one; is a perfectly ordinary output. Only a denominator of exactly zero is disallowed, which happens once, at , not for an entire half-line either side of it.
- DAll real , since is only a single point and the function is defined almost everywhere
"Almost everywhere" is not the same as "everywhere," and a domain excludes every point where the rule genuinely fails, however few there are. is not a small or negligible number here — it is not a number at all, because division by zero has no result to assign.
Traps tested: Denominator misidentified · Fraction assumed to need positive denominator · Single excluded point treated as negligible
, . Given that exists on this domain, which statement about it is correct?
- The domain of is , because that is the range of
Correct. Completing the square: , vertex . The domain is the left branch, running down from the vertex, so the minimum is attained and the range is . The domain of is always the range of — this is not a fact about this particular function, it is what swapping x and y always produces.
- BThe domain of is , the same as the domain of
This confuses the domain of with the domain of itself — the domain of is the RANGE of , not a repeat of 's own domain. is in fact the correct range of (since range of f⁻¹ = domain of f), just attached to the wrong one of the two functions.
- C does not exist, because is a quadratic and quadratics are always many-one
A quadratic on its full, unrestricted domain is many-one, but the domain here has been deliberately restricted to — exactly one side of the vertex, which makes this branch one-one. The question states the inverse exists precisely because this restriction has already been applied; the general rule about unrestricted quadratics does not apply once a domain restriction is in force.
- DThe domain of cannot be determined without first finding the formula for
It can, and finding it this way is faster: the domain of is the range of , which is available directly from the completed-square form () without swapping x and y or rearranging anything. The formula for and its domain are two separate pieces of information, earned by two separate marks, and the domain does not have to wait for the formula.
Traps tested: Range of f confused with domain of finverse · Restricted domain not accounted for · Domain of inverse derived from scratch not recognised as range of f
Practice this for real
This site teaches the mechanism; the exam is sat on Pearson's own real questions. Go find and attempt these yourself — nothing here substitutes for actually sitting a timed paper.
Pearson's official past-papers portalSelect International Advanced Level → Mathematics → any series, then look for WMA13.
Up next
The Modulus Function and Combinations of Graph Transformations
The modulus sign is not an instruction to delete a minus sign — it is a fold in the graph, and every combined transformation on this paper is two separate, independent moves that happen not to interfere with each other. Almost every mark lost on this topic is one of those two facts going unrecognised: a sketch that reflects the wrong half of the curve because y = |f(x)| and y = f(|x|) do genuinely different things to it, or a solved equation that keeps a root the case it came from never actually permits.
55 min