MATH2010 Mock A — solutions and marking
Award marks for justified mathematical steps. Equivalent valid methods receive the same credit. Within a part, keep credit for correct later reasoning when an earlier arithmetic slip has been carried through consistently.
Question paper · Revision route
Q1. A plane, a projection and a volume — 16 marks
The two given directions are vectors in three-dimensional space. A point on the plane is obtained by starting at and adding multiples of those directions. To recognize the plane with one equation, we need a vector perpendicular to both directions. That same normal then supplies the perpendicular line needed for the distance problem.
(a) [6] A cross product gives
As checks, and . It is nonzero, so the two directions are independent. For a point , the displacement from to lies along the plane precisely when it is perpendicular to this normal. The plane equation is , hence
Marking: cross product 3; point-normal equation 2; consistent simplified equation 1. The opposite normal gives the same plane.
(b) [6] Write the plane's scalar left-hand side as . The normal is a vector, whereas assigns a real number to a point. Its value measures a signed normal displacement with the normal's scale still included. Dividing by the normal's length removes that arbitrary scale. The distance from is
To find the foot rather than just its distance, use the perpendicular line from : . Substituting these three coordinates in the plane equation gives
Thus , and the foot is
Substitution checks that , and by construction. The parameter is not a distance: moving one parameter unit moves by the non-unit vector . The length is , agreeing with the earlier result. The negative parameter says that the foot lies in the direction opposite to the chosen normal; a distance itself is nonnegative. Marking: distance 2; normal-line construction 2; correct foot 2.
(c) [4] The scalar triple product is
Here the parallelogram base has area . The perpendicular height contributed by is the magnitude of its projection onto a unit normal, namely . Base area times height is therefore . This explains why the volume is the absolute scalar triple product. Its negative sign records orientation; swapping two edges reverses that sign without changing the solid's volume. Marking: triple product 2; absolute volume and orientation explanation 2.
If this question was difficult, revisit vectors and projections and planes and volumes.
Q2. A set and its edges — 16 marks
First translate the inequalities into geometry: the squared-radius bounds give radii from to , and keeps the upper half-plane. The radial edges are included, but the horizontal edges are excluded. All interior, closure and boundary tests use balls in the ambient plane, centred at the point being tested.
(a) [8] The strict inequalities describe the interior, and adding the missing horizontal edges gives the closure:
The boundary is
For the interior, the strict radial and vertical gaps give room to move a little in every direction and remain in . On either circle, moving across the circle leaves the permitted radial interval, so those included points are not interior points.
For the closure, replacing the strict vertical inequality by a non-strict one adds exactly the missing horizontal edges. Every added point can be approached with the same radius and an upper-half-plane angle tending to or . A point outside the stated closure violates at least one closed inequality and has a neighbourhood disjoint from .
The boundary is the closure minus the interior: the two upper semicircular arcs and the two axis segments. The axis segment between and is not another boundary edge; its interior points lie inside the excluded hole and have small balls that miss . For a concrete test, the ball of radius centred at the origin cannot meet , whose points have radius at least . The origin is therefore an exterior point, not a boundary point. Points beyond radius are also separated from . This accounts for every piece rather than treating the entire axis as boundary. Marking: interior 2; closure 2; arcs and both horizontal segments 2; neighbourhood/approach justification 2.
(b) [6] is not open: lies on the inner edge, and every ball there contains points of radius less than . It is not closed: the points , for positive integers , belong to and tend to . It is bounded, since ; for example, the open ball of radius centred at the origin contains the whole set.
For path-connectedness, write any two points in their unique upper-half-plane polar form , with and . For set
The radius is a weighted average of two numbers in , so it remains in that interval. The angle is a weighted average of two numbers strictly between and , so it remains strictly between those bounds. Thus the second coordinate stays positive. Sine, cosine and the interpolated coordinates are continuous, and the path has the required endpoints. This verifies every part of the path-connectedness definition.
A straight segment is a different construction and need not work: a segment between opposite sides of the half-annulus can pass through the hole. The chosen polar path changes radius and angle while enforcing the constraints throughout. Marking: open/closed decisions with witnesses 2; boundedness 1; valid path and containment 3.
(c) [2] The point is
The cosine is and the sine is , explaining both products. The squared radius is , which lies between and , and the second coordinate is positive. Thus the point belongs to . Its negative first coordinate also agrees with the specified upper-left angle. Marking: coordinates 1; membership check 1.
Revisit point sets and boundary tests and coordinate conversion.
Q3. Which approaches prove a limit? — 18 marks
The first goal is to control every nearby point, not to collect examples of successful paths. For the second function, a path with a different answer is enough to disprove the limit. Keeping these two goals separate tells us which method to seek.
(a) [6] Expanding the nonnegative square gives . Adding to both sides gives . Away from the origin the denominator is positive, so dividing gives, with ,
For , choose . Then implies , and hence . For example, an output tolerance of is guaranteed by an input distance less than . The same radius works for every approach because no angular or slope factor remains. The joint limit is zero; the assigned origin value is also zero, which is the additional fact needed for continuity. Marking: valid uniform bound 3; limit/continuity 1; explicit and verification 2.
(b) [4] On , if ,
The slope is fixed during this limit, so the denominator tends to the positive number . For , use the original quotient: its numerator is zero and its denominator is away from the origin. On the vertical line , the numerator is also zero and the denominator is . Thus every line gives limit zero. This still leaves paths whose slope changes as they approach the origin. Marking: finite slopes other than 1, 2; slope 1 and vertical line, 2.
(c) [4] To find a useful curve, compare the denominator terms and . Making balances them and makes the numerator the same order as well. This gives the curve . For ,
This differs from the zero obtained on the line , so the joint limit does not exist. The slope of the straight line from the origin to a point on this curve is . It varies with the point, so this curve is not one of the fixed-slope lines checked above. The value assigned at the origin cannot repair this missing joint limit. Marking: valid curve and value 2; comparison and conclusion 2.
(d) [4] With fixed, continuity of the quotient at gives
In that first step the denominator tends to , so substituting is justified. The outer limit as is then zero. In the other order, hold fixed. As , the numerator tends to zero and the denominator tends to , giving ; the outer limit is again zero.
Each iterated procedure finishes one coordinate limit while the other coordinate is fixed. It does not test simultaneous curved motion. Their agreement therefore does not prove a joint limit; part (c) is an explicit counterexample to that inference. A genuine joint-limit proof would need a condition such as the uniform bound used in part (a). Marking: each iterated limit 1; correct logical interpretation 2.
Revisit uniform estimates and paths and continuous extension.
Q4. Differentiating in the correct variables — 16 marks
The input has two real coordinates, and the output is one real number. Each partial derivative is a scalar rate in one coordinate direction. The gradient collects the two rates into a vector; a mixed partial is another scalar derivative of a rate function.
(a) [6] When differentiating with respect to , regard as constant. The exponent has derivative , while is a constant factor. When differentiating with respect to , the exponent has derivative and has derivative . Thus
For the point evaluation, , , and . Consequently and . Another way to see the second rate is to fix only , leaving the changing variable visible: . Its derivative at zero is . Substituting both coordinates at the start would give only the single value and discard the nearby values needed to find a rate. Marking: each first derivative 2; gradient at the correct point 2.
(b) [6] Here means differentiate with respect to . The product contributes two terms:
For , differentiate with respect to :
Both calculations therefore give
At , the common expression is . Keeping both product-rule terms is essential: differentiating only the exponential would miss the standalone exponential term. Marking: each mixed derivative 2; evaluations 2.
(c) [4] One sufficient theorem is: if is on an open neighbourhood of a point, then the two mixed second partials agree there. This is a guarantee under regularity hypotheses, rather than a rule that permits every mixed derivative to be swapped without checking.
Here is open, , and the exponential, polynomial and logarithmic expressions and all their derivatives are continuous on . Thus is on , in particular . For the evaluated point, for example, a ball of radius around lies wholly in . The line is outside the function's domain, so no conclusion at that line is asserted. Marking: valid sufficient hypotheses 2; verification of open domain and continuity 2. Equality of two computed numbers at a point alone would not verify the theorem's hypotheses.
Revisit partial and mixed derivatives.
Q5. Linearization with a controlled error — 18 marks
The purpose of linearization is to replace the square-root calculation near the base point by a constant plus a linear predicted change. The increment has two coordinates, while the predicted change and the error are each single real numbers. Here the base point is the origin, so is the increment length. The symbol is a scalar substitution used to simplify the algebra; it is not a time or a distance. To justify the approximation, we must compare the error with the length of the whole increment.
(a) [4] The scalar derivative of the square root gives
The factor in the second numerator comes from differentiating with respect to . At the origin , and . Therefore
The constant is the base output; predicts its change. The affine function includes both. Confusing that function with just the derivative's linear part would lose the base value. Marking: value and partials 2; affine approximation 2.
(b) [6] Rationalize before subtracting the linear term:
because multiplying by the conjugate replaces the numerator by . Now use a common denominator to subtract , and rationalize once more:
The denominator is positive on the stated domain, and no division by is needed, so the identity also holds at . The negative square in the numerator shows that : the approximation overestimates the true value. We have obtained both the size and the direction of the error from exact algebra. Marking: first rationalization 2; common denominator 2; second rationalization and final expression 2.
(c) [4] Choose . Cauchy–Schwarz applied to and gives , so and the whole neighbourhood lies in the domain. The denominator in the identity is at least . Also
Hence, for ,
This is the differentiability condition. The bound says that the error is at most a constant times the square of the increment length; dividing by that length leaves a quantity tending to zero. Merely showing that the error tends to zero would establish a weaker fact. Dividing by alone would also be unsuitable, because increments with must be tested. The constant need not be the sharpest possible lower bound for the denominator to prove this limit. Marking: valid neighbourhood and bound 2; normalized remainder limit 2.
(d) [4] Substitute the actual increment first: . The predicted change is , so the approximation is . Since , . Thus
The bound follows from and . In particular . Thus the actual value is below the approximation by less than about . This interval interprets the error estimate; it is not an assertion that the affine approximation equals the square root. Marking: approximation 2; valid absolute-error bound 2.
Revisit differentiability and linearization.
Q6. Direction, speed and differentiability — 16 marks
Here the input is a position in three-dimensional space and the output is a scalar. The gradient's three entries are local rates in the three coordinate directions. A unit direction specifies orientation without speed; the given non-unit vector must be normalized before asking for change per unit distance.
(a) [4] The polynomial is differentiable, and
For example, the mixed term contributes to the first partial and to the second. Substitution gives the three components , and . Because , the unit direction is . Hence
The dot product consists of . It is positive, so the scalar output initially increases in this unit direction. The unnormalized dot product is a rate for parameter velocity : that motion travels three distance units per parameter unit. Dividing by three removes the extra speed and gives the requested rate per unit distance. Marking: gradient 2; normalization and directional rate 2.
(b) [6] Restricting to unit directions compares changes over the same spatial distance. If speed could be multiplied by an arbitrary positive constant, a positive directional rate could be made arbitrarily large, so there would be no finite fastest rate under that different question.
The gradient length is . For , Cauchy–Schwarz gives . Equality requires a direction parallel to the gradient. Normalize it for increase, and reverse its sign for decrease:
Each vector has squared length . Their dot products with the gradient give and , respectively. Thus the steepest increasing direction moves toward decreasing and increasing at this point. The zero first gradient component means no first-order contribution from the direction here; it does not mean that the polynomial is independent of . Marking: bound and equality condition 2; each correct direction/rate pair 2.
(c) [6] We cannot use the gradient dot-product formula before establishing differentiability. Start with the directional-derivative definition instead. For a unit vector and , direct substitution gives , so
The denominator is positive because is nonzero. The expression does not depend on or its sign, so the two-sided limit exists in every unit direction. In the two coordinate directions, either or , giving zero; hence . In contrast, for , the numerator is and the denominator is , so
If were differentiable, the coordinate partials would force its linear predicted change to be zero. Every unit directional derivative would then equal , contradicting the diagonal result. This one incompatible direction is already enough to disprove differentiability. Each line having its own slope is not enough: those slopes must come from one compatible linear map, together with a small remainder for all increments. Even a successful list of directional checks would not replace that uniform remainder condition.
The same failure is visible directly. On , the output is and the increment length is . The absolute error of the only possible zero linear approximation, divided by that length, is therefore for every nonzero . It does not tend to zero. In fact , so the function is continuous at the origin; continuity plus all directional derivatives still has not produced differentiability. Marking: all-direction formula and existence 2; coordinate partials 1; nonzero diagonal derivative and valid contradiction 3.
Revisit the small-remainder condition and the unit directional derivative and fastest-direction parts of directional derivatives.
Choose the next revision step
Record each part's earned marks and one concrete error type: arithmetic, definition, hypothesis, uniformity, or direction normalization. Rework the corresponding note example with the answer covered. Then solve that part again on a blank page and justify the step that previously failed. A high total score should still be followed by revisiting any unproved claim or missing boundary case.