Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Nuclear Fréchet spaces are semi-reflexive

Proved
MasulloGRH.nuclearFrechet_strongBidual_eval

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

locally-convexmasullo-grhnuclear-spaces

Let EEE be a nuclear Fréchet space over C\mathbb CC and Eβ′E'_\betaEβ′​ its strong dual (continuous linear functionals with the topology of uniform convergence on bounded subsets of EEE). Then every continuous linear functional FFF on Eβ′E'_\betaEβ′​ is the evaluation at a point of EEE: there is y∈Ey\in Ey∈E with

F(f)=f(y)for all f∈E′.F(f)=f(y)\qquad\text{for all } f\in E'.F(f)=f(y)for all f∈E′.

That is, EEE is semi-reflexive. This holds because a nuclear Fréchet space is a Montel space (bounded sets are pre-compact, and closed bounded sets are complete, hence compact), and Montel spaces are reflexive (Example C.1.4.6(3)).

Formalization Note Eβ′E'_\betaEβ′​ is Mathlib's StrongDual ℂ E and its dual is StrongDual ℂ (StrongDual ℂ E); nuclearity and the Fréchet property are the predicates of the definition file. Uniqueness of yyy (which follows from Hahn–Banach) is not part of the statement.

Preamble
import Definitions.Def_MasulloGRH_LocallyConvex

set_option autoImplicit false
Formal statement
namespace MasulloGRH

theorem nuclearFrechet_strongBidual_eval (E : Type*) [AddCommGroup E] [Module ℂ E]
    [TopologicalSpace E] (hE : IsFrechet E) (hN : IsNuclear E)
    (F : StrongDual ℂ (StrongDual ℂ E)) :
    ∃ y : E, ∀ f : StrongDual ℂ E, F f = f y := by sorry

end MasulloGRH
Source
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, Example C.1.4.6(3) and Lemma C.2.4.16 (nuclear spaces are Montel); Schaefer, Topological Vector Spaces, Ch. IV, 5.5 and 5.8

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