Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)
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 a<c<ba<c<b: ff is integrable on [a,b][a,b] if and only if it is integrable on [a,c][a,c] and on [c,b][c,b], and then abf=acf+cbf\int_a^b f = \int_a^c f + \int_c^b f; with the oriented form for arbitrary a,b,ca,b,c

Statement

Let a<c<ba < c < b be reals and let f:[a,b]Rf : [a,b] \to \mathbb{R} be bounded (Lower bound, bounded below, bounded set). Then:

  1. ff is integrable on [a,b][a,b] (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) if and only if its restrictions to [a,c][a,c] and to [c,b][c,b] are integrable;
  2. and in that case abf  =  acf  +  cbf.\int_a^b f \;=\; \int_a^c f \;+\; \int_c^b f .
  3. Oriented form. Let α<β\alpha < \beta be reals, let f:[α,β]Rf : [\alpha,\beta] \to \mathbb{R} be integrable, and let u,v,w[α,β]u, v, w \in [\alpha,\beta] be arbitrary. Then, with the convention of The integral with oriented limits: aaf:=0\int_a^a f := 0 and baf:=abf\int_b^a f := -\int_a^b f, uvf  +  vwf  =  uwf.\int_u^v f \;+\; \int_v^w f \;=\; \int_u^w f .

Claim 3 is where The integral with oriented limits: aaf:=0\int_a^a f := 0 and baf:=abf\int_b^a f := -\int_a^b f earns its place: it holds for every arrangement of the three points, including the degenerate ones, and it is the form used everywhere below.

Facts & Assumptions

Given: Reals a<c<ba < c < b and a bounded f:[a,b]Rf : [a,b] \to \mathbb{R}; and, for claim 3, reals α<β\alpha < \beta, an integrable f:[α,β]Rf : [\alpha,\beta] \to \mathbb{R} and points u,v,w[α,β]u,v,w \in [\alpha,\beta]. Let a real ε>0\varepsilon > 0 be given.

[L2]

A function integrable on [p,q][p,q] is integrable on every [p,q][p,q][p',q'] \subseteq [p,q] with p<qp' < q' (A function integrable on [a,b][a,b] is integrable on every closed subinterval).

[L3]

For a partition R=(n,t)R = (n,t) and bounded hh: L(h,R)=i<nmiΔiL(h,R) = \sum_{i<n}m_i\Delta_i, U(h,R)=i<nMiΔiU(h,R) = \sum_{i<n}M_i\Delta_i, and L(h,R)hhU(h,R)L(h,R) \le \underline{\int} h \le \overline{\int} h \le U(h,R), the integral being the common value of the two when they agree (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).

[L4]

A partition of [p,q][p,q] is a pair (n,t)(n,t) with n1n \ge 1, t0=pt_0 = p, ti<ti+1t_i < t_{i+1} for i<ni < n and tk=qt_k = q for knk \ge n; its subintervals are [ti,ti+1][t_i,t_{i+1}] for i<ni<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).

[L5]

Finite sums split at an intermediate index, with k=pq1xk=j<qpxp+j\sum_{k=p}^{q-1}x_k = \sum_{j<q-p}x_{p+j} (Finite sums and finite products, by recursion, Laws of finite sums and finite products, clause 3).

[L6]

With oriented limits, vuh=uvh\int_v^u h = -\int_u^v h and uuh=0\int_u^u h = 0 (The integral with oriented limits: aaf:=0\int_a^a f := 0 and baf:=abf\int_b^a f := -\int_a^b f).

[L7]

Ordered-field arithmetic: adding a constant preserves an inequality, the order is total and transitive, and a real of absolute value below every positive real is 00 (Ordered field, Complete ordered field (least-upper-bound property)).

Proof

technique · direct
1.1

Claim 1, forward. If ff is integrable on [a,b][a,b] then, since a<ca < c and c<bc < b, [L2] gives integrability on [a,c][a,c] and on [c,b][c,b].

L2
1.2

