Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 11.17 — suprema and upper limits of measurable functions

Proved
Rudin.ch11_measurable_limits

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

analysismeasure-theory

If f1,f2,…f_1, f_2, \dotsf1​,f2​,… are measurable, then sup⁡nfn\sup_n f_nsupn​fn​ and lim sup⁡nfn\limsup_n f_nlimsupn​fn​ are measurable. As in Rudin the functions take values in the extended half-line, so both are always defined.

Preamble
import Mathlib
import Definitions.Def_Rudin_ch11_L2

open Filter Topology MeasureTheory
open scoped ENNReal
Formal statement
namespace Rudin

/-- Rudin, Theorem 11.17: the pointwise supremum and the upper limit of a sequence of measurable
functions are measurable.  As in Rudin the functions take values in the extended half-line, so
that the supremum and the upper limit are always defined. -/
theorem ch11_measurable_limits {X : Type*} [MeasurableSpace X] (f : ℕ → X → ℝ≥0∞)
    (hf : ∀ n, Measurable (f n)) :
    Measurable (fun x => ⨆ n, f n x) ∧
      Measurable (fun x => limsup (fun n => f n x) atTop) := by sorry

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

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

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

  1. the pointwise supremum x↦sup⁡nfn(x)x \mapsto \sup_n f_n(x)x↦supn​fn​(x) is measurable;
  2. the pointwise upper limit x↦lim sup⁡n→∞fn(x)x \mapsto \limsup_{n\to\infty} f_n(x)x↦limsupn→∞​fn​(x) is measurable.

Both suprema and upper limits are taken in [0,∞][0,\infty][0,∞], where they always exist, so no boundedness hypothesis is needed. No measure is involved — this is purely about measurability with respect to the σ\sigmaσ-algebra of XXX and the Borel structure of [0,∞][0,\infty][0,∞].

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