📐 Analysis I & II — The Complete Intuitive Guide

A from-the-ground-up synthesis of Struwe (2010), Ziltener (2025), and seven D-ITET basic exams (2013–2023)

Promise. If you read this from top to bottom, knowing only high school math, you will understand every concept on the ETH D-ITET Analysis basic exam — not just memorize formulas. Every idea is built up from intuition, every theorem comes with a real-world picture, and every chapter ends with actual exam tasks with full solutions.


🧭 How to use this note

This document is written for Obsidian, so it uses LaTeX ($...$ and $$...$$), callouts (> [!tip]), and [[wiki-links]] for navigation.

Every chapter follows the same six-step rhythm:

  1. 🤔 The big question — what real-world or mathematical problem are we solving?
  2. 💡 The intuition — a picture or analogy your brain can hold
  3. 📜 The formal definition — the precise statement
  4. 🔧 Worked examples — small, then medium, then exam-level
  5. 🎯 How the exam tests this — concrete patterns from past D-ITET exams
  6. 📝 Practice tasks with solutions

How to study with this document

  1. First pass — read intuitions and worked examples only. Skip formal definitions if they feel intimidating.
  2. Second pass — read carefully, do every example with paper.
  3. Third pass — close the document, redo every “Practice Task” from memory.

📋 Table of Contents

  1. 1 · Logic — the operating system of math
  2. 2 · Sets and functions
  3. [[#3 · Numbers — from to ]]
  4. 4 · Sequences — what does “approaching” mean?
  5. 5 · Series — adding infinitely many things
  6. 6 · Continuity — drawing without lifting the pen
  7. 7 · Differentiation — the slope at a point
  8. 8 · Taylor series — polynomial X-rays
  9. 9 · Limits and L’Hôpital’s rule
  10. 10 · Integration — the Fundamental Theorem
  11. 11 · Integration techniques (parts, substitution, partial fractions)
  12. 12 · Ordinary differential equations
  13. 13 · Multivariable functions
  14. 14 · Multivariable extrema and Lagrange multipliers
  15. 15 · Multiple integrals
  16. 16 · Vector fields, Green, Stokes, Gauß
  17. 17 · Implicit and inverse function theorems
  18. 18 · Master strategy — the exam playbook

1 · Logic — the operating system of math

🤔 The big question

Why do we need logic? Because every theorem you’ll ever read says “if this holds, then that holds” — and to use the theorem you must understand exactly what it claims, what it doesn’t, and how to negate it.

💡 Intuition: statements are switches

A mathematical statement is a sentence that is either true or false — like a light switch with only “on” and “off”. No “kinda”, no “maybe”, no “depends on the weather”.

Example

  • — TRUE ✅
  • — FALSE ❌
  • “This sentence is false” — not allowed (paradox: if it’s true it’s false, if it’s false it’s true). Math forbids self-reference like this.

📜 The five connectives

Given two statements and , you can build new ones:

SymbolRead asMeaningMnemonic
”not Flips the truth valuethink: “the opposite"
" and True only if both are truethink: a chain — weakest link breaks it
or True if at least one is trueinclusive or — like a menu where you can pick either or both
”if , then Only false when true, falsea promise: only broken if you don’t deliver
iff Same truth value”they live or die together”

⚠️ The trap that catches everyone: vacuous truth

A false hypothesis implies anything

is true whenever is false. The statement “if the moon is made of cheese, then is logically true, because the premise is false.

Why? The implication is a promise. The promise “if it rains, I’ll bring an umbrella” is only broken if it rains and you don’t bring an umbrella. On a sunny day, the promise was never tested — so it was never broken.

💡 Contraposition — the most useful identity in proof-writing

Example

  • “If it rains → ground is wet” “If ground is dry → it didn’t rain”
  • “If is even → is even” “If is odd → is odd” (easier to prove!)

📜 Quantifiers: and

SymbolRead asExample
”for all in , holds”
“there exists in with

Negation rule — flip the quantifier and negate the statement

Negating a real exam-style sentence (FS 2023 task MC1)

Original:

Negation, step by step:

  1. Flip outer :
  2. Flip inner :
  3. De Morgan:

Final:

🔧 Three proof techniques you absolutely need

Direct proof

Build a chain .

Proof by contradiction

To prove , assume the opposite () and derive nonsense.

There is no largest natural number

Assume there is a largest . But is also in , and . Contradiction!

Mathematical induction — your best friend on exams

To prove for all :

  1. Base case: prove (or ).
  2. Inductive step: assume holds — the induction hypothesis (IH) — and prove .

Sum of the first odd numbers

Claim: .

Base ():

Step: Assume . Then

🎯 How the exam tests logic

Every basic exam contains at least one logic / quantifier task. Common types:

  • Negate a quantified statement (FS 2023, MC1)
  • Prove an inequality by induction (FS 2015 task 9, FS 2019 task 13)
  • Prove a sum-formula by induction

📝 Practice tasks

Task 1.1 (Quantifier negation)

Negate: .

Task 1.2 (Induction — adapted from FS 2015 task 9)

Prove that for all and : .

Task 1.3 (FS 2019 task 13 — clever induction)

Prove: for all .


2 · Sets and functions

🤔 The big question

Sets are the nouns of math; functions are the verbs. You can’t talk about anything without them.

💡 Sets — collections without order

Set

A set is an unordered collection of distinct objects, called elements.

Notation: — order and repetition don’t matter.

SetSymbolMembers
Naturals
Naturals incl. 0
Integers
Rationals
RealsAll decimals
Complex
Empty set or nothing

📜 Set operations and De Morgan

OperationDefinitionPicture
Unionboth circles
Intersectionoverlap only
Difference minus the overlap
Complementeverything outside
Cartesian productgrid of pairs

De Morgan's Laws

💡 Functions — the rule book

Function

A function assigns to every exactly one .

  • domain
  • codomain
  • Notation:

Example

  • — only on non-negatives!

🔧 Injective, surjective, bijective

Definition

  • Injective (one-to-one): different inputs → different outputs. .
  • Surjective (onto): every is hit. .
  • Bijective: both. Then an inverse exists.

Mental picture

  • on : NOT injective (), NOT surjective onto (negative numbers aren’t hit).
  • : bijective, inverse is .

🔧 Composition

If and : Apply first, then . Associative: .

🎯 How the exam tests this

Set/function questions are warm-up multiple choice. Example FS 2023 MC2:

True or false: for any and any , we have .

Answer: False. The image and intersection don’t generally commute when isn’t injective.


3 · Numbers — from to

🤔 Why so many number systems?

Every time a problem couldn’t be solved, mathematicians invented a new kind of number.

Couldn’t solve…so we invented…
in (integers)
in (rationals)
in (reals)
in (complex)

So: .

💡 The real numbers — the “no gaps” property

The rationals have holes: (Pythagoras already knew). Calculus needs a number system without holes — that’s .

Bounds, supremum, infimum

Let be non-empty.

  • is bounded above if . is an upper bound.
  • The supremum is the least upper bound.
  • The infimum is the greatest lower bound.
  • If , it’s the maximum . Likewise for .

Completeness axiom of

Every non-empty bounded-above subset of has a supremum in .

This is the single most important property of . Every limit theorem ultimately relies on it.

Sup vs. max

. , but , so has no maximum.

Archimedean property

For every there is with . Hence .

💡 The Euclidean space

Stack reals into a vector .

Norm and dot product

Three core inequalities

  1. Cauchy–Schwarz:
  2. Triangle:
  3. Reverse triangle:

💡 Complex numbers

Define with and form .

You can think of as — the complex plane — with horizontal axis = real part, vertical axis = imaginary part.

Complex operations

For and :

Inverse computation (from Ziltener)

💡 Polar form and Euler’s formula — the magic shortcut

Every can be written as or equivalently — via Euler’s formula: so .

Why polar form is amazing

Multiplication becomes trivial: Multiply moduli, add angles. Powers and roots become easy.

Power via polar form

, so .

🎯 Roots of complex numbers

Every has exactly different -th roots:

Fundamental Theorem of Algebra

Every non-constant complex polynomial has at least one complex root. Hence it factors completely into linear factors over .

This is why is algebraically closed — and why FS 2023 MC3 (“does there exist a degree-3 polynomial with no complex root?”) is false.

📝 Practice tasks

Task 3.1 — Compute .

Task 3.2 — Find all with .


4 · Sequences — what does “approaching” mean?

🤔 The big question

If a turtle moves meters per step, where does it end up? Intuitively at — but how do we make that precise without hand-waving?

Answer: the epsilon-N definition of a limit. This single idea is the foundation of every theorem in calculus.

💡 What is a sequence?

Sequence

A sequence is an infinite ordered list — equivalently, a function (or ). Notation: .

Three classics

  • Harmonic : terms
  • Geometric : terms
  • Constant

📜 The definition that started it all

Convergence

converges to — written or — iff

How to read this:

  • is a “challenge” (any tolerance the prover throws at you, no matter how tiny).
  • You answer with (an index from which on the sequence is closer than to ).
  • Smaller usually requires bigger .

Given , choose any . Then for :

🔧 Limit arithmetic — your daily toolkit

If and , then:

  • (provided )

Squeeze (Sandwich) Theorem

If for all and and , then .

🔧 Standard limits — memorize these

SequenceLimitCondition

💡 The four pillars of convergence

Monotone convergence

A monotonically increasing sequence bounded above converges (to its supremum). Likewise for decreasing & bounded below.

Bolzano–Weierstrass

Every bounded sequence in has a convergent subsequence.

Cauchy criterion

A sequence converges it is Cauchy:

Why Cauchy is golden

You can prove convergence without knowing the limit — just check the terms huddle together.

🔧 Worked exam-style examples

FS 2023 MC4 — algebraic limit

.

Common denominator : Divide by in numerator and denominator: .

FS 2023 MC5 — conjugate trick

.

Multiply by conjugate :

💡 Limes superior and inferior

For a bounded sequence, define

Theorem

A bounded sequence converges .

🎯 How the exam tests sequences

  • Compute a limit using algebra/conjugates (FS 2023 MC4, MC5).
  • Identify which standard tool applies (squeeze, monotone convergence).
  • Find limits of recursive sequences (HS 2013 task 2 — golden ratio recursion).

📝 Practice tasks

Task 4.1 — Compute .

Task 4.2 — Show does not converge.

Task 4.3 (FS 2013 task 2 — resistor circuit)

A resistor network gives total resistance . Does converge? If so, to what?


5 · Series — adding infinitely many things

🤔 The big question

What is ? You can’t literally add infinitely many things — but you can take the limit of partial sums.

📜 Series — formal definition

Series

Given , define partial sums . The series converges iff converges, in which case

💎 Two essential examples

Geometric series — THE most important series

For :

Proof sketch: , so .

Zeno's paradox solved

Achilles runs km. Finite!

Square inscribed inside square (HS 2013 task 2a)

Each new square has side . Total perimeter: for .

Harmonic series diverges

Even though .

Why? Group terms: — each group , infinitely many groups.

The lesson: is necessary for to converge — but not sufficient.

🔧 Convergence tests — your decision tree

TestWhen to useStatement
n-th termalways check firstIf , diverges
Geometricconverges iff
Comparisonbound by simpler series and converges ⇒ converges
Ratio testfactorials / exponentials: converges, diverges
Root test-th powers: same conclusion
Leibnizalternating series decreasing to converges

FS 2023 MC7 — pick the divergent series

behaves like — divergent (harmonic-like).

FS 2019 task 2

. Since , the n-th-term test ⇒ diverges.

💡 Absolute vs. conditional convergence

Definition

converges absolutely iff converges.

Theorem

Absolute convergence ⇒ convergence (but not vice versa).

Conditional convergence

converges (Leibniz), but not absolutely.

🚀 Power series — calculus’s superpower

Power series

Has a radius of convergence , computed by or by ratio test:

  • → converges
  • → diverges
  • At → must be checked separately

FS 2019 MC1

. Ratio: So .

💎 The exponential series

The single most important power series:

It satisfies — and from this single fact follow Euler’s formula, the trigonometric identities, and (via ) the bridge between exponentials and trigonometry.

🎯 How the exam tests series

  • Compute radius of convergence (FS 2019 MC1, FS 2023 task 2)
  • Decide convergence (FS 2023 MC7, FS 2019 task 2)
  • Sum a geometric-type series (HS 2013 task 2)
  • Show uniform convergence of partial sums of a power series (FS 2023 task 2)

📝 Practice tasks

Task 5.1 — Find for .

Task 5.2 — Sum .

Task 5.3 (HS 2013 task 2b — nested triangles)

Triangles inscribed each at half the side length. The first triangle has area . What percentage of the total area is ?


6 · Continuity — drawing without lifting the pen

🤔 The big question

You drove from Zürich to Geneva starting at altitude and arriving at . Did your altitude pass through exactly somewhere along the way? Common sense says yes — and the precise statement of “yes” is the Intermediate Value Theorem, the most useful consequence of continuity.

💡 Intuition

A function is continuous at if, when you wiggle a tiny bit around , also wiggles only a tiny bit around . No jumps, no holes, no infinities at .

📜 The two equivalent definitions

Continuity (sequential)

is continuous at iff for every sequence , .

Continuity ( -)

is continuous at iff

These are equivalent. Use sequential when you have a sequence. Use - when proving from scratch.

🔧 Examples and counterexamples

Continuous everywhere

Polynomials, , , , on , on .

Jump discontinuity

is discontinuous at — left limit , right limit .

FS 2023 MC11 — pick the right constant

. For continuity at : So .

💡 Lipschitz continuity — quantitative continuity

Lipschitz with constant

Lipschitz ⇒ uniformly continuous ⇒ continuous.

💡 Compact sets — where continuity gets superpowers

Compactness (sequential)

is compact iff every sequence in has a subsequence converging to a point of .

Heine–Borel

In : compact closed and bounded.

Example

is compact. is not (). is not (unbounded).

🎯 The two great theorems

Extreme Value Theorem

A continuous on a compact attains its max and min.

Intermediate Value Theorem (IVT)

If is continuous and lies between and , then with .

FS 2023 MC13

If and for continuous , then with . True by IVT.

HS 2015 task 4 — the "tangent point"

Find such that the tangent to at has the same slope as the secant from to .

Secant slope . Set , so . (This is the Mean Value Theorem in action — see chapter 7.)

HS 2016 task 11 — fixed point via IVT

Let continuous. Show has a fixed point ().

Define . Then and . By IVT, with , i.e., .

💡 Pointwise vs. uniform convergence of functions

Definition

A sequence of functions converges to :

  • Pointwise:
  • Uniformly:

Pointwise is a trap

on converges pointwise to for , . Each is continuous, but the limit isn’t.

Theorem

Uniform limit of continuous functions is continuous.

FS 2023 MC14

on :

  • At : .
  • At : .

So pointwise limit is the discontinuous step function. Cannot converge uniformly (would force the limit to be continuous).

🎯 Practice tasks

Task 6.1 — Show is Lipschitz on .

Task 6.2 (FS 2019 task 5) — Where is continuous, differentiable, ?


7 · Differentiation — the slope at a point

🤔 The big question

A car’s odometer reads at time . The speedometer at instant shows what number? Answer: the derivative — the instantaneous rate of change.

💡 Intuition: zoom in until straight

Take any smooth graph and zoom in near a point. Eventually it looks like a straight line. The slope of that line is .

📜 The definition

Derivative

is differentiable at if the limit exists. Other notations: .

The tangent line at : .

🔧 First examples

at

Right: . Left: . Not differentiable. (Continuous, though!)

is its own derivative

Using and :

💡 Differentiable ⇒ continuous (not vice versa)

If is differentiable at , it's continuous at .

Proof: .

The converse fails: is continuous but not differentiable at . Worse, Weierstrass built a function continuous everywhere but differentiable nowhere.

🔧 The differentiation rules

RuleFormula
Sum
Product
Quotient
Chain
Inverse

🔧 Standard derivatives — memorize this table

(const)

💡 The Mean Value Theorem — calculus’s workhorse

Rolle's theorem

If is continuous on , differentiable on , and , then with .

Mean Value Theorem (MVT)

If is continuous on , differentiable on , then with

Real-world reading

If you drive from Zürich to Geneva (282 km) in 3 hours, your average speed is 94 km/h. The MVT says: at some instant, your speedometer read exactly 94 km/h.

The HS 2016 exam phrased this exact scenario: a driver passes two cameras at distance in time . If exceeds the speed limit, the driver gets a ticket — the MVT guarantees they were speeding at some moment.

HS 2015 task 4 — already discussed in chapter 6

Direct application of the MVT: setting secant slope.

💡 Consequences of the MVT

Sign of derivative ⇒ monotonicity

  • constant
  • increasing
  • strictly increasing
  • decreasing
  • strictly decreasing

💡 Local extrema

Fermat's necessary condition

If has a local extremum at an interior , then .

Second derivative test

If and is continuous near :

  • → strict local min
  • → strict local max
  • → inconclusive (try higher derivatives)

🎯 How the exam tests differentiation

  • Compute a derivative using chain rule (FS 2013 task 3b — )
  • Apply MVT (HS 2015 task 4, HS 2016 task 11-style)
  • Find local/global extrema (HS 2015 task 8, HS 2016 task 4)

📝 Practice tasks

Task 7.1 (FS 2013 task 3b) — Differentiate .

Task 7.2 — Find the absolute max and min of on .

Task 7.3 — Find for , .


8 · Taylor series — polynomial X-rays

🤔 The big question

Calculators don’t actually “compute ” by some magic. They approximate by polynomials — because polynomials are the only functions a CPU can really evaluate (just ). Which polynomial best approximates near ? The Taylor polynomial.

💡 Intuition: keep matching higher derivatives

The tangent line matches in value and slope at . Why stop there? Match the curvature too — and the rate-of-change of curvature, etc.

📜 Taylor’s theorem

Taylor formula with Lagrange remainder

If is -times differentiable, then between and with

If as , then is the Taylor series of around .

🔧 The standard Taylor series (around ) — memorize all of these

FunctionSeriesDomain

🎯 The exam pattern

Taylor series are incredibly useful for limits ("" type) and for showing differentiability properties.

FS 2013 task 1a — limit using Taylor

Using and :

HS 2015 task 1b — Taylor for and

on , extended continuously.

Numerator: . Denominator: . Divide: So and .

FS 2023 MC24 — Taylor polynomial of around to order 2

Use . So Up to order 2 (i.e. only terms with total degree ):

🎯 Practice tasks

Task 8.1 — Compute .

Task 8.2 — Find the Taylor polynomial of up to order 3.


9 · Limits and L’Hôpital’s rule

🤔 The big question

Limits like , , , , , are called indeterminate — you can’t just plug in. We need techniques.

🔧 The toolbox (in order of preference)

  1. Algebraic simplification (cancel, conjugate, common denominator).
  2. Standard limits (memorize: , etc.).
  3. Taylor series (turn the function into a polynomial-like object).
  4. L’Hôpital’s rule (last resort — sometimes loops forever).

💡 L’Hôpital’s rule

L'Hôpital

If (or both ), near , and exists, then

Common L'Hôpital mistakes

  1. Apply only when you have or .
  2. Differentiate numerator and denominator separately — NOT as a quotient!
  3. If it loops, switch to Taylor.

🎯 Worked exam-style examples

FS 2013 task 1a (Method 1, L'Hôpital)

. Numerator and denominator , so apply L’Hôpital: Simplify by dividing top and bottom by :

FS 2013 task 1b (substitution + L'Hôpital)

. Substitute (so means ):

HS 2015 task 2b (conjugate)

. Multiply by conjugate:

FS 2019 task 3b (L'Hôpital for )

. L’Hôpital: .

HS 2016 task 2c (1/x form, )

. Use and . Then . So the original .

FS 2019 task 3a (clever inequality)

. Hint shows (squeeze: ). So limit .

🎯 The “compute this limit” exam tasks

Almost every basic exam has 2–4 limit computations. Strategies:

If you see…Try first
with trigTaylor
rationalfactor / cancel
at conjugate
common denominator
AlwaysL’Hôpital as fallback

📝 Practice tasks

Task 9.1 (HS 2016 task 2a).

Task 9.2 (HS 2016 task 2b).

Task 9.3.


10 · Integration — the Fundamental Theorem

🤔 The big question

The integral measures area under the curve. But it also computes:

  • distance from velocity
  • mass from density
  • charge from current
  • expected value from probability density

The miracle: integration is the inverse of differentiation. This is the Fundamental Theorem of Calculus.

💡 Antiderivatives

Antiderivative

is an antiderivative of if . We write .

The "" reminds us the antiderivative is unique only up to a constant.

💡 The Riemann integral

Partition into small intervals, pick sample points , form the Riemann sum and refine. The limit is the Riemann integral .

Theorem

Every continuous function on is Riemann-integrable. So is every monotonic function, and any bounded function with finitely many discontinuities.

💎 The Fundamental Theorem of Calculus (FTC)

FTC, Part 1 (existence)

If is continuous on , then is differentiable and .

FTC, Part 2 (computation)

If on , then

Example

.

🔧 The antiderivative table — memorize this

()

💡 Properties

  • Linearity:
  • Additivity:
  • Monotonicity:
  • Estimation:

🎯 Improper integrals

When the interval is infinite or the integrand blows up:

The test

  • converges iff .
  • converges iff .

FS 2015 task 5

Discuss in three cases (, , ). Result above.

🎯 How the exam tests integration

  • Compute a definite integral (every exam has 2-3)
  • Apply FTC
  • Improper integrals with parameter (FS 2015 task 5)
  • Recursion via integration by parts (FS 2023 task 3)

📝 Practice tasks

Task 10.1 — Compute .

Task 10.2 — Determine convergence of and find its value if convergent.

Task 10.3 (FS 2023 task 3) — Define . Show and use this to evaluate .


11 · Integration techniques (parts, substitution, partial fractions)

The exam will throw integrals at you that don’t appear in the table. You need three techniques: integration by parts, substitution, and partial fractions.

🔧 Integration by parts

From :

How to choose and

Pick as the part that gets simpler when differentiated:

  • polynomials → become 0 eventually
  • → becomes
  • , → become rational

Pick as something easy to integrate (, , ).

Mnemonic LIATE: pick as the first thing in the list that appears Logarithm > Inverse trig > Algebraic (polynomial) > Trig > Exponential.

Let , , .

FS 2013 task 3a-ii:

Let , , .

FS 2019 task 4:

, , .

FS 2015 task 1b:

Two parts: Evaluate at endpoints: .

HS 2016 task 5a (recursion trick):

Let . Two parts give . Apply parts again to the integral: . Substitute back:

🔧 Substitution (u-substitution)

If , :

When to substitute

Look for an “outer” function and an “inner” function whose derivative also shows up. Set inner.

, . .

HS 2014 task 3a-i:

, . New limits , .

HS 2016 task 5b:

Substitute , , . Limits: , .

🔧 Partial fraction decomposition

For rational integrands with :

  1. Factor into linear and irreducible quadratic factors.
  2. Write as a sum:
  3. Integrate each piece.

FS 2013 task 3a-i:

Factor: . Set . Multiply through and compare coefficients: .

HS 2014 task 3a-ii:

Factor: . Setup: . Solving gives .

FS 2019 MC2:

. So

🎯 The exam pattern for integrals

Each exam typically has 2-3 integrals, often:

  • one integration by parts (involves , , or / )
  • one partial fraction (cubic denominator)
  • sometimes a substitution (square root, trig)

📝 Practice tasks

Task 11.1.

Task 11.2 (HS 2014 task 3 partial fraction) (factor: ).

Task 11.3 (Substitution).


12 · Ordinary differential equations

🤔 The big question

Newton’s law is really — an ODE. So is radioactive decay, population growth, electrical circuits, planetary motion. Solving ODEs is the mathematical core of physics and engineering.

📜 What is an ODE?

Definition

An ODE of order is an equation involving an unknown function and its derivatives up to order .

Order = highest derivative. Linear = no products of and its derivatives.

ODEModels
radioactive decay
spring without friction
damped oscillator
RLC circuit

🔧 Type 1 — Separable ODEs

If you can write , separate:

FS 2013 task 4b

. Separate: Hence .

HS 2014 task 4b:

. Substitute :

🔧 Type 2 — Linear first-order ODEs

Use the integrating factor . Multiplying gives , so

🔧 Type 3 — Linear ODEs with constant coefficients

For :

Try . This produces the characteristic polynomial:

Roots of Solution contribution
Simple real
Repeated real (mult. )
Complex pair

FS 2013 task 4a

.

Homogeneous: . So .

Particular ansatz: since and is not a root, try . Plug in, collect coefficients: (from ) and (from ). Solve: .

Final: .

HS 2014 task 4a:

Homogeneous: , so . Particular: try . Substitute, compare coefficients: . Final: .

FS 2023 task 4 (parameter analysis)

. Characteristic: .

  • : real distinct, .
  • : double root , .
  • : complex pair, .

Bounded as iff .

💡 The damped harmonic oscillator (engineering classic)

RegimeConditionSolution
Undamped
Underdamped,
Critically damped
Overdamped

🔧 Inhomogeneous: total = homogeneous + particular

For of standard form, guess :

Guess for
polynomial of degree polynomial of degree
(multiply by if is a root)
,
productproduct

Resonance trap

If your ansatz already solves the homogeneous equation, multiply by . This is what FS 2019 task 6 tests: — homogeneous roots are . Since is a root, the ansatz isn’t but . Solving gives .

💡 Systems of ODEs and matrix exponential

A scalar -th order ODE can be rewritten as a system of first-order equations. In matrix form: Solution: , where .

FS 2023 task 4.A1 — converting to a system

Rewrite as a system: Let . Then .

🎯 The exam pattern

Every exam has at least one ODE task, and often two:

  • one second-order linear with constant coefficients (homogeneous + particular)
  • one first-order separable

📝 Practice tasks

Task 12.1 (FS 2017 task 6) — Find the unique bounded solution of with .

Task 12.2 — Solve , .


13 · Multivariable functions

🤔 The big question

Real engineering problems involve many variables: temperature varies in 3D space, profit depends on price and advertising, an antenna’s gain depends on angle and frequency. We need calculus that handles many variables.

📜 The setup

A function . Examples:

  • height of a mountain at scalar field on
  • temperature in a room — scalar field on
  • vector field
  • curve (a helix)

💡 Continuity in many variables

Path-dependence trap

Just because is continuous in alone (with fixed) and in alone (with fixed) does NOT mean is continuous in .

Classic counterexample

for , . Along : for . So . Not continuous!

FS 2019 task 7

for , .

  • Along : , continuous.
  • Along : , discontinuous at origin.

💡 Partial derivatives

Partial derivative

where is the -th unit vector.

In words: differentiate in the -direction, treating other variables as constants.

Example

. Then

💡 The gradient — direction of steepest ascent

Gradient

Geometric meaning

  1. points in the direction of steepest ascent.
  2. Its magnitude equals the rate of ascent in that direction.
  3. is perpendicular to level sets .

The directional derivative in direction (unit vector):

💡 Total differentiability and the Jacobian

For :

Jacobian matrix

\frac{\partial f_1}{\partial x_1} & \cdots & \frac{\partial f_1}{\partial x_d}\\ \vdots & \ddots & \vdots\\ \frac{\partial f_m}{\partial x_1} & \cdots & \frac{\partial f_m}{\partial x_d} \end{pmatrix}$$

(Total) differentiability

is differentiable at if

Subtle point (FS 2023 MC22)

Existence of all partial derivatives at does NOT imply (total) differentiability. But: if all partials exist and are continuous in a neighborhood, is differentiable there. ( differentiable.)

🔧 Multivariable chain rule — the workhorse

Chain rule (matrix form)

If and are differentiable:

FS 2013 task 7

, . , .

,

.

By chain rule: .

FS 2023 MC21

, . Then

. .

.

Product: .

💡 Higher partials and Schwarz

Schwarz / Clairaut

If is twice continuously differentiable, mixed partials commute:

💡 The Hessian and multivariable Taylor

Hessian

\frac{\partial^2 f}{\partial x_1^2} & \cdots & \frac{\partial^2 f}{\partial x_1 \partial x_d}\\ \vdots & \ddots & \vdots\\ \frac{\partial^2 f}{\partial x_d \partial x_1} & \cdots & \frac{\partial^2 f}{\partial x_d^2} \end{pmatrix}$$ (symmetric for $C^2$ functions).

Multivariable Taylor (2nd order)

🎯 How the exam tests this

  • Compute partial derivatives, gradient (every exam)
  • Use the chain rule to get a Jacobian (FS 2013 task 7, FS 2023 MC21)
  • Decide where a piecewise function is continuous/differentiable (FS 2019 task 5, FS 2023 MC22)
  • Find the Taylor polynomial of a multivariable function (FS 2023 MC24)

📝 Practice tasks

Task 13.1 — Compute and for .

Task 13.2 (FS 2019 task 7) — Find a line through origin where (extended by 0 at origin) is continuous, and one where it isn't.


14 · Multivariable extrema and Lagrange multipliers

🤔 The big question

Where on a surface is the highest peak? On a constrained surface (like a sphere), where is the largest value of a function? This is what almost every Analysis 2 exam tests.

💡 The 2-step recipe for global extrema on a domain

To find global max/min of on a bounded domain :

  1. Interior critical points: solve inside .
  2. Boundary: parametrize and find extrema of the restricted function. Use Lagrange multipliers if is given by an equation.
  3. Compare: evaluate at all candidates plus all “corners” of , pick max/min.

💡 The Hessian / second-derivative test (interior points only)

At a critical point ():

Hessian Type
Positive definite (all eigenvalues )strict local min
Negative definite (all eigenvalues )strict local max
Indefinite (mixed signs)saddle
Semi-definite (zero eigenvalue)inconclusive

For a Hessian :

  • and ⇒ positive definite (min)
  • and ⇒ negative definite (max)
  • ⇒ saddle

FS 2015 task 1a

. At origin: . Both eigenvalues ⇒ negative definite ⇒ local maximum.

💡 Lagrange multipliers — the constraint trick

To extremize subject to :

Lagrange multiplier method

Critical points satisfy for some .

Geometric meaning

At an extremum on the constraint, the level set of must be tangent to the constraint set — so and must be parallel.

FS 2013 task 5 — extrema on a sphere

Maximize/minimize subject to .

Set :

The 2nd equation gives or .

Case : equations 1, 3 ⇒ , then . .

Case : With , . With , . With , .

Conclusion: Max at ; min at .

HS 2015 task 6 — distance to paraboloid

Find the point on closest to .

Minimize subject to . Lagrange: gives Together with the constraint, solving yields with distance .

FS 2023 task 5 — extrema on a closed region with curved boundary

on .

  1. Interior: . Not in .
  2. Top edge , : restrict . Critical point: . Candidate .
  3. Bottom edge , : . Critical points: (inside) or (outside). Candidate .
  4. Corners and .

Evaluate: , , , .

Max at ; min at .

🎯 The exam pattern

Lagrange / extrema problems are guaranteed on every basic exam. Always:

  1. Check the interior.
  2. Check each piece of the boundary (parametrize or use Lagrange).
  3. Check corners explicitly.
  4. Compare values at all candidates.

📝 Practice tasks

Task 14.1 (FS 2019 task 8) — Find global extrema of on .

Task 14.2 (HS 2014 task 5) — Global extrema of on .


15 · Multiple integrals

🤔 The big question

Volume under a 3D surface, mass of an irregular object, charge of a non-uniform region — all require integrals over 2D or 3D regions.

💡 Double integral

For continuous on a rectangle , partition into small rectangles, sum , refine. Limit = .

💎 Fubini’s theorem — iterated single integrals

Fubini

You can integrate in either order. Pick the easier one.

For a region :

HS 2014 task 6

where is bounded by and .

Intersection: or . On : .

HS 2015 MC1c — switching integration order

. Region: , , equivalently and . So

🔧 Change of variables — Jacobian determinant

Transformation formula

If is a bijection:

The factor is the local volume-stretch factor.

Polar coordinates ()

.

Cylindrical coordinates ()

.

Spherical coordinates ()

.

FS 2013 task 6 — using polar coordinates

where is bounded by and .

Cross-section at height is unit disk. So: Polar coordinates:

HS 2016 task 7 — ice cream cone (cone + spherical cap)

Cone meets sphere at . Volume of cone (cylindrical): . Volume of cap (cylindrical): . Total: .

HS 2015 task 9 — rotation volume

. Cross-section is a disk of radius , so area . Volume:

🎯 The exam pattern

  • A 2D integral over a region (often using polar coordinates).
  • A 3D integral often involving rotation symmetry (cylindrical, spherical).
  • Sometimes a Jacobian computation explicitly.

📝 Practice tasks

Task 15.1 — Compute where is the unit disk.

Task 15.2 (FS 2019 MC1c) — Volume of .

Task 15.3 — Volume of unit ball using spherical coordinates.


16 · Vector fields, Green, Stokes, Gauß

This is the grand finale: three theorems that all say the same thing in different dimensions — integral over a boundary equals integral of a derivative over the interior.

💡 Vector fields and conservativity

Vector field

A vector field on is a map . Imagine attaching an arrow to every point.

Conservative field, potential

is conservative if there exists a scalar function (a potential) with .

Necessary integrability condition

If is conservative and , then (because mixed partials of commute). On simply connected domains, this is also sufficient.

💡 Line integrals

Line integral

For a curve and continuous:

Physical meaning: the work done by force along the path.

Fundamental Theorem for line integrals

If : Path-independent! Closed loop integrals vanish.

FS 2023 MC25

. Note this is — exact! So for any path from to :

💡 Three differential operators (in )

For :

Definition

Divergence:

Curl (3D):

Curl (2D, scalar):

Physical meaning

  • Divergence at a point = how much spreads out / is sourced there.
  • Curl at a point = how much rotates / circulates there. Imagine putting a tiny paddle wheel in the field; curl is its angular velocity.

💎 Green’s theorem (2D)

Green

Let be a “nice” bounded region with boundary traversed counterclockwise. For functions :

HS 2014 task 8

over a rectangle . By Green: , so .

FS 2023 task 6.A3 — using Green to compute a line integral

Compute where along a half-disk boundary. With (chapter result), Green relates this to the area integral.

💎 Stokes’ theorem (3D)

Stokes

For a smooth oriented surface with boundary curve :

Reading

The circulation of around the boundary equals the total curl piercing the surface. Green is the 2D special case.

FS 2013 task 8 — line integral via Stokes

Compute where is the intersection of and and .

The intersection projects to a circle in the -plane, with . Use Stokes: . Surface element on is with normal direction . The work goes through Stokes; final answer: .

💎 Gauß’s theorem (Divergence theorem)

Gauß

For a bounded volume with smooth boundary (outward orientation):

Reading

Total flux out through the boundary = total source strength inside.

HS 2015 task 7

Cylinder , . .

HS 2016 task 10 — flux through cylinder

given, . Cylindrical coordinates over a cylinder of radius , height :

💡 The grand unification

All these theorems follow the same template:

SettingStatement
FTC (1D)
FT for line integrals
Green (2D)
Stokes (3D)
Gauß (3D)

In modern language (differential forms), they are literally the same theorem.

🎯 The exam pattern

Practically every basic exam ends with one big theorem-of-vector-calculus task (Green, Stokes, or Gauß).

  • Use Gauß when the surface is closed and you have a flux integral.
  • Use Stokes when you have a line integral around a closed curve and the curve bounds a surface that’s hard to parametrize directly.
  • Use Green for 2D analogues.

📝 Practice tasks

Task 16.1 — Use Green to compute where is the boundary of the unit square traversed counterclockwise.

Task 16.2 (FS 2017 task 12) — Use Gauß to compute where and is a half-sphere.


17 · Implicit and inverse function theorems

🤔 The big question

Sometimes you have an equation like and want to know: can I solve for as a function of near a specific point? When does the equation locally define a function ?

The implicit function theorem answers this — and it’s the subject of a guaranteed exam task.

💡 The inverse function theorem

Inverse function theorem

Let be and . Then there is a neighborhood of such that:

  1. is bijective onto an open set .
  2. is also .
  3. .

FS 2017 task 10 — finding

. Note , so . , . By the inverse function theorem: .

FS 2023 MC27

. Locally invertible at ? . . Yes, locally invertible.

💎 The implicit function theorem

Implicit function theorem

Let be with and . Then near we can solve for as a function of : , and

For one variable each: if with :

FS 2019 task 12 — solve implicitly + compute derivative

. Show locally solvable for near , find .

✓. , at : ✓. , at : .

HS 2014 task 7 — Taylor polynomial of implicit function

, find near , compute Taylor polynomial of to order 2.

. ✓. , so .

For : differentiate the equation twice and substitute . Result: .

Taylor polynomial: .

FS 2023 MC28

. Can we solve for as near ?

Need : ✓ for any . ✓. So yes.

🎯 The exam pattern

The implicit function theorem appears in nearly every exam:

  • Verify the hypotheses ( and ).
  • Compute or higher derivatives using implicit differentiation.
  • Possibly: build a Taylor polynomial of the implicit function.

📝 Practice tasks

Task 17.1 — Show that defines near and compute .

Task 17.2 (HS 2015 task 8) — Adapted: at the touching point of curves , both gradients are parallel. Use this with the relations to find unknowns.


18 · Master strategy — the exam playbook

📊 Anatomy of the D-ITET basic exam

Based on FS 2013, FS 2015, FS 2019, FS 2023, HS 2013, HS 2014, HS 2015, HS 2016 (~8 exams analyzed), the structure is remarkably stable:

BlockTopicApprox. %
Limits / sequencescomputing , L’Hôpital, Taylor~10–15%
Seriesradius of convergence, sum, convergence test~5–10%
Single-variable derivativeschain rule, MVT, extrema~10%
Single-variable integralsparts, partial fractions, substitution~15%
ODEslinear constant-coefficient, separable~10–15%
Multivariable derivativesgradient, Jacobian, Hessian~10%
Constrained extremaLagrange multipliers~10–15%
Multiple integralspolar/cylindrical/spherical~10%
Vector calculusGreen / Stokes / Gauß~10%
Implicit / inverse function via ~5%
Induction / proofsum identity or inequality~5%

Recent exams (2019, 2023) have a large multiple-choice block at the start (~28 questions) testing the big concepts.

🎯 The “must-know” cheat sheet

Limits

Series

  • Geometric: for
  • Harmonic diverges
  • Power series: or

Derivatives

  • , ,
  • ,
  • ,
  • Chain:
  • Inverse:

Integrals

  • (the absolute value matters!)
  • Parts:
  • Substitution: spot and
  • Partial fractions: factor denominator, set up undetermined coefficients
  • Improper: converges iff

ODEs

  • Separable:
  • Linear constant-coeff: characteristic polynomial
  • Resonance: if RHS matches homogeneous solution, multiply ansatz by

Multivariable

  • Jacobian, Hessian,
  • Lagrange:
  • Polar Jacobian: . Spherical: .
  • Implicit:
  • Inverse function condition:

Vector calculus

  • (3D) =
  • Green: in 2D
  • Stokes: on a surface in 3D
  • Gauß: for closed surfaces

🧠 The 5 strategy tips that actually move the needle

  1. Read everything first. Spend 5 minutes scanning all problems. Tackle easy ones first to build momentum and bank points.
  2. Always verify hypotheses before applying a theorem. Lagrange, implicit function, IVT, MVT — they have specific conditions.
  3. Don’t loop with L’Hôpital. If two iterations don’t simplify, switch to Taylor.
  4. Sketch the region before any 2D/3D integral. Catching the wrong limits costs many points.
  5. For Lagrange / extrema: always check (a) interior critical points, (b) boundary, (c) corners. Forgetting corners is the #1 reason students lose points on extrema problems.

🏁 Final words

You're ready when…

  • You can write down the standard limits, derivatives, and integrals from memory.
  • You can apply each big theorem (FTC, MVT, IVT, EVT, Green, Stokes, Gauß) without rereading the conditions.
  • You can convert any extremum problem to either gradient = 0 (interior) or Lagrange (boundary).
  • You can solve a 2nd-order linear ODE with constant coefficients in your sleep.
  • You stop being scared of and — they’re just tolerance and response.

Good luck. The math you’ve learned here is the same math powering signal processing, control theory, machine learning, and physics. Master it once and it stays with you forever.


Sources synthesized in this guide:

  • M. Struwe, Analysis für Informatik, Skript, ETH Zürich, 5. November 2010.
  • F. Ziltener, Skript zu den Vorlesungen Analysis 1 und 2 für ITET und RW, ETH Zürich, 21. Mai 2025.
  • Past D-ITET basic exams: FS 2013, FS 2015, HS 2013, HS 2014, HS 2015, HS 2016, FS 2019, FS 2023.

Further reading: Chr. Blatter, Ingenieur-Analysis 1 und 2; J. J. Duistermaat & J. A. C. Kolk, Multidimensional Real Analysis I and II.