Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Retakh's localization lemma: (M) forces E/FE/FE/F and PmP_mPm​ to agree on q(U)q(U)q(U)

Proved
MasulloGRH.strictLF_quotient_regular_of_condM_localization

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

functional-analysislf-spaces

Let E=⋃nEnE=\bigcup_n E_nE=⋃n​En​ be a strict countable locally convex inductive limit of nuclear Fréchet spaces E0⊆E1⊆⋯E_0\subseteq E_1\subseteq\cdotsE0​⊆E1​⊆⋯ (each EnE_nEn​ with the topology induced by EEE; EEE with the finest locally convex topology making all inclusions continuous). Let F⊆EF\subseteq EF⊆E be a closed linear subspace, q ⁣:E→E/Fq\colon E\to E/Fq:E→E/F the quotient map (with the quotient topology) and Pn=En/(F∩En)P_n=E_n/(F\cap E_n)Pn​=En​/(F∩En​) the quotient steps. Here U0(⋅)\mathcal U_0(\cdot)U0​(⋅) denotes the filter of 000-neighbourhoods.

Assume the quotient spectrum (Pm)(P_m)(Pm​) satisfies Retakh's condition (M), written in terms of the steps:

∀n ∃m≥n ∃U∈U0(En) ∀k≥m ∀W∈U0(Em) ∃W′∈U0(Ek):q(U)∩q(W′)⊆q(W).\forall n\ \exists m\ge n\ \exists U\in\mathcal U_0(E_n)\ \forall k\ge m\ \forall W\in\mathcal U_0(E_m)\ \exists W'\in\mathcal U_0(E_k):\quad q(U)\cap q(W')\subseteq q(W).∀n ∃m≥n ∃U∈U0​(En​) ∀k≥m ∀W∈U0​(Em​) ∃W′∈U0​(Ek​):q(U)∩q(W′)⊆q(W).

Then (M) localizes to the inductive limit itself (Retakh's lemma): on q(U)q(U)q(U) the quotient topology of E/FE/FE/F and the topology of PmP_mPm​ coincide at 000,

∀n ∃m≥n ∃U∈U0(En) ∀W∈U0(Em) ∃G∈U0(E/F):q(U)∩G⊆q(W).\forall n\ \exists m\ge n\ \exists U\in\mathcal U_0(E_n)\ \forall W\in\mathcal U_0(E_m)\ \exists G\in\mathcal U_0(E/F):\quad q(U)\cap G\subseteq q(W).∀n ∃m≥n ∃U∈U0​(En​) ∀W∈U0​(Em​) ∃G∈U0​(E/F):q(U)∩G⊆q(W).

In Lean, q(x)∈q(W)q(x)\in q(W)q(x)∈q(W) for x∈Ux\in Ux∈U is written as x−w∈Fx-w\in Fx−w∈F for some w∈Ww\in Ww∈W. This is the key step of Retakh's theorem (Wengenroth, proof of Theorem 6.4): the absolutely convex hull of a suitable union of the neighbourhoods W′W'W′ provided by (M) is a 000-neighbourhood of the inductive limit E/F=ind⁡PmE/F=\operatorname{ind}P_mE/F=indPm​.

Preamble
import Definitions.Def_MasulloGRH_LocallyConvex

set_option autoImplicit false
Formal statement
namespace MasulloGRH

theorem strictLF_quotient_regular_of_condM_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),
      ∃ G ∈ nhds (0 : E ⧸ V), ∀ x ∈ U, Submodule.Quotient.mk (x : E) ∈ G →
        ∃ w ∈ W, ((x : E) - (w : E)) ∈ V := by sorry

end MasulloGRH
Source
V. S. Retakh, Subspaces of a countable inductive limit, Soviet Math. Dokl. 11 (1970) 1384-1386; J. Wengenroth, Derived Functors in Functional Analysis, LNM 1810 (2003), Section 6.1, Theorem 6.4 and its proof; used in A. M. Masullo, The Music of the Primes, draft of 20 November 2026, Appendix C, Theorem C.1.5.11 and proof of Corollary C.1.5.13 (pp. 667-669)

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