Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-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.

01x2=1/3\int_0^1 x^{2} = 1/3, computed from the Darboux definition with uniform partitions and the closed form k<nk2=n(n1)(2n1)/6\sum_{k<n} k^{2} = n(n-1)(2n-1)/6

Example

Let f:[0,1]Rf : [0,1] \to \mathbb{R} be f(x)=x2f(x) = x^{2} (Integer powers ama^m). Then ff is Riemann integrable on [0,1][0,1] and

01x2dx  =  13.\int_0^1 x^{2}\,\mathrm{d}x \;=\; \frac{1}{3} .

Everything is computed from the definition. For the uniform partition UNU_N of [0,1][0,1] into N1N \ge 1 parts (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) the two Darboux sums (For bounded ff on [a,b][a,b] and a partition PP: the infimum mim_i and supremum MiM_i of ff on the ii-th subinterval, and the lower and upper Darboux sums L(f,P)=imiΔiL(f,P) = \sum_i m_i \Delta_i and U(f,P)=iMiΔiU(f,P) = \sum_i M_i \Delta_i) are

L(f,UN)  =  (N1)(2N1)6N2,U(f,UN)  =  (N+1)(2N+1)6N2,U(f,UN)L(f,UN)  =  1N,L(f,U_N) \;=\; \frac{(N-1)(2N-1)}{6N^{2}}, \qquad U(f,U_N) \;=\; \frac{(N+1)(2N+1)}{6N^{2}}, \qquad U(f,U_N) - L(f,U_N) \;=\; \frac{1}{N},

where a natural NN multiplying or dividing a real stands for its canonical natural ι(N)\iota(N) (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field), as in clause 2 of Laws of finite sums and finite products. Both expressions converge to 1/31/3 as NN grows, the lower sums from below and the upper sums from above, and the gap 1/N1/N is what Archimedes' property drives to 00.

The arithmetic rests on one closed form, valid for every nNn \in \mathbb{N}:

6k<nι(k)2  =  ι(n)(ι(n)1)(2ι(n)1),6\sum_{k<n} \iota(k)^{2} \;=\; \iota(n)\bigl(\iota(n)-1\bigr)\bigl(2\iota(n)-1\bigr) ,

which at n=0n = 0 reads 0=00 = 0 and is the familiar n(n1)(2n1)/6n(n-1)(2n-1)/6 written so that the empty sum is the case n=0n = 0 rather than an exception. Note the indexing: the sum runs over k<nk < n, so its last term is ι(n1)2\iota(n-1)^{2} and not ι(n)2\iota(n)^2.

Facts & Assumptions

Given: f:[0,1]Rf : [0,1] \to \mathbb{R} with f(x)=x2f(x) = x^{2}, and 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) for iNi \le N and lengths Δi=1/ι(N)\Delta_i = 1/\iota(N).

[L1]

For UNU_N: t0=0t_0 = 0, tN=1t_N = 1, ti<ti+1t_i < t_{i+1}, Δi=1/ι(N)\Delta_i = 1/\iota(N) for i<Ni < N, i<NΔi=1\sum_{i<N}\Delta_i = 1, and Ii=[ti,ti+1]I_i = [t_i,t_{i+1}] (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]

mi=inff[Ii]m_i = \inf f[I_i], Mi=supf[Ii]M_i = \sup f[I_i], L(f,P)=i<NmiΔiL(f,P) = \sum_{i<N}m_i\Delta_i, U(f,P)=i<NMiΔiU(f,P) = \sum_{i<N}M_i\Delta_i, and L(f,P)01f01fU(f,P)L(f,P) \le \underline{\int_0^1} f \le \overline{\int_0^1} f \le U(f,P) for every partition PP; when ff is integrable, 01f\int_0^1 f is the common value of the two integrals (For bounded ff on [a,b][a,b] and a partition PP: the infimum mim_i and supremum MiM_i of ff on the ii-th subinterval, and the lower and upper Darboux sums L(f,P)=imiΔiL(f,P) = \sum_i m_i \Delta_i and U(f,P)=iMiΔiU(f,P) = \sum_i M_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).

[L3]

For 0a<b0 \le a < b one has a2<b2a^{2} < b^{2}; a set with a least element has it as its infimum and one with a greatest element has it as its supremum (Monotonicity of xxnx \mapsto x^n and of nann \mapsto a^n, Integer powers ama^m, Greatest lower bound (infimum), Maximum and minimum of a set, Complete ordered field (least-upper-bound property)).

[L4]

The closed form. For every nNn \in \mathbb{N}, 6k<nι(k)2=ι(n)(ι(n)1)(2ι(n)1)6\sum_{k<n}\iota(k)^{2} = \iota(n)(\iota(n)-1)(2\iota(n)-1). This is an induction on nn (The principle of mathematical induction) from the recursion clause k<n+1=k<n+ι(n)2\sum_{k<n+1} = \sum_{k<n} + \iota(n)^2 of Finite sums and finite products, by recursion and the identity x(x1)(2x1)+6x2=x(x+1)(2x+1)x(x-1)(2x-1) + 6x^{2} = x(x+1)(2x+1), valid in any commutative ring and in particular for x=ι(n)x = \iota(n) (Ordered field, Canonical naturals are positive and strictly increasing).

[L5]

Finite sums: scaling, additivity, telescoping i<N(ci+1ci)=cNc0\sum_{i<N}(c_{i+1}-c_i) = c_N - c_0, and ι(i+1)=ι(i)+1\iota(i+1) = \iota(i)+1 (Finite sums and finite products, by recursion, Laws of finite sums and finite products, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Canonical naturals are positive and strictly increasing).

[L8]

Ordered-field arithmetic and the absolute value: adding a constant and multiplying by a positive quantity preserve an inequality; the order is total and transitive; uvw|u - v| \le w whenever cudc \le u \le d, cvdc \le v \le d and dcwd - c \le w (Basic properties of the absolute value, 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.

Verification

technique · direct
1.1

ff is continuous on [0,1][0,1] and 0<10 < 1, so ff is Riemann integrable on [0,1][0,1] by [L6]; write J:=01fJ := \int_0^1 f.

givenL6
1.2

On Ii=[ti,ti+1]I_i = [t_i,t_{i+1}] with 0ti<ti+10 \le t_i < t_{i+1} the function ff takes its least value at tit_i and its greatest at ti+1t_{i+1}, by [L3]; both values are attained, so mi=ti2=ι(i)2/ι(N)2m_i = t_i^{2} = \iota(i)^{2}/\iota(N)^{2} and Mi=ti+12=ι(i+1)2/ι(N)2M_i = t_{i+1}^{2} = \iota(i+1)^{2}/\iota(N)^{2} by [L3] and [L1].

givenL1L3
2.1

By [L2], [L5] and [L1], L(f,UN)=i<Nι(i)2ι(N)21ι(N)=1ι(N)3i<Nι(i)2L(f,U_N) = \sum_{i<N}\frac{\iota(i)^{2}}{\iota(N)^{2}}\cdot\frac{1}{\iota(N)} = \frac{1}{\iota(N)^{3}}\sum_{i<N}\iota(i)^{2}, and by [L4] this equals ι(N)(ι(N)1)(2ι(N)1)6ι(N)3=(ι(N)1)(2ι(N)1)6ι(N)2\frac{\iota(N)(\iota(N)-1)(2\iota(N)-1)}{6\,\iota(N)^{3}} = \frac{(\iota(N)-1)(2\iota(N)-1)}{6\,\iota(N)^{2}}.

step 1.2L1L2L4L5
2.2

Likewise U(f,UN)=1ι(N)3i<Nι(i+1)2U(f,U_N) = \frac{1}{\iota(N)^{3}}\sum_{i<N}\iota(i+1)^{2}. Since i<Nι(i+1)2=k<N+1ι(k)2ι(0)2=k<N+1ι(k)2\sum_{i<N}\iota(i+1)^{2} = \sum_{k<N+1}\iota(k)^{2} - \iota(0)^{2} = \sum_{k<N+1}\iota(k)^{2} by [L5] and ι(0)=0\iota(0) = 0, [L4] applied at N+1N+1 gives U(f,UN)=(ι(N)+1)(2ι(N)+1)6ι(N)2U(f,U_N) = \frac{(\iota(N)+1)(2\iota(N)+1)}{6\,\iota(N)^{2}}.

step 1.2L1L2L4L5
2.3

Directly, U(f,UN)L(f,UN)=1ι(N)3i<N(ι(i+1)2ι(i)2)=ι(N)2ι(0)2ι(N)3=1ι(N)U(f,U_N) - L(f,U_N) = \frac{1}{\iota(N)^{3}}\sum_{i<N}\bigl(\iota(i+1)^{2} - \iota(i)^{2}\bigr) = \frac{\iota(N)^{2} - \iota(0)^{2}}{\iota(N)^{3}} = \frac{1}{\iota(N)}, by telescoping in [L5].

step 1.2L1L2L5
3.1

Expanding by [L8], 13L(f,UN)=3ι(N)16ι(N)2>0\frac{1}{3} - L(f,U_N) = \frac{3\iota(N)-1}{6\,\iota(N)^{2}} > 0 and U(f,UN)13=3ι(N)+16ι(N)2>0U(f,U_N) - \frac{1}{3} = \frac{3\iota(N)+1}{6\,\iota(N)^{2}} > 0 for N1N \ge 1, so L(f,UN)<13<U(f,UN)L(f,U_N) < \frac{1}{3} < U(f,U_N).

step 2.1step 2.2L7L8
3.2

By [L2], L(f,UN)JU(f,UN)L(f,U_N) \le J \le U(f,U_N) as well.

step 1.1step 2.1step 2.2L2
4.1

Both JJ and 1/31/3 lie in the interval with endpoints L(f,UN)L(f,U_N) and U(f,UN)U(f,U_N), whose length is 1/ι(N)1/\iota(N) by step 2.3, so J1/31/ι(N)|J - 1/3| \le 1/\iota(N) for every natural N1N \ge 1, by [L8].

step 2.3step 3.1step 3.2L8
5.1

If J1/3J \ne 1/3 then J1/3>0|J - 1/3| > 0, and [L7] supplies N1N \ge 1 with 1/ι(N)<J1/31/\iota(N) < |J - 1/3|, contradicting step 4.1. Hence J=1/3J = 1/3, that is 01x2dx=1/3\int_0^1 x^{2}\,\mathrm{d}x = 1/3.

step 4.1L7L8

Remarks

  • The first index is 00 and the last term of the lower sum is not 11. The lower sum uses mi=ti2m_i = t_i^{2} with ii running from 00, so its first term is 00 and its last is ((N1)/N)2(1/N)\bigl((N-1)/N\bigr)^{2}\cdot(1/N); the upper sum uses Mi=ti+12M_i = t_{i+1}^{2} and so ends at 1(1/N)1 \cdot (1/N). Reading the closed form with the other convention, k=1nk2=n(n+1)(2n+1)/6\sum_{k=1}^{n}k^{2} = n(n+1)(2n+1)/6, and attaching it to the wrong sum is the standard way to lose the factor and land on 1/21/2 or 1/61/6 instead of 1/31/3.

  • The gap is exactly 1/N1/N, not merely O(1/N)O(1/N). Step 2.3 computes it by telescoping without evaluating either sum, which is also the cheapest route to integrability through Riemann's criterion: a bounded ff on [a,b][a,b] is Darboux integrable if and only if for every real ε>0\varepsilon > 0 there is a partition PP with U(f,P)L(f,P)<εU(f,P) - L(f,P) < \varepsilon: the continuity of x2x^2 is not needed for that, only for the shortcut taken in step 1.1.

  • What this example does not do. No antiderivative and no fundamental theorem of calculus is used or available at this point in the reading order; the value 1/31/3 is extracted from the two sums and the Archimedean property alone. The same computation with x3x^{3} needs k<nk3\sum_{k<n}k^{3} and is no harder, but it is not carried out here.

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: 122 results over 27 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