Alphabeta Math
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.

✓ 25 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 25 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Approximation and Compactness in C(K)

1 · Prerequisites

2 · Summary

The space C(K,R) is formed from continuous real-valued functions on a compact metric space. The supremum metric, compactness criteria, uniform convergence, and the finite binomial identities used by Bernstein polynomials provide the background for its approximation theory. Compactness is expressed through equicontinuity and boundedness, while uniform limits preserve continuity.

The development defines the family conditions needed for Arzelà--Ascoli, proves polynomial approximation through Bernstein polynomials, and gives the real Stone--Weierstrass argument for unital point-separating algebras. It also proves the closed-set form of Baire category needed for the dense nowhere-differentiability result and establishes the Takagi function as an explicit witness.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-02Open item page →

Equicontinuity, pointwise boundedness, and uniform boundedness for families in C(K,R)

Definition

Let (K,d) be a nonempty compact metric space and let F⊆C(K,R) in the sense of The space C(K,R) of continuous real-valued functions on a nonempty compact metric space. The family F is equicontinuous at a∈K when, for every ε>0, there is δ>0 such that for every f∈F and every x∈K, d(x,a)<δ implies ∣f(x)−f(a)∣<ε. It is equicontinuous when this holds at every a∈K.

It is pointwise bounded when, for every a∈K, the set {f(a):f∈F} is bounded in R. It is uniformly bounded when a real M≥0 satisfies ∣f(x)∣≤M for every f∈F and x∈K.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

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]

Equicontinuity at each a∈K gives a radius ra>0 such that d(x,a)<ra 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.1

The balls B(a,ra/2) for a∈K cover K, so choose finitely many centres a0,…,aN whose balls cover K.

L1L2choose
2.1

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

step 1.1algebra
3.1

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

step 2.1L1algebra∎
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Equicontinuity and pointwise boundedness on a compact metric space imply uniform boundedness

Statement

An equicontinuous, pointwise-bounded family F⊆C(K,R) on a nonempty compact metric space is uniformly bounded.

Facts & Assumptions

Given: An equicontinuous and pointwise-bounded family F.

[L1]

There is a common radius δ>0 such that d(x,y)<δ implies ∣f(x)−f(y)∣<1 for all f∈F (An equicontinuous family on a compact metric space is uniformly equicontinuous).

[L2]

Pointwise boundedness and uniform boundedness have the quantified meanings in Equicontinuity, pointwise boundedness, and uniform boundedness for families in C(K,R).

Proof

technique · direct
1.1

The δ-balls cover K; compactness supplies finitely many centres a0,…,aN whose δ-balls cover it.

L1choose
2.1

By pointwise boundedness, choose Mi≥0 with ∣f(ai)∣≤Mi for every f∈F, and let M:=1+max⁡iMi.

L2step 1.1choose
3.1

For x∈K, choose i with d(x,ai)<δ; then ∣f(x)∣≤∣f(x)−f(ai)∣+∣f(ai)∣<1+Mi≤M.

step 1.1step 2.1L1algebra
4.1

Thus M uniformly bounds F.

step 3.1L2∎
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

An equicontinuous pointwise-bounded family in C(K,R) has a finite net in the supremum metric

Statement

An equicontinuous pointwise-bounded family F⊆C(K,R) is totally bounded for the supremum metric.

Facts & Assumptions

Given: A positive real ε and an equicontinuous pointwise-bounded family F.

[L1]

Uniform equicontinuity gives a finite set E⊆K such that agreement within ε/3 at every point of E forces agreement within ε everywhere (An equicontinuous family on a compact metric space is uniformly equicontinuous).

[L3]

Totally bounded means that every positive radius admits a finite covering by metric balls (Finite ε-net and totally bounded metric space).

Proof

technique · constructive
1.1

Choose a finite δ-net E={a0,…,aN} in K from the uniform equicontinuity radius for ε/3.

L1construct
1.2

By [L2], every vector (f(a0),…,f(aN)) lies in one bounded box in RN+1; cover that box by finitely many coordinate cubes of side less than ε/3.

L2construct
2.1

Choose one member of F from each nonempty inverse image of such a cube. Every f∈F and its chosen representative differ by less than ε/3 on E.

step 1.2construct
3.1

For any x∈K, choose ai∈E with d(x,ai)<δ and use equicontinuity for both functions and step 2.1 to obtain ∣f(x)−g(x)∣<ε.

