Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a)

Statement

Let a<b be reals, let G:[a,b]→R be differentiable at every point of [a,b] as a function on [a,b] (The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set; at a and b this is the one-sided derivative), let f:=G′, and suppose 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). Then

∫abf  =  G(b)−G(a).

Both hypotheses are needed and neither is removable. A function may be differentiable everywhere with G′ not integrable — then the left-hand side does not exist (an everywhere differentiable function with unbounded derivative) — and an integrable f need not be the derivative of anything (the sign function); both witnesses are on the companion page.

No continuity of f is assumed, which is what makes this the working form: the theorem evaluates ∫abf for every integrable derivative, not only for continuous integrands.

Facts & Assumptions

Given: Reals a<b, a function G:[a,b]→R differentiable at every point of [a,b], f:=G′ integrable on [a,b], and a partition P=(n,t) of [a,b].

[L1]

For a partition P=(n,t) of [a,b]: t0=a, tn=b, ti<ti+1 for i<n, Δi=ti+1−ti>0, and Ii=[ti,ti+1]⊆[a,b] (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).

[L2]

L(f,P)=∑i<nmiΔi and U(f,P)=∑i<nMiΔi with mi=inf⁡f[Ii] and Mi=sup⁡f[Ii], so mi≤f(ξ)≤Mi for every ξ∈Ii (For bounded f on [a,b] and a partition P: the infimum mi and supremum Mi of f on the i-th subinterval, and the lower and upper Darboux sums L(f,P)=∑imiΔi and U(f,P)=∑iMiΔi, Lower bound, bounded below, bounded set).

[L3]

∫ab‾f=sup⁡PL(f,P) and ∫ab‾f=inf⁡PU(f,P), and f integrable means the two agree, their common value being ∫abf (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).

[L4]

Mean value theorem: if u is continuous on [p,q] with p<q and differentiable at every point of (p,q), there is ξ∈(p,q) with u(q)−u(p)=u′(ξ)(q−p) (The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a)).

[L6]

Finite sums: telescoping ∑i<n(ci+1−ci)=cn−c0, and monotonicity in the terms (Finite sums and finite products, by recursion, Laws of finite sums and finite products, clauses 4 and 5).

[L7]

Ordered-field arithmetic: multiplying an inequality by a positive real preserves it, the order is total and transitive, and a number that is an upper bound of a set and also a lower bound of another set lies between their supremum and infimum (Ordered field, Complete ordered field (least-upper-bound property)).

Proof

technique · direct
1.1

Let P=(n,t) be an arbitrary partition of [a,b] and let i<n. The restriction of G to Ii=[ti,ti+1] is continuous on Ii and differentiable at every point of (ti,ti+1), with the same derivative f there, by [L5] and [L1].

givenL1L5
2.1

By [L4] applied on Ii there is ξi∈(ti,ti+1) with G(ti+1)−G(ti)=f(ξi) Δi; since ξi∈Ii and Δi>0, [L2] gives miΔi≤G(ti+1)−G(ti)≤MiΔi.

step 1.1L1L2L4L7
3.1

Step 2.1 holds for every i<n, so monotonicity of finite sums applies to the three families and gives ∑i<nmiΔi≤∑i<n(G(ti+1)−G(ti))≤∑i<nMiΔi.

step 2.1L6
4.1

The middle sum telescopes to G(tn)−G(t0)=G(b)−G(a) by [L6] and [L1], so L(f,P)≤G(b)−G(a)≤U(f,P) by [L2].

step 3.1L1L2L6
5.1

Step 4.1 holds for every partition P, so G(b)−G(a) is an upper bound of the set of lower sums and a lower bound of the set of upper sums; hence ∫ab‾f≤G(b)−G(a)≤∫ab‾f by [L3] and [L7].

step 4.1L3L7
6.1

Since f is integrable the two integrals coincide with ∫abf, so ∫abf=G(b)−G(a).

step 5.1L3∎

Remarks

Depends on

Used by

…and 47 more results.

Dependency tree · two levels

49 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