Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.10 — the Weierstrass M-test

Proved
Rudin.ch07_weierstrass_M_test

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

analysisseries

If ∣fn(x)∣≤Mn|f_n(x)| \le M_n∣fn​(x)∣≤Mn​ for all x∈Ex \in Ex∈E and ∑Mn\sum M_n∑Mn​ converges, then ∑fn\sum f_n∑fn​ converges uniformly on EEE.

Preamble
import Mathlib
import Definitions.Def_Rudin_ch07_families

open Filter Topology
Formal statement
namespace Rudin

/-- Rudin, Theorem 7.10 (Weierstrass M-test): if `‖f n x‖ ≤ M n` on `E` and `∑ M n`
converges, then the series `∑ f n` converges uniformly on `E`. -/
theorem ch07_weierstrass_M_test {X : Type*} (E : Set X) (f : ℕ → X → ℂ) (M : ℕ → ℝ)
    (hbound : ∀ n, ∀ x ∈ E, ‖f n x‖ ≤ M n) (hM : Summable M) :
    ∃ g : X → ℂ,
      TendstoUniformlyOn (fun N x => ∑ n ∈ Finset.range N, f n x) g atTop E := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 7, p. 148, Theorem 7.10
Read-back

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

Let XXX be an arbitrary type, E⊆XE \subseteq XE⊆X, let f0,f1,⋯:X→Cf_0,f_1,\dots : X \to \mathbb{C}f0​,f1​,⋯:X→C and let M:N→RM : \mathbb{N} \to \mathbb{R}M:N→R. Assume:

  • ∥fn(x)∥≤Mn\lVert f_n(x) \rVert \le M_n∥fn​(x)∥≤Mn​ for every index nnn and every x∈Ex \in Ex∈E;
  • the family (Mn)(M_n)(Mn​) is summable, i.e. the net of finite partial sums converges — unconditional summability of the real series ∑nMn\sum_n M_n∑n​Mn​.

Then there exists a function g:X→Cg : X \to \mathbb{C}g:X→C such that the partial sums

SN(x)=∑n=0N−1fn(x)S_N(x) = \sum_{n=0}^{N-1} f_n(x)SN​(x)=n=0∑N−1​fn​(x)

converge to ggg uniformly on EEE as N→∞N \to \inftyN→∞.

Only the existence of a uniform limit is asserted; no formula or bound for ggg is claimed, and ggg is unconstrained outside EEE. Note the partial sum SNS_NSN​ omits the term fNf_NfN​.

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

  • Endorsed by LG · 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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me