Did you know? Finding one solution is not the same as proving there is exactly one. The equation x²=9 has two real solutions, but the equation x³+x=1 has exactly one real solution. A stronger mathematician learns to answer two different questions: does a suitable object exist, and could there be another?
Those questions sit at the heart of JC2 H3 Mathematics. For learners and families comparing a JC2 H3 Mathematics tutor in Bukit Timah, the 2026 Singapore–Cambridge H3 Mathematics (9820) syllabus explicitly names proof of existence, proof of uniqueness and proof by construction. The demands are not only harder algebra; they require a complete and logically precise argument.
Quick answer: To prove existence, construct a valid example or use a theorem that guarantees an object under stated conditions. To prove uniqueness, suppose two objects satisfy the property and show they must be equal. To prove exactly one, do both. An example without a uniqueness argument does not establish exactly one; a uniqueness argument without existence may describe an empty collection.
Jump to your answer
- Existence, uniqueness and exactly one
- What a constructive proof looks like
- Worked problem: one real root of x³+x−1
- Euclidean division: a unique quotient and remainder
- Functions, inverses and restriction of domain
- Unique minimisers and equality
- How unique-sounding claims fail
- Twenty detailed example clinics
- Practice and assessment checklist
- Frequently asked questions
- Official reference and next guides
Existence, uniqueness and ‘exactly one’ are three different statements
Consider a property P(x) on a specified domain D. ‘There exists an x with P(x)’ means at least one permitted object satisfies it. ‘At most one x has P(x)’ means no two distinct permitted objects both satisfy it. ‘There exists exactly one x’ combines these two requirements. The symbol ∃! is sometimes used for exactly one.
A uniqueness proof can be logically correct even if no object exists. For example, the statement ‘there is at most one positive integer n satisfying n²=−1’ is true, because there are none, but ‘there exists exactly one’ is false. A student who proves only at most one has not answered an existence claim.
Conversely, a single example establishes existence but says nothing about uniqueness. Taking x=3 solves x²=9, yet x=−3 also solves it. The challenge is to determine whether the problem asks for a witness, a complete set of solutions or a proof that exactly one exists.
To organise a proof, label the parts explicitly. Write ‘Existence’ and present the witness or theorem. Then write ‘Uniqueness’, assume that a and b are arbitrary solutions and derive a=b. Close by stating that the required object exists and is unique.
These statements depend on the domain. For x²=4, there are two real solutions, one nonnegative real solution and no positive integer solutions other than x=2. For x²=−4, there are no real solutions but two complex solutions. Changing the universe changes the claim.
The official H3 syllabus includes quantifiers and necessary or sufficient conditions alongside existence and uniqueness proofs. A student should therefore read every ‘for all’, ‘there exists’, ‘exactly one’, ‘nonzero’, ‘positive’ and ‘integer’ as mathematically decisive language.
Construction is a proof of existence when every condition is checked
A constructive proof produces an actual mathematical object and shows it has the requested property. To prove that for every integer n there is a larger integer, choose n+1. The chosen value is an integer and is strictly greater than n; existence follows immediately.
To prove there are infinitely many even integers, use the sequence 2,4,6,… or for any integer bound M choose 2(|M|+1), which is even and larger than M. The argument should explain why the construction can always produce a new value beyond a proposed finite limit.
For every positive integer n, the triple (n²−1, 2n, n²+1) satisfies (n²−1)²+(2n)²=(n²+1)². When n≥2, these are positive integers, so the construction gives a Pythagorean triple. It does not automatically prove that every Pythagorean triple has this particular form.
A valid construction must respect hidden restrictions. If a problem asks for two distinct integers with a shared property, producing the same integer twice does not work. If it asks for a positive solution, a negative witness is not permissible even if it satisfies an algebraic equation.
Sometimes existence is shown without an explicit formula. The intermediate value theorem can guarantee a real root between two sign-changing endpoints of a continuous function. Such an argument is nonconstructive in the sense that it may not supply a convenient closed form, but it still rigorously establishes existence.
An H3 answer may combine methods: use a theorem for existence, algebra for uniqueness and an approximation to locate the object numerically. Keep the roles separate so that a calculator approximation is not presented as the proof of existence.
Worked proof: x³+x−1 has exactly one real root
Claim: The equation x³+x−1=0 has exactly one real solution. We will establish existence and uniqueness separately.
Existence: Define f(x)=x³+x−1, which is continuous for all real x. We have f(0)=−1 and f(1)=1. Since zero lies between these values, the intermediate value theorem guarantees some c in (0,1) for which f(c)=0.
Uniqueness, by monotonicity: The derivative f′(x)=3x²+1 is strictly positive for every real x. Therefore f is strictly increasing on the entire real line. A strictly increasing function cannot take the value zero at two distinct inputs.
Conclusion: The equation has at least one real root by the sign change and continuity, and at most one by strict monotonicity. Hence it has exactly one real root, lying between zero and one.
An alternative uniqueness proof avoids differentiation. If a and b satisfy f(a)=f(b), then 0=f(a)−f(b)=(a−b)(a²+ab+b²+1). Since a²+ab+b²=(a+b/2)²+3b²/4≥0, the second factor is strictly positive. Thus a−b=0 and a=b. This provides a purely algebraic uniqueness argument.
Notice how the two proofs complement one another. Continuity plus a sign change gives existence; derivative positivity or positive factorisation gives uniqueness. Neither argument alone answers the phrase ‘exactly one’.
A unique quotient and remainder: integer arithmetic with no guessing
For integers a and positive integer d, the division algorithm states that there exist unique integers q and r satisfying a=dq+r and 0≤r<d. This single sentence contains both an existence claim and a uniqueness claim.
For a concrete example, divide 47 by 6. We have 47=6×7+5 with remainder five in the permitted range from zero to five. Thus q=7 and r=5 provide a valid witness for this instance. For the general theorem, set q=⌊a/d⌋ and r=a−dq. The floor definition guarantees q≤a/d<q+1, which implies 0≤r<d.
To prove uniqueness, suppose a=dq+r=dq′+r′ with both remainders in [0,d). Then d(q−q′)=r′−r. The right-hand side is an integer strictly between −d and d. The only multiple of d in that interval is zero.
Therefore r′−r=0, so r=r′. Since d(q−q′)=0 and d>0, q=q′. This proves the quotient and remainder are unique. The proof works for negative dividends too when the remainder convention is 0≤r<d.
Be careful not to confuse the unique remainder with a unique modular representative without a chosen range. The integers 5,11 and −1 represent the same congruence class modulo six. The standard remainder is unique because we imposed the half-open range [0,6).
The example is a useful combination of construction, interval inequalities and a difference argument. It illustrates how an H3 problem can ask students to prove something familiar from ordinary arithmetic rather than merely compute it.
Function inverses: uniqueness can depend on the chosen domain
Consider f(x)=x². On the real numbers, f is not one-to-one because f(2)=f(−2)=4. Thus it does not have an inverse function taking every nonnegative output to a unique real input unless we restrict its domain.
Restrict the domain to x≥0. Then every y≥0 has exactly one nonnegative input x satisfying x²=y, namely x=√y. Existence is given by the nonnegative square root, and uniqueness follows because squaring is strictly increasing on nonnegative inputs.
The same restriction idea appears in inverse trigonometric functions: to make sine one-to-one, a suitable restricted interval is chosen. A student’s proof should state that interval and check that the image covers the intended codomain.
Now look at f(x)=x³+x. It is continuous and strictly increasing, with values approaching −∞ and +∞ as x approaches the respective extremes. Therefore for every real y, the equation f(x)=y has exactly one real solution, so f defines a bijection from ℝ to ℝ.
Notice that an inverse need not have a simple elementary formula. The statement that exactly one input corresponds to each output is about existence and uniqueness; it does not require writing the inverse using radicals.
This section also connects to the bijection principle, where an exact one-to-one and onto correspondence allows objects to be counted by easier representations.
Optimisation: when equality gives the unique best solution
Suppose f(x)=(x−3)²+2 for real x. Since (x−3)²≥0, f(x)≥2. Equality occurs precisely when x=3. Therefore the global minimum value is two and it is attained at a unique point x=3.
Compare g(x)=(x²−1)². Its minimum value is zero because a square cannot be negative. But equality occurs when x²=1, so the minimum is attained at x=−1 and x=1. A minimum value may exist without a unique minimising input.
For h(x)=x² on the open interval (0,1), every value is positive, yet values can be made arbitrarily close to zero by choosing smaller positive x. The greatest lower bound is zero, but the function has no minimum on that open domain. This is an existence failure, not merely a numerical issue.
When claiming a unique maximum or minimum, identify three things: a global bound; at least one permitted point attaining the bound; and an argument that no distinct permitted point can attain the same bound. Some problems require only the value, but a full reasoning exercise can ask for the unique optimiser.
This is exactly why equality conditions deserve explicit attention in the AM–GM guide and in Cauchy–Schwarz proofs. Proving an inequality does not automatically prove existence or uniqueness of its equality case.
How plausible uniqueness claims can fail
The equation x+1/x=3 for x>0 has two positive solutions. Multiply through by x, which is legal because x is positive, to obtain x²−3x+1=0. Its two roots (3+√5)/2 and (3−√5)/2 are positive and distinct. Finding the first root proves existence but not uniqueness.
The equation x²=a over real x has zero solutions for a<0, one solution for a=0 and two solutions for a>0. A universal claim such as ‘every real a gives exactly one real solution’ fails in two different ways. The cases provide a more accurate classification.
A polynomial equation of odd degree always has at least one real root under the usual real-coefficient assumption, but it need not have a unique root. For instance, x³−x=x(x−1)(x+1) has three distinct real zeros. Existence information alone is not uniqueness information.
Another trap is to prove only that any solution must equal a candidate. The candidate may fail the original property, especially after squaring or dropping a domain condition. Verify the candidate to establish existence before concluding exactly one.
A productive H3 exercise is to create near-identical statements: ‘there exists a solution’, ‘there is at most one solution’, and ‘there is exactly one solution’. Then ask which parts of a proposed argument justify each statement. The classification helps students avoid overclaiming what their working actually shows.
Twenty-two worked proof clinics
1. One integer strictly between two
For any integer n, the integer n+1 lies strictly between n and n+2. This gives a constructive witness for existence. It is also unique among integers because an integer m satisfying n<m<n+2 must be exactly n+1. The proof uses both the construction and the spacing of consecutive integers.
2. A real equation with one answer
The equation 7x+3=24 has the solution x=3. Suppose a and b both satisfy it. Then 7a+3=7b+3, hence a=b. We have established existence by substitution and uniqueness by comparing hypothetical solutions. Stating only the isolated algebraic answer would omit the proof structure.
3. An equation with two answers
Over the reals, x²=9 has solutions x=3 and x=−3. Either one is enough to prove that at least one exists. Both are needed to list all solutions, and their distinctness disproves uniqueness. The same equation restricted to nonnegative reals has exactly one solution.
4. A positive-domain distinction
For x>0, the equation x²=0 has no solution. Over x≥0 it has exactly one, namely zero. A small symbol in the domain entirely changes the existence statement. Always read strict inequalities, especially when an apparent equality case is located on a boundary.
5. A constructible even number
Given any positive integer n, construct 2n. It is positive and even. To prove that a positive even integer larger than n exists, use 2n+2, which is strictly greater than n for every positive n. The witness must satisfy every condition, not just evenness.
6. A unique additive inverse
Every real a has an additive inverse −a because a+(−a)=0. If b and c both satisfy a+b=0 and a+c=0, subtracting gives b=c. The example separates showing that an inverse can be named from showing no different inverse exists.
7. A unique multiplicative inverse
For any nonzero real a, 1/a satisfies a(1/a)=1. If ab=1 and ac=1, then a(b−c)=0 and the nonzero assumption forces b=c. For a=0 no inverse exists. This is a complete existence-and-uniqueness theorem with its necessary hypothesis.
8. Every element has an image
A function f:D→C assigns each input in D exactly one output in C. The phrase ‘exactly one output’ is part of the definition of a function. It does not mean that distinct inputs necessarily produce distinct outputs. Confusing the function property with injectivity is a frequent conceptual error.
9. Domain-restricted square root
For y≥0, there is exactly one x≥0 satisfying x²=y, namely x=√y. Over all real x, the answer differs: when y>0 both √y and −√y work. Thus a chosen inverse branch requires a stated domain restriction.
10. Two positive roots
The equation x+1/x=3, x>0, becomes x²−3x+1=0. Its solutions (3±√5)/2 are distinct and positive. An answer displaying only one proves existence, not uniqueness; a claim of exactly one is false. A discriminant calculation plus sign check settles the full solution set.
11. A continuous root
Let f(x)=x³+x−1. The values f(0)=−1 and f(1)=1 bracket zero. Because f is continuous on [0,1], the intermediate value theorem gives a root in (0,1). This existence proof does not need an exact decimal for that root.
12. That root is unique
For the same function f, the derivative f′(x)=3x²+1 is positive for every real x. Therefore f is strictly increasing and cannot have two different zeros. Combining this with the previous existence argument proves exactly one real root.
13. An algebraic alternative
For any real a,b, (a³+a)−(b³+b)=(a−b)(a²+ab+b²+1). Since the second factor is positive, equal outputs imply a=b. This is an injectivity proof without calculus. It can be applied to the unique root of x³+x=1.
14. Euclidean division of 47
The equality 47=6×7+5 has quotient seven and remainder five, with 0≤5<6. If another quotient and remainder in the standard range existed, subtracting representations would make a multiple of six lie strictly between −6 and 6, forcing it to be zero.
15. Negative dividend, standard remainder
For a=−7 and d=3, the standard representation is −7=3(−3)+2, with remainder two in [0,3). Writing quotient −2 and remainder −1 reproduces the arithmetic but violates the stated nonnegative-remainder convention. Existence and uniqueness depend on the precise allowed range.
16. A unique minimiser
The function f(x)=(x−3)²+2 has minimum two at x=3. A nonnegative square gives the bound, and that square equals zero only when x=3. Both the minimum value and its unique attaining input have been established.
17. Multiple minimisers
For g(x)=(x²−1)², the minimum value zero occurs at x=−1 and x=1. The value is unique as a number, but the minimising point is not unique. A question asking for ‘the minimum’ differs from one asking for ‘the unique minimiser’.
18. No attained minimum
On the domain (0,1), the function f(x)=x has infimum zero, but it has no minimum because zero is excluded. For any allowed x, the smaller positive number x/2 remains in the domain. This construction refutes the existence of a least permitted value.
19. A Pythagorean construction
For integer n≥2, the numbers a=n²−1, b=2n and c=n²+1 are positive integers. Expanding shows a²+b²=c². Thus they form a Pythagorean triple. Do not conclude without further proof that every integer right triangle has this special form.
20. Uniqueness through absolute value
For a given nonnegative real r, the equation |x|=r has one real solution if r=0 and two if r>0. For r<0 it has none. The separate cases show why a claim of exactly one real x for every real r is false.
21. Existence by counting
Six integers are chosen from 1 to 10. Pair the ten values as (1,2),(3,4),(5,6),(7,8),(9,10). Pigeonhole reasoning guarantees one pair is fully chosen, so at least one pair of consecutive integers exists. The argument does not claim the pair is unique.
22. Exactly one remainder
When a positive modulus m is fixed, each integer a has exactly one standard remainder r with 0≤r<m. The existence follows by division; uniqueness follows because two permitted remainders congruent modulo m differ by a multiple of m smaller in absolute value than m, so the difference is zero.
Three challenges that test the full statement
Challenge one: prove that there is exactly one real x such that 5x−2=13, then change the domain to positive integers and to nonnegative integers. The real solution x=3 remains permitted in both restricted domains, but the proof should explain why. Now change the equation to 5x−2=12: the real solution is 14/5, so there is no integer solution. Existence changes; uniqueness as an at-most-one statement remains.
Challenge two: find all real x satisfying x²−4x+4=0. Factor to (x−2)²=0, so x=2. This establishes both existence and uniqueness because a real square is zero only at zero. Compare with x²−4x+3=0, which factors as (x−1)(x−3)=0 and has two roots. The algebraic structure signals whether the solution set has one or more elements.
Challenge three: define a sequence by a₁=2 and aₙ₊₁=3aₙ+1 for n≥1. Existence is established recursively: the first term is specified and each subsequent term is computed from the preceding one. Uniqueness follows by induction: if two sequences meet the same base value and recurrence, they agree at n=1 and their next terms agree whenever their current terms agree.
A full mathematical statement specifies its domain and the meaning of the property, then establishes the correct number of objects. This habit transfers into constructive geometry, function inversion, optimisation and the interpretation of mathematical texts.
How existence and uniqueness work in mathematical modelling
Mathematical modelling often asks whether a proposed model produces a solution and whether the solution is identifiable. Suppose a measurement y is modelled by y=2x+5 for real x. Every real observation y corresponds to exactly one real x=(y−5)/2. The model is invertible across the entire real line because its slope is nonzero.
If the model instead uses y=x², a positive measurement such as nine cannot distinguish x=3 from x=−3 unless the context restricts the sign. If x represents a physical length, the nonnegative domain may restore uniqueness. The modelling assumption, rather than algebra alone, explains why one inverse can be selected.
Consider a budget model y=100−5n, where n counts whole items purchased. Solving for n gives n=(100−y)/5. A real solution exists for every real y, but a permitted count requires n to be a nonnegative integer. The range and integrality constraints determine which observations are meaningful. A tidy numerical answer that violates them is not a valid model solution.
In optimisation, uniqueness is related to the shape of the objective. For f(x)=(x−c)²+d on all real x, the minimum is d and the unique minimiser is c. For a flat-bottom function such as f(x)=0 throughout [0,1], the minimum still exists but infinitely many points attain it. These examples separate finding the best value from identifying one best decision.
A student preparing for non-routine H3 questions should practise phrasing conclusions with care: ‘a root exists’, ‘at most one root exists’, ‘the real root is unique’, ‘the minimum value is five’, or ‘the minimising point is unique’. Each statement has a different burden of proof, and a full response needs exactly the appropriate one.
How to repair incomplete existence and uniqueness proofs
If a solution says ‘substituting x=2 works, so x=2 is the unique solution’, circle the word ‘unique’. Substitution supports existence only. Ask whether the equation has any other possible solutions. That second step could involve factoring, monotonicity, a difference argument or a domain restriction.
If a solution says ‘assuming a and b are both solutions, we get a=b, so one solution exists’, circle ‘exists’. The argument proves at most one, not at least one. A separate witness or existence theorem is needed. This error is particularly easy to make when a long algebraic uniqueness proof looks complete.
Look for a hidden zero factor. Suppose uniqueness is argued from c(a−b)=0. If c may be zero, the conclusion a=b is not justified. The proof must either establish c≠0 or split into cases. This is the same logical repair that prevents invalid cancellation in elementary algebra.
Look for an unjustified appeal to a graph. A plotted curve that appears to cross the axis once may provide a conjecture but does not rigorously rule out other intersections outside the viewing window. Continuity and monotonicity provide proofs when their hypotheses are verified.
Look for existence theorems cited without their assumptions. The intermediate value theorem needs continuity over the relevant closed interval and a target value between endpoint values. A discontinuous function can jump across zero without ever taking zero, so a mere sign change is insufficient.
Finally, ensure the uniqueness proof compares arbitrary satisfying objects. Showing that two specific examples happen to coincide does not establish that any pair of possible solutions coincides. Generality is expressed through the quantifiers and through the variables chosen in the argument.
A tutorial sequence for the JC2 learner and parent
Begin with short questions classified into three types: existence only, at most one and exactly one. Ask the learner to say which type each question asks for before calculating. This prevents the common habit of automatically writing a root and treating it as the end of the problem.
Next teach proof construction. Give students an existence task where they can write a witness, then a uniqueness task where they must compare two hypothetical candidates. Move to a continuous-function question where a theorem supplies existence and monotonicity supplies uniqueness.
After that, introduce a domain-sensitive example. Change x²=9 from the real line to nonnegative reals, positive integers or complex numbers. The algebraic equation remains visually the same while the solution set and uniqueness claim can change. This is a high-value H3 reading exercise.
Give the student a flawed model solution and ask them to identify the first unsupported sentence. Once corrected, require them to present the final reasoning in concise paragraphs with assumptions, inferences and a conclusion. Accuracy and communication should improve together.
Parents can ask the learner two practical questions after a session: ‘How did you show that a solution exists?’ and ‘How did you show that no different solution exists?’ These questions encourage explanation without requiring parents to solve advanced calculus or abstract proof problems.
The eduKateSG immutable small-group reference near Sixth Avenue MRT describes a three-student Secondary 1 Mathematics format. This guide draws on its emphasis on explanation and close feedback, but does not claim that a specific JC2 H3 course or timetable is currently running. Enquire directly about level-specific availability.
A simple weekly diagnostic can collect three examples: one where the learner found only a witness, one where a uniqueness proof missed the existence part, and one where both parts were established correctly. Ask the learner to rewrite all three without viewing their previous solutions. The resulting explanations reveal whether the distinction is becoming automatic.
Frequently asked questions
Are existence and uniqueness separate H3 Mathematics skills?
Yes. The 2026 Singapore–Cambridge H3 Mathematics 9820 syllabus explicitly lists proof of existence, proof of uniqueness and proof by construction under mathematical reasoning principles.
What does ‘there exists exactly one’ mean?
It means at least one object in the specified domain has the property and no two distinct objects in that domain have it. Both statements require justification.
Can one example prove uniqueness?
Not generally. One example proves existence. To establish uniqueness, compare arbitrary hypothetical solutions or prove an injectivity or monotonicity property that rules out distinct solutions.
Can a uniqueness proof be true when no solution exists?
Yes. A statement that there is at most one solution can be true even when there are zero solutions. That is why a proof of exactly one needs a separate existence argument.
Does the intermediate value theorem prove uniqueness?
No. Under its hypotheses it guarantees existence of a root or target value between endpoints. To prove uniqueness, an additional argument such as strict monotonicity is required.
Does a strictly increasing function have a solution to every equation f(x)=y?
Not automatically. Strict increase gives at most one solution for each output y, but existence depends on whether y lies in the function’s range. The function’s continuity and limiting behaviour may help establish that range.
Why are domain restrictions important for inverse functions?
The real function x↦x² maps both 2 and −2 to 4. Restricting to x≥0 makes it one-to-one and permits the standard nonnegative square-root inverse.
How does an equality condition relate to a unique optimum?
An inequality may establish a bound. Solving the equality condition determines where it is attained; if exactly one permitted input attains the bound, the optimiser is unique.
Can a graphing calculator establish existence and uniqueness?
It can offer approximations and useful exploration. For a rigorous claim, use appropriate mathematical arguments, such as continuity, monotonicity, factorisation, an explicit construction or a complete case analysis.
How can a tutor diagnose weakness in these proofs?
Ask the student to label the part demonstrating existence and the part demonstrating uniqueness, then change one domain condition and examine the effect. The explanation reveals whether the student understands the logical structure rather than memorising a solution format.
Official syllabus and companion lessons
The 2026 Singapore–Cambridge H3 Mathematics (9820) syllabus specifies existence, uniqueness and construction under mathematical proof methods. Students preparing for another examination year should use the 2027 SEAB syllabus directory to confirm current requirements.
Related guides include quantifiers and necessary or sufficient conditions, working backwards in non-routine problems and bijections. They connect precision of mathematical language with the structure of proof.
The practical question to remember is: ‘Have I shown it can happen, and have I shown it cannot happen in another way?’ For a claim of exactly one, the correct answer to both must be supported by mathematics.
The final three-question proof audit
Before concluding any existence-and-uniqueness answer, ask three questions. What is the exact domain? A root that exists over the complex numbers may not exist over the reals, and an integer construction may fail a positive-only condition. Where is the existence proof? Identify the witness, construction or theorem that guarantees a permitted object. Where is the uniqueness proof? Identify the argument that rules out every genuinely different permitted object.
Use the familiar function f(x)=x³+x−1 as a final rehearsal. Continuity and f(0)<0<f(1) show a real zero exists. Strict positivity of f′(x)=3x²+1 shows that at most one zero exists. Together, and only together, these establish exactly one. On a fresh question, write the same two-part logic before choosing the algebraic details; doing so prevents a correct calculation from turning into an incomplete proof.
For parents and tutors, this audit is also a short diagnostic conversation: ask the learner to point to the precise line where existence is established and the precise line where another solution is excluded. If they can do both without reciting a model answer, they are practising the mathematical precision expected in advanced JC work. This clarity is more important than making every proof look complicated.