Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Retakh's lemma for the quotient spectrum: condition (M) gives absolutely convex localizing sets

Proved
MasulloGRH.strictLF_quotient_condM_absConvex_localization

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

functional-analysislf-spaceslocally-convex

Let E=⋃nXnE=\bigcup_n X_nE=⋃n​Xn​ be a strict LF-space of nuclear Fréchet spaces over C\mathbb CC (the steps XnX_nXn​ carry the topology induced by EEE) and let V⊆EV\subseteq EV⊆E be a closed subspace. Assume the quotient spectrum Xk/(V∩Xk)X_k/(V\cap X_k)Xk​/(V∩Xk​) satisfies Retakh's condition (M) in the following form: for every nnn there are m≥nm\ge nm≥n and a 000-neighbourhood UUU of XnX_nXn​ such that for all k≥mk\ge mk≥m and every 000-neighbourhood WWW of XmX_mXm​ there is a 000-neighbourhood W′W'W′ of XkX_kXk​ with

U∩(W′+V)⊆W+V.U\cap (W'+V)\subseteq W+V.U∩(W′+V)⊆W+V.

Then for every nnn there are m≥nm\ge nm≥n and a 000-neighbourhood UUU of XnX_nXn​ such that for every 000-neighbourhood WWW of XmX_mXm​ there is an absolutely convex set Ω⊆E\Omega\subseteq EΩ⊆E whose trace Ω∩Xk\Omega\cap X_kΩ∩Xk​ is a 000-neighbourhood of XkX_kXk​ for every kkk, and

U∩(Ω+V)⊆W+V.U\cap(\Omega+V)\subseteq W+V.U∩(Ω+V)⊆W+V.

This is the combinatorial core of Retakh's theorem that (M) implies that the inductive limit topology and the step topology of Xm/(V∩Xm)X_m/(V\cap X_m)Xm​/(V∩Xm​) coincide on the image of UUU (the set Ω\OmegaΩ is built as an absolutely convex hull of suitably chosen step neighbourhoods).

Preamble
import Definitions.Def_MasulloGRH_LocallyConvex

set_option autoImplicit false
Formal statement
namespace MasulloGRH

theorem strictLF_quotient_condM_absConvex_localization (E : Type*) [AddCommGroup E] [Module ℂ E]
    [TopologicalSpace E] (X : ℕ → Submodule ℂ E) (hmono : Monotone X)
    (hexh : ∀ x : E, ∃ n, x ∈ X n) (hX : ∀ n, IsFrechet (X n) ∧ IsNuclear (X n))
    (htop : ‹TopologicalSpace E› =
      sInf {t | IsLocallyConvexTopology E t ∧ ∀ n, @Continuous (X n) E _ t Subtype.val})
    (V : Submodule ℂ E) (hV : IsClosed (V : Set E))
    (hM : ∀ n : ℕ, ∃ m : ℕ, n ≤ m ∧ ∃ U ∈ nhds (0 : X n), ∀ k : ℕ, m ≤ k →
      ∀ W ∈ nhds (0 : X m), ∃ W' ∈ nhds (0 : X k),
        ∀ x ∈ U, ∀ y ∈ W', ((x : E) - (y : E)) ∈ V → ∃ w ∈ W, ((x : E) - (w : E)) ∈ V) :
    ∀ n : ℕ, ∃ m : ℕ, n ≤ m ∧ ∃ U ∈ nhds (0 : X n), ∀ W ∈ nhds (0 : X m),
      ∃ Ω : Set E, Convex ℝ Ω ∧ Balanced ℂ Ω ∧
        (∀ k, ((↑) : X k → E) ⁻¹' Ω ∈ nhds (0 : X k)) ∧
        ∀ x ∈ U, ∀ y ∈ Ω, ((x : E) - y) ∈ V → ∃ w ∈ W, ((x : E) - (w : E)) ∈ V := by sorry

end MasulloGRH
Source
A. M. Masullo, The Music of the Primes (draft 20 Nov 2026), Appendix C, §C.1.5; V. S. Retakh, Subspaces of a countable inductive limit, Soviet Math. Dokl. 11 (1970); J. Wengenroth, Derived Functors in Functional Analysis, LNM 1810, Ch. 6.

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