step 1.1step 2.1L1algebra
4.1

The finitely many representatives form an ε-net, so F is totally bounded.

step 3.1L3discharge-construct∎
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

A uniformly convergent sequence of continuous functions, together with its limit, is equicontinuous

Statement

If fn→f uniformly on a compact metric space and every fn is continuous, then {f}∪{fn:n∈N} is equicontinuous.

Facts & Assumptions

Given: a∈K and ε>0.

[L1]

A uniform limit of continuous real-valued functions is continuous (The uniform limit of continuous real-valued functions on a metric space is continuous).

[L2]

Equicontinuity is the common-radius condition for a family of functions (Equicontinuity, pointwise boundedness, and uniform boundedness for families in C(K,R)).

Proof

technique · direct
1.1

Choose N such that ∣fn(x)−f(x)∣<ε/3 for every n≥N and x∈K.

givenchoose
1.2

By [L1], choose a neighbourhood of a on which ∣f(x)−f(a)∣<ε/3; by continuity of the finitely many fn with n<N, shrink it so the same inequality with ε holds for all of them.

L1choose
2.1

On that neighbourhood, the triangle inequality gives ∣fn(x)−fn(a)∣<ε for n≥N, while step 1.2 covers f and n<N.

step 1.1step 1.2algebra
3.1

Thus the displayed family is equicontinuous at arbitrary a, hence equicontinuous.

step 2.1L2∎
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Arzelà--Ascoli for real C(K) under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain). Let K be a nonempty compact metric space and F⊆C(K,R). Its closure in the supremum metric is compact if and only if F is equicontinuous and pointwise bounded.

Facts & Assumptions

Given: The Axiom of Countable Choice, the Axiom of Dependent Choice, and a family F⊆C(K,R).

[L1]

An equicontinuous pointwise-bounded family is totally bounded in the supremum metric (An equicontinuous pointwise-bounded family in C(K,R) has a finite net in the supremum metric).

[L3]

A subspace of a complete metric space is complete exactly when it is closed; assuming Countable Choice and Dependent Choice, in a metric space compactness is equivalent to completeness together with total boundedness (Closed subspaces of complete metric spaces are complete; the converse under countable choice, For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice).

[L4]
[L5]

A continuous function on a compact metric space is uniformly continuous (Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).

Proof

technique · direct
1.1

Suppose F is equicontinuous and pointwise bounded. By [L1] it is totally bounded, and its closure is totally bounded as well.

L1algebra
1.2

Conversely suppose the closure is compact. For a positive ε, choose a finite ε/3-net g0,…,gN in the closure; by [L5], a common positive radius makes every gi vary by less than ε/3.

L3L5choose
2.1

The closure is closed in the complete space of [L2], hence complete by [L3]. Therefore its closure is compact by [L3].

step 1.1L2L3
2.2

For f∈F, choose gi within ε/3 in supremum distance. The two uniform-distance bounds and step 1.2 give ∣f(x)−f(y)∣<ε whenever d(x,y) is below the common radius.

step 1.2algebra
2.3

The same finite net bounds ∣f(a)∣ at each fixed a∈K, so F is pointwise bounded.

step 1.2L4algebra
3.1

Steps 2.2 and 2.3 give equicontinuity and pointwise boundedness, completing the converse.

step 2.2step 2.3L4∎
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Every pointwise-bounded equicontinuous sequence in C(K,R) has a uniformly convergent subsequence

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain). Let K be a nonempty compact metric space. Every equicontinuous pointwise-bounded sequence in C(K,R) has a subsequence converging uniformly to a member of C(K,R).

Facts & Assumptions

Given: A nonempty compact metric space K, the stated choice principles, and an equicontinuous pointwise-bounded sequence (fn) in C(K,R).

[L1]

For a nonempty compact metric space K, an equicontinuous pointwise-bounded family in C(K,R) has compact closure in the supremum metric (Arzelà--Ascoli for real C(K) under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded).

Proof

technique · direct
1.1

The sequence lies in its compact closure by [L1].

L1
2.1

By [L2], it has a subsequence converging in the supremum metric to a point of that closure.

step 1.1L2choose
3.1

Supremum-metric convergence is uniform convergence, so the claimed subsequence converges uniformly.

step 2.1algebra∎
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-02Open item page →

