Curriculum Matrix Lecture Notes

Mathematics for AI 2

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→Rf: D \to \mathbb{R} is continuous at x0∈Dx_0 \in D if for all sequences (xn)n∈N(x_n)_{n \in \mathbb{N}} with xn→x0x_n \to x_0, the limit lim⁡n→∞f(xn)\lim_{n \to \infty} f(x_n) exists and satisfies:

lim⁡n→∞f(xn)=f(x0)\lim_{n \to \infty} f(x_n) = f(x_0)

An equivalent definition is the ϵ−δ\epsilon-\delta criterion. A function is continuous at x0x_0 if and only if:

∀ϵ>0 ∃δ>0 ∀x∈D:∣x−x0∣<δ  ⟹  ∣f(x)−f(x0)∣<ϵ\forall \epsilon > 0 \ \exists \delta > 0 \ \forall x \in D : |x - x_0| < \delta \implies |f(x) - f(x_0)| < \epsilon

Standard calculation rules apply: if ff and gg are continuous, then f+gf+g, f⋅gf \cdot g, and c⋅fc \cdot f are continuous. Moreover, the composition g∘fg \circ f is continuous. The inverse function of a continuous, bijective function on an interval is also continuous.

Limits and Accumulation Points

An accumulation point x0x_0 of a set D⊂RD \subset \mathbb{R} is a point where there exists a sequence (xn)n∈N(x_n)_{n \in \mathbb{N}} in DD such that x0=lim⁡n→∞xnx_0 = \lim_{n \to \infty} x_n and xn≠x0x_n \neq x_0 for all nn. If yy is the limit of f(x)f(x) as xx approaches an accumulation point x0x_0, we write:

lim⁡x→x0f(x)=y\lim_{x \to x_0} f(x) = y

The Sandwich Rule states that if f(x)≤g(x)≤h(x)f(x) \leq g(x) \leq h(x) for all x∈Dx \in D and lim⁡x→x0f(x)=lim⁡x→x0h(x)=L\lim_{x \to x_0} f(x) = \lim_{x \to x_0} h(x) = L, then the limit of g(x)g(x) exists and lim⁡x→x0g(x)=L\lim_{x \to x_0} g(x) = L.

Module 2: Differential Calculus (Chapter 5)

Derivatives and Differentiability

A function f:(a,b)→Rf: (a, b) \to \mathbb{R} is differentiable at x0x_0 if the difference quotient limit exists:

lim⁡h→0f(x0+h)−f(x0)h=lim⁡x→x0f(x)−f(x0)x−x0\lim_{h \to 0} \frac{f(x_0 + h) - f(x_0)}{h} = \lim_{x \to x_0} \frac{f(x) - f(x_0)}{x - x_0}

This limit is denoted as f′(x0)f'(x_0) or dfdx(x0)\frac{df}{dx}(x_0). Geometrically, f′(x0)f'(x_0) represents the slope of the tangent line to the graph of ff at x0x_0. Any function that is differentiable at a point is necessarily continuous at that point.

Key Calculation Rules:

  • Product Rule:
    (fg)′(x0)=f′(x0)g(x0)+g′(x0)f(x0)(fg)'(x_0) = f'(x_0)g(x_0) + g'(x_0)f(x_0)
  • Chain Rule:
    (g∘f)′(x0)=g′(f(x0))f′(x0)(g \circ f)'(x_0) = g'(f(x_0))f'(x_0)
  • Quotient Rule:
    (fg)′(x0)=f′(x0)g(x0)−f(x0)g′(x0)g(x0)2\left(\frac{f}{g}\right)'(x_0) = \frac{f'(x_0)g(x_0) - f(x_0)g'(x_0)}{g(x_0)^2}
  • Inverse Functions:
    (f−1)′(y0)=1f′(x0)(f^{-1})'(y_0) = \frac{1}{f'(x_0)}

Extrema and Mean Value Theorems

A necessary condition for a local extreme value at x0x_0 for a differentiable function is f′(x0)=0f'(x_0) = 0 (a stationary point). The second derivative test provides a sufficient condition: if f′(x0)=0f'(x_0) = 0 and f′′(x0)>0f''(x_0) > 0, x0x_0 is a strict local minimum; if f′′(x0)<0f''(x_0) < 0, it is a strict local maximum.

The Mean Value Theorem asserts that for a continuous function on [a,b][a, b] that is differentiable on (a,b)(a, b), there exists ξ∈(a,b)\xi \in (a, b) such that:

f′(ξ)=f(b)−f(a)b−af'(\xi) = \frac{f(b) - f(a)}{b - a}

L'Hospital's Rule and Taylor's Theorem

For limits producing indeterminate forms 00\frac{0}{0} or ±∞±∞\frac{\pm \infty}{\pm \infty}, L'Hospital's rule can be applied:

lim⁡x→x0f(x)g(x)=lim⁡x→x0f′(x)g′(x)\lim_{x \to x_0} \frac{f(x)}{g(x)} = \lim_{x \to x_0} \frac{f'(x)}{g'(x)}

Taylor's Theorem allows approximating a function using polynomials. The Taylor polynomial of order nn at x0x_0 is:

Tn(x)=∑k=0nf(k)(x0)k!(x−x0)kT_n(x) = \sum_{k=0}^{n} \frac{f^{(k)}(x_0)}{k!} (x - x_0)^k

