Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The strong dual of a complete nuclear (DF)-space is nuclear

Proved
MasulloGRH.strongDual_nuclear_of_complete_nuclear_DF

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

functional-analysisnuclear-spaces

Let GGG be a complete nuclear locally convex space over C\mathbb CC which is a (DF)(DF)(DF)-space, i.e.

  1. GGG has a fundamental sequence of bounded sets B0,B1,…B_0, B_1, \dotsB0​,B1​,… (every bounded set lies in some BnB_nBn​), and
  2. every countable intersection ⋂nUn\bigcap_n U_n⋂n​Un​ of closed, balanced, convex 000-neighbourhoods which absorbs all bounded sets is itself a 000-neighbourhood.

Then the strong dual Gβ′G'_\betaGβ′​ is nuclear (indeed a nuclear Fréchet space). This is Schaefer, Topological Vector Spaces, IV.9.6.

Preamble
import Definitions.Def_MasulloGRH_LocallyConvex

set_option autoImplicit false
Formal statement
namespace MasulloGRH

theorem strongDual_nuclear_of_complete_nuclear_DF (G : Type*) [AddCommGroup G] [Module ℂ G]
    [TopologicalSpace G] (hC : IsCompleteTVS G) (hN : IsNuclear G)
    (hB : ∃ B : ℕ → Set G, (∀ n, Bornology.IsVonNBounded ℂ (B n)) ∧
      ∀ S : Set G, Bornology.IsVonNBounded ℂ S → ∃ n, S ⊆ B n)
    (hDF : ∀ U : ℕ → Set G, (∀ n, U n ∈ nhds (0 : G) ∧ IsClosed (U n) ∧ Balanced ℂ (U n) ∧ Convex ℝ (U n)) →
      (∀ S : Set G, Bornology.IsVonNBounded ℂ S → Absorbs ℂ (⋂ n, U n) S) →
      (⋂ n, U n) ∈ nhds (0 : G)) :
    IsNuclear (StrongDual ℂ G) := by sorry

end MasulloGRH
Source
A. M. Masullo, The Music of the Primes (draft 20 Nov 2026), Appendix C, Lemma C.2.4.11; H. H. Schaefer, Topological Vector Spaces, IV.6.1 (strong dual of bornological space complete), IV.8.1 (strong dual of metrizable LCS is (DF)), IV.9.6 (strong dual of complete nuclear (DF)-space is nuclear)

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