Skip to content

MATH3060

Mathematical Analysis III

Metric spaces and completeness, function spaces, approximation and Hilbert spaces, contraction mappings, implicit functions and differential equations, and Fourier series.

4 chapters · 17 sectionsEN · 繁 · 简
My course notes

Your progress

0/ 17 sections marked complete

Next section: 1.1 Completeness, compactness and category

Completion marks are saved in this browser.

This course in the web

In the MATH3060 notes

Theorem cards
71
Definitions
37
Counterexamples
19
Concept lenses
13
Histories of ideas
1
Proof X-rays
22

Sections with a history of an idea

None of these is on the timeline yet.

No concept lens from this course is recorded in the web yet.

Open this course in the knowledge map

Counts cover the 17 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.

In the webTheorem cards 71 · Definitions 37 · Counterexamples 19 · Concept lenses 13 · Histories of ideas 1 · Proof X-rays 22

None of these is on the timeline yet.

No concept lens from this course is recorded in the web yet.

Open this course in the knowledge map

Counts cover the 17 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.

Chapter 1 · 4 sections

Metric methods

Metric methods

Theorems 24 · Definitions 13Counterexamples 5Lenses 2Proof X-rays 6

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 1.1

    Completeness, compactness and category

    Separate three kinds of control on a metric space, prove the compactness criterion and Baire theorem, and learn where each hypothesis is used.

  2. 1.2

    Metric completion and uniform extensions

    Construct a completion from Cauchy sequences and prove its extension and uniqueness properties.

  3. 1.3

    Continuity and relative topology in metric spaces

    Connect metric continuity with sequential limits and open preimages, and distinguish local and uniform control.

  4. 1.4

    Connectedness, components and small chains

    Prove the intermediate-value characterization of connectedness, develop components and paths, and explain how compactness turns arbitrarily fine chains into connectedness.

Chapter 2 · 5 sections

Function spaces and approximation

Function spaces and approximation

Theorems 18 · Definitions 11Counterexamples 5Lenses 5Proof X-rays 7

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 2.1

    Approximation and equicontinuity in function spaces

    Prove completeness of the uniform norm, the real Stone–Weierstrass theorem and the Arzelà–Ascoli criterion, with examples separating their hypotheses.

  2. 2.2

    Complex Stone–Weierstrass and the role of conjugation

    Prove complex uniform approximation through a real subalgebra, locate the conjugation hypothesis precisely, and construct approximation examples and sharp counterexamples.

  3. 2.3

    Baire category: why a typical continuous function is nowhere differentiable

    Prove a dense G-delta theorem by closed anchored-slope classes and small polygonal perturbations, then examine interpolation constraints and the role of the function-space topology.

  4. 2.4

    Hilbert projections, representation and orthonormal bases

    Prove best approximation in closed convex sets, orthogonal decomposition, Riesz representation and general orthonormal expansion, then connect them to Fourier completeness.

  5. 2.5

    Weak limits and minimization in Hilbert spaces

    Prove weak subsequence extraction for bounded Hilbert sequences, weak lower semicontinuity of convex energies, and an existence theorem for minimizers.

Chapter 3 · 5 sections

Local analysis and differential equations

Local analysis and differential equations

Theorems 20 · Definitions 10Counterexamples 6Lenses 5Proof X-rays 5

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 3.1

    Contractions, local inversion and differential equations

    Use one fixed-point argument to construct local inverses and ODE solutions, with explicit domains, error bounds and failure examples.

  2. 3.2

    Implicit constraints and parameter-dependent flows

    Differentiate implicit solution branches and ODE trajectories, prove continuous dependence and continuation, and derive a transverse event-time formula.

  3. 3.3

    Picard iteration beyond a short time interval

    Use factorial estimates to prove full-interval existence, uniqueness and error bounds for globally Lipschitz differential equations.

  4. 3.4

    Peano existence: Euler polygons, compactness and nonunique limits

    Use Ascoli compactness to construct solutions of continuous finite-dimensional ODEs without a Lipschitz assumption, and distinguish residual consistency from selection of a unique solution.

  5. 3.5

    Constant rank: local normal forms and regular level sets

    Prove the constant-rank theorem from the inverse theorem, identify tangent kernels, and distinguish independent constraints, local images and singular fibers.

Chapter 4 · 3 sections

Fourier methods

Fourier methods

Theorems 9 · Definitions 3Counterexamples 3Lenses 1History 1Proof X-rays 4

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 4.1

    Fourier coefficients, kernels and convergence

    Derive Fourier projection, distinguish ordinary sums from Fejér means, and prove uniform convergence of the means and pointwise convergence under piecewise smoothness.

  2. 4.2

    A pointwise Fourier convergence criterion

    Prove the Riemann–Lebesgue lemma and a Dini criterion for ordinary Fourier sums, with jump and Hölder examples.

  3. 4.3

    Gibbs jumps and the shrinking transition profile

    Prove the universal Fourier profile near a jump, derive its persistent overshoot, and compare ordinary sums with range-preserving Fejér means.

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details