Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (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.

Functions satisfying a fixed local Lipschitz bound somewhere form a closed subset of C([0,1])

Statement

For p,q∈N>0, let Ep,q be the functions f∈C([0,1],R) for which some a∈[0,1] satisfies ∣f(t)−f(a)∣≤p∣t−a∣ whenever t∈[0,1] and ∣t−a∣<1/q. Then Ep,q is closed in the supremum metric.

Facts & Assumptions

Given: Positive integers p,q and a function f∈C([0,1],R) outside Ep,q.

Proof

technique · direct
1.1givenconstruct

Because f∉Ep,q, for each a∈[0,1] some t∈[0,1] satisfies ∣t−a∣<1/q and ∣f(t)−f(a)∣>p∣t−a∣. For t∈[0,1] and rational δ>0, let Vt,δ consist of the points a satisfying ∣t−a∣<1/q and ∣f(t)−f(a)∣>p∣t−a∣+3δ. Each Vt,δ is relatively open by continuity of f, and the whole indexed family covers [0,1], since every strict gap exceeds 3δ for some positive rational δ.

2.1step 1.1L1L2algebra

By [L2], finitely many sets Vti,δi cover [0,1]. Put ε=min⁡iδi>0. If h∈C([0,1],R) and ∥h−f∥∞<ε, then for each a∈[0,1] some i has a∈Vti,δi. The triangle inequality gives ∣h(ti)−h(a)∣≥∣f(ti)−f(a)∣−2∥h−f∥∞>p∣ti−a∣+3δi−2ε≥p∣ti−a∣, while ∣ti−a∣<1/q. Thus no a witnesses h∈Ep,q.

3.1step 2.1∎

Step 2.1 shows that the uniform ball of radius ε about every f∉Ep,q misses Ep,q. The complement is open, so Ep,q is closed. The cover and finite subcover make no countable witness selection.

Depends on

Used by

Dependency tree · two levels

31 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources