Module 1: Continuous Functions and Limits (Chapter 4)
Continuous Functions
The precise mathematical definition of a continuous function relies on limits. A function f:D→R is continuous at x0∈D if for all sequences (xn)n∈N with xn→x0, the limit limn→∞f(xn) exists and satisfies:
n→∞limf(xn)=f(x0)
An equivalent definition is the ϵ−δ criterion. A function is continuous at x0 if and only if:
∀ϵ>0∃δ>0∀x∈D:∣x−x0∣<δ⟹∣f(x)−f(x0)∣<ϵ
Standard calculation rules apply: if f and g are continuous, then f+g, f⋅g, and c⋅f are continuous. Moreover, the composition g∘f is continuous. The inverse function of a continuous, bijective function on an interval is also continuous.
Limits and Accumulation Points
An accumulation point x0 of a set D⊂R is a point where there exists a sequence (xn)n∈N in D such that x0=limn→∞xn and xn=x0 for all n. If y is the limit of f(x) as x approaches an accumulation point x0, we write:
x→x0limf(x)=y
The Sandwich Rule states that if f(x)≤g(x)≤h(x) for all x∈D and limx→x0f(x)=limx→x0h(x)=L, then the limit of g(x) exists and limx→x0g(x)=L.
Module 2: Differential Calculus (Chapter 5)
Derivatives and Differentiability
A function f:(a,b)→R is differentiable at x0 if the difference quotient limit exists:
This limit is denoted as f′(x0) or dxdf(x0). Geometrically, f′(x0) represents the slope of the tangent line to the graph of f at x0. Any function that is differentiable at a point is necessarily continuous at that point.
A necessary condition for a local extreme value at x0 for a differentiable function is f′(x0)=0 (a stationary point). The second derivative test provides a sufficient condition: if f′(x0)=0 and f′′(x0)>0, x0 is a strict local minimum; if f′′(x0)<0, it is a strict local maximum.
The Mean Value Theorem asserts that for a continuous function on [a,b] that is differentiable on (a,b), there exists ξ∈(a,b) such that:
f′(ξ)=b−af(b)−f(a)
L'Hospital's Rule and Taylor's Theorem
For limits producing indeterminate forms 00 or ±∞±∞, L'Hospital's rule can be applied:
x→x0limg(x)f(x)=x→x0limg′(x)f′(x)
Taylor's Theorem allows approximating a function using polynomials. The Taylor polynomial of order n at x0 is:
Tn(x)=k=0∑nk!f(k)(x0)(x−x0)k
The remainder term Rn(x)=f(x)−Tn(x) takes the Lagrange form:
(n+1)!f(n+1)(ξ)(x−x0)n+1
Newton's Method
Newton's method iteratively finds roots for f(x)=0 using the sequence:
xk+1=xk−f′(xk)f(xk)
Module 3: Basic Integration Theory (Chapter 6)
Antiderivatives and the Riemann Integral
An antiderivative of f on an open set Ω is a differentiable function F such that F′(x)=f(x).
The definite integral computes the area under the curve of f over [a,b] by taking the limit of Riemann sums (quadrature rule):
∫abf(x)dx=n→∞limnb−ak=0∑n−1f(a+knb−a)
This value is bounded by the limits of the lower sums Ln(f) and upper sums Un(f).
Fundamental Theorem of Calculus
The Fundamental Theorem of Calculus connects differentiation and integration:
Part I: F(x)=∫axf(y)dy is an antiderivative of f.
Part II: For any antiderivative F, the definite integral is calculated as: ∫abf(x)dx=F(b)−F(a)
Integration Rules:
Integration by Parts: derived from the product rule. ∫f′(x)g(x)dx=f(x)g(x)−∫f(x)g′(x)dx
Substitution Rule: derived from the chain rule. ∫abf(g(x))g′(x)dx=∫g(a)g(b)f(y)dy
Module 4: Fourier Series (Chapter 7)
Trigonometric Polynomials and Fourier Coefficients
Fourier series approximate periodic functions (e.g., f(x+1)=f(x) ) via superposition of waves. A trigonometric polynomial is defined as:
p(x)=k=−n∑ncke2πikx
By Euler's formula eit=cos(t)+isin(t), this can be written using sines and cosines. For a given periodic function f, its k -th Fourier coefficient is:
f^(k)=∫01f(x)e−2πikxdx
Convergence
The n -th partial sum is:
Snf(x)=k=−n∑nf^(k)e2πikx
Point-wise convergence: limn→∞fn(x)=f(x) for each x.
Uniform convergence: limn→∞supx∈D∣fn(x)−f(x)∣=0. Dirichlet's theorem dictates that if f is periodic, piecewise continuous, and differentiable at x0, its Fourier series converges point-wise to f(x0). If f is twice continuously differentiable, the Fourier series converges uniformly.
Module 5: Multivariate Calculus (Chapter 8)
Scalar Fields and Vector Fields
Functions mapping D⊂Rn→R are scalar fields (e.g., population density). Functions mapping D⊂Rn→Rm are vector fields (e.g., wind velocity).
Norms and Distances
A norm assigns a non-negative length to vectors. Common p -norms include:
1-norm: ∥v∥1=∑i=1d∣vi∣
Euclidean norm: ∥v∥2=∑i=1dvi2
Maximum norm: ∥v∥∞=max{∣v1∣,…,∣vd∣}
Norms satisfy the Triangle Inequality (∥u+v∥≤∥u∥+∥v∥) and the Cauchy-Schwarz Inequality:
∥u⋅v∥2≤∥u∥2∥v∥2
Partial Derivatives and Gradients
Multivariate continuity means xk→x0⟹f(xk)→f(x0). The partial derivative of f with respect to the i-th coordinate is:
∂xi∂f(x)=h→0limhf(x+hei)−f(x)
The Gradient collects all partial derivatives into a vector: