Alphabeta Math
ExampleConstruction: 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.

One refinement worked out for f(x)=x2f(x) = x^{2} on [0,1][0,1]: adding the point 1/21/2 to the trivial partition raises the lower sum from 00 to 1/81/8 and lowers the upper sum from 11 to 5/85/8

Example

Let f:[0,1]Rf : [0,1] \to \mathbb{R} be f(x)=x2f(x) = x^{2} (Integer powers ama^m). Let P0P_0 be the trivial partition of [0,1][0,1], with point set {0,1}\{0,1\}, and let P1:=P0+12P_1 := P_0 + \tfrac12 be the partition obtained by inserting the point 1/21/2, with point set {0,12,1}\{0, \tfrac12, 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). Then

L(f,P0)=0,L(f,P1)=18,U(f,P1)=58,U(f,P0)=1,L(f,P_0) = 0, \qquad L(f,P_1) = \tfrac18, \qquad U(f,P_1) = \tfrac58, \qquad U(f,P_0) = 1 ,

so that

0  =  L(f,P0)    L(f,P1)    U(f,P1)    U(f,P0)  =  1,0 \;=\; L(f,P_0) \;\le\; L(f,P_1) \;\le\; U(f,P_1) \;\le\; U(f,P_0) \;=\; 1 ,

which is claim 1 of Refining a partition raises the lower Darboux sum and lowers the upper one, and every lower sum is at most every upper sum: L(f,P)L(f,P)U(f,P)U(f,P)L(f,P) \le L(f,P') \le U(f,P') \le U(f,P) when PP' refines PP, and L(f,P)U(f,Q)L(f,P) \le U(f,Q) for arbitrary partitions PP and QQ; moreover the two changes are at most 2M(nn)P2M(n' - n)\|P\| with both inequalities strict. The gap drops from U(f,P0)L(f,P0)=1U(f,P_0) - L(f,P_0) = 1 to U(f,P1)L(f,P1)=12U(f,P_1) - L(f,P_1) = \tfrac12: exactly one refinement halves it, and 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 shows the uniform partitions drive it to 00.

Facts & Assumptions

Given: f:[0,1]Rf : [0,1] \to \mathbb{R} with f(x)=x2f(x) = x^{2}; the partition P0=(1,t)P_0 = (1,t) with t0=0t_0 = 0 and tk=1t_k = 1 for k1k \ge 1; and P1=(2,s)P_1 = (2,s) with s0=0s_0 = 0, s1=1/2s_1 = 1/2 and sk=1s_k = 1 for k2k \ge 2.

[L1]

Both P0P_0 and P1P_1 are partitions of [0,1][0,1], and P1P_1 refines P0P_0, since pts(P0)={0,1}{0,12,1}=pts(P1)\operatorname{pts}(P_0) = \{0,1\} \subseteq \{0,\tfrac12,1\} = \operatorname{pts}(P_1); the subintervals of P0P_0 are [0,1][0,1] with length 11, and those of P1P_1 are [0,12][0,\tfrac12] and [12,1][\tfrac12,1], each of length 12\tfrac12 (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 and U(f,P)=i<nMiΔiU(f,P) = \sum_{i<n}M_i\Delta_i (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).

[L3]

For 0a<b0 \le a < b one has a2<b2a^{2} < b^{2}, so on an interval [c,d][0,1][c,d] \subseteq [0,1] with c<dc < d the function ff has least value c2c^{2} and greatest value d2d^{2}, both attained; 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)).

[L5]

Finite sums of one and of two terms: i<1ai=a0\sum_{i<1}a_i = a_0 and i<2ai=a0+a1\sum_{i<2}a_i = a_0 + a_1 (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L6]

Ordered-field arithmetic: (12)2=14(\tfrac12)^{2} = \tfrac14, 1412=18\tfrac14 \cdot \tfrac12 = \tfrac18, 18+12=58\tfrac18 + \tfrac12 = \tfrac58, and 0<18<58<10 < \tfrac18 < \tfrac58 < 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.

Verification

technique · direct
1.1

For P0P_0 the single subinterval is [0,1][0,1], so by [L3] m0=02=0m_0 = 0^{2} = 0 and M0=12=1M_0 = 1^{2} = 1, and by [L2] and [L5], L(f,P0)=01=0L(f,P_0) = 0 \cdot 1 = 0 and U(f,P0)=11=1U(f,P_0) = 1 \cdot 1 = 1.

givenL1L2L3L5
1.2

For P1P_1 the two subintervals are [0,12][0,\tfrac12] and [12,1][\tfrac12,1], each of length 12\tfrac12, so by [L3] the extreme values are m0=0m_0 = 0, M0=(12)2=14M_0 = (\tfrac12)^{2} = \tfrac14 on the first and m1=14m_1 = \tfrac14, M1=1M_1 = 1 on the second.

givenL1L3L6
2.1

Hence by [L2], [L5] and [L6], L(f,P1)=012+1412=18L(f,P_1) = 0\cdot\tfrac12 + \tfrac14\cdot\tfrac12 = \tfrac18 and U(f,P1)=1412+112=18+12=58U(f,P_1) = \tfrac14\cdot\tfrac12 + 1\cdot\tfrac12 = \tfrac18 + \tfrac12 = \tfrac58.

step 1.2L2L5L6
3.1

Comparing with step 1.1 and using [L6]: L(f,P0)=0<18=L(f,P1)L(f,P_0) = 0 < \tfrac18 = L(f,P_1) and U(f,P1)=58<1=U(f,P0)U(f,P_1) = \tfrac58 < 1 = U(f,P_0), while L(f,P1)=18<58=U(f,P1)L(f,P_1) = \tfrac18 < \tfrac58 = U(f,P_1). This is the chain of [L4] for the refinement P1P_1 of P0P_0, here with every inequality strict.

step 1.1step 2.1L1L4L6

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: 87 results over 22 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