Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 11.31 — Fatou's theorem

Proved
Rudin.ch11_fatou

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

analysismeasure-theory

If fn≥0f_n \ge 0fn​≥0 are measurable and f=lim inf⁡nfnf = \liminf_n f_nf=liminfn​fn​, then ∫f dμ≤lim inf⁡n∫fn dμ\int f\,d\mu \le \liminf_n \int f_n\,d\mu∫fdμ≤liminfn​∫fn​dμ. Strict inequality may occur.

Preamble
import Mathlib
import Definitions.Def_Rudin_ch11_L2

open Filter Topology MeasureTheory
open scoped ENNReal
Formal statement
namespace Rudin

/-- Rudin, Theorem 11.31 (Fatou's theorem): for nonnegative measurable functions, the integral of
the lower limit is at most the lower limit of the integrals. -/
theorem ch11_fatou {X : Type*} [MeasurableSpace X] (μ : Measure X) (f : ℕ → X → ℝ≥0∞)
    (hf : ∀ n, Measurable (f n)) :
    (∫⁻ x, liminf (fun n => f n x) atTop ∂μ) ≤ liminf (fun n => ∫⁻ x, f n x ∂μ) atTop := by sorry

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

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

Let XXX be a measurable space with measure μ\muμ and let f0,f1,⋯:X→[0,∞]f_0,f_1,\dots : X \to [0,\infty]f0​,f1​,⋯:X→[0,∞] be measurable functions into the extended nonnegative reals. Then

∫Xlim inf⁡n→∞fn(x) dμ(x)  ≤  lim inf⁡n→∞∫Xfn dμ,\int_X \liminf_{n\to\infty} f_n(x)\, d\mu(x) \;\le\; \liminf_{n\to\infty} \int_X f_n \, d\mu ,∫X​n→∞liminf​fn​(x)dμ(x)≤n→∞liminf​∫X​fn​dμ,

an inequality in [0,∞][0,\infty][0,∞], the integrals being lower Lebesgue integrals and both lower limits taken in [0,∞][0,\infty][0,∞] (where they always exist).

The inequality goes only in this direction, and no integrability, domination or convergence hypothesis is imposed.

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