Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-02
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])C([0,1])

Statement

For p,qN>0p,q\in\mathbb N_{>0}, let Ep,qE_{p,q} be the functions fC([0,1],R)f\in C([0,1],\mathbb R) for which some a[0,1]a\in[0,1] satisfies f(t)f(a)pta|f(t)-f(a)|\le p|t-a| whenever t[0,1]t\in[0,1] and ta<1/q|t-a|<1/q. Then Ep,qE_{p,q} is closed in the supremum metric.

Facts & Assumptions

Proof

technique · sequential
1.1

For each nn, choose a witness an[0,1]a_n\in[0,1] for fnEp,qf_n\in E_{p,q}. Pass to a subsequence with ana[0,1]a_n\to a\in[0,1] using [L2].

givenL2choose
1.2

By [L1], fnff_n\to f uniformly, and [L3] confirms that fC([0,1],R)f\in C([0,1],\mathbb R).

L1L3algebra
2.1

Fix t[0,1]t\in[0,1] with ta<1/q|t-a|<1/q. For all sufficiently large nn, tan<1/q|t-a_n|<1/q, hence fn(t)fn(an)ptan|f_n(t)-f_n(a_n)|\le p|t-a_n|.

step 1.1givenalgebra
3.1

Letting nn tend to infinity in step 2.1, uniform convergence and continuity of ff give f(t)f(a)pta|f(t)-f(a)|\le p|t-a|.

step 1.1step 1.2step 2.1algebra
4.1

The point aa witnesses fEp,qf\in E_{p,q}; therefore Ep,qE_{p,q} is sequentially closed, hence closed in this metric space.

step 3.1L1algebra

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 81 results over 14 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources