Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.13 — strong maximum principle for subharmonic functions

Proved
HunterPDE.Harmonic.strong_maximum_principle

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

maximum-principlep2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1pdesubharmonic-functions

Let Ω⊆Rn\Omega \subseteq \mathbb{R}^nΩ⊆Rn be a connected open set and u∈C2(Ω)u \in C^2(\Omega)u∈C2(Ω). If uuu is subharmonic (Δu≥0\Delta u \ge 0Δu≥0 in Ω\OmegaΩ) and attains a global maximum value in Ω\OmegaΩ, i.e. there is x0∈Ωx_0 \in \Omegax0​∈Ω with

u(x)≤u(x0)for all x∈Ω,u(x) \le u(x_0) \qquad \text{for all } x \in \Omega,u(x)≤u(x0​)for all x∈Ω,

then uuu is constant in Ω\OmegaΩ.

Applied to uuu and −u-u−u it gives the strong maximum and minimum principle for harmonic functions (Theorem 2.15).

Formalization Note. Subharmonicity (with u∈C2(Ω)u \in C^2(\Omega)u∈C2(Ω)) is IsSubharmonicOn Ω u from the definition item Subharmonic. Connectedness is IsPreconnected Ω; nonemptiness is implied by the existence of the maximum point, so this is the book's "connected". Constant in Ω\OmegaΩ is ∃c,∀x∈Ω,u(x)=c\exists c, \forall x \in \Omega, u(x) = c∃c,∀x∈Ω,u(x)=c.

Preamble
import Mathlib
import Definitions.Def_HunterPDE_Harmonic_Subharmonic
Formal statement
namespace HunterPDE.Harmonic

/-- Theorem 2.13 of Hunter, *Notes on PDEs* (revised 6/18/2014), p. 26 (strong maximum
principle): if `Ω ⊆ ℝⁿ` is a connected open set, `u ∈ C²(Ω)` is subharmonic (`Δu ≥ 0` in `Ω`) and
`u` attains a global maximum value in `Ω` (at some `x₀ ∈ Ω`), then `u` is constant in `Ω`. -/
theorem strong_maximum_principle {n : ℕ} {Ω : Set (EuclideanSpace ℝ (Fin n))}
    {u : EuclideanSpace ℝ (Fin n) → ℝ} (hΩ : IsOpen Ω) (hconn : IsPreconnected Ω)
    (hu : IsSubharmonicOn Ω u) (hmax : ∃ x₀ ∈ Ω, ∀ x ∈ Ω, u x ≤ u x₀) :
    ∃ c : ℝ, ∀ x ∈ Ω, u x = c := by sorry

end HunterPDE.Harmonic
Source
Hunter, Notes on Partial Differential Equations (revised 6/18/2014), p. 26, Theorem 2.13
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Hypotheses.

  • n∈Nn \in \mathbb{N}n∈N is arbitrary.
  • Ω⊆Rn\Omega \subseteq \mathbb{R}^nΩ⊆Rn is open and preconnected, meaning it cannot be split into two disjoint nonempty relatively open pieces. The empty set counts as preconnected.
  • u:Rn→Ru : \mathbb{R}^n \to \mathbb{R}u:Rn→R is subharmonic on Ω\OmegaΩ:
    • uuu is C2C^2C2 on Ω\OmegaΩ;
    • Δu(x)=∑iD2u(x)(ei,ei)≥0\Delta u(x) = \sum_i D^2u(x)(e_i,e_i) \ge 0Δu(x)=∑i​D2u(x)(ei​,ei​)≥0 for all x∈Ωx \in \Omegax∈Ω.
  • uuu attains its maximum over Ω\OmegaΩ: there is x0∈Ωx_0 \in \Omegax0​∈Ω with u(x)≤u(x0)u(x) \le u(x_0)u(x)≤u(x0​) for all x∈Ωx \in \Omegax∈Ω.

Conclusion. uuu is constant on Ω\OmegaΩ: there is a real ccc with u(x)=cu(x) = cu(x)=c for all x∈Ωx \in \Omegax∈Ω.

Degenerate cases.

  • Empty Ω\OmegaΩ. The hypothesis on x0x_0x0​ forces Ω\OmegaΩ to be nonempty, so empty Ω\OmegaΩ cannot occur.
  • n=0n = 0n=0. Ω\OmegaΩ is the single point, where every function is constant, so the statement is trivially true.
  • Values outside Ω\OmegaΩ. Only the values of uuu on Ω\OmegaΩ are constrained. Since Ω\OmegaΩ is open, "C2C^2C2 on Ω\OmegaΩ" is ordinary C2C^2C2 near each point of Ω\OmegaΩ.
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 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