MATH1961 Mathematics 1A (Advanced)
MATH1961 Overview
- University of Sydney
- S1 2026
- 8 chapters
- Science
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).
- Assessed by Final examination 60% · Mid-semester quiz 13% · Two written assignments 15% · Online quizzes 10% + 1 more
- Key terms Epsilon–delta definition of a limit, Completeness of the reals, Mean Value Theorem (MVT), Riemann integrable
- How to prepare Treat MATH1961 as a set of named proofs and rigour drills you rehearse until they run on autopilot &mdash…
- Most asked What is on the MATH1961 final exam?
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 |
What MATH1961 covers
Eight topic blocks → one exam-ready map, rigour layer first. Each links to its free chapter guide.
Mathematical Foundations
Logic & quantifiers · the four proof methods · induction · completeness of ℝThis is the chapter that makes MATH1961 Advanced.
- 1.1 Notation you must use correctly — quantifiers, implication, the number-system chain
- 1.2 Negating quantified statements — the counterexample as a complete proof
- 1.3 The four proof techniques: direct, contrapositive, contradiction, cases
- Mathematical and strong induction — the worked template
- The completeness of ℝ — sup / inf and the Least Upper Bound Axiom
Limits and Continuity
The ε–δ definition · limit laws & squeeze · DNE by two sequences · IVT / EVTThis chapter holds the single most important statement in the calculus stream: the precise ε–δ definition of a limit.
- 2.1 The ε–δ definition of a limit — reading it as a game
- How to PROVE a limit from the definition — the standard backward-then-forward play
- 2.2 Limit laws, the squeeze (sandwich) law & the fundamental limit
- Limit DNE by the two-sequence method — the rigour trap
- Continuity, and the IVT / EVT proved via completeness
Differentiation
The rigorous derivative · Rolle → MVT → Cauchy MVT · L’HôpitalThis is the proof-heavy core of the calculus stream.
- The derivative as a limit of difference quotients — the secant → tangent picture
- The Carathéodory form, and proving differentiable ⇒ continuous
- The four rules, and how lectures prove the product rule from the definition
- Rolle’s theorem → the Mean Value Theorem → the Cauchy MVT
- Monotonicity & extremum corollaries; L’Hôpital’s rule from the Cauchy MVT
Integration
Darboux sums · the Riemann integral · both parts of the FTC · techniquesThe second proof-heavy core. The definite integral is not ‘the antiderivative evaluated at the ends’ — that is a theorem (the FTC), and the Advanced unit makes you build the integral from its definition first.
- The Riemann integral via Darboux upper & lower sums
- The Darboux criterion — integrability is ‘the gap closes’
- The two rigour traps: unbounded ⇒ not integrable; bounded ⇏ integrable (Dirichlet)
- Both parts of the Fundamental Theorem of Calculus, proved
- Techniques: substitution, parts, partial fractions, trig substitution; improper integrals & area
Series
Sequences & ε–N · geometric & power series · Taylor + Lagrange remainderA series is the limit of its partial sums, and the whole theory rests on one question — do the terms bunch toward a single number as n grows?
- Sequences and their limits — the ε–N definition, made usable
- The toolkit: algebra of limits, squeeze, monotone + bounded ⇒ convergent
- Proving divergence by two subsequences
- Geometric series, power series & the radius of convergence
- Taylor’s theorem with the Lagrange remainder, and why the series represents e<sup>x</sup>, sin, cos
Complex Numbers
Arithmetic · the Argand diagram · polar & Euler form · de Moivre · roots of unityA complex number is z = x + iy with x, y real and i² = −1. The reals sit inside ℂ as the y = 0 line; what you gain is that every polynomial now factors (the Fundamental Theorem of Algebra).
- Arithmetic, the conjugate & modulus — dividing by multiplying by the conjugate
- The Argand diagram — modulus and argument replace x and y
- Polar & exponential form, and Euler’s formula
- de Moivre’s theorem (with the induction proof) & powers
- Roots of unity and the unit-circle / trig connection
Linear Algebra
Vectors & Cauchy–Schwarz · Gaussian elimination · vector spaces · rank–nullityThis is the structural half of MATH1961 (the Brownlowe stream).
- Vectors, the dot product & norm; Cauchy–Schwarz by the discriminant trick
- The cross product, lines & planes in ℝ³
- Gaussian elimination & solving linear systems
- Matrix algebra, inverses & determinants
- Vector spaces: subspace, span, independence, basis, dimension — and rank–nullity
Eigenvalues and Eigenvectors
Characteristic polynomial · eigenspaces · the multiplicity trap · diagonalisationFor most vectors x, multiplying by a matrix A rotates and rescales x into a new direction. A few special non-zero vectors are only scaled — Ax lands on the same line through the origin.
- The eigen-equation Av = λv — directions the matrix only stretches
- The characteristic polynomial det(A − λI) = 0 & the eigenspace as a null space
- Algebraic vs geometric multiplicity — the multiplicity trap
- Diagonalisation A = PDP<sup>−1</sup>, fully worked
- Applications: matrix powers, Markov chains; real matrices with complex eigenvalues
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.
MATH1961 cheatsheet for exam revision
AskSia publishes a free MATH1961 cheatsheet for exam revision, an exam cheat sheet that follows the official permitted-materials rule for this assessment and condenses the topics in this guide. Open the MATH1961 cheatsheet.
Worked example · free
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.
Questions students ask in each MATH1961 chapter
- Why does MATH1961 spend a whole chapter on logic and proof before any calculus?
- Because the Advanced unit grades whether you can construct an argument, and the same machinery — quantifiers, the proof methods, induction, and the completeness of ℝ — is what later proves the IVT, the EVT, the MVT and the FTC. Master the spine first and the rest of the course becomes ‘apply the toolkit’. The quantifier discipline you build here is exactly what an ε–δ limit proof tests. Chapter 01 · Mathematical Foundations
- What is the actual method to prove a limit from the ε–δ definition?
- Four steps. (1) Take ε > 0 arbitrary. (2) Work backwards from the target |f(x) − L| < ε, bounding it by something simple times |x − a|. (3) Read off a δ (in terms of ε) that makes the bound < ε. (4) Verify forwards: assume 0 < |x − a| < δ and show |f(x) − L| < ε. The marks are in doing backward-design then a clean forward check, with δ chosen after ε. Chapter 02 · Limits and Continuity
- Why does the Advanced unit insist the derivative is a limit, not just a slope formula?
- Because the proofs depend on it. From the limit definition (or the equivalent Carathéodory form) you can prove that differentiability forces continuity, and you can derive the product, quotient and chain rules rather than memorising them. Mainstream calculus uses the rules; MATH1961 asks you to justify them, and that is where the marks separate. Chapter 03 · Differentiation
- Why build the integral from Darboux sums instead of just using antiderivatives?
- Because ‘the antiderivative evaluated at the ends’ is the conclusion (the FTC), not the definition. The Advanced unit defines the integral as area trapped between upper and lower sums, then proves the FTC connects it to antiderivatives. Building from the definition is exactly what lets you handle integrability questions and the rigour traps the exam plants. Chapter 04 · Integration
- How do I prove a sequence converges in the Advanced unit?
- Either directly from the ε–N definition (given ε, find an N past which |an − L| < ε), or — especially for recursively-defined sequences — by showing it is monotone and bounded and invoking the monotone convergence theorem, which is the completeness axiom in disguise. ‘It looks like it settles down’ earns nothing; the marks are in the rigorous argument. Chapter 05 · Series
- How do I divide complex numbers?
- Multiply the numerator and denominator by the conjugate of the denominator. The denominator (c + di)(c − di) becomes the real number c² + d² = |c + di|², and the rest is bookkeeping. This works because z·z̄ = |z|² is always real — the single most useful identity in the chapter. Chapter 06 · Complex Numbers
- What is the discriminant trick and why does the exam love it?
- It proves the Cauchy–Schwarz inequality from a single observation: the squared length p(t) = (tu + v)·(tu + v) is ≥ 0 for every real t, so this quadratic in t never dips below the axis, which forces its discriminant ≤ 0 — and that discriminant is Cauchy–Schwarz. The exam likes it because the marks are explicitly in saying why p(t) ≥ 0 (a dot square) and why the discriminant is ≤ 0; quoting the inequality without the argument scores little. Chapter 07 · Linear Algebra
- How do I actually find eigenvalues and eigenvectors?
- Four steps. (1) Form A − λI (subtract λ down the diagonal). (2) Compute det(A − λI), a degree-n polynomial in λ. (3) Solve χA(λ) = 0 for the eigenvalues. (4) For each λ, find null(A − λI) by row reduction — that null space is the eigenspace, and you report it by a basis. The zero vector is excluded from being an eigenvector. Chapter 08 · Eigenvalues and Eigenvectors
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.