Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A convex cone of bounded functions with nonpositive infima admits a nonpositive state

Proved
MasulloGRH.exists_state_nonpos_on_cone

by Ismael Correa · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-analysismasullo-grhnuclear-spaces

Let XXX be a set, S⊆XS\subseteq XS⊆X a nonempty subset, and KKK a convex cone of real functions on XXX (closed under addition and under multiplication by nonnegative reals) such that

  1. every φ∈K\varphi\in Kφ∈K is bounded on SSS;
  2. every φ∈K\varphi\in Kφ∈K satisfies inf⁡t∈Sφ(t)≤0\inf_{t\in S}\varphi(t)\le 0inft∈S​φ(t)≤0, i.e. for every ε>0\varepsilon>0ε>0 there is t∈St\in St∈S with φ(t)≤ε\varphi(t)\le\varepsilonφ(t)≤ε.

Then there is a state Λ\LambdaΛ on the functions bounded on SSS which is nonpositive on KKK: a map Λ\LambdaΛ from real functions on XXX to R\mathbb RR which, on functions bounded on SSS, is additive, real-homogeneous and monotone with respect to the pointwise order on SSS, satisfies Λ(1)=1\Lambda(1)=1Λ(1)=1, and

Λ(φ)≤0for all φ∈K.\Lambda(\varphi)\le 0\qquad\text{for all }\varphi\in K.Λ(φ)≤0for all φ∈K.

This is the Hahn–Banach separation step in the proof of Pietsch's domination theorem: the cone KKK is separated in ℓ∞(S)\ell^\infty(S)ℓ∞(S) from the open cone of functions with strictly positive infimum, and the separating functional, suitably normalized, is the state.

Formalization Note Λ\LambdaΛ is defined on all functions X→RX\to\mathbb RX→R, but its algebraic and order properties are only required for functions bounded on SSS (values on unbounded functions are irrelevant).

Preamble
import Mathlib

set_option autoImplicit false
Formal statement
namespace MasulloGRH

theorem exists_state_nonpos_on_cone (X : Type*) (S : Set X) (hS : S.Nonempty)
    (K : Set (X → ℝ)) (hadd : ∀ φ ∈ K, ∀ ψ ∈ K, φ + ψ ∈ K)
    (hsmul : ∀ r : ℝ, 0 ≤ r → ∀ φ ∈ K, r • φ ∈ K)
    (hbdd : ∀ φ ∈ K, ∃ M : ℝ, ∀ t ∈ S, |φ t| ≤ M)
    (hinf : ∀ φ ∈ K, ∀ ε : ℝ, 0 < ε → ∃ t ∈ S, φ t ≤ ε) :
    ∃ Λ : (X → ℝ) → ℝ,
      (∀ φ ψ : X → ℝ, (∃ M : ℝ, ∀ t ∈ S, |φ t| ≤ M) → (∃ M : ℝ, ∀ t ∈ S, |ψ t| ≤ M) →
        Λ (φ + ψ) = Λ φ + Λ ψ) ∧
      (∀ (r : ℝ) (φ : X → ℝ), (∃ M : ℝ, ∀ t ∈ S, |φ t| ≤ M) → Λ (r • φ) = r * Λ φ) ∧
      (∀ φ ψ : X → ℝ, (∃ M : ℝ, ∀ t ∈ S, |φ t| ≤ M) → (∃ M : ℝ, ∀ t ∈ S, |ψ t| ≤ M) →
        (∀ t ∈ S, φ t ≤ ψ t) → Λ φ ≤ Λ ψ) ∧
      Λ (fun _ => 1) = 1 ∧ ∀ φ ∈ K, Λ φ ≤ 0 := by sorry

end MasulloGRH
Source
Pietsch domination theorem: A. Pietsch, Nuclear Locally Convex Spaces, Springer 1972, Theorem 2.3.3 and its proof (Hahn-Banach separation in the space of bounded functions); used for A. M. Masullo, The Music of the Primes, draft of 20 November 2026, https://math216.wordpress.com/wp-content/uploads/2026/11/the-music-of-the-primes.pdf, Appendix C, Lemma C.2.4.10 (characterizations of nuclearity)

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