Alphabeta Math
Session-authored (Fable 5 assisted)
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)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 passaudited 2026-08-02Open 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][0,1] must be equicontinuous or have a uniformly convergent subsequence.

Facts & Assumptions

Given: fn(x)=x2/(x2+(1nx)2)f_n(x)=x^2/(x^2+(1-nx)^2) for 0x10\le x\le1.

[L1]

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

Proof

technique · direct
1.1

Each fnf_n is continuous, 0fn10\le f_n\le1, fn(0)=0f_n(0)=0, and fn(1/n)=1f_n(1/n)=1.

givenalgebra
1.2

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

givenL1algebra
2.1

The common values at 00 and 1/n01/n\to0 contradict equicontinuity at 00.

step 1.1algebra
2.2

Uniform convergence to zero is impossible because fnfn(1/n)=1\lVert f_n\rVert_\infty\ge f_n(1/n)=1.

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:cR}\mathcal F=\{f_c:c\in\mathbb R\} on a nonempty metric space, where fc(x)=cf_c(x)=c.

Counterexample

Proof

technique · direct
1.1

For every cc and all x,yx,y, fc(x)fc(y)=0|f_c(x)-f_c(y)|=0, so any positive δ\delta works simultaneously for every member of F\mathcal F.

givenL1algebra
1.2

At each fixed point aa, {fc(a):cR}=R\{f_c(a):c\in\mathbb R\}=\mathbb 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\mathbb 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 ε\varepsilon--δ\delta equicontinuity condition must have a uniformly convergent subsequence.

Facts & Assumptions

Given: b(x)=max{1x,0}b(x)=\max\{1-|x|,0\} and fn(x)=b(xn)f_n(x)=b(x-n) for nNn\in\mathbb 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 11-Lipschitz and takes values in [0,1][0,1]. Every translate fnf_n has the same properties. Thus the family is uniformly bounded and, for every ε>0\varepsilon>0, the common choice δ=ε\delta=\varepsilon gives xy<δfn(x)fn(y)<ε|x-y|<\delta\Rightarrow|f_n(x)-f_n(y)|<\varepsilon for every nn; this is the ordinary all-metric-space equicontinuity condition used in the refuted claim.

givenalgebra
1.2

If mn2|m-n|\ge2, then at x=nx=n one has fn(n)=1f_n(n)=1 and fm(n)=0f_m(n)=0; consequently fnfm1\lVert f_n-f_m\rVert_\infty\ge1.

givenalgebra
2.1

Every infinite subsequence contains two indices separated by at least 22, 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)=x2f(x)=x^2 equal x2+x(1x)/nx^2+x(1-x)/n

Statement

For f(x)=x2f(x)=x^2 and n1n\ge1, Bn(f)(x)=x2+x(1x)/nB_n(f)(x)=x^2+x(1-x)/n. Hence Bn(f)f=1/(4n)\lVert B_n(f)-f\rVert_\infty=1/(4n). For n=0n=0, B0(f)=0B_0(f)=0.

Facts & Assumptions

Given: f(x)=x2f(x)=x^2 on [0,1][0,1].

[L1]

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

[L2]

Proof

technique · calculation
1.1

For n1n\ge1, substitute f(k/n)=(k/n)2f(k/n)=(k/n)^2 in the definition and use [L1] to obtain Bn(f)=x2+x(1x)/nB_n(f)=x^2+x(1-x)/n.

L1L2algebra
2.1

Since 0x(1x)1/40\le x(1-x)\le1/4 with equality at x=1/2x=1/2, the stated supremum error is 1/(4n)1/(4n).

step 1.1algebra
3.1

The separate definition at degree zero gives B0(f)=f(0)=0B_0(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 xxax\mapsto|x-a|, a[0,1]a\in[0,1], is compact in C([0,1])C([0,1])

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)) and the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain). The family D={da:a[0,1]}C([0,1],R)\mathcal D=\{d_a:a\in[0,1]\}\subseteq C([0,1],\mathbb R), where da(x)=xad_a(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)=xad_a(x)=|x-a| for a,x[0,1]a,x\in[0,1].

[L1]

Every sequence in [0,1][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)ab|d_a(x)-d_b(x)|\le|a-b| for every xx; evaluating at x=0x=0 gives dadb=ab\lVert d_a-d_b\rVert_\infty=|a-b|.

givenalgebra
2.1

Given a sequence dand_{a_n} in D\mathcal D, use [L1] to choose anja[0,1]a_{n_j}\to a\in[0,1]. Step 1.1 then gives danjdad_{a_{n_j}}\to d_a uniformly.

L1step 1.1choose
3.1

Thus D\mathcal 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][-1,1] form a unital algebra but are not dense because they do not separate 1-1 and 11

Statement refuted

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

Facts & Assumptions

Given: AA is the algebra of even polynomials restricted to [1,1][-1,1].

[L1]

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

Proof

technique · direct
1.1

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

givenL1algebra
1.2

Every pAp\in A has p(1)=p(1)p(-1)=p(1); therefore AA does not separate these two points.

givenL1algebra
2.1

If pAp\in A, then max{p(1)+1,p(1)1}1\max\{|p(-1)+1|,|p(1)-1|\}\ge1, so pid1\lVert p-\operatorname{id}\rVert_\infty\ge1.

step 1.2algebra
3.1

Hence the identity function is not in the closure of AA, and AA 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][0,1] but are not dense in C([0,1])C([0,1])

Statement refuted

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

Facts & Assumptions

Given: A={pR[x]:p(0)=0}A=\{p\in\mathbb R[x]:p(0)=0\}, restricted to [0,1][0,1].

[L1]

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

Proof

technique · direct
1.1

The set AA is an algebra, and the function xxx\mapsto x in AA separates every distinct pair of points of [0,1][0,1].

givenL1algebra
1.2

Every pAp\in A vanishes at 00, so AA contains no constant-one function and is not unital.

givenL1algebra
2.1

For every pAp\in A, p1p(0)1=1\lVert p-\mathbf1\rVert_\infty\ge|p(0)-1|=1. Thus 1\mathbf1 is not in the uniform closure of AA.

step 1.2algebra
3.1

Therefore AA separates points but is not dense.

step 1.1step 2.1algebra

Sources