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

If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz

Statement

Let m∈N with m≥1 and let a,b∈R with a<b.

  1. Fundamental theorem, second part, in Rm. Let f:[a,b]→Rm be differentiable at every point of [a,b] as a function on [a,b] (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral), and suppose f′:[a,b]→Rm is integrable. Then ∫abf′  =  f(b)−f(a).
  2. A bounded derivative gives a Lipschitz function. Let f:[a,b]→Rm be continuous on [a,b] and differentiable at every point of (a,b), and let M≥0 satisfy ∥f′(t)∥2≤M for every t∈(a,b). Then ∥f(t)−f(s)∥2  ≤  M ∣t−s∣for all s,t∈[a,b], that is, f is Lipschitz with constant M as a map ([a,b],dR)→(Rm,d2) (Lipschitz map, α-Hölder map for rational 0<α≤1, and contraction, The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded, Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it).

Facts & Assumptions

Given: A natural m≥1, reals a<b, and a function f:[a,b]→Rm with the hypotheses of the clause under discussion; points s,t∈[a,b].

[L1]

The vector-valued derivative and integral are componentwise: f′(c)i=fi′(c), and f is integrable exactly when every fi is, with (∫abf)i=∫abfi; equality of two elements of Rm is equality of all their coordinates (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral, A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions).

[L3]

The mean value inequality on a subinterval (The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a)): for s<t, f continuous on [s,t] and differentiable on (s,t) with ∥f′∥2≤M there, ∥f(t)−f(s)∥2≤M(t−s).

[L4]

Restricting the domain of a function preserves a limit and its value, the ε-δ condition then quantifying over fewer points; in particular if f is differentiable at c as a function on [a,b] and c is a limit point of [s,t]⊆[a,b], then the restriction of f to [s,t] is differentiable at c with the same derivative (The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A, Vector-valued functions f:A→Rm, their limits and continuity, with the dictionary to the metric notions, Limit point, isolated point, adherent point, derived set, and dense subset of R, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L6]

Lipschitz maps: f is Lipschitz with constant L≥0 when dY(f(x),f(x′))≤L dX(x,x′) for all x,x′ (Lipschitz map, α-Hölder map for rational 0<α≤1, and contraction).

Proof

technique · direct
1.1

Under the hypotheses of clause 1, each component fi is differentiable at every point of [a,b] with derivative fi′=(f′)i, and each (f′)i is integrable on [a,b].

L1
1.2

Under the hypotheses of clause 2, if s<t in [a,b] then f restricted to [s,t] is continuous on [s,t] and differentiable at every point of (s,t) with the same derivative, since (s,t)⊆(a,b) and every point of (s,t) is a limit point of [s,t].

L4
2.1

Applying [L2] to G:=fi and g:=(f′)i gives ∫ab(f′)i=fi(b)−fi(a) for every i<m.

step 1.1L2
2.2

Under the hypotheses of clause 2, for s<t in [a,b] the mean value inequality applies on [s,t] and gives ∥f(t)−f(s)∥2≤M(t−s)=M∣t−s∣.

step 1.2L3L5
3.1

The i-th coordinate of ∫abf′ is ∫ab(f′)i and the i-th coordinate of f(b)−f(a) is fi(b)−fi(a); by step 2.1 these agree for every i<m, so the two vectors are equal, which is clause 1.

step 2.1L1
3.2

If s=t then ∥f(t)−f(s)∥2=0=M∣t−s∣; and if t<s then step 2.2 applied with the roles exchanged gives ∥f(s)−f(t)∥2≤M∣s−t∣, and ∥f(t)−f(s)∥2=∥−(f(s)−f(t))∥2=∥f(s)−f(t)∥2 while ∣s−t∣=∣t−s∣.

step 2.2L5
4.1

Steps 2.2 and 3.2 cover all pairs s,t∈[a,b], so ∥f(t)−f(s)∥2≤M∣t−s∣ always; since d2(f(t),f(s))=∥f(t)−f(s)∥2 and dR(t,s)=∣t−s∣, this is exactly the Lipschitz condition with constant M≥0, which is clause 2.

step 2.2step 3.2L5L6∎

Remarks

Depends on

Used by

Dependency tree · two levels

108 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