Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pietsch domination: a normalized positive state on the qqq-polar

Proved
MasulloGRH.pietsch_domination_state

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

Let EEE be a complex topological vector space and p,qp,qp,q seminorms on EEE, and let B={f∈E′:∣f(y)∣≤q(y) ∀y}B=\{f\in E' : |f(y)|\le q(y)\ \forall y\}B={f∈E′:∣f(y)∣≤q(y) ∀y} be the qqq-polar in the continuous dual. Assume the absolutely summing inequality: for every finite family x1,…,xnx_1,\dots,x_nx1​,…,xn​ and every ccc, if ∑i∣f(xi)∣≤c\sum_i |f(x_i)|\le c∑i​∣f(xi​)∣≤c for all f∈Bf\in Bf∈B then ∑ip(xi)≤c\sum_i p(x_i)\le c∑i​p(xi​)≤c.

Then there is a Pietsch state Λ\LambdaΛ on real functions on E′E'E′ which, restricted to functions bounded on BBB, is additive, R\mathbb RR-homogeneous, monotone with respect to the pointwise order on BBB, normalized by Λ(1)=1\Lambda(1)=1Λ(1)=1, and dominates ppp:

p(x)≤Λ(f↦∣f(x)∣)for all x∈E.p(x)\le \Lambda\big(f\mapsto |f(x)|\big)\quad\text{for all }x\in E.p(x)≤Λ(f↦∣f(x)∣)for all x∈E.

This is the Hahn–Banach form of the Pietsch domination theorem (a positive normalized functional on ℓ∞(B)\ell^\infty(B)ℓ∞(B) replaces the Pietsch probability measure).

Preamble
import Mathlib

set_option autoImplicit false
Formal statement
namespace MasulloGRH

universe u

theorem pietsch_domination_state (E : Type u)
    [AddCommGroup E] [Module ℂ E] [TopologicalSpace E]
    (p q : Seminorm ℂ E)
    (hAS : ∀ (n : ℕ) (x : Fin n → E) (c : ℝ),
      (∀ f : StrongDual ℂ E, (∀ y, ‖f y‖ ≤ q y) → ∑ i, ‖f (x i)‖ ≤ c) →
      ∑ i, p (x i) ≤ c) :
    ∃ Λ : (StrongDual ℂ E → ℝ) → ℝ,
      (∀ φ ψ : StrongDual ℂ E → ℝ,
        (∃ M : ℝ, ∀ f : StrongDual ℂ E, (∀ y, ‖f y‖ ≤ q y) → |φ f| ≤ M) →
        (∃ M : ℝ, ∀ f : StrongDual ℂ E, (∀ y, ‖f y‖ ≤ q y) → |ψ f| ≤ M) →
        Λ (φ + ψ) = Λ φ + Λ ψ) ∧
      (∀ (r : ℝ) (φ : StrongDual ℂ E → ℝ),
        (∃ M : ℝ, ∀ f : StrongDual ℂ E, (∀ y, ‖f y‖ ≤ q y) → |φ f| ≤ M) →
        Λ (r • φ) = r * Λ φ) ∧
      (∀ φ ψ : StrongDual ℂ E → ℝ,
        (∃ M : ℝ, ∀ f : StrongDual ℂ E, (∀ y, ‖f y‖ ≤ q y) → |φ f| ≤ M) →
        (∃ M : ℝ, ∀ f : StrongDual ℂ E, (∀ y, ‖f y‖ ≤ q y) → |ψ f| ≤ M) →
        (∀ f : StrongDual ℂ E, (∀ y, ‖f y‖ ≤ q y) → φ f ≤ ψ f) → Λ φ ≤ Λ ψ) ∧
      Λ (fun _ => 1) = 1 ∧
      ∀ x : E, p x ≤ Λ (fun f => ‖f x‖) := by sorry

end MasulloGRH
Source
A. M. Masullo, The Music of the Primes (draft of 20 November 2026), Appendix C; Pietsch domination theorem (cf. A. Pietsch, Nuclear Locally Convex Spaces, Thm 2.3.3; Diestel-Jarchow-Tonge, Absolutely Summing Operators, Thm 2.12)

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