The Bernstein polynomial Bn(f) on [0,1]

Definition

Let f:[0,1]→R and n∈N. Its Bernstein polynomial with index n is

Bn(f)(x):=∑k<n+1ι ⁣(nk)f ⁣(ι(k)ι(n))xk(1−x)n−k(0≤x≤1),

when n≥1. It is a polynomial of degree at most n when nonzero, and it may be the zero polynomial (for example when f=0). Here the finite sum and binomial coefficients are those of Finite sums and finite products, by recursion and The set [A]k of k-element subsets and the binomial coefficient (nk):=∣[n]k∣. For n=0 set B0(f)(x):=f(0); this separate clause avoids the undefined quotient 0/0.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

The zeroth, first, and second centred moments of the Bernstein basis

Statement

For n≥1, 0≤x≤1, and bn,k(x)=ι(nk)xk(1−x)n−k,

∑k=0nbn,k=1,∑k=0nknbn,k=x,∑k=0n(kn−x)2bn,k=x(1−x)n.

Facts & Assumptions

Given: n≥1 and x∈[0,1].

[L1]

The binomial theorem gives (u+v)n=∑k=0nι(nk)ukvn−k (The binomial theorem in R: (x+y)n=∑k<n+1ι ⁣(nk) xky n−k).

[L2]

Finite sums are additive, scale, and split as in Laws of finite sums and finite products.

Proof

technique · direct
1.1

Apply [L1] to u=x and v=1−x to obtain the zeroth identity.

L1algebra
1.2

Reindex the terms k(nk)=n(n−1k−1) and apply [L1] at exponent n−1 to obtain the first identity.

L1L2algebra
2.1

Apply the same reindexing to k(k−1)(nk)=n(n−1)(n−2k−2) when n≥2, combine it with step 1.2, and expand the square.

step 1.2L1L2algebra
3.1

For n=1 the displayed centred identity is checked directly; together with step 2.1 this proves it for all n≥1.

step 2.1algebra∎
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Bernstein polynomials converge uniformly to every continuous function on [0,1]

Statement

If f:[0,1]→R is continuous, then Bn(f)→f uniformly on [0,1].

Facts & Assumptions

Given: A continuous function f:[0,1]→R and ε>0.

[L1]

A continuous function on a compact metric space is uniformly continuous (Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).

[L2]

The Bernstein basis has the zeroth and centred second moment identities (The zeroth, first, and second centred moments of the Bernstein basis).

[L3]

