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.

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

Stone–Weierstrass in General: 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 passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The disc algebra is unital and separating but not self-adjoint or dense

Statement refuted

The false claim is that a unital point-separating complex function algebra on a compact Hausdorff space must be self-adjoint and uniformly dense without any conjugation hypothesis.

On the closed unit disc D:={z∈C:∣z∣≤1}, let P be the algebra of restrictions of complex polynomials in the coordinate z, and let A be its uniform closure: the set of functions f:D→C such that for every ε>0 there is p∈P with ∣f(z)−p(z)∣<ε for every z∈D. Then A is a uniformly closed unital point-separating complex function algebra, but z‾∉A. Consequently A is neither self-adjoint nor dense in C(D,C).

Facts & Assumptions

Given: The closed unit disc D⊆C, the coordinate-polynomial algebra P, and its uniform closure A.

[L1]

A complex function algebra is self-adjoint when it contains the pointwise conjugate of each of its members; it is unital and point-separating under the literal constant-function and distinct-pair conditions (Self-adjoint complex function algebras, unitality, and point separation).

[L2]

For z=a+bi, z‾=a−bi and ∣z∣=a2+b2 (Real and imaginary parts, complex conjugation, and modulus).

[L3]

For all z,w∈C, zz‾=∣z∣2, ∣zw∣=∣z∣∣w∣, and ∣z+w∣≤∣z∣+∣w∣ (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[L5]

Under C=R2, dC(z,w)=∣z−w∣ is exactly the Euclidean metric, and continuity on subsets of C uses this metric (The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane).

[L6]

Natural powers satisfy z0=1 and zn+1=znz; negative integer powers of nonzero z are powers of its inverse (Integer powers in the complex field).

[L7]

For n≥1, the nth roots of unity are the distinct numbers exp⁡(2πik/n) for natural k with 0≤k<n (The n-th roots of a complex number and the n distinct roots of unity for every n≥1).

[L8]

For n∈N with n≥2, the sum of all nth roots of unity is 0 (For n≥2, the sum of all n-th roots of unity is zero).

[L9]

For all z,w∈C, exp⁡(z+w)=exp⁡zexp⁡w (exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential).

[L10]

The complex exponential satisfies ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ (ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ).

[L11]

If a property holds at 0 and passes from every natural n to its successor, then it holds for every natural number (The principle of mathematical induction).

[L13]

A compact subset of a metric space is compact as a topological subspace of its metric topology, and conversely (For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide, clause 2).

[L14]

Every metric space is Hausdorff: distinct points are separated by disjoint open balls (Distinct points of a metric space have disjoint balls around them).

[L15]

If a map from a topological space to a metric space has, for every ε>0, a continuous map staying within ε of it at every point, then it is continuous (A uniform limit of continuous functions is continuous, so C(X,Y) is closed in YX under the uniform metric, clause 1).

Counterexample

technique · contradiction
1.1L3L5L12L13L14

The reverse triangle inequality derived from [L3] makes z↦∣z∣ continuous, so D={∣z∣≤1} is closed; it is bounded because dC(z,0)=∣z∣≤1. Thus [L5], [L12], and [L13] make D compact, and [L14] makes its metric topology Hausdorff.

1.2L1L3L4L5L6L15choosealgebra

Each p=∑j=0mαjzj in P is continuous: the identity zj−wj=(z−w)∑k=0j−1zkwj−1−k of [L6] together with ∣zw∣=∣z∣∣w∣ and ∣z+w∣≤∣z∣+∣w∣ from [L3] gives ∣zj−wj∣≤j∣z−w∣ for z,w∈D, so ∣p(z)−p(w)∣≤Cp∣z−w∣ with Cp:=∑j=1mj∣αj∣, which is continuity for the metric of [L5]; hence [L15] puts every member of A in C(D,C). The set P contains the constants and the coordinate function z↦z, which separates points, and is closed under complex linear combinations and products by [L1] and [L4], so P is a unital point-separating complex function algebra and A⊇P inherits unitality and point separation. A is a complex vector subspace because approximants add and scale. For products, ∣z∣≤1 and [L3] give ∣p(z)∣≤Mp:=∑j=0m∣αj∣ on D for every p∈P, so given f,g∈A and η>0 one may first fix b0∈P with ∣g−b0∣<1 everywhere, whence ∣g∣≤K:=Mb0+1 on D, and then choose a∈P with ∣f−a∣<η/(2K) everywhere and b∈P with ∣g−b∣<η/(2(Ma+1)) everywhere; from ab−fg=a(b−g)+(a−f)g and [L3], ∣ab−fg∣≤Ma∣b−g∣+K∣a−f∣<η pointwise, and ab∈P, so fg∈A. Finally A is uniformly closed, because a function within ε/2 of a member of A everywhere is within ε of a member of P everywhere.

1.3L2assume-contragivenchoose

Suppose for contradiction that z‾∈A. Then there is a nonzero polynomial p(z)=∑j=0majzj with sup⁡z∈D∣z‾−p(z)∣<1; put N:=m+2≥2 and ζ:=exp⁡(2πi/N).

1.4L6L7L9L10L11

Repeated use of the addition law [L9], along the induction of [L11] on k with base exp⁡0=1=ζ0, gives exp⁡(2πik/N)=ζk for every natural k; so the list of [L7] is exactly 1,ζ,…,ζN−1, and these are the Nth roots of unity. For an integer r with 1≤r<N one has ζr=exp⁡(2πir/N), and [L10] makes this equal to 1=exp⁡0 only when 2πir/N∈2πiZ, that is only when N divides r, which fails in that range; hence ζr≠1. The same law gives (ζr)N=exp⁡(2πir)=1.

1.5L4L6L11algebra

For every natural q≥1 and every x∈C, (x−1)∑k=0q−1xk=xq−1. Apply [L11] to the property that this identity holds for q=n+1. At n=0 the identity reads (x−1)x0=x−1, which is immediate. Assuming it at n, adding the term xn+1 to the sum changes the left side by (x−1)xn+1=xn+2−xn+1, carrying the right side from xn+1−1 to xn+2−1, which is the identity at n+1.

2.1step 1.4step 1.5L4L8

The exponent-one cancellation ∑k=0N−1ζk=0 is [L8]. For 2≤r≤m+1<N, step 1.5 with x=ζr and step 1.4 give (ζr−1)∑k=0N−1ζrk=0 with ζr−1≠0, so ∑k=0N−1ζrk=0.

2.2step 1.4L3algebra

Every sampled point lies on the unit circle, so [L3] gives ζkζk‾=1 and hence N−1∑k=0N−1ζkζk‾=1.

3.1step 2.1L4L6algebra

Expanding p and using step 2.1 for the exponents j+1∈{1,…,m+1} gives N−1∑k=0N−1ζkp(ζk)=0.

4.1step 1.3step 3.1step 2.2L3L11

Subtracting step 3.1 from step 2.2 and repeatedly applying the triangle inequality in [L3], justified over the finite sum by [L11], yields 1≤N−1∑k=0N−1∣ζk‾−p(ζk)∣<1, contradicting step 1.3.

5.1step 4.1step 1.2L1L2L3L5discharge-contradiction∎

Therefore z‾∉A. Since the coordinate function z belongs to A, the algebra is not self-adjoint by [L1]. The conjugation map is continuous, because z‾−w‾=z−w‾ by [L2] and ∣u‾∣2=u‾ u=∣u∣2 by [L3], so ∣z‾−w‾∣=∣z−w∣; and A is uniformly closed by step 1.2, so a function uniformly approximable by members of A lies in A. Hence z‾ is a member of C(D,C) that A cannot approximate uniformly, and A is not dense.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Trigonometric polynomials are uniformly dense on the unit circle

Example

Let T:={z∈C:∣z∣=1} be the unit circle. A complex trigonometric polynomial on T is a finite Laurent sum z⟼∑j=−nnajzj, where n∈N and aj∈C. The complex trigonometric polynomials are uniformly dense in C(T,C).

Facts & Assumptions

Given: The unit circle T with the subspace topology from the usual complex metric, and the algebra T of complex trigonometric polynomials on it.

[L1]

Every unital point-separating self-adjoint complex function algebra on a compact Hausdorff space is uniformly dense in the full complex continuous-function space (Complex Stone–Weierstrass dichotomy for separating self-adjoint algebras; the unital case is dense).

[L2]

A complex function algebra is self-adjoint when it contains each pointwise conjugate, unital when it contains all constants, and point-separating when it distinguishes every distinct pair (Self-adjoint complex function algebras, unitality, and point separation).

[L3]

Under C=R2, dC(z,w)=∣z−w∣ is the Euclidean metric (The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane).

[L4]

For z=a+bi, z‾=a−bi and ∣z∣=a2+b2 (Real and imaginary parts, complex conjugation, and modulus).

[L5]

Complex conjugation is a real-field automorphism with z+w‾=z‾+w‾, zw‾=z‾ w‾ and z‾‾=z; and for every z,w∈C, zz‾=∣z∣2, ∣zw∣=∣z∣∣w∣ and ∣z+w∣≤∣z∣+∣w∣ (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[L7]

Natural powers satisfy z0=1 and zn+1=znz, while negative integer powers of nonzero z are powers of its inverse (Integer powers in the complex field).

[L9]

A compact subset of a metric space is compact as a topological subspace of its metric topology, and conversely (For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide, clause 2).

[L10]

Every metric space is Hausdorff: distinct points are separated by disjoint open balls (Distinct points of a metric space have disjoint balls around them).

Verification

technique · direct
1.1L3L4L5L8L9L10

The reverse triangle inequality from [L5] makes z↦∣z∣ continuous, so T={∣z∣=1} is closed; it is bounded. Thus [L3], [L8], and [L9] make T compact, and [L10] makes it Hausdorff.

1.2L5L6L7algebra

For z∈T, [L5] gives zz‾=1, so uniqueness of the inverse in the field [L6] gives z−1=z‾; consequently [L7] gives z−r=(z‾)r for every natural r.

2.1step 1.2L2L3L5L7algebra

Finite Laurent sums are closed under complex linear combinations and products, contain every constant and the coordinate function z↦z, and therefore separate points; conjugating such a sum conjugates its coefficients and reverses its exponents by step 1.2, so T is self-adjoint. Every member of T is also continuous, so T is a subalgebra of C(T,C): step 1.2 rewrites a Laurent sum as ∑j≥0ajzj+∑j<0aj(z‾)−j on T; conjugation satisfies ∣z‾−w‾∣=∣z−w∣, because z‾−w‾=z−w‾ and ∣u‾∣2=u‾ u=∣u∣2 by [L5]; and the identity ur−vr=(u−v)∑k=0r−1ukvr−1−k of [L7] with ∣zw∣=∣z∣∣w∣ and ∣z+w∣≤∣z∣+∣w∣ from [L5] gives ∣ur−vr∣≤r∣u−v∣ whenever ∣u∣=∣v∣=1, so each Laurent sum is Lipschitz for the metric of [L3].

3.1step 1.1step 2.1L1∎

The algebra T is a unital, point-separating, self-adjoint complex function algebra on the compact Hausdorff circle from step 1.1, so [L1] makes it uniformly dense in C(T,C).

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-16Open item page →

The lattice generated by the constants and the distance functions is dense on every compact metric space

Example

Let (X,d) be a compact metric space. Let L be the smallest real vector sublattice of C(X,R) containing every constant function and every distance function da:X⟶R,da(x):=d(a,x)(a∈X). Then L is uniformly dense in C(X,R): for every f∈C(X,R) and every ε>0 there is g∈L with ∣g(x)−f(x)∣<ε for every x∈X. When X is nonempty this is density for the topology of uniform convergence.

Facts & Assumptions

Given: A compact metric space (X,d) and the real vector sublattice L generated by constants and the distance functions da.

[L1]

On a compact Hausdorff space, a unital point-separating real vector sublattice contains, for every f∈C(X,R) and every ε>0, a member within ε of f at every point; for nonempty X this is density for the topology of uniform convergence (Lattice Stone–Weierstrass theorem on a compact Hausdorff space).

[L2]

A unital real vector sublattice contains all constants and separates points when every distinct pair is distinguished by one member (Unital point-separating real vector sublattices of C(X,R)).

[L3]

A metric satisfies d(x,y)=0 exactly when x=y, symmetry, and d(x,z)≤d(x,y)+d(y,z) (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[L4]

A metric space is compact if and only if it is compact as a topological space in its metric topology (For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide, clause 1).

[L5]

Every metric space is Hausdorff: distinct points are separated by disjoint open balls (Distinct points of a metric space have disjoint balls around them).

Verification

technique · direct
1.1L4L5

By [L4] and [L5], the metric topology makes X a compact Hausdorff space.

1.2L3algebra

For a,x,y∈X, the triangle inequality and symmetry in [L3] give d(a,x)≤d(a,y)+d(x,y) and d(a,y)≤d(a,x)+d(x,y); hence ∣da(x)−da(y)∣≤d(x,y), so every da is continuous.

2.1step 1.2L2L3

The generated lattice L is unital by construction. If x≠y, then dx(x)=0 while dx(y)=d(x,y)≠0 by [L3], so dx∈L separates x and y; thus L is point-separating in the sense of [L2].

3.1step 1.1step 2.1L1∎

Apply [L1] to the unital point-separating real vector sublattice L on the compact Hausdorff space of step 1.1.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

On a finite compact Hausdorff space a unital separating algebra contains every scalar-valued function

Example

Let X be a finite compact Hausdorff space and let F be either R or C. If A⊆C(X,F) is a unital point-separating F-function algebra, then A=C(X,F)=FX. Thus on a finite Hausdorff space uniform approximation strengthens to exact interpolation. In the complex case no self-adjointness hypothesis is needed.

Facts & Assumptions

Given: A finite compact Hausdorff space X, a scalar field F∈{R,C}, and a unital point-separating F-function algebra A⊆C(X,F).

[L1]

A real function algebra is a real vector subspace closed under pointwise multiplication; unitality supplies all constants and point separation supplies a member distinguishing each distinct pair (Unital, point-separating, and nowhere-vanishing real function algebras on a compact Hausdorff space).

[L2]

A complex function algebra is a complex vector subspace closed under pointwise multiplication, with the same literal unitality and point-separation clauses; self-adjointness is a separate condition (Self-adjoint complex function algebras, unitality, and point separation).

[L3]

Every natural-number-indexed list of nonempty sets has a choice function on its family of values, and this finite choice uses no form of the Axiom of Choice (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

[L4]

In this library, a finite family is empty or has an explicit finite listing; in particular, a finite space is listable (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, finiteness convention).

Verification

technique · direct
1.1L1L2

If X=∅, then FX has only the empty function, which is the zero element of A. If X={x}, every function is constant, so unitality gives A=FX.

1.2L3L4L5choose

Assume X has at least two points and use [L4] to list its points. For a fixed x∈X, [L5] supplies, for each listed y≠x, a nonempty set of open neighbourhoods of x missing y; [L3] chooses one from each member of this finite list. Their intersection is the open singleton {x}. Hence every singleton is open and every function X→F is continuous.

1.3L1L2L3L4choosealgebra

For every ordered pair x≠y, point separation in [L1] or [L2] gives fxy∈A with fxy(x)≠fxy(y); by [L3] and the finite listing in [L4], choose these over the finite list of ordered pairs and define hxy:=(fxy−fxy(y))/(fxy(x)−fxy(y))∈A. Then hxy(x)=1 and hxy(y)=0.

2.1step 1.3L1L2L4algebra

For each x∈X, the finite product ex:=∏y≠xhxy belongs to A, equals 1 at x, and equals 0 at every other point because the factor indexed by that point vanishes.

3.1step 1.2step 2.1L1L2L4algebra∎

For any function φ:X→F, the finite sum ∑x∈Xφ(x)ex belongs to A and agrees with φ at every point. By step 1.2 every such φ is continuous, so A=C(X,F)=FX.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Endpoint-duplicating functions on [0,1] become all continuous functions on the endpoint quotient

Example

Let A:={f∈C([0,1],R):f(0)=f(1)}. Then A is a uniformly closed unital real function algebra. Its indistinguishability relation identifies exactly the two endpoints 0 and 1, and the descent map identifies A isometrically with all continuous real-valued functions on the endpoint quotient [0,1]/{0,1}.

Facts & Assumptions

Given: The closed interval [0,1], the endpoint-equality algebra A, and its indistinguishability quotient.

[L1]

For a uniformly closed unital real function algebra on a compact Hausdorff space, descent is a unital algebra isomorphism onto the full continuous real function algebra of its indistinguishability quotient, and it is isometric when the space is nonempty (A closed unital real function algebra is C(Y,R) on its indistinguishability quotient).

[L2]

The indistinguishability relation is x∼Ay exactly when f(x)=f(y) for every f∈A (The quotient that identifies points indistinguishable by a real function algebra).

[L3]

For a≤b, every family of open subsets of R whose union contains [a,b] has a finite subfamily whose union already contains [a,b] (Heine-Borel by bisection: every closed bounded interval [a,b] is compact).

[L4]

A subset A of a topological space X is a compact subset — that is, the subspace (A,TA) is a compact space — if and only if every family of open subsets of X whose union contains A has a finite subfamily whose union contains A, or else A=∅ (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, clause 1).

[L5]

The function dR(s,t)=∣s−t∣ is a metric on R, and its metric topology is the usual topology (The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded).

[L6]

Every metric space is Hausdorff: distinct points are separated by disjoint open balls (Distinct points of a metric space have disjoint balls around them).

[L9]

For continuous f,g:X→R on a topological space, f+g, fg, ∣f∣, max⁡(f,g) and min⁡(f,g) are continuous (Sums, products, absolute values, finite maxima and minima, and quotients of continuous real-valued maps on a topological space are continuous where defined).

[L10]

A map is continuous when the preimage of every open set containing an image point contains an open set around that point (Continuity of a map of topological spaces at a point and globally).

Verification

technique · direct
1.1L3L4L5L6L7

By [L3] and the equivalence in [L4], the subspace [0,1] of R is a compact topological space. By [L5] and [L6] the line R is Hausdorff, so [L7] makes the subspace [0,1] Hausdorff.

1.2givenalgebra

Endpoint equality is preserved by pointwise sums, real scalar multiples, and products, and every constant has equal endpoint values, so A is a unital real function algebra.

1.3givenalgebra

If g is uniformly approximable by members of A, then for every ε>0 some f∈A satisfies ∣g(0)−f(0)∣<ε/2 and ∣g(1)−f(1)∣<ε/2; since f(0)=f(1), this forces g(0)=g(1). Hence A is uniformly closed.

1.4L8L9L10constructalgebra

For c∈(0,1) let ι:[0,1]→R be the inclusion and put tc:=min⁡{c−1ι, (1−c)−1(1−ι)}. A constant map is continuous because the preimage of every open set is ∅ or all of [0,1], which is the condition in [L10]; ι is continuous by [L8]; so [L9] makes the two affine maps and their pointwise minimum continuous. For 0≤x≤c one has x/c≤1≤(1−x)/(1−c), and for c≤x≤1 the two inequalities reverse, so tc(x)=x/c on [0,c] and tc(x)=(1−x)/(1−c) on [c,1]. Hence tc(0)=tc(1)=0, so tc∈A; also tc(c)=1, and tc(x)>0 for 0<x<1, so tc vanishes only at the two endpoints.

2.1step 1.4L2

Every member of A identifies 0 and 1. Conversely, if x≠y and {x,y}≠{0,1}, at least one of the two points is interior; choosing that point as c in step 1.4 gives a tent function taking value 1 there and a value strictly below 1 at the other point. Thus [L2] says that the only nonsingleton equivalence class is {0,1}.

3.1step 1.1step 1.2step 1.3step 2.1L1∎

Steps 1.1, 1.2, and 1.3 meet the hypotheses of [L1], and step 2.1 identifies its quotient; since [0,1] is nonempty, [L1] gives the isometric conclusion, so descent is an isometric unital algebra isomorphism A≅C([0,1]/{0,1},R).

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The polynomial algebra is dense but not closed on a nondegenerate compact interval

Example

Let a<b be real numbers, and let P[a,b] be the real algebra of restrictions to [a,b] of real polynomials. Then P[a,b] is uniformly dense in C([a,b],R) but is not uniformly closed.

Facts & Assumptions

Given: Reals a<b and the algebra P[a,b] of restricted real polynomials.

[L1]

Every unital point-separating real function algebra on a compact Hausdorff space is uniformly dense in the full real continuous-function space (Real Stone–Weierstrass theorem for compact Hausdorff spaces).

[L2]

For a≤b, every continuous real function on [a,b] is a uniform limit of polynomials (Polynomials are uniformly dense in C([a,b],R) for every closed interval).

[L3]

A nonzero real polynomial of degree n has at most n distinct real roots (A nonzero real polynomial of degree n has no more than n distinct real roots).

[L4]

For a≤b, every family of open subsets of R whose union contains [a,b] has a finite subfamily whose union already contains [a,b] (Heine-Borel by bisection: every closed bounded interval [a,b] is compact).

[L5]

The function dR(s,t)=∣s−t∣ is a metric on R, and its metric topology is the usual topology (The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded).

[L6]

Every metric space is Hausdorff: distinct points are separated by disjoint open balls (Distinct points of a metric space have disjoint balls around them).

[L7]

A subset A of a topological space X is a compact subset — that is, the subspace (A,TA) is a compact space — if and only if every family of open subsets of X whose union contains A has a finite subfamily whose union contains A, or else A=∅ (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, clause 1).

[L10]

For continuous f,g:X→R on a topological space, f+g, fg and ∣f∣ are continuous (Sums, products, absolute values, finite maxima and minima, and quotients of continuous real-valued maps on a topological space are continuous where defined).

[L11]

A map is continuous when the preimage of every open set containing an image point contains an open set around that point (Continuity of a map of topological spaces at a point and globally).

Verification

technique · direct
1.1L4L5L6L7L8

By [L4] and the equivalence in [L7], the subspace [a,b] of R is a compact topological space; by [L5] and [L6] the line R is Hausdorff, so [L8] makes the subspace [a,b] Hausdorff.

1.2L9L10L11givenalgebra

Put c:=(a+b)/2, so a<c<b, let ι:[a,b]→R be the inclusion, and put h:=∣ι−c∣, so that h(x)=∣x−c∣. A constant map is continuous because the preimage of every open set is ∅ or all of [a,b], which is the condition in [L11]; ι is continuous by [L9]; so [L10] makes ι−c and then h continuous.

2.1step 1.1step 1.2L1L2algebra

The restricted polynomials form a unital real function algebra, and the coordinate polynomial x↦x separates distinct points; hence [L1] makes P[a,b] uniformly dense in C([a,b],R). In particular, [L2] also places the continuous function h from step 1.2 in its uniform closure.

2.2step 1.2L3algebra

Suppose a real polynomial p agreed with h on [a,b]. Then q(x):=p(x)−(x−c) vanishes at every x∈[c,b]; if q were nonzero, that nondegenerate interval would contain more distinct roots than the finite bound in [L3], so q is the zero polynomial and p(x)=x−c identically.

3.1step 1.2step 2.2algebra

Evaluating the identity from step 2.2 at a gives p(a)=a−c<0, whereas h(a)=∣a−c∣=c−a>0, a contradiction. Therefore h∉P[a,b].

4.1step 2.1step 3.1∎

Step 2.1 puts h in the uniform closure and step 3.1 keeps it outside P[a,b], so P[a,b] is not closed; together with the density in step 2.1 this proves the example.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

A continuous real function on [0,1] whose every moment ∫01xnf vanishes is identically zero

Statement

Let f:[0,1]→R be continuous (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point) and suppose that

∫01xnf(x) dx  =  0for every n∈N.

Then f(x)=0 for every x∈[0,1].

The hypothesis includes n=0, which reads ∫01f=0. Continuity is doing real work here rather than tidying: the last step of the proof is A continuous f≥0 on [a,b] with ∫abf=0 is identically 0, and its companion FALSE: a nonnegative Riemann integrable function on [a,b] with ∫abf=0 is identically zero shows that a merely integrable nonnegative function with integral 0 need not be identically zero.

Facts & Assumptions

Given: A continuous f:[0,1]→R with ∫01xnf(x) dx=0 for every n∈N.

[L1]

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

[L2]

Sums, scalar multiples and products of functions continuous at a point are continuous at that point; and, with no hypothesis at all, every constant function, the identity, every x↦xn for n∈N, and every polynomial function with real coefficients are continuous (Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function).

[L3]

For reals a<b, a continuous g:[a,b]→R is bounded and Riemann integrable on [a,b] (A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion).

[L4]

For reals a<b, integrable g,h:[a,b]→R and reals λ,μ, the function λg+μh is integrable on [a,b] and ∫ab(λg+μh)=λ∫abg+μ∫abh (Integrable functions on [a,b] form a set closed under sums and scalar multiples, and ∫ab(λf+μg)=λ∫abf+μ∫abg).

[L5]

For reals a<b and integrable g:[a,b]→R: if g(x)≥0 for every x∈[a,b] then ∫abg≥0; and if m≤g(x)≤M for every x∈[a,b] with m,M real, then m(b−a)≤∫abg≤M(b−a) (If f≤g on [a,b] and both are integrable then ∫abf≤∫abg; and m(b−a)≤∫abf≤M(b−a)).

[L7]

For reals a<b, if g:[a,b]→R is continuous with g(x)≥0 for every x∈[a,b] and ∫abg=0, then g(x)=0 for every x∈[a,b] (A continuous f≥0 on [a,b] with ∫abf=0 is identically 0).

Proof

technique · direct
1.1givenL2L3

For each n∈N the function x↦xn is continuous on [0,1], so x↦xnf(x) is continuous on [0,1] as a product of continuous functions, and is therefore integrable; so each integral in the hypothesis is defined.

1.2givenL3choose

f is bounded and integrable on [0,1], so there is a real M>0 with ∣f(x)∣≤M for every x∈[0,1]; if the bound supplied is 0, replace it by 1.

1.3givenL2L3L5

f2 is continuous on [0,1] as a product of continuous functions, hence integrable, and f(x)2≥0 for every x∈[0,1], so ∫01f2≥0.

2.1step 1.1L4givenalgebra

Let p(x)=a0+a1x+⋯+amxm be any real polynomial. Each x↦ajxjf(x) is integrable by step 1.1, and applying the linearity identity m times to the finite sum gives ∫01pf=∑j≤maj∫01xjf, every summand of which is 0 by hypothesis, so ∫01pf=0.

2.2step 1.2L1choose

Let ε>0. Choose a polynomial p with sup⁡x∈[0,1]∣p(x)−f(x)∣<ε/M, which is legitimate since ε/M>0 by step 1.2.

3.1step 1.1step 2.1step 2.2L2L3L4L6algebra

The polynomial p chosen in step 2.2 is continuous on [0,1] by [L2] and hence integrable by [L3]; so f−p is integrable by [L4], and both (f−p)f and pf are integrable by [L6]. Since f2=(f−p)f+pf pointwise on [0,1], [L4] gives ∫01f2=∫01(f−p)f+∫01pf, and the second term is 0 by step 2.1, giving ∫01f2=∫01(f−p)f.

3.2step 1.2step 2.2L5algebra

For every x∈[0,1], ∣f(x)−p(x)∣ ∣f(x)∣<(ε/M)⋅M=ε by steps 1.2 and 2.2, so −ε≤(f−p)(x)f(x)≤ε on [0,1]; since 1−0=1, the two-sided bound gives ∫01(f−p)f≤ε.

4.1step 1.3step 3.1step 3.2

Combining, 0≤∫01f2≤ε.

5.1step 4.1algebra

Step 4.1 holds for every ε>0, and the value ∫01f2 does not depend on ε; were it positive, taking ε to be half of it would contradict step 4.1, so ∫01f2=0.

6.1step 1.3step 5.1L7algebra∎

f2 is continuous on [0,1], nonnegative there, and has integral 0 by step 5.1, so f(x)2=0 for every x∈[0,1], and hence f(x)=0 for every x∈[0,1].

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Every continuous function on [0,1] is uniformly approximated by everywhere-differentiable functions whose derivative vanishes at a prescribed point

Statement

Let c∈(0,1), let f∈C([0,1],R) and let ε>0. Then there is a function g:R→R, differentiable at every real point (The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set), with

g′(c)  =  0andsup⁡x∈[0,1]∣f(x)−g(x)∣  <  ε.

Since a function differentiable at every real point is continuous there, the restrictions to [0,1] of the everywhere-differentiable functions with vanishing derivative at c are uniformly dense in C([0,1],R).

The source states this for c=1/2 and for differentiability on (0,1); the statement above is the altered form obtained by letting the point be arbitrary and by producing an approximant differentiable on all of R, which is what the construction below actually delivers. Nothing in the proof uses 0<c<1; the restriction to (0,1) is kept only so that c is an interior point of the interval on which the approximation is measured.

Facts & Assumptions

Given: A point c∈(0,1), a function f∈C([0,1],R) and a real ε>0.

[L1]

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

[L3]

Let A⊆R, let c∈A be a limit point of A, let u,v:A→R be differentiable at c and let α∈R. Then u+v is differentiable at c with (u+v)′(c)=u′(c)+v′(c), and αu is differentiable at c with (αu)′(c)=αu′(c) (Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0).

[L4]

Let A,B⊆R, let v:A→R with v[A]⊆B and let u:B→R. Let c∈A be a limit point of A at which v is differentiable, put b:=v(c), and suppose b is a limit point of B at which u is differentiable. Then u∘v is differentiable at c and (u∘v)′(c)=u′(v(c)) v′(c) (The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c)).

[L5]

The functions sin⁡ and cos⁡ are differentiable on R, with (sin⁡x)′=cos⁡x and (cos⁡x)′=−sin⁡x; also sin⁡0=0 and cos⁡0=1 (The derivatives of sine and cosine are cosine and minus sine).

[L6]

For every real x, sin⁡2x+cos⁡2x=1; consequently ∣sin⁡x∣≤1 and ∣cos⁡x∣≤1 (Parity and the Pythagorean identity for sine and cosine).

[L7]

A function differentiable at a point is continuous at that point (A function differentiable at c is continuous at c).

[L8]

For every ε>0 in a complete ordered field there is a natural number 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.1givenL1choose

By [L1] choose a polynomial p with sup⁡x∈[0,1]∣p(x)−f(x)∣<ε/3.

2.1step 1.1L2

p is differentiable at every real point; put a:=p′(c). Every real point is a limit point of R, so the derivatives below are all defined symbols.

3.1step 1.1step 2.1algebra

Case a=0. Put g:=p. Then g is differentiable at every real point with g′(c)=a=0, and sup⁡x∈[0,1]∣f(x)−g(x)∣<ε/3<ε, which is the assertion.

3.2step 2.1L8choose

Case a≠0. Then ∣a∣>0, so ε/(3∣a∣)>0, and by [L8] there is a natural number λ≥1 with 1/λ<ε/(3∣a∣).

4.1step 3.2choose

Define v:R→R by v(x)=λ(x−c) and g:R→R by g(x)=p(x)−(a/λ)sin⁡(v(x)).

5.1step 4.1L2algebra

v(x)=λ(x−c) is the polynomial function with a0=−λc and a1=λ, so [L2] makes it differentiable at every real point with v′(x)=1⋅λ⋅x0=λ; substituting x=c gives v(c)=0.

5.2step 3.2step 4.1L6algebra

For every x∈[0,1], ∣g(x)−p(x)∣=(∣a∣/λ) ∣sin⁡(v(x))∣≤∣a∣/λ<ε/3, using ∣sin⁡∣≤1 and step 3.2.

6.1step 5.1L4L5

Since sin⁡ is differentiable at every real point and every real point is a limit point of R, the chain rule applies to sin⁡∘ v at every real x and gives (sin⁡∘ v)′(x)=cos⁡(v(x)) λ.

6.2step 1.1step 5.2algebra

For every x∈[0,1], ∣f(x)−g(x)∣≤∣f(x)−p(x)∣+∣p(x)−g(x)∣<ε/3+ε/3=2ε/3, so 2ε/3 is an upper bound for ∣f−g∣ on [0,1] and therefore sup⁡x∈[0,1]∣f(x)−g(x)∣≤2ε/3<ε.

7.1step 2.1step 4.1step 6.1L3algebra

By [L3], g is differentiable at every real point, with g′(x)=p′(x)−(a/λ)λcos⁡(v(x))=p′(x)−acos⁡(v(x)).

8.1step 2.1step 5.1step 7.1L5algebra

At x=c we have v(c)=0 and cos⁡0=1, so g′(c)=p′(c)−a⋅1=a−a=0.

9.1step 3.1step 8.1step 6.2

In both cases a function g:R→R differentiable at every real point has been produced with g′(c)=0 and sup⁡x∈[0,1]∣f(x)−g(x)∣<ε, which is the first assertion.

10.1step 9.1L7∎

Such a g is continuous at every real point, so its restriction to [0,1] lies in C([0,1],R); since f∈C([0,1],R) and ε>0 were arbitrary, these restrictions are uniformly dense in C([0,1],R), which is the second assertion.

Sources