Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck 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<b: f is integrable on [a,b] if and only if it is integrable on [a,c] and on [c,b], and then ∫abf=∫acf+∫cbf; with the oriented form for arbitrary a,b,c

Statement

Let a<c<b be reals and let f:[a,b]→R be bounded (Lower bound, bounded below, bounded set). Then:

  1. f is integrable on [a,b] (The lower and upper Darboux integrals of a bounded f on [a,b] as sup⁡PL(f,P) and inf⁡PU(f,P), Darboux integrability as their equality, and the notation ∫abf) if and only if its restrictions to [a,c] and to [c,b] are integrable;
  2. and in that case ∫abf  =  ∫acf  +  ∫cbf.
  3. Oriented form. Let α<β be reals, let f:[α,β]→R be integrable, and let u,v,w∈[α,β] be arbitrary. Then, with the convention of The integral with oriented limits: ∫aaf:=0 and ∫baf:=−∫abf, ∫uvf  +  ∫vwf  =  ∫uwf.

Claim 3 is where The integral with oriented limits: ∫aaf:=0 and ∫baf:=−∫abf 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<b and a bounded f:[a,b]→R; and, for claim 3, reals α<β, an integrable f:[α,β]→R and points u,v,w∈[α,β]. Let a real ε>0 be given.

[L2]

A function integrable on [p,q] is integrable on every [p′,q′]⊆[p,q] with p′<q′ (A function integrable on [a,b] is integrable on every closed subinterval).

[L4]

A partition of [p,q] is a pair (n,t) with n≥1, t0=p, ti<ti+1 for i<n and tk=q for k≥n; its subintervals are [ti,ti+1] for i<n (Partition of [a,b] as a finite strictly increasing list a=t0<t1<⋯<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L5]

Finite sums split at an intermediate index, with ∑k=pq−1xk=∑j<q−pxp+j (Finite sums and finite products, by recursion, Laws of finite sums and finite products, clause 3).

[L6]

With oriented limits, ∫vuh=−∫uvh and ∫uuh=0 (The integral with oriented limits: ∫aaf:=0 and ∫baf:=−∫abf).

[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 0 (Ordered field, Complete ordered field (least-upper-bound property)).

Proof

technique · direct
1.1

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

L2
1.2

The splice. Let P1=(n1,t1) be a partition of [a,c] and P2=(n2,t2) one of [c,b]. Define P:=(n1+n2, t) by ti:=ti1 for i≤n1, tn1+j:=tj2 for j≤n2, and tk:=b for k≥n1+n2. The two prescriptions agree at i=n1, where tn11=c=t02; and t0=a, tn1+n2=tn22=b, with ti<ti+1 for every i<n1+n2. So P is a partition of [a,b].

L4construct
1.3

Claim 1, converse. Suppose f is integrable on [a,c] and on [c,b], and use [L1] on each to fix P1 with U(f,P1)−L(f,P1)<ε⋅2−1 and P2 with U(f,P2)−L(f,P2)<ε⋅2−1.

L1choose
2.1

The first n1 subintervals of P are those of P1 and the last n2 are those of P2, with the matching lengths, so by [L3] and the splitting law [L5], L(f,P)=L(f,P1)+L(f,P2) and U(f,P)=U(f,P1)+U(f,P2).

step 1.2L3L4L5
3.1

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

step 1.2step 2.1step 1.3L1L7
4.1

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

step 2.1step 1.3step 3.1L3
5.1

Those two numbers differ by less than ε by step 1.3, so ∣∫abf−∫acf−∫cbf∣<ε; as ε>0 was arbitrary the difference is 0, which is claim 2.

step 1.3step 4.1L7
6.1

Claim 3, first the sorted case. Let x≤y in [α,β]. Then ∫αyf=∫αxf+∫xyf. Indeed if α<x<y this is claim 2 applied on [α,y], where f is integrable by [L2]; if x=α the middle term is 0 by [L6] and the identity is trivial; and if x=y the last term is 0 by [L6] and the identity is again trivial.

step 5.1L2L6
7.1

Put F(x):=∫αxf for x∈[α,β], which is defined by [L2] and [L6]. Then ∫xyf=F(y)−F(x) for all x,y∈[α,β]: for x<y this is step 6.1 rearranged; for x=y both sides are 0 by [L6]; and for x>y the case already proved gives ∫yxf=F(x)−F(y), and [L6] negates both sides.

step 6.1L2L6construct
8.1

Claim 3. For arbitrary u,v,w∈[α,β], step 7.1 gives ∫uvf+∫vwf=(F(v)−F(u))+(F(w)−F(v))=F(w)−F(u)=∫uwf.

step 7.1algebra∎

Remarks

Depends on

Used by

Dependency tree · two levels

39 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