Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

The Dirichlet function is the pointwise limit of a sequence of Baire class one functions and is itself not Baire class one, so the Baire hierarchy on [0,1] is already strict at the first level

Example

Let D:[0,1]→R be the restriction to [0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length) of the Dirichlet function (The Dirichlet function 1Q, and Thomae's function t with t(x)=1/q at a rational x=p/q in lowest terms with q≥1 and t(x)=0 at every irrational x), so D(x)=1 at a rational x and D(x)=0 at an irrational x. Then:

  1. D is the pointwise limit on [0,1] of a sequence (gm)m∈N of functions each of which is of Baire class one on [0,1] (Pointwise convergence of a sequence of real functions, and the Baire class one functions as the pointwise limits of sequences of continuous functions), namely the indicators of the finite sets {s(0),…,s(m)} for a fixed surjection s:N→Q∩[0,1];
  2. D is not of Baire class one on [0,1].

So the class of pointwise limits of sequences of Baire class one functions is strictly larger than the class of Baire class one functions. That larger class is classically called Baire class two; no definition of it is given in this library and none is used, the statement above being phrased entirely in terms of pointwise limits (Pointwise convergence of a sequence of real functions, and the Baire class one functions as the pointwise limits of sequences of continuous functions).

Facts & Assumptions

Given: The Dirichlet function restricted to [0,1], written D, and Q for the canonical copy of the rationals inside R (The rationals embed densely in the reals).

[L1]

Q∩[0,1] is nonempty and at most countable, so it is the image of a surjection s:N→Q∩[0,1] (Q is countably infinite, Finite, countably infinite, countable, uncountable, A nonempty set is at most countable iff it is a surjective image of N, The rationals embed densely in the reals).

[L5]

A nonempty finite set of reals presented as {a0,…,am} has a minimum, which is one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L7]

∣u−w∣≤∣u−v∣+∣v−w∣ and ∣u∣≥0 (Basic properties of the absolute value); a sequence of reals converges to L when it is eventually within every positive ε of L (Limits and Cauchy sequences of reals, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

Verification

technique · contradiction
1.1

Fix a surjection s:N→Q∩[0,1] and, for m∈N, let gm:[0,1]→R be the indicator of {s(0),…,s(m)}: gm(x)=1 if x=s(j) for some j≤m, and gm(x)=0 otherwise.

L1construct
1.2

Suppose, for contradiction, that D is of Baire class one on [0,1].

assume-contra
1.3

But D is continuous at no point of [0,1]. Let c∈[0,1] and let δ>0 be real; put u:=max⁡{0, c−δ/2} and v:=min⁡{1, c+δ/2}, so that u<v and [u,v]⊆[0,1]∩Nδ(c), the strict inequality holding because c∈[0,1], 0<1 and δ>0. The nondegenerate interval (u,v) contains a rational y1 and an irrational y2, with D(y1)−D(y2)=1, so one of ∣D(y1)−D(c)∣ and ∣D(y2)−D(c)∣ equals 1; hence no δ witnesses continuity at c for ε=1. This is the argument of the Dirichlet claim, restricted to the domain [0,1].

A1L2L7L8
2.1

For m∈N define ρm:[0,1]→R by ρm(x):=min⁡{ ∣x−s(j)∣:j≤m }, the minimum of a nonempty finite set of reals. Then ρm(x)≥0, and ρm(x)=0 exactly when x=s(j) for some j≤m, the minimum being attained.

step 1.1L5L7
2.2

Then the set of points of [0,1] at which D is continuous is dense in [0,1], since 0<1; in particular it is nonempty.

step 1.2L3
3.1

ρm is 1-Lipschitz, hence continuous: choosing j0≤m with ρm(x)=∣x−s(j0)∣ gives ρm(y)≤∣y−s(j0)∣≤∣y−x∣+ρm(x), and exchanging x and y gives ∣ρm(x)−ρm(y)∣≤∣x−y∣; so δ:=ε witnesses continuity at every point.

step 2.1L4L5L7
4.1

For m,n∈N define hm,n:[0,1]→R by hm,n(x):=max⁡{ 0, 1−ι(n) ρm(x) }; the index runs over the whole of N, the term at n=0 being the constant 1 since ι(0)=0, so that n↦hm,n is a sequence in the sense of Sequences of reals: bounded, eventually, frequently, tails, subsequences. Each hm,n is continuous on [0,1], being the pointwise maximum of the constant 0 and the continuous function x↦1−ι(n)ρm(x).

step 3.1L4L6
5.1

For each fixed m the sequence n↦hm,n converges pointwise on [0,1] to gm. If ρm(x)=0 then hm,n(x)=max⁡{0,1}=1=gm(x) for every n. If ρm(x)>0 then, taking a natural n0≥1 with ι(n0)>1/ρm(x), every n≥n0 has ι(n)ρm(x)≥ι(n0)ρm(x)>1, so hm,n(x)=0=gm(x).

step 2.1step 4.1L6L7
6.1

Hence each gm is of Baire class one on [0,1], being the pointwise limit of a sequence of continuous functions.

step 4.1step 5.1
7.1

The sequence (gm)m∈N converges pointwise on [0,1] to D. If x∈Q∩[0,1] then x=s(k) for some k, since s is onto, and gm(x)=1=D(x) for every m≥k. If x∈[0,1] is irrational then x≠s(j) for every j, so gm(x)=0=D(x) for every m. Claim 1 is proved.

step 1.1step 6.1A1L1L7
8.1

Steps 2.2 and 1.3 contradict one another, so the assumption of step 1.2 is false and D is not of Baire class one on [0,1]: claim 2 holds, and with step 7.1 the example is complete.

step 7.1step 1.2step 2.2step 1.3discharge-contradiction∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

90 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources