Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The strong dual of a Fréchet space has a fundamental sequence of bounded sets

Proved
MasulloGRH.strongDual_frechet_fundamental_bounded_seq

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

functional-analysislocally-convex

Let EEE be a Fréchet space over C\mathbb CC and Eβ′E'_\betaEβ′​ its strong dual (continuous linear functionals, topology of uniform convergence on bounded subsets of EEE). Then Eβ′E'_\betaEβ′​ has a fundamental sequence of bounded sets: there are bounded sets B0,B1,B2,⋯⊆Eβ′B_0, B_1, B_2, \dots \subseteq E'_\betaB0​,B1​,B2​,⋯⊆Eβ′​ such that

every bounded S⊆Eβ′ satisfies S⊆Bn for some n.\text{every bounded } S \subseteq E'_\beta \text{ satisfies } S \subseteq B_n \text{ for some } n.every bounded S⊆Eβ′​ satisfies S⊆Bn​ for some n.

One may take Bn=Un∘B_n = U_n^\circBn​=Un∘​, the polars of a countable base (Un)(U_n)(Un​) of 000-neighbourhoods of EEE: equicontinuous sets are strongly bounded, and since EEE is barrelled (Baire), strongly bounded sets are equicontinuous. This is the first half of the (DF)(DF)(DF) property of Eβ′E'_\betaEβ′​.

Preamble
import Definitions.Def_MasulloGRH_LocallyConvex

set_option autoImplicit false
Formal statement
namespace MasulloGRH

theorem strongDual_frechet_fundamental_bounded_seq (E : Type*) [AddCommGroup E] [Module ℂ E]
    [TopologicalSpace E] (hE : IsFrechet E) :
    ∃ B : ℕ → Set (StrongDual ℂ E), (∀ n, Bornology.IsVonNBounded ℂ (B n)) ∧
      ∀ S : Set (StrongDual ℂ E), Bornology.IsVonNBounded ℂ S → ∃ n, S ⊆ B n := by sorry

end MasulloGRH
Source
H. H. Schaefer, Topological Vector Spaces, IV.8.1 and its proof (the strong dual of a metrizable locally convex space is a (DF)-space); A. Grothendieck, Sur les espaces (F) et (DF), Summa Brasil. Math. 3 (1954); used in A. M. Masullo, The Music of the Primes (draft), Appendix C, Lemma C.2.4.11

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