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.

✓ 7 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 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Approximation and Compactness in C(K): Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

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