MAT148 Midterm Preparation: How to Solve Proof-Based Calculus Problems
- Jason Mastorakos
- Jul 30
- 12 min read
Prepare for MAT148 midterms with rigorous strategies for logic, limits, continuity, theorem selection and proof-based calculus problems.
MAT148 midterm preparation requires a different strategy from ordinary first-year calculus preparation.
In a computational course, knowing how to differentiate a function or evaluate a limit may be enough to earn a substantial number of marks. In a proof-based calculus course, those techniques remain important, but students must also explain:
Why a statement is true.
Which definition applies.
Whether a theorem’s hypotheses are satisfied.
How each conclusion follows from the previous line.
Whether a claim is always true or only true under additional assumptions.
MAT148H1, officially titled Calculus I with Proofs, is the University of Toronto’s proof-oriented first calculus course replacing the former MAT137 course number. Its official topics include logic and quantifiers, sets, mathematical induction, limits, continuity, the mean value theorem, elementary transcendental functions, the inverse function theorem, differentiation and applications. The course combines theoretical foundations with computation and problem-solving.
That combination is the source of the course’s difficulty.
A student may know that
limx-> a [ f(x)]=L,
yet be unable to use the formal definition of a limit.
A student may correctly calculate
[f'(x),]
yet lose marks because they invoke the mean value theorem without verifying continuity and differentiability.
A student may understand a theorem intuitively but be unable to construct a precise proof under midterm time pressure.
The solution is not to memorize hundreds of completed proofs. It is to develop a repeatable proof-construction system.
This guide presents that system.
What makes MAT148 different from computational calculus?
A computational question typically asks you to apply an identifiable procedure:
Differentiate (f(x)=x^2e^x).
A proof-based question may ask:
Suppose (f) is differentiable and (f'(x)>0) for every (x) in an interval. Prove that (f) is strictly increasing on that interval.
The second problem requires several decisions:
Which theorem connects derivatives with increasing behaviour?
Which two arbitrary points should be introduced?
What theorem hypotheses must be verified?
How does the sign of the derivative produce the desired inequality?
What must be stated to conclude strict monotonicity?
The algebra is minimal. The logical structure is the real problem.
This leads to the central principle of MAT148 midterm preparation:
[\boxed{\text{Do not memorize proofs; memorize proof structures.}}]
Many calculus proofs can be organized into a relatively small number of structures:
Direct proof.
Proof by contrapositive.
Proof by contradiction.
Mathematical induction.
Existence proof.
Uniqueness proof.
Epsilon-delta proof.
Theorem-application proof.
Counterexample construction.
Your objective is to recognize which structure a question requires.
The six-step MAT148 proof method
Use the following framework whenever you face an unfamiliar proof-based calculus problem:
Decode->Expand->Select->Construct->Conclude->Audit
Step 1: Decode the statement
Identify precisely what is given and what must be proved.
Separate the statement into:
Hypotheses: facts you may assume.
Target: the statement you must establish.
Domain: where the variables or functions are defined.
Quantifiers: whether the claim concerns every object or at least one object.
For example:
Let (f:[a,b]\to\mathbb{R}) be continuous. Suppose (f(a)<0<f(b)). Prove that there exists (c\in(a,b)) such that (f(c)=0).
The hypotheses are:
f is continuous on [a,b],
and
f(a)<0<f(b).
The target is:
exists c in(a,b) such that f(c)=0.
The word exists tells you this is an existence proof. The sign change and continuity strongly indicate the intermediate value theorem.
Do not begin writing until you have separated the hypotheses from the conclusion.
Step 2: Expand the relevant definitions
Definitions are not background information. They are tools.
When a proof appears difficult, expand the most important definition in the statement.
For example:
Strictly increasing
A function (f) is strictly increasing on an interval (I) when
for all x_1,x_2 in I,x_1<x_2 implies f(x_1)<f(x_2).
Continuity at (a)
A function (f) is continuous at (a) when
for all epsilon>0, exists delta>0 such that |x-a|<delta implies |f(x)-f(a)|<epsilon.
Injectivity
A function (f) is injective when
f(x_1)=f(x_2) implies x_1=x_2.]
Limit
The statement
lim_x-> a f(x)=L
means that
for all epsilon>0, exists delta>0 such that 0<|x-a|<delta implies|f(x)-L|<epsilon.
Expanding a definition converts an abstract target into a concrete list of tasks.
If the target is to prove that (f) is strictly increasing, you now know what to do:
Choose arbitrary (x_1<x_2).
Show that (f(x_1)<f(x_2)).
That is much more actionable than the vague instruction “prove (f) is increasing.”
Step 3: Select the governing theorem or proof structure:(MAT148 Midterm Preparation:)
Ask which mathematical bridge connects the hypotheses to the target.
Common MAT148 bridges include:
Information given | Desired conclusion | Likely tool |
Continuity and a sign change | Existence of a zero | Intermediate value theorem |
Equal endpoint values | Interior point with zero derivative | Rolle’s theorem |
Continuity and differentiability | Relationship between secant and tangent slopes | Mean value theorem |
Derivative is positive | Function is strictly increasing | Mean value theorem |
Derivative is zero everywhere | Function is constant | Mean value theorem |
Formula indexed by integers | Statement true for all (n) | Mathematical induction |
Formal limit statement | Control of output error | Epsilon-delta definition |
Universal claim appears false | Disprove statement | Counterexample |
Do not write “by the mean value theorem” merely because derivatives appear in the problem.
First verify that the theorem actually applies.
Step 4: Construct the proof in logical units
Each sentence should perform one identifiable mathematical function.
A strong proof often follows this structure:
Introduce arbitrary objects.
State why a theorem applies.
Record the theorem’s conclusion.
combine it with the hypotheses.
derive the desired result.
Avoid unexplained jumps.
Instead of writing:
Since (f'>0), (f) is increasing.
Write:
Let (x_1,x_2 in I) with (x_1<x_2). Since (f) is continuous on ([x_1,x_2]) and differentiable on ((x_1,x_2)), the mean value theorem gives a point (c in(x_1,x_2)) such that[f(x_2)-f(x_1)=f'(c)(x_2-x_1).] Since (f'(c)>0) and (x_2-x_1>0), we have f(x_2)-f(x_1)>0. Therefore, f(x_1)<f(x_2). Because (x_1<x_2) were arbitrary, (f) is strictly increasing on (I).
The expanded proof demonstrates the actual logical mechanism.
Step 5: State the conclusion explicitly
A proof should finish by returning to the original target.
Do not stop at an intermediate equation.
If the problem asks you to prove uniqueness, end with:
Therefore, no two distinct points can satisfy the equation, so the solution is unique.
If the problem asks you to prove continuity, end with:
Thus, for every epsilon>0, the chosen delta guarantees the required inequality. Therefore, (f) is continuous at (a).
A correct derivation without a clear final conclusion may appear incomplete.
Step 6: Audit the proof
Before submitting, inspect the proof as if you were grading it.
Ask:
Did I use every hypothesis?
Did I define every new variable?
Did I preserve the correct quantifier order?
Did I verify the theorem’s assumptions?
Did I divide by something that could equal zero?
Did I assume what I was trying to prove?
Did I prove existence but forget uniqueness?
Did I handle endpoints correctly?
Does the final sentence answer the question?
Proof auditing is not merely proofreading. It is mathematical verification.
Worked proof 1: proving monotonicity with the mean value theorem
Problem
Let (f) be continuous on ([a,b]) and differentiable on ((a,b)). Suppose
[f'(x)>0]
for every (x\in(a,b)). Prove that (f) is strictly increasing on ([a,b]).
Step 1: Expand the target
To prove that (f) is strictly increasing, we must show that for arbitrary (x_1,x_2\in[a,b]),
[x_1<x_2\impliesf(x_1)<f(x_2).]
Step 2: Introduce arbitrary points
Let (x_1,x_2\in[a,b]) and suppose
[x_1<x_2.]
Step 3: Verify the theorem hypotheses
Because (f) is continuous on ([a,b]), it is continuous on the smaller interval ([x_1,x_2]).
Because (f) is differentiable on ((a,b)), it is differentiable on ((x_1,x_2)).
Therefore, the mean value theorem applies on ([x_1,x_2]).
Step 4: Apply the theorem
There exists (c\in(x_1,x_2)) such that
[\frac{f(x_2)-f(x_1)}{x_2-x_1}=f'(c).]
Equivalently,
[f(x_2)-f(x_1)=f'(c)(x_2-x_1).]
Since
[f'(c)>0]
and
[x_2-x_1>0,]
their product is positive:
[f(x_2)-f(x_1)>0.]
Hence,
[f(x_2)>f(x_1).]
Because (x_1<x_2) were arbitrary, (f) is strictly increasing on ([a,b]).
[\boxed{f\text{ is strictly increasing on }[a,b].}]
Why this proof earns marks
The proof does not merely name the mean value theorem. It:
Chooses arbitrary points.
Restricts the original hypotheses to the required subinterval.
states the theorem’s conclusion.
uses both positivity conditions.
returns to the definition of strictly increasing.
Worked proof 2: an epsilon-delta continuity argument
Problem
Prove directly from the definition that
[f(x)=x^2]
is continuous at every (a\in\mathbb{R}).
Step 1: State the target
We must prove that for every (\varepsilon>0), there exists (\delta>0) such that
[|x-a|<\delta\implies|x^2-a^2|<\varepsilon.]
Step 2: Analyze the expression
Factor:
|x-a||x+a|.]
We can control (|x-a|) directly using (\delta), but (|x+a|) also depends on (x).
We therefore need a preliminary bound on (|x+a|).
Suppose we require
[|x-a|<1.]
Then
|(x-a)+a|\leq |x-a|+|a|<1+|a|.]
Therefore,
[|x+a|\leq |x|+|a|<2|a|+1.]
Thus,
[|x^2-a^2|<|x-a|(2|a|+1).]
To make this less than (\varepsilon), it is sufficient to require
[|x-a|<\frac{\varepsilon}{2|a|+1}.]
We need both restrictions, so choose
\min\left{1,\frac{\varepsilon}{2|a|+1}\right}.]
Step 3: Write the formal proof
Let (\varepsilon>0). Choose
\min\left{1,\frac{\varepsilon}{2|a|+1}\right}.]
Suppose
[|x-a|<\delta.]
Since (\delta\leq 1), we have
[|x-a|<1,]
and therefore
[|x+a|<2|a|+1.]
Moreover,
[\delta\leq\frac{\varepsilon}{2|a|+1},]
so
[|x-a|<\frac{\varepsilon}{2|a|+1}.]
Consequently,
[\begin{aligned}|f(x)-f(a)|&=|x^2-a^2|\&=|x-a||x+a|\&<\frac{\varepsilon}{2|a|+1}(2|a|+1)\&=\varepsilon.\end{aligned}]
Therefore, (f(x)=x^2) is continuous at (a). Since (a\in\mathbb{R}) was arbitrary, (f) is continuous on (\mathbb{R}).
The hidden structure
The essential difficulty is not the factorization. It is recognizing that one factor must first be bounded.
This produces a common epsilon-delta pattern:
[\boxed{\text{Restrict }x\rightarrow\text{bound the uncontrolled factor}\rightarrow\text{choose }\delta}]
Worked proof 3: existence and uniqueness of a solution
Problem
Prove that the equation
[x^3+x-1=0]
has exactly one solution in ((0,1)).
The phrase exactly one contains two separate tasks:
Prove that a solution exists.
Prove that the solution is unique.
A proof completing only one part is incomplete.
Part A: Existence
Define
[f(x)=x^3+x-1.]
The function (f) is continuous on ([0,1]) because it is a polynomial.
Evaluate the endpoints:
[f(0)=-1]
and
[f(1)=1.]
Thus,
[f(0)<0<f(1).]
By the intermediate value theorem, there exists (c\in(0,1)) such that
[f(c)=0.]
Therefore, at least one solution exists in ((0,1)).
Part B: Uniqueness
Differentiate:
[f'(x)=3x^2+1.]
For every (x\in\mathbb{R}),
[3x^2+1>0.]
Therefore, by the mean value theorem, (f) is strictly increasing.
A strictly increasing function can cross the horizontal axis at most once. Hence, the solution in ((0,1)) is unique.
Therefore,
[\boxed{x^3+x-1=0\text{ has exactly one solution in }(0,1).}]
Proof architecture
This problem uses two independent bridges:
[\text{continuity + sign change}\Longrightarrow\text{existence},]
and
[f'>0\Longrightarrow\text{strictly increasing}\Longrightarrow\text{uniqueness}.]
Recognizing these separate components is more important than performing the derivative.
Logic and quantifiers: a frequent source of lost marks
Proof-based calculus depends on quantifiers.
Compare:
[\forall x\in\mathbb{R},\quad\exists y\in\mathbb{R}\quad\text{such that}\quady>x,]
with
[\exists y\in\mathbb{R},\quad\forall x\in\mathbb{R}\quad\text{such that}\quady>x.]
The first statement is true: for any (x), choose (y=x+1).
The second is false: no real number is larger than every real number.
The symbols are almost identical, but the quantifier order changes the meaning completely.
Negating quantified statements
The correct rules are:
[\neg(\forall x,P(x))\equiv\exists x,\neg P(x),]
and
[\neg(\exists x,P(x))\equiv\forall x,\neg P(x).]
For example, negate:
For every (\varepsilon>0), there exists (\delta>0) such that (P(\varepsilon,\delta)) holds.
The negation is:
There exists (\varepsilon>0) such that for every (\delta>0), (P(\varepsilon,\delta)) does not hold.
This structure is central when proving that a limit does not exist or that a function is not continuous.
Do not write a verbal negation based only on intuition. Reverse each quantifier and negate the final property.
Mathematical induction: the four required parts
A complete induction proof should contain four identifiable components.
Suppose you want to prove a statement (P(n)) for every integer (n\geq n_0).
1. Base case
Verify (P(n_0)).
2. Induction hypothesis
Assume (P(k)) is true for an arbitrary integer (k\geq n_0).
3. Inductive step
Use the hypothesis (P(k)) to prove (P(k+1)).
4. Conclusion
Invoke the principle of mathematical induction.
A common mistake is to verify several numerical cases and assume that the pattern must continue. Examples provide evidence, but they do not prove a universal statement.
Another common mistake is to assume (P(k+1)) while trying to prove (P(k+1)). That is circular reasoning.
Your induction hypothesis must be exactly the previous case—or the appropriate collection of previous cases in strong induction.
How to choose the correct theorem
Before applying a theorem, build a small hypothesis checklist.
Intermediate value theorem
Check:
Is (f) continuous on a closed interval ([a,b])?
Is the desired value between (f(a)) and (f(b))?
Is the goal to prove existence rather than calculate an exact point?
Mean value theorem
Check:
Is (f) continuous on ([a,b])?
Is (f) differentiable on ((a,b))?
Does the problem connect average and instantaneous change?
Rolle’s theorem
Check:
Is (f) continuous on ([a,b])?
Is (f) differentiable on ((a,b))?
Is (f(a)=f(b))?
Inverse function reasoning
Check:
Is the function injective on the relevant domain?
Is monotonicity available?
Is the derivative nonzero where the inverse derivative is being considered?
Have the correct domain and range been identified?
Theorem names alone do not earn full credit. The proof must show that the hypotheses are satisfied.
Common MAT148 proof-writing mistakes
1. Starting with the desired conclusion
A student trying to prove
[A\implies B]
may begin by assuming (B). Unless the proof is intentionally structured as a reverse derivation that is later justified, this is circular.
Begin with the hypotheses, not the conclusion.
2. Writing “obviously” instead of an argument
Words such as “clearly,” “obviously” and “trivially” do not replace reasoning.
A step may be obvious to you but still require a theorem, inequality or definition.
3. Ignoring quantifiers
To prove a universal statement, your chosen object must be arbitrary.
To prove an existence statement, you must produce or justify at least one valid object.
To disprove a universal statement, one counterexample is enough.
4. Using a theorem without checking its hypotheses
Differentiability does not automatically hold at endpoints, corners or discontinuities.
Continuity cannot be assumed merely because a graph looks connected.
Write the hypotheses explicitly.
5. Confusing an implication with its converse
From
[f\text{ differentiable at }a\impliesf\text{ continuous at }a,]
you cannot conclude that every continuous function is differentiable.
The converse is false.
6. Proving existence but not uniqueness
When a problem says “exactly one,” “unique” or “one and only one,” split the proof into two labelled parts.
7. Choosing (\delta) without showing why it works
In an epsilon-delta proof, stating a formula for (\delta) is not enough.
You must prove that the choice forces
[|f(x)-L|<\varepsilon.]
8. Losing the domain
A function may be increasing on one interval and decreasing on another.
An inverse may exist only after the domain is restricted.
Every theorem application must occur on a clearly specified interval.
9. Replacing a proof with examples
Testing (n=1,2,3) does not prove a statement for all positive integers.
Graphing a function does not prove continuity.
A numerical approximation does not prove exact equality.
10. Writing an unstructured wall of symbols
Proofs are arguments written for a reader.
Use complete sentences, transitions and clearly stated conclusions.
A 14-day MAT148 midterm preparation plan
Because the exact assessment scope may vary, students should confirm the assigned sections, announcements and instructor guidance for their specific section. The following plan develops the core proof-calculus competencies associated with the official MAT148 topic list.
Days 1–2: Logic and definitions
Review:
Implications and converses.
Contrapositives.
Quantifier order.
Negation of quantified statements.
Set notation.
Definitions used in the assessed material.
Training task:
Write every major definition from memory, then compare it with the official course wording.
Days 3–4: Proof structures
Practise:
Direct proof.
Contrapositive.
Contradiction.
Existence and uniqueness.
Counterexamples.
Mathematical induction.
Training task:
For ten statements, identify the likely proof structure before attempting the proof.
Days 5–6: Limits
Practise:
Limit laws.
One-sided limits.
Formal limit statements.
Epsilon-delta inequalities.
Disproving proposed limits.
Identifying where algebraic estimates require auxiliary bounds.
Training task:
Complete at least three epsilon-delta proofs without looking at a model solution.
Days 7–8: Continuity
Practise:
Continuity at a point.
Continuity on an interval.
Algebra of continuous functions.
Intermediate value theorem.
Existence-of-root arguments.
Counterexamples involving discontinuities.
Training task:
For every theorem problem, write the hypotheses before writing the conclusion.
Days 9–10: Differentiation and the mean value theorem
Practise:
Derivative from the limit definition.
Differentiability versus continuity.
Rolle’s theorem.
Mean value theorem.
Monotonicity.
Uniqueness arguments.
Bounds derived from derivative information.
Training task:
Construct a theorem-selection table connecting each hypothesis pattern to its likely conclusion.
Day 11: Mixed proof set
Complete a timed set containing:
One logic problem.
One definition-based problem.
One theorem-application problem.
One counterexample problem.
One computational calculus problem.
One unfamiliar proof.
Do not organize the questions by topic. The purpose is to practise method recognition.
Day 12: Error analysis
Classify every mistake as one of the following:
Definition error.
Quantifier error.
Theorem-selection error.
Missing hypothesis.
Algebraic error.
Logical gap.
Incomplete conclusion.
Time-management error.
Do not merely rewrite the correct answer. Identify why your original reasoning failed.
Day 13: Timed mock midterm
Reproduce realistic conditions:
No notes unless permitted by the course.
Fixed time.
No solution checking during the attempt.
Full written proofs.
No AI-generated hints.
Afterward, grade for reasoning rather than final answers alone.
Day 14: Targeted repair
Spend the final day on the two weakest categories identified during the mock midterm.
Do not attempt to relearn the entire course the night before the assessment.
How to manage time during a proof-based midterm
First pass
Read every question and classify it:
Definition.
Computation.
Theorem application.
Existence or uniqueness.
Counterexample.
Induction.
Epsilon-delta.
Begin with a question whose structure you recognize.
Before writing a proof
Use the margin or scratch space to record:
[\text{Given}\quad\longrightarrow\quad\text{Tool}\quad\longrightarrow\quad\text{Target}.]
For example:
[\text{continuous + sign change}\longrightarrow\text{IVT}\longrightarrow\text{root exists}.]
This reduces the risk of beginning a proof with no direction.
When you become stuck
Do not repeatedly manipulate the same equation.
Instead, ask:
Which definition is hidden in the target?
Which hypothesis have I not used?
Is the problem asking for existence, uniqueness or both?
Would the contrapositive be easier?
Can I construct a counterexample?
Is there a theorem whose conclusion resembles the target?
Before submitting
Audit the beginning and end of every proof.
The beginning should identify arbitrary objects or assumptions correctly.
The end should explicitly state the required conclusion.
How parents can evaluate MAT148 support
For parents supporting a university student, poor performance in proof-based calculus does not necessarily mean the student “cannot do calculus.”
The underlying difficulty may be more specific:
Translating definitions into proof objectives.
Managing quantifiers.
Selecting the correct theorem.
Writing complete arguments.
Distinguishing intuition from proof.
Transferring ideas to unfamiliar questions.
Completing rigorous work under time pressure.
Effective support should diagnose which of these mechanisms is failing.
A useful coaching process should include:
A baseline diagnostic.
Classification of proof and reasoning errors.
Targeted practice rather than repetitive worksheets.
Timed mixed-problem sets.
Written feedback on logical structure.
A second assessment using different but comparable problems.
The goal should not be indefinite dependence on a tutor.
The goal should be measurable growth in independent proof construction.
For adult university students, progress communication with parents should occur only with the student’s knowledge and permission.
Final MAT148 midterm checklist
Before the midterm, confirm that you can:
State the important definitions precisely.
Negate quantified statements correctly.
Distinguish a theorem from its converse.
Construct a direct proof.
Use contradiction or contrapositive when appropriate.
Complete a mathematical induction proof.
Prove a basic limit using epsilon-delta reasoning.
Verify continuity and differentiability hypotheses.
Apply the intermediate value theorem.
Apply Rolle’s theorem and the mean value theorem.
Separate existence from uniqueness.
Construct a counterexample to a false universal statement.
Explain every major logical transition.
Audit a proof for missing assumptions.
The central objective of MAT148 midterm preparation is not to predict every question.
It is to develop a reliable response to unfamiliar questions:
[\boxed{\text{Decode the claim}\rightarrow\text{expand the definitions}\rightarrow\text{select the bridge}\rightarrow\text{construct the argument}\rightarrow\text{audit the proof}}]
That process transforms proof writing from guesswork into a disciplined mathematical method.
Need specialized MAT148 preparation?
S.T.E.M. Online helps university students develop the reasoning required for proof-based calculus, including:
Logic and quantifiers.
Definitions and theorem hypotheses.
Epsilon-delta proofs.
Limits and continuity.
Mean value theorem arguments.
Existence and uniqueness proofs.
Counterexample construction.
Timed midterm problem solving.
The coaching process begins by identifying whether the student’s main obstacle is conceptual knowledge, theorem selection, proof construction, mathematical notation or exam execution.
Recommended internal links:
MAT148 tutoring service page.
University calculus tutoring page.
Free calculus diagnostic.
Hard calculus exam-questions article.
Future article on MAT148 proof-writing mistakes.
Comments