Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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 function equal to q at a rational p/q in lowest terms and to 0 at every irrational is finite at every point and unbounded on every nondegenerate interval

Example

Let q(x) be the least denominator of a rational x (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) and define h:R→R by

h(x):=ι(q(x))  for x∈Q,h(x):=0  for x∉Q,

where ι(q) is the canonical natural (The canonical natural ι(n)=n⋅1F of a field) and Q is the canonical copy of the rationals inside R (The rationals embed densely in the reals). Equivalently h(x)=1/t(x) at a rational x, where t is Thomae's function. Then:

  1. h(x) is a real number for every real x: h is finite at every point;
  2. h is unbounded on every nondegenerate interval (Lower bound, bounded below, bounded set, Intervals of R: the nine order-convex forms, nondegeneracy, and length): for all reals a<b and every real M there is x∈(a,b) with h(x)>M.

So a function may be finite at every single point and yet fail to be bounded on every interval, however short. In particular h is bounded on no neighbourhood of any point.

Facts & Assumptions

Given: The function h above, with q(x)=min⁡{ q∈N:q≥1 and ι(q)x∈Z } for x∈Q.

[A1]

q(x)≥1 is a natural with ι(q(x)) x∈Z, and q(x)≤q for every natural q≥1 with ι(q)x∈Z (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).

[L2]

A nonzero integer has absolute value at least 1, since no integer lies strictly between 0 and 1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1, Basic properties of the absolute value).

[L3]

For every real η>0 there is a natural n≥1 with 1/ι(n)<η, and for every real x a natural n≥1 with x<ι(n); ι is positive and strictly increasing on the naturals ≥1 (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Every complete ordered field is Archimedean, Canonical naturals are positive and strictly increasing, The canonical natural ι(n)=n⋅1F of a field).

Verification

technique · direct
1.1

Claim 1: for a rational x the value h(x)=ι(q(x)) is a canonical natural, hence a real number, and for an irrational x the value is 0. Every real falls under exactly one clause, so h is a function R→R.

A1
1.2

Separation of rationals by their denominators. Let x≠y be rationals. Then ∣x−y∣≥1/(ι(q(x)) ι(q(y))). Indeed, put q1:=q(x), q2:=q(y), p1:=ι(q1)x and p2:=ι(q2)y, all integers; then x−y=(p1ι(q2)−p2ι(q1))/(ι(q1)ι(q2)), the numerator is an integer, and it is nonzero because x≠y; so its absolute value is at least 1.

A1L2L4
2.1

Claim 2: let a<b be reals and let M be real. Take a rational x1 with a<x1<b and put q1:=q(x1). Take a natural N≥1 with M<ι(N), and put η:=min⁡{ 1ι(q1) ι(N), b−x1 }>0.

step 1.2L1L3L4
3.1

With x1, q1, N and η as in step 2.1, take a rational y with x1<y<x1+η. Then a<x1<y<b, so y∈(a,b); and y≠x1 with ∣y−x1∣<η≤1/(ι(q1)ι(N)).

step 2.1L1
4.1

Hence q(y)>N. If instead q(y)≤N then ι(q(y))≤ι(N), and step 1.2 would give ∣y−x1∣≥1/(ι(q1)ι(q(y)))≥1/(ι(q1)ι(N)), contradicting step 3.1.

step 1.2step 3.1L3
5.1

Therefore h(y)=ι(q(y))>ι(N)>M, and y∈(a,b): the values of h on (a,b) exceed every real, so h is unbounded on (a,b), and hence on every set containing it.

step 2.1step 3.1step 4.1L3∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

59 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