Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 11.24 — the integral is a countably additive set function

Proved
Rudin.ch11_integral_countably_additive

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

analysismeasure-theory

If fff is integrable and E1,E2,…E_1, E_2, \dotsE1​,E2​,… are pairwise disjoint measurable sets with union EEE, then ∫Ef dμ=∑n∫Enf dμ\int_E f\,d\mu = \sum_n \int_{E_n} f\,d\mu∫E​fdμ=∑n​∫En​​fdμ, the series being convergent.

Preamble
import Mathlib
import Definitions.Def_Rudin_ch11_L2

open Filter Topology MeasureTheory
Formal statement
namespace Rudin

/-- Rudin, Theorem 11.24: the integral of an integrable function is a countably additive set
function. -/
theorem ch11_integral_countably_additive {X : Type*} [MeasurableSpace X] (μ : Measure X)
    (f : X → ℝ) (hf : Integrable f μ) (E : ℕ → Set X) (hE : ∀ n, MeasurableSet (E n))
    (hdisj : Pairwise (Function.onFun Disjoint E)) :
    HasSum (fun n => ∫ x in E n, f x ∂μ) (∫ x in ⋃ n, E n, f x ∂μ) := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 11, p. 315, Theorem 11.24
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Let XXX be a measurable space with measure μ\muμ, let f:X→Rf : X \to \mathbb{R}f:X→R be integrable with respect to μ\muμ, and let E0,E1,…E_0,E_1,\dotsE0​,E1​,… be measurable subsets of XXX that are pairwise disjoint. Then the family of numbers

n  ⟼  ∫Enf dμn \;\longmapsto\; \int_{E_n} f \, d\mun⟼∫En​​fdμ

is summable with sum ∫⋃nEnf dμ\displaystyle\int_{\bigcup_n E_n} f\,d\mu∫⋃n​En​​fdμ — that is, the net of finite partial sums converges unconditionally to that value (a stronger assertion than convergence of the ordered partial sums).

Each integral is the Bochner integral of fff restricted to the indicated set. Integrability is assumed on the whole space, which in particular gives integrability on each EnE_nEn​.

Human review
  • Endorsed by Shuze Chen · Sep 13, 2026

  • Endorsed by Lucas · Sep 13, 2026

    Confirmed by the mission captain (proposal self-audit).

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