The remainder term Rn(x)=f(x)−Tn(x)R_n(x) = f(x) - T_n(x) takes the Lagrange form:

f(n+1)(ξ)(n+1)!(x−x0)n+1\frac{f^{(n+1)}(\xi)}{(n+1)!}(x - x_0)^{n+1}

Newton's Method

Newton's method iteratively finds roots for f(x)=0f(x) = 0 using the sequence:

xk+1=xk−f(xk)f′(xk)x_{k+1} = x_k - \frac{f(x_k)}{f'(x_k)}

Module 3: Basic Integration Theory (Chapter 6)

Antiderivatives and the Riemann Integral

An antiderivative of ff on an open set Ω\Omega is a differentiable function FF such that F′(x)=f(x)F'(x) = f(x).

The definite integral computes the area under the curve of ff over [a,b][a, b] by taking the limit of Riemann sums (quadrature rule):

∫abf(x)dx=lim⁡n→∞b−an∑k=0n−1f(a+kb−an)\int_a^b f(x) dx = \lim_{n \to \infty} \frac{b - a}{n} \sum_{k=0}^{n-1} f\left(a + k\frac{b-a}{n}\right)

This value is bounded by the limits of the lower sums Ln(f)L_n(f) and upper sums Un(f)U_n(f).

Fundamental Theorem of Calculus

The Fundamental Theorem of Calculus connects differentiation and integration:

  • Part I: F(x)=∫axf(y)dyF(x) = \int_a^x f(y) dy is an antiderivative of ff.
  • Part II: For any antiderivative FF, the definite integral is calculated as:
    ∫abf(x)dx=F(b)−F(a)\int_a^b f(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\int f'(x)g(x) dx = f(x)g(x) - \int 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\int_a^b f(g(x))g'(x) dx = \int_{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)f(x+1) = f(x) ) via superposition of waves. A trigonometric polynomial is defined as:

p(x)=∑k=−nncke2πikxp(x) = \sum_{k=-n}^{n} c_k e^{2\pi i k x}

By Euler's formula eit=cos⁡(t)+isin⁡(t)e^{it} = \cos(t) + i\sin(t), this can be written using sines and cosines.
For a given periodic function ff, its kk -th Fourier coefficient is:

f^(k)=∫01f(x)e−2πikxdx\hat{f}(k) = \int_0^1 f(x) e^{-2\pi i k x} dx

Convergence

The nn -th partial sum is:

Snf(x)=∑k=−nnf^(k)e2πikxS_n f(x) = \sum_{k=-n}^{n} \hat{f}(k) e^{2\pi i k x}
  • Point-wise convergence: lim⁡n→∞fn(x)=f(x)\lim_{n \to \infty} f_n(x) = f(x) for each xx.
  • Uniform convergence: lim⁡n→∞sup⁡x∈D∣fn(x)−f(x)∣=0\lim_{n \to \infty} \sup_{x \in D} |f_n(x) - f(x)| = 0.
    Dirichlet's theorem dictates that if ff is periodic, piecewise continuous, and differentiable at x0x_0, its Fourier series converges point-wise to f(x0)f(x_0). If ff is twice continuously differentiable, the Fourier series converges uniformly.

Module 5: Multivariate Calculus (Chapter 8)

Scalar Fields and Vector Fields

Functions mapping D⊂Rn→RD \subset \mathbb{R}^n \to \mathbb{R} are scalar fields (e.g., population density). Functions mapping D⊂Rn→RmD \subset \mathbb{R}^n \to \mathbb{R}^m are vector fields (e.g., wind velocity).

Norms and Distances

A norm assigns a non-negative length to vectors. Common pp -norms include:

  • 1-norm: ∥v∥1=∑i=1d∣vi∣\|v\|_1 = \sum_{i=1}^d |v_i|
  • Euclidean norm: ∥v∥2=∑i=1dvi2\|v\|_2 = \sqrt{\sum_{i=1}^d v_i^2}
  • Maximum norm: ∥v∥∞=max⁡{∣v1∣,…,∣vd∣}\|v\|_\infty = \max \{|v_1|, \dots, |v_d|\}

Norms satisfy the Triangle Inequality (∥u+v∥≤∥u∥+∥v∥\|u + v\| \leq \|u\| + \|v\|) and the Cauchy-Schwarz Inequality:

∥u⋅v∥2≤∥u∥2∥v∥2\|u \cdot v\|_2 \leq \|u\|_2 \|v\|_2

Partial Derivatives and Gradients

Multivariate continuity means xk→x0  ⟹  f(xk)→f(x0)x_k \to x_0 \implies f(x_k) \to f(x_0).
The partial derivative of ff with respect to the ii-th coordinate is:

∂f∂xi(x)=lim⁡h→0f(x+hei)−f(x)h\frac{\partial f}{\partial x_i}(x) = \lim_{h \to 0} \frac{f(x + h e_i) - f(x)}{h}

The Gradient collects all partial derivatives into a vector:

∇f(x)=(∂f∂x1,…,∂f∂xd)T\nabla f(x) = \left( \frac{\partial f}{\partial x_1}, \dots, \frac{\partial f}{\partial x_d} \right)^T