The splice. Let P1=(n1,t1)P_1 = (n_1,t^1) be a partition of [a,c][a,c] and P2=(n2,t2)P_2 = (n_2,t^2) one of [c,b][c,b]. Define P:=(n1+n2, t)P := (n_1+n_2,\ t) by ti:=ti1t_i := t^1_i for in1i \le n_1, tn1+j:=tj2t_{n_1+j} := t^2_j for jn2j \le n_2, and tk:=bt_k := b for kn1+n2k \ge n_1+n_2. The two prescriptions agree at i=n1i = n_1, where tn11=c=t02t^1_{n_1} = c = t^2_0; and t0=at_0 = a, tn1+n2=tn22=bt_{n_1+n_2} = t^2_{n_2} = b, with ti<ti+1t_i < t_{i+1} for every i<n1+n2i < n_1+n_2. So PP is a partition of [a,b][a,b].

L4construct
1.3

Claim 1, converse. Suppose ff is integrable on [a,c][a,c] and on [c,b][c,b], and use [L1] on each to fix P1P_1 with U(f,P1)L(f,P1)<ε21U(f,P_1)-L(f,P_1) < \varepsilon\cdot 2^{-1} and P2P_2 with U(f,P2)L(f,P2)<ε21U(f,P_2)-L(f,P_2) < \varepsilon\cdot 2^{-1}.

L1choose
2.1

The first n1n_1 subintervals of PP are those of P1P_1 and the last n2n_2 are those of P2P_2, with the matching lengths, so by [L3] and the splitting law [L5], L(f,P)=L(f,P1)+L(f,P2)L(f,P) = L(f,P_1) + L(f,P_2) and U(f,P)=U(f,P1)+U(f,P2)U(f,P) = U(f,P_1) + U(f,P_2).

step 1.2L3L4L5
3.1

For the splice PP of those two, step 2.1 gives U(f,P)L(f,P)<εU(f,P) - L(f,P) < \varepsilon; as ε>0\varepsilon > 0 was arbitrary and ff is bounded, [L1] makes ff integrable on [a,b][a,b].

step 1.2step 2.1step 1.3L1L7
4.1

Claim 2. With P1P_1, P2P_2 and PP as above, [L3] puts abf\int_a^b f between L(f,P)L(f,P) and U(f,P)U(f,P), that is between L(f,P1)+L(f,P2)L(f,P_1)+L(f,P_2) and U(f,P1)+U(f,P2)U(f,P_1)+U(f,P_2) by step 2.1; and [L3] applied on [a,c][a,c] and on [c,b][c,b] puts acf+cbf\int_a^c f + \int_c^b f between the same two numbers.

step 2.1step 1.3step 3.1L3
5.1

Those two numbers differ by less than ε\varepsilon by step 1.3, so abfacfcbf<ε\bigl|\int_a^b f - \int_a^c f - \int_c^b f\bigr| < \varepsilon; as ε>0\varepsilon > 0 was arbitrary the difference is 00, which is claim 2.

step 1.3step 4.1L7
6.1

Claim 3, first the sorted case. Let xyx \le y in [α,β][\alpha,\beta]. Then αyf=αxf+xyf\int_\alpha^y f = \int_\alpha^x f + \int_x^y f. Indeed if α<x<y\alpha < x < y this is claim 2 applied on [α,y][\alpha,y], where ff is integrable by [L2]; if x=αx = \alpha the middle term is 00 by [L6] and the identity is trivial; and if x=yx = y the last term is 00 by [L6] and the identity is again trivial.

step 5.1L2L6
7.1

Put F(x):=αxfF(x) := \int_\alpha^x f for x[α,β]x \in [\alpha,\beta], which is defined by [L2] and [L6]. Then xyf=F(y)F(x)\int_x^y f = F(y) - F(x) for all x,y[α,β]x,y \in [\alpha,\beta]: for x<yx < y this is step 6.1 rearranged; for x=yx = y both sides are 00 by [L6]; and for x>yx > y the case already proved gives yxf=F(x)F(y)\int_y^x f = F(x)-F(y), and [L6] negates both sides.

step 6.1L2L6construct
8.1

Claim 3. For arbitrary u,v,w[α,β]u,v,w \in [\alpha,\beta], step 7.1 gives uvf+vwf=(F(v)F(u))+(F(w)F(v))=F(w)F(u)=uwf\int_u^v f + \int_v^w f = \bigl(F(v)-F(u)\bigr) + \bigl(F(w)-F(v)\bigr) = F(w)-F(u) = \int_u^w f.

step 7.1algebra

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 65 results over 18 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