For each positive real η there is a natural N≥1 with 1/N<η (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

Proof

technique · direct
1.1

Choose δ>0 such that ∣f(s)−f(x)∣<ε/2 whenever ∣s−x∣<δ, and choose M with ∣f∣≤M.

L1choose
1.2

On the far part, (k/n−x)2≥δ2; hence its total basis weight is at most x(1−x)/(nδ2)≤1/(4nδ2) by [L2].

L2algebra
2.1

Split the Bernstein sum into ∣k/n−x∣<δ and its complement. The near part is at most ε/2 by the zeroth identity.

step 1.1L2algebra
2.2

Choose n so large that 2M/(4nδ2)<ε/2. The far part is then below ε/2, uniformly in x.

step 1.2L3algebra
3.1

The near and far estimates give ∣Bn(f)(x)−f(x)∣<ε for every x and all sufficiently large n.

step 2.1step 2.2∎
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Polynomials are uniformly dense in C([0,1],R)

Statement

For every f∈C([0,1],R) and ε>0, there is a polynomial p with sup⁡x∈[0,1]∣p(x)−f(x)∣<ε.

Facts & Assumptions

Given: f∈C([0,1],R) and ε>0.

[L1]

The Bernstein polynomials of f converge uniformly to f (Bernstein polynomials converge uniformly to every continuous function on [0,1]).

Proof

technique · direct
1.1

Choose n with sup⁡x∣Bn(f)(x)−f(x)∣<ε.

L1choose
2.1

The finite defining sum for Bn(f) is a polynomial in x, so p:=Bn(f) has the required property.

step 1.1algebra∎
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Polynomials are uniformly dense in C([a,b],R) for every closed interval

Statement

For a≤b, every continuous real function on [a,b] is a uniform limit of polynomials.

Facts & Assumptions

Given: f∈C([a,b],R) and ε>0.

[L1]

Polynomials are uniformly dense on [0,1] (Polynomials are uniformly dense in C([0,1],R)).

[L2]

Closed intervals have the endpoint convention of Intervals of R: the nine order-convex forms, nondegeneracy, and length.

Proof

technique · direct
1.1

If a=b, the constant polynomial q(x)=f(a) agrees with f on the singleton interval.

givenL2algebra
1.2

Now suppose a<b and define g(t)=f(a+(b−a)t) on [0,1].

givenL2construct
1.3

Choose a polynomial p with ∣p(t)−g(t)∣<ε on [0,1] by [L1].

L1choose
2.1

Then q(x)=p((x−a)/(b−a)) is a polynomial and satisfies ∣q(x)−f(x)∣<ε on [a,b]. Together with step 1.1 this proves both cases.

step 1.1step 1.2step 1.3algebra∎
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-02Open item page →

A unital point-separating real subalgebra of C(K,R)

Definition

Let K be a nonempty compact metric space. A set A⊆C(K,R) is a unital real function algebra when it contains every constant function and is closed under pointwise addition, scalar multiplication, and multiplication. It separates points when for every distinct x,y∈K there is g∈A with g(x)≠g(y). The ambient function space is The space C(K,R) of continuous real-valued functions on a nonempty compact metric space.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

The uniform closure of a unital real function algebra is closed under absolute value, maximum, and minimum

Statement

If A⊆C(K,R) is a unital real function algebra and A‾ is its uniform closure, then u∈A‾ implies ∣u∣∈A‾; consequently u∨v and u∧v lie in A‾ whenever u,v do.

Facts & Assumptions

Given: A unital real function algebra A and u,v∈A‾.

[L1]

The algebra operations and constants are those in A unital point-separating real subalgebra of C(K,R).

[L2]

Polynomials uniformly approximate ∣t∣ on every bounded closed interval (Polynomials are uniformly dense in C([a,b],R) for every closed interval).

Proof

technique · direct
1.1

Choose an∈A converging uniformly to u. Their ranges, together with that of u, lie in one bounded interval.

givenchoose
1.2

By [L2], choose polynomials pj with pj(0)=0 converging uniformly to ∣t∣ on that interval. Then pj(an)∈A by [L1].

L1L2choose
2.1

A diagonal choice of j,n makes pj(an) uniformly converge to ∣u∣, so ∣u∣∈A‾.

step 1.1step 1.2algebra
3.1

The identities u∨v=(u+v+∣u−v∣)/2 and u∧v=(u+v−∣u−v∣)/2 and [L1] give the remaining closure.

step 2.1L1algebra∎
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

A unital separating real function algebra interpolates arbitrary values at two distinct points

Statement

If A⊆C(K,R) is unital and separates points, then for distinct x,y∈K and reals r,s there is g∈A with g(x)=r and g(y)=s.

Facts & Assumptions

Given: Distinct x,y∈K and r,s∈R.

[L1]

Separation gives h∈A with h(x)≠h(y); constants and affine combinations of members of A remain in A (A unital point-separating real subalgebra of C(K,R)).

Proof

technique · constructive
1.1

Choose h from [L1] and put g(z)=r+(s−r)(h(z)−h(x))/(h(y)−h(x)).

L1construct
2.1

The denominator is nonzero, g∈A, and direct substitution gives g(x)=r and g(y)=s.

step 1.1L1algebradischarge-construct∎
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Real Stone--Weierstrass theorem for compact metric spaces

Statement

Let K be a nonempty compact metric space and let A⊆C(K,R) be a unital subalgebra which separates points. Then A is dense in C(K,R) for the supremum metric.

Facts & Assumptions

Given: f∈C(K,R) and ε>0.

[L1]

The uniform closure A‾ is closed under pointwise maximum and minimum (The uniform closure of a unital real function algebra is closed under absolute value, maximum, and minimum).

[L2]

For distinct x,y∈K and prescribed real values at x,y, A contains a function taking those two values (A unital separating real function algebra interpolates arbitrary values at two distinct points).

[L3]

Every open cover of the compact metric space K has a finite subcover (Open cover, subcover, compact metric space, and compact subset of a metric space).

Proof

technique · constructive
1.1

For fixed x,y∈K, choose ux,y∈A with ux,y(x)=f(x) and ux,y(y)=f(y), using f(x)1 when x=y and [L2] otherwise.

L2algebra
2.1

For fixed x, the open sets Ux,y={z:ux,y(z)>f(z)−ε} cover K, since y∈Ux,y. Select y1,…,yr whose sets cover K by [L3].

step 1.1L3construct
3.1

Put gx=max⁡jux,yj∈A‾. Then gx(x)=f(x) and gx>f−ε on K.

L1step 2.1algebra
4.1

The open sets Vx={z:gx(z)<f(z)+ε} cover K. By [L3], choose x1,…,xs whose Vxi cover K.

step 3.1L3construct
5.1

The function h=min⁡igxi belongs to A‾ by [L1], and f−ε<h<f+ε pointwise. Thus ∥h−f∥∞<ε.

L1step 3.1step 4.1algebra
6.1

Since ε was arbitrary and every h of step 5.1 lies in the closed set A‾, the function f lies in A‾. Thus A‾=C(K,R) and A is dense.

step 5.1discharge-construct∎
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior

Statement

Assume the Axiom of Dependent Choice (DC). If a nonempty metric space X is complete, then it is not the union of a sequence of closed sets each having empty interior. Equivalently, the intersection of countably many open dense subsets of X is dense.

Facts & Assumptions

Given: The Axiom of Dependent Choice (DC), closed sets F1,F2,…⊆X with empty interior, and a nonempty open set O⊆X.

[L1]

A complete metric space contains the limit of every Cauchy sequence (Complete metric space: every Cauchy sequence converges in the space).

[L2]

Under the assumed Axiom of Dependent Choice, a recursively specified sequence of balls is permitted (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[L3]

For every positive real number there is a reciprocal integer smaller than it (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

Proof

technique · constructive
1.1

If X is empty the assertion is vacuous. Otherwise choose an open ball B0 whose closure lies in O; this is possible because O is open.

givenalgebra
1.2

Given a nonempty open ball Bn−1, its intersection with X∖Fn is nonempty because Fn has empty interior. Choose an open ball Bn with nonempty closure, Bn‾⊆Bn−1∖Fn, and radius below 2−n.

givenL3construct
2.1

Dependent choice gives balls Bn satisfying step 1.2 for every n. Choose centres xn∈Bn.

L2step 1.2choose
3.1

The nesting and the radius bound make (xn) Cauchy: for m>n, both xm and xn lie in Bn‾, so their distance is at most twice the radius of Bn, which tends to zero.

step 1.2step 2.1L3algebra
4.1

Let x=lim⁡nxn, supplied by completeness [L1]. For every n, the tail lies in the closed set Bn‾, so x∈Bn‾⊆Bn−1∖Fn.

L1step 1.2step 3.1algebra
5.1

Thus x∈O∖⋃nFn. Every nonempty open O meets this complement, proving both stated formulations.

step 4.1discharge-construct∎
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

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

Proof

technique · sequential
1.1

For each n, choose a witness an∈[0,1] for fn∈Ep,q. Pass to a subsequence with an→a∈[0,1] using [L2].

givenL2choose
1.2

By [L1], fn→f uniformly, and [L3] confirms that f∈C([0,1],R).

L1L3algebra
2.1

Fix t∈[0,1] with ∣t−a∣<1/q. For all sufficiently large n, ∣t−an∣<1/q, hence ∣fn(t)−fn(an)∣≤p∣t−an∣.

step 1.1givenalgebra
3.1

Letting n tend to infinity in step 2.1, uniform convergence and continuity of f give ∣f(t)−f(a)∣≤p∣t−a∣.

step 1.1step 1.2step 2.1algebra
4.1

The point a witnesses f∈Ep,q; therefore Ep,q is sequentially closed, hence closed in this metric space.

step 3.1L1algebra∎
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Polygonal functions with sufficiently steep nonvertex slopes are dense in C([0,1])

Statement

For every f∈C([0,1],R), every ε>0, and every M>0, there is a piecewise-affine h with finitely many vertices such that ∥f−h∥∞<ε and every slope on a nonvertex affine piece has absolute value greater than M.

Facts & Assumptions

Given: f∈C([0,1],R), ε>0, and M>0.

[L2]

Proof

technique · constructive
1.1

By [L1], choose a finite partition 0=x0<⋯<xr=1 so that ∣f(s)−f(t)∣<ε/4 whenever s,t are in one partition interval. Let g be the affine interpolant through (xi,f(xi)).

L1construct
2.1

The affine-interpolation formula makes ∣g(t)−f(t)∣<ε/4 on every partition interval. Let S be the maximum of the finitely many absolute slopes of g.

step 1.1algebra
3.1

Choose 0<η<ε/4. By [L2], subdivide every partition interval evenly enough to support a continuous triangular sawtooth w, zero at the old vertices, with ∥w∥∞≤η and every nonvertex slope of absolute value greater than S+M.

L2step 2.1construct
4.1

Put h=g+w. On each new affine piece, the reverse triangle inequality gives ∣h′∣≥∣w′∣−∣g′∣>M, while ∥h−f∥∞<ε/2<ε.

step 2.1step 3.1algebra
5.1

This h has the required finite polygonal structure, approximation, and slope bound.

step 4.1discharge-construct∎
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Under Dependent Choice, continuous nowhere differentiable functions form a dense subset of C([0,1],R)

Statement

Assume the Axiom of Dependent Choice (DC). Then the set of continuous functions [0,1]→R having no finite two-sided derivative at an interior point and no finite one-sided derivative at either endpoint is dense in C([0,1],R) for the supremum metric.

Facts & Assumptions

Given: The Axiom of Dependent Choice (DC); for p,q∈N>0, Ep,q is the fixed local-Lipschitz set of Functions satisfying a fixed local Lipschitz bound somewhere form a closed subset of C([0,1]).

[L2]

Polygonal functions whose nonvertex slopes exceed any prescribed bound are dense (Polygonal functions with sufficiently steep nonvertex slopes are dense in C([0,1])).

[L3]

C([0,1],R) is a nonempty complete metric space in the supremum metric (C(K,R) is complete in the supremum metric for every nonempty compact metric space K).

[L5]

Assume the Axiom of Dependent Choice (DC). The intersection of countably many open dense subsets of a nonempty complete metric space is dense (Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior).

Proof

technique · direct
1.1

Each Ep,q has empty interior. Indeed, every supremum ball contains by [L2] a polygonal h all of whose nonvertex slopes have absolute value greater than p; at any point, including a vertex or endpoint, a sufficiently nearby point on an adjacent affine piece violates the defining p-bound.

L2givenalgebra
1.2

If f∈G had a finite derivative at a, [L4] would bound its difference quotients by some integer p on a sufficiently small radius 1/q, placing f in Ep,q; this contradicts f∈G.

L4givenalgebra
2.1

Hence every C([0,1])∖Ep,q is open and dense by [L1].

L1step 1.1algebra
3.1

Apply [L5] to the complete space of [L3]. The intersection G=⋂p,q≥1(C([0,1])∖Ep,q) is dense.

L3step 2.1L5
4.1

Thus G is a dense subset of the continuous nowhere-differentiable functions, which proves the statement.

step 3.1step 1.2algebra∎
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-02Open item page →

The tent function ϕ(t)=dist⁡(t,Z) and the Takagi series T(x)=∑n≥02−nϕ(2nx)

Definition

For t∈R, put r(t):=t−⌊t⌋ and

ϕ(t):=min⁡{r(t), 1−r(t)}.

By the integer-part convention of Integer part: for every real x there is exactly one integer m with m≤x<m+1, 0≤r(t)<1; thus this is equivalently the distance from t to the integers. In particular 0≤ϕ(t)≤1/2 and ϕ is 1-periodic.

For x∈[0,1], the Takagi series is the series of real functions in the sense of A series of real-valued functions and its pointwise and uniform convergence through its partial sums

T(x):=∑n≥02−nϕ(2nx).

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

The Takagi series converges uniformly to a continuous nowhere differentiable function

Statement

The Takagi series T(x)=∑n≥02−nϕ(2nx) converges uniformly on [0,1]. Its sum is continuous and has no finite derivative at any point of [0,1], with one-sided derivatives at the endpoints understood.

Facts & Assumptions

Proof

technique · direct
1.1

Since 0≤ϕ≤1/2, the nth summand is bounded by 2−n−1; its majorant series converges. Thus T converges uniformly by [L1].

givenL1algebra
1.2

For x∈[0,1) and each N, let uN≤x<vN be the adjacent dyadic rationals of order N; at x=1 use the left adjacent interval. Every summand of index at least N vanishes at both endpoints, while each earlier summand is affine on that interval with slope εk∈{−1,1}.

givenalgebra
2.1

Every summand is continuous, so T is continuous by [L2].

step 1.1L2algebra
2.2

Hence (T(vN)−T(uN))/(vN−uN)=∑k<Nεk. These secant slopes cannot converge to a finite real number, because consecutive partial sums differ by εN of absolute value one.

step 1.2algebra
3.1

If a finite derivative existed at an interior point, both endpoint difference quotients and therefore their secant combination would tend to it; at a dyadic point or endpoint the same argument uses the nested one-sided dyadic intervals. This contradicts step 2.2 and [L3].

step 2.2L3algebra∎

5 · Examples, counterexamples and false statements

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passverified 2026-09-09 (gpt-6-astra)Open item page →

Rudin's bounded rational spikes are not equicontinuous and have no uniformly convergent subsequence

Statement refuted

Refuted: a uniformly bounded family of continuous functions on [0,1] must be equicontinuous or have a uniformly convergent subsequence.

Facts & Assumptions

Given: For each integer n≥1, let fn(x)=x2/(x2+(1−nx)2) for 0≤x≤1. The sequence is explicitly indexed by the positive integers, so 1/n is always defined and belongs to [0,1].

[L1]

A uniform limit of continuous real functions is continuous (The uniform limit of continuous real-valued functions on a metric space is continuous).

Counterexample

technique · direct
1.1

The denominator is positive: if its two nonnegative summands vanished, x=0 and 1−nx=0 would both hold, which is impossible. Each fn is therefore continuous, 0≤fn≤1, fn(0)=0, and fn(1/n)=1.

givenalgebra
1.2

For every fixed x>0, fn(x)→0, while fn(0)=0. Thus any uniformly convergent subsequence would have the zero function as its pointwise limit, consistently with [L1].

givenL1algebra
2.1

Take ε=1/2. For every δ>0 there is an integer n≥1 with 1/n<δ, but ∣fn(1/n)−fn(0)∣=1. Thus no common radius works at 0, so the family is not equicontinuous.

step 1.1algebra
2.2

For every subsequence (fnj), the indices nj tend to infinity, so step 1.2 still forces any uniform limit to be zero. But ∥fnj∥∞=fnj(1/nj)=1 for every j, contradicting uniform convergence to zero. No subsequence is uniformly convergent.

step 1.1step 1.2algebra
3.1

This bounded family is neither equicontinuous nor uniformly sequentially compact.

step 2.1step 2.2algebra∎
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-02Open item page →

All constant functions form an equicontinuous family that is not pointwise bounded

Statement refuted

Refuted: equicontinuity alone implies pointwise boundedness.

Facts & Assumptions

Given: F={fc:c∈R} on a nonempty metric space, where fc(x)=c.

[L1]

Equicontinuity and pointwise boundedness have the meanings of Equicontinuity, pointwise boundedness, and uniform boundedness for families in C(K,R).

Counterexample

Proof

technique · direct
1.1

For every c and all x,y, ∣fc(x)−fc(y)∣=0, so any positive δ works simultaneously for every member of F.

givenL1algebra
1.2

At each fixed point a, {fc(a):c∈R}=R, which is unbounded.

givenL1algebra
2.1

Hence this family is equicontinuous but not pointwise bounded.

step 1.1step 1.2algebra∎
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Translations of a fixed bump on R are uniformly bounded and equicontinuous but have no uniformly convergent subsequence

Statement refuted

Refuted: on an arbitrary metric domain, a uniformly bounded family satisfying the usual all-metric-space ε--δ equicontinuity condition must have a uniformly convergent subsequence.

Facts & Assumptions

Given: b(x)=max⁡{1−∣x∣,0} and fn(x)=b(x−n) for n∈N.

[L1]

A uniformly convergent sequence of real-valued functions is uniformly Cauchy (A sequence of real-valued functions converges uniformly if and only if it is uniformly Cauchy).

Proof

technique · direct
1.1

The triangular bump is 1-Lipschitz and takes values in [0,1]. Every translate fn has the same properties. Thus the family is uniformly bounded and, for every ε>0, the common choice δ=ε gives ∣x−y∣<δ⇒∣fn(x)−fn(y)∣<ε for every n; this is the ordinary all-metric-space equicontinuity condition used in the refuted claim.

givenalgebra
1.2

If ∣m−n∣≥2, then at x=n one has fn(n)=1 and fm(n)=0; consequently ∥fn−fm∥∞≥1.

givenalgebra
2.1

Every infinite subsequence contains two indices separated by at least 2, so no subsequence is uniformly Cauchy.

step 1.2algebra
3.1

By [L1], no subsequence can converge uniformly.

L1step 2.1algebra∎
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-02Open item page →

The Bernstein polynomials of f(x)=x2 equal x2+x(1−x)/n

Statement

For f(x)=x2 and n≥1, Bn(f)(x)=x2+x(1−x)/n. Hence ∥Bn(f)−f∥∞=1/(4n). For n=0, B0(f)=0.

Facts & Assumptions

Given: f(x)=x2 on [0,1].

[L1]

The first two Bernstein binomial moments are those of The zeroth, first, and second centred moments of the Bernstein basis.

[L2]

The Bernstein polynomial is defined in The Bernstein polynomial Bn(f) on [0,1].

Proof

technique · calculation
1.1

For n≥1, substitute f(k/n)=(k/n)2 in the definition and use [L1] to obtain Bn(f)=x2+x(1−x)/n.

L1L2algebra
2.1

Since 0≤x(1−x)≤1/4 with equality at x=1/2, the stated supremum error is 1/(4n).

step 1.1algebra
3.1

The separate definition at degree zero gives B0(f)=f(0)=0.

L2algebra∎
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Under the Axiom of Countable Choice and the Axiom of Dependent Choice, the family x↦∣x−a∣, a∈[0,1], is compact in C([0,1])

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain). The family D={da:a∈[0,1]}⊆C([0,1],R), where da(x)=∣x−a∣, is compact in the supremum metric.

Facts & Assumptions

Given: The Axiom of Countable Choice, the Axiom of Dependent Choice, and da(x)=∣x−a∣ for a,x∈[0,1].

[L1]

Every sequence in [0,1] has a convergent subsequence (Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence).

[L2]

Assuming the Axiom of Countable Choice and the Axiom of Dependent Choice, sequential compactness and compactness are equivalent for a metric space (For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice).

Proof

technique · sequential
1.1

The reverse triangle inequality gives ∣da(x)−db(x)∣≤∣a−b∣ for every x; evaluating at x=0 gives ∥da−db∥∞=∣a−b∣.

givenalgebra
2.1

Given a sequence dan in D, use [L1] to choose anj→a∈[0,1]. Step 1.1 then gives danj→da uniformly.

L1step 1.1choose
3.1

Thus D is sequentially compact, and it is compact by [L2].

step 2.1L2algebra∎
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Even polynomials on [−1,1] form a unital algebra but are not dense because they do not separate −1 and 1

Statement refuted

Refuted: a unital real function algebra on a compact space is dense without the point-separation hypothesis.

Facts & Assumptions

Given: A is the algebra of even polynomials restricted to [−1,1].

[L1]

A unital separating real function algebra has the properties in A unital point-separating real subalgebra of C(K,R).

Proof

technique · direct
1.1

The constants belong to A, and sums and products of even polynomials are even, so A is a unital algebra.

givenL1algebra
1.2

Every p∈A has p(−1)=p(1); therefore A does not separate these two points.

givenL1algebra
2.1

If p∈A, then max⁡{∣p(−1)+1∣,∣p(1)−1∣}≥1, so ∥p−id⁡∥∞≥1.

step 1.2algebra
3.1

Hence the identity function is not in the closure of A, and A is not dense.

step 2.1algebra∎
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Polynomials vanishing at zero separate points of [0,1] but are not dense in C([0,1])

Statement refuted

Refuted: point separation alone makes a real function algebra dense in C([0,1]).

Facts & Assumptions

Given: A={p∈R[x]:p(0)=0}, restricted to [0,1].

[L1]

Point separation and the unital condition are distinct requirements in A unital point-separating real subalgebra of C(K,R).

Proof

technique · direct
1.1

The set A is an algebra, and the function x↦x in A separates every distinct pair of points of [0,1].

givenL1algebra
1.2

Every p∈A vanishes at 0, so A contains no constant-one function and is not unital.

givenL1algebra
2.1

For every p∈A, ∥p−1∥∞≥∣p(0)−1∣=1. Thus 1 is not in the uniform closure of A.

step 1.2algebra
3.1

Therefore A separates points but is not dense.

step 1.1step 2.1algebra∎

Sources