Learn

Learning preferences

Make learning more comfortable. Changes apply immediately.

Enlarges page content, including diagrams and their labels. You can also use your browser’s zoom.

Choose the colours that are easiest for you to distinguish. Applies to lesson diagrams and lab plots. Labels, shapes, hatching and line patterns also distinguish meanings. Source photographs and raw image brightness stay unchanged; mask-only views are available for image overlays.

ExampleComparisonSample link

Saved in this browser on this device. Preferences are separate from progress backups.

Mathematics · unit version 1

Compactness of function families

Turn common continuity control into uniformly convergent subsequences, distinguish a family from its closure, and justify optimization over functions.

Open any lesson. Completion records participation; automatic practice checks and human judgment of written arguments are separate. This unit retains its own versioned requirements.

Readiness and preparation

Check your starting point

Try these short questions on paper, then compare your reasoning. They are optional self-checks, not a placement score or a navigation requirement. Use a targeted review when useful and return with your browser’s Back control.

What does uniform convergence require beyond pointwise convergence?

The extraction proof must obtain one error cutoff for every input.

Compare reasoning and find a refresher

One index cutoff must control the error at all inputs simultaneously. Separate cutoffs at each input need not have a finite common maximum.

Review the uniform Cauchy criterion

What does compactness provide at a chosen positive spatial scale?

Finitely many centers will turn separate convergence bounds into one uniform bound.

Compare reasoning and find a refresher

A finite cover by balls at that scale, with centers in the compact metric space. The finite number of centers is essential.

Review finite nets and total boundedness

Loading saved mathematics work…

A sharp maximum, an operator image and a grid certificate

The mixed assessment has separate response history and review criteria; it does not change lesson participation records.

Lesson sequence

Each linked lesson opens on its own page. Expand its details here when you want to check the objectives before choosing.

  1. Equicontinuity and common control

    Lesson details and objectives

    Distinguish local family-wide continuity from uniform control, and turn compactness and pointwise bounds into rigorous finite-grid certificates.

    • State the quantifier order for equicontinuity and prove its compact-domain uniform upgrade.
    • Prove that pointwise boundedness plus equicontinuity yields a common supremum bound on a compact domain.
    • Derive sharp one-function and two-function grid bounds, distinguishing samples from regularity assumptions.

    6 practice tasks.

  2. Extract a uniform limit from a family of functions

    Lesson details and objectives

    Build one subsequence that converges at a countable dense set, then use equicontinuity and finite nets to control every input simultaneously.

    • Construct dense sample points and nested scalar-convergent subsequences with strictly increasing diagonal indices.
    • Upgrade dense-set convergence to a uniformly Cauchy subsequence using an explicit three-error estimate.
    • Prove the compact-domain extraction theorem and identify independent failures of boundedness, equicontinuity and compactness.

    6 practice tasks.

  3. Close the family before claiming attainment

    Lesson details and objectives

    Prove the converse compactness conditions, pass to a compact closure, and justify optimization over closed function constraints.

    • Derive pointwise boundedness and equicontinuity from compactness of the uniform closure using finite nets.
    • Distinguish compact from relatively compact families and prove compactness of the closure using the extraction theorem.
    • Check closed function constraints and prove attainment for continuous functionals rather than assuming an optimizer exists.

    6 practice tasks.