Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

For the Dirichlet function every uniform partition with rational tags gives Riemann sum 11, so the sums converge along that sequence of tagged partitions although the function is not integrable: the mesh condition of the Riemann definition quantifies over all tagged partitions and cannot be weakened to one sequence

Statement refuted

Refuted: that a bounded ff on [a,b][a,b] is Riemann integrable with integral II as soon as there is one sequence (PN,ξN)(P_N,\xi^N) of tagged partitions with PN0\|P_N\| \to 0 and S(f,PN,ξN)IS(f,P_N,\xi^N) \to I (Tagged partitions of [a,b][a,b], with a tag ξi\xi_i in each subinterval, and the Riemann sum S(f,P,ξ)=if(ξi)ΔiS(f,P,\xi) = \sum_i f(\xi_i)\,\Delta_i, The lower and upper Darboux integrals of a bounded ff on [a,b][a,b] as supPL(f,P)\sup_P L(f,P) and infPU(f,P)\inf_P U(f,P), Darboux integrability as their equality, and the notation abf\int_a^b f).

The witness is again the Dirichlet function on [0,1][0,1] (The Dirichlet function 1Q1_{\mathbb{Q}}, and Thomae's function tt with t(x)=1/qt(x) = 1/q at a rational x=p/qx = p/q in lowest terms with q1q \ge 1 and t(x)=0t(x) = 0 at every irrational xx). Take PN:=UNP_N := U_N, the uniform partition into N1N \ge 1 parts, and tag each subinterval by its left endpoint ξiN:=ι(i)/ι(N)\xi^N_i := \iota(i)/\iota(N), a rational. Then

UN=1ι(N)0,S(1Q,UN,ξN)=1  for every N1,\|U_N\| = \frac{1}{\iota(N)} \longrightarrow 0, \qquad S(\mathbf{1}_{\mathbb{Q}}, U_N, \xi^N) = 1 \ \text{ for every } N \ge 1,

so the Riemann sums converge, to 11; and yet 1Q\mathbf{1}_{\mathbb{Q}} is not Riemann integrable on [0,1][0,1] (The Dirichlet function on [0,1][0,1] has lower Darboux integral 00 and upper Darboux integral 11, so it is bounded and not Riemann integrable).

What this shows about The Darboux and Riemann definitions agree: a bounded ff on [a,b][a,b] is Darboux integrable with integral II if and only if for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that S(f,P,ξ)I<ε|S(f,P,\xi) - I| < \varepsilon for every tagged partition of mesh below δ\delta. Condition 2 there quantifies over every tagged partition of mesh below δ\delta, tags included, and the quantifier cannot be replaced by the existence of one good sequence. Tagging the very same partition by irrationals instead gives Riemann sum 00, so for each NN the two taggings of UNU_N give the two values 11 and 00; no real number is within 1/21/2 of both.

Facts & Assumptions

Given: g:[0,1]Rg : [0,1] \to \mathbb{R} with g(x)=1g(x) = 1 for rational xx and g(x)=0g(x) = 0 for irrational xx; for N1N \ge 1 the uniform partition UN=(N,t)U_N = (N,t) of [0,1][0,1] with ti=ι(i)/ι(N)t_i = \iota(i)/\iota(N) and Δi=1/ι(N)\Delta_i = 1/\iota(N); and the tagging ξN\xi^N with ξiN:=ti\xi^N_i := t_i for i<Ni < N.

[A1]

The refuted claim: if some sequence of tagged partitions of [0,1][0,1] has meshes tending to 00 and Riemann sums tending to II, then gg is Riemann integrable with integral II.

[L1]

For UNU_N: ti=ι(i)/ι(N)[0,1]t_i = \iota(i)/\iota(N) \in [0,1], ti<ti+1t_i < t_{i+1}, Δi=1/ι(N)\Delta_i = 1/\iota(N), i<NΔi=1\sum_{i<N}\Delta_i = 1, and UN=1/ι(N)\|U_N\| = 1/\iota(N) (Partition of [a,b][a,b] as a finite strictly increasing list a=t0<t1<<tn=ba = t_0 < t_1 < \dots < t_n = b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L2]

ξiN:=tiIi\xi^N_i := t_i \in I_i defines a tagging of UNU_N, and S(g,UN,ξN)=i<Ng(ξiN)ΔiS(g,U_N,\xi^N) = \sum_{i<N}g(\xi^N_i)\Delta_i (Tagged partitions of [a,b][a,b], with a tag ξi\xi_i in each subinterval, and the Riemann sum S(f,P,ξ)=if(ξi)ΔiS(f,P,\xi) = \sum_i f(\xi_i)\,\Delta_i).

[L4]

Finite sums: scaling and i<N1Δi=i<NΔi\sum_{i<N}1 \cdot \Delta_i = \sum_{i<N}\Delta_i (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L5]

A constant sequence converges to its value; and for every real η>0\eta > 0 there is N1N \ge 1 with 1/ι(N)<η1/\iota(N) < \eta, so the sequence N1/ι(N)N \mapsto 1/\iota(N) converges to 00, its terms being positive and decreasing below every positive bound (Limits and Cauchy sequences of reals, Sequences of reals: bounded, eventually, frequently, tails, subsequences, For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Every complete ordered field is Archimedean, Canonical naturals are positive and strictly increasing, Basic properties of the absolute value).

[L9]

Ordered-field arithmetic: the order is total and transitive, ι(N)>0\iota(N) > 0 for N1N \ge 1, and 010 \ne 1 (Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Counterexample

technique · direct
1.1

For each N1N \ge 1, (UN,ξN)(U_N,\xi^N) is a tagged partition of [0,1][0,1] of mesh 1/ι(N)1/\iota(N), by [L1] and [L2].

givenL1L2
1.2

By [L3] every tag ξiN=ti\xi^N_i = t_i is rational, so g(ξiN)=1g(\xi^N_i) = 1; hence by [L2], [L4] and [L1], S(g,UN,ξN)=i<N1Δi=i<NΔi=1S(g,U_N,\xi^N) = \sum_{i<N}1\cdot\Delta_i = \sum_{i<N}\Delta_i = 1.

givenL1L2L3L4
2.1

The sequence NUN=1/ι(N)N \mapsto \|U_N\| = 1/\iota(N) converges to 00 and the sequence NS(g,UN,ξN)N \mapsto S(g,U_N,\xi^N) is constantly 11, hence converges to 11, by [L5].

step 1.1step 1.2L5
3.1

So the hypothesis of [A1] is met with I:=1I := 1; but gg is not Riemann integrable on [0,1][0,1] by [L6]. [A1] is therefore refuted.

step 2.1A1L6
4.1

Moreover, for each N1N \ge 1 the same partition carries a tagging whose Riemann sum is 00: by [L7] each open interval (ti,ti+1)(t_i,t_{i+1}) contains an irrational, and choosing one in each of the NN subintervals is a finite selection, giving a tagging ζ\zeta of UNU_N with g(ζi)=0g(\zeta_i) = 0 for every i<Ni < N and hence S(g,UN,ζ)=0S(g,U_N,\zeta) = 0 by [L2] and [L4]. So for every real δ>0\delta > 0 there are tagged partitions of mesh below δ\delta with Riemann sum 11 and others with Riemann sum 00, and by [L9] no single real II can satisfy the condition of [L8] at ε:=21\varepsilon := 2^{-1}.

step 1.1step 1.2L2L4L5L7L8L9

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 133 results over 31 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources