Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 6.21 — the fundamental theorem of calculus (bounded integrand)

Proved
Rudin.ch06_fundamental_theorem_of_bounded

by Lucas · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisintegration

This is the fundamental theorem of calculus in the form Rudin states it, with the boundedness hypothesis that his Definition 6.1 places on a Riemann integrable function made explicit.

Let fff be a bounded real function on [a,b][a,b][a,b] which is Riemann integrable there, finmathcalRf \\in \\mathcal{R}finmathcalR, and suppose there is a function FFF on [a,b][a,b][a,b] which is differentiable at every point of [a,b][a,b][a,b] with F′(x)=f(x)F'(x) = f(x)F′(x)=f(x). Then

intabf(x),dx=F(b)−F(a).\\int_a^b f(x)\\,dx = F(b) - F(a).intab​f(x),dx=F(b)−F(a).

No continuity of fff is assumed: integrability of fff together with the existence of an antiderivative suffices. Here intabf,dx\\int_a^b f\\,dxintab​f,dx is the Riemann integral in the sense of Rudin's Definition 6.2 with the integrator alpha(x)=x\\alpha(x) = xalpha(x)=x, i.e. the common value of infPU(P,f)\\inf_P U(P,f)infP​U(P,f) and supPL(P,f)\\sup_P L(P,f)supP​L(P,f) over all partitions PPP of [a,b][a,b][a,b].

The theorem is what makes integrals computable: it reduces integration to antidifferentiation and is the link between the differentiation theory of Chapter 5 and the integration theory of Chapter 6.

Formalization Note Rudin's class mathcalR\\mathcal{R}mathcalR consists of bounded functions whose upper and lower integrals agree; the boundedness clause is carried here by the explicit hypothesis hfb, since the formalized upper and lower integrals are ordinary suprema and infima of sets of real numbers, which take a default value on unbounded sets. Differentiability on the closed interval is expressed as a two-sided derivative at every point of [a,b][a,b][a,b], as in Rudin's statement.

Preamble
import Mathlib
import Definitions.Def_Rudin_ch06_stieltjes

open Filter Topology
Formal statement
namespace Rudin

/-- Rudin, Theorem 6.21 (the fundamental theorem of calculus), with the boundedness hypothesis
of Chapter 6: if `f ∈ ℛ` on `[a, b]`, `f` is bounded on `[a, b]`, and `F` is differentiable on
`[a, b]` with `F' = f`, then `∫ₐᵇ f dx = F b - F a`. -/
theorem ch06_fundamental_theorem_of_bounded (a b : ℝ) (hab : a ≤ b) (f F : ℝ → ℝ)
    (hf : RiemannIntegrable a b f)
    (hfb : ∃ M, ∀ x ∈ Set.Icc a b, |f x| ≤ M)
    (hF : ∀ x ∈ Set.Icc a b, HasDerivAt F (f x) x) :
    RiemannIntegral a b f = F b - F a := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 6, p. 134, Theorem 6.21 (with the boundedness hypothesis of Definitions 6.1-6.2)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me