MATH1961 · Mathematics 1a (advanced)
The Complete Exam Bible · S1 2026Mathematics 1A (Advanced)
Mathematics 1A (Advanced) is the proof-based twin of mainstream first-year mathematics at the University of Sydney — same broad topics, but with a rigour layer bolted on: the precise ε–δ definition of a limit, the completeness of ℝ (sup / inf, the Least Upper Bound Axiom), and formal proofs of every big theorem (Cauchy–Schwarz, the IVT and EVT, Rolle, the MVT, Taylor’s remainder, the FTC, rank–nullity). It runs four lecture hours a week and is explicitly “a deeper look — more proof based”. The final exam is 60% of your grade and rewards a clean argument, not just a right number: a correct-looking answer with no justification scores almost nothing. This guide teaches each topic the way the exam marks it — the definition stated with the exact quantifier order, the theorem shown with its proof, and the rigour trap flagged.
What MATH1961 covers
Eight topic blocks → one exam-ready map, rigour layer first. Each links to its free chapter guide.
How MATH1961 is assessed
| Component | Weight | Format |
|---|---|---|
| Final examination | 60% | Formal exam period · covers both streams (Calculus + Linear Algebra) · proof-based |
| Mid-semester quiz | 13% | Around Week 8 |
| Two written assignments | 15% | Proof-heavy · Assignment 1 ~ Week 3, Assignment 2 ~ Week 11 |
| Online quizzes | 10% | Ten weekly quizzes on Canvas (~1% each) |
| Tutorial participation | 2% | Across both tutorial streams — confirm the exact split in your unit’s Canvas/outline |
An ε–δ limit proof — the signature Advanced question, mark by mark
- +1State the definition and the goal. We must show: for every ε > 0 there exists δ > 0 such that 0 < |x − 3| < δ implies |(2x − 1) − 5| < ε. Take ε > 0 arbitrary.
- +1Work backwards from the target. Simplify the quantity to control: |(2x − 1) − 5| = |2x − 6| = 2|x − 3|. We want 2|x − 3| < ε, i.e. |x − 3| < ε/2.
- +1Choose δ in terms of ε. Let δ = ε/2 (this is the witness; δ is chosen after and depends on ε — the quantifier order is the whole point).
- +1Verify forwards. Assume 0 < |x − 3| < δ. Then |(2x − 1) − 5| = 2|x − 3| < 2δ = 2 · (ε/2) = ε.
- +1Conclude. Since ε > 0 was arbitrary, the definition is satisfied, so limx→3 (2x − 1) = 5. ■
Key terms
- Epsilon–delta definition of a limit
- The precise statement that limx→a f(x) = L means: for every ε > 0 there exists δ > 0 such that 0 < |x − a| < δ implies |f(x) − L| < ε. The quantifier order (for-all ε, then there-exists δ) is the heart of it — δ is allowed to depend on ε, and the strict |x − a| > 0 means the limit ignores the value at a itself.
- Completeness of the reals
- The Least Upper Bound Axiom: every non-empty set of real numbers that is bounded above has a least upper bound (supremum) in ℝ. This is the property the rationals lack, and it is what makes the IVT, the EVT and monotone convergence true — the spine of the whole Advanced unit.
- Mean Value Theorem (MVT)
- If f is continuous on [a, b] and differentiable on (a, b), there is a point c in (a, b) where f′(c) equals the average slope (f(b) − f(a))/(b − a). In MATH1961 you prove it from Rolle’s theorem, and it powers the monotonicity test, Taylor’s remainder and L’Hôpital’s rule.
- Riemann integrable
- A bounded function f on [a, b] is Riemann integrable when its Darboux upper and lower sums can be squeezed arbitrarily close (the Darboux criterion). Boundedness is necessary but not sufficient — the Dirichlet function is bounded yet not integrable — while every continuous or monotone bounded function is integrable.
- Eigenvalue and eigenvector
- A non-zero vector v with Av = λv keeps its direction under the matrix A; the scalar λ is its eigenvalue (the stretch factor). The eigenvalues are the roots of the characteristic polynomial det(A − λI) = 0, and each eigenspace is the null space of A − λI — report it by a basis.
MATH1961 FAQ
Is MATH1961 hard?
It is harder than mainstream Mathematics 1A in a specific way: the topics overlap, but MATH1961 adds a rigour layer and grades whether you can construct a proof, not just apply a formula. Mainstream is now only about 60–70% of the Advanced content, and a correct-looking answer with no justification scores almost nothing. The difficulty is writing clean ε–δ arguments, inductions and named-theorem proofs under exam time — pure technique you can drill to automatic.
How is MATH1961 assessed?
The final exam dominates at 60% and covers both the Calculus and Linear Algebra streams. The rest is continuous assessment — a mid-semester quiz (about 13%), two proof-heavy written assignments (about 15% together), ten weekly online quizzes (about 10%) and tutorial participation (about 2%). Confirm this year’s exact dates and weights against your own unit Canvas, as details shift between cohorts.
How is MATH1961 different from MATH1021 / mainstream Mathematics 1A?
Same broad topics — limits, differentiation, integration, series, complex numbers and linear algebra — but MATH1961 bolts on the rigour: the precise ε–δ limit, the completeness of ℝ (sup / inf), and formal proofs of the IVT, EVT, MVT, Taylor’s remainder, the FTC and rank–nullity. It runs four lecture hours a week instead of about three and is described as “a deeper look — more proof based”. The marks that separate you from a mainstream student are the proofs.
What is on the MATH1961 final exam?
Both streams. From Calculus: ε–δ limit proofs, continuity and the IVT/EVT, the Mean Value Theorem chain and its corollaries, Taylor’s theorem with the Lagrange remainder, and the Riemann integral with both parts of the FTC. From Algebra: vectors and Cauchy–Schwarz, Gaussian elimination, vector spaces, the rank–nullity theorem, and eigenvalues, eigenvectors and diagonalisation. Recurring ‘prove that…’ items carry the highest marks.
Is using AskSia for MATH1961 cheating?
No. AskSia is a study reference written in our own words — we host none of your lecturer’s files, and Sia teaches you the method (the proof technique, the quantifier order, the trap) to earn the marks; it does not complete or sit your assessments.
How to study for the exam
Treat MATH1961 as a set of named proofs and rigour drills you rehearse until they run on autopilot — because under exam pressure you only reproduce reliably what you have written many times. Build each topic as an “AHA-unit”: state the definition or theorem with the exact quantifier order (partial credit lives there), then build the argument in full sentences mixing English and symbols, the style the lecturer grades. The recurring ‘prove that…’ items are the ε–δ limit, ‘sup = …’ (both clauses), a limit DNE by two sequences, the IVT/EVT via completeness, and the MVT → Taylor → FTC chain. Because the final is 60% and rewards rigour over arithmetic, banked proof technique is the safest mark in the unit. Drill the continuous-assessment assignments as rehearsals — they already demand ε-style limits, induction and isomorphism arguments at exam level.
