Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded sets of a nuclear Fréchet space are nuclearly dominated

Proved
MasulloGRH.nuclearFrechet_bounded_nuclear_domination

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

Let EEE be a nuclear Fréchet space over C\mathbb CC (nuclear in Grothendieck's sense, Definition C.2.4.1) and let B⊆EB\subseteq EB⊆E be bounded. Then there exist a bounded sequence (yn)n≥0(y_n)_{n\ge0}(yn​)n≥0​ in EEE and reals cn≥0c_n\ge 0cn​≥0 with ∑ncn<∞\sum_n c_n<\infty∑n​cn​<∞ such that for every continuous linear functional f∈E′f\in E'f∈E′ and every x∈Bx\in Bx∈B,

∣f(x)∣≤∑n=0∞cn ∣f(yn)∣.|f(x)|\le\sum_{n=0}^{\infty}c_n\,|f(y_n)|.∣f(x)∣≤n=0∑∞​cn​∣f(yn​)∣.

This is the dual form of the classical fact that in a (quasi-)complete nuclear space every bounded closed absolutely convex set BBB is contained in a bounded absolutely convex DDD such that the canonical map EB→EDE_B\to E_DEB​→ED​ is nuclear, x↦∑ncnφn(x)ynx\mapsto\sum_n c_n\varphi_n(x)y_nx↦∑n​cn​φn​(x)yn​ with ∥φn∥EB′≤1\|\varphi_n\|_{E_B'}\le1∥φn​∥EB′​​≤1, yn∈Dy_n\in Dyn​∈D (Pietsch 4.4; Schaefer III.7).

Preamble
import Definitions.Def_MasulloGRH_LocallyConvex

set_option autoImplicit false
Formal statement
namespace MasulloGRH

theorem nuclearFrechet_bounded_nuclear_domination (E : Type*) [AddCommGroup E] [Module ℂ E]
    [TopologicalSpace E] (hE : IsFrechet E) (hN : IsNuclear E)
    (B : Set E) (hB : Bornology.IsVonNBounded ℂ B) :
    ∃ (y : ℕ → E) (c : ℕ → ℝ), Bornology.IsVonNBounded ℂ (Set.range y) ∧ (∀ n, 0 ≤ c n) ∧
      Summable c ∧ ∀ (f : StrongDual ℂ E), ∀ x ∈ B, ‖f x‖ ≤ ∑' n, c n * ‖f (y n)‖ := by sorry

end MasulloGRH
Source
A. M. Masullo, The Music of the Primes (draft of 20 November 2026), Appendix C, §C.2.4 (nuclearity of the strong dual of a nuclear Fréchet space); cf. Schaefer, Topological Vector Spaces, III.7 and IV.9.6; Pietsch, Nuclear Locally Convex Spaces, 4.4

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