Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-26 (gpt-6-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

An equicontinuous family on a compact metric space is uniformly equicontinuous

Statement

Let (K,d) be a nonempty compact metric space and let F⊆C(K,R) be equicontinuous. For every ε>0 there is δ>0 such that for every f∈F and x,y∈K, d(x,y)<δ implies ∣f(x)−f(y)∣<ε.

Facts & Assumptions

Given: A positive real ε and an equicontinuous family F on K.

[L1]

For each a∈K there exists some radius r>0 such that d(x,a)<r implies ∣f(x)−f(a)∣<ε/2 for every f∈F (Equicontinuity, pointwise boundedness, and uniform boundedness for families in C(K,R)).

[L2]

Compactness means that every open cover has a finite subcover (Open cover, subcover, compact metric space, and compact subset of a metric space).

Proof

technique · direct
1.1L1L2construct

Form the set of all pairs (a,r) with a∈K, r>0, and the property in [L1]. The balls B(a,r/2) for these pairs form an open cover of K by [L1]. Compactness gives finitely many such pairs (a0,r0),…,(aN,rN) whose balls cover K. No radius was selected simultaneously for every point of K.

2.1step 1.1algebra

Let δ be the least of the finitely many positive radii ri/2. If d(x,y)<δ, choose i with x∈B(ai,ri/2); then both x and y lie in B(ai,ri).

3.1step 2.1L1algebra∎

The two estimates from [L1] and the triangle inequality give ∣f(x)−f(y)∣<ε for every f∈F.

Depends on

Dependency tree · 2 levels

Sources