Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13
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.

Newton–Leibniz remains valid across finitely many exceptional interior points when the primitive is continuous

Statement

Let a<b, let E⊆[a,b] be finite, and let G:[a,b]→R be continuous. Suppose G is differentiable at every point of (a,b)∖E, and let f:[a,b]→R be Riemann integrable with

f(x)=G′(x)(x∈(a,b)∖E).

Then

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

Points of E equal to a or b impose no additional condition, because the hypothesis concerns only interior derivatives.

Facts & Assumptions

Given: The data in the statement.

[L1]

If a continuous function on a closed interval is differentiable in its interior and its interior derivative has an integrable extension, the extension integrates to the endpoint change (Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), and a Riemann-integrable extension of the interior derivative).

Proof

technique · decomposition
1.1

List the distinct points of E∩(a,b) in increasing order as e1<⋯<em; if this set is empty, take m=0. Put e0=a and em+1=b.

givenchoose
1.2

On every [ei,ei+1], the restriction of G is continuous and differentiable throughout the open subinterval, while the restriction of f is integrable and agrees there with G′.

givenL2
2.1

Applying [L1] on each subinterval gives ∫eiei+1f=G(ei+1)−G(ei).

step 1.2L1
3.1

Summing step 2.1, using [L2], and telescoping yields ∫abf=G(b)−G(a).

step 2.1L2
4.1

When m=0 there is one subinterval and the proof is exactly [L1]; endpoint members of E never occur in an open subinterval.

step 1.1step 2.1∎

Depends on

Used by

Dependency tree · two levels

15 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