Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The hull condition implies Retakh's condition (M) for the quotient spectrum

Proved
MasulloGRH.strictLF_quotient_condM_of_hull_condition

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

Let E=⋃kEkE=\bigcup_k E_kE=⋃k​Ek​ be a strict countable locally convex inductive limit of nuclear Fréchet spaces (each EkE_kEk​ with the topology induced by EEE, EEE with the finest locally convex topology making all inclusions continuous), and let F⊆EF\subseteq EF⊆E be a closed subspace. Write Γ(S)=conv⁡R(bal⁡CS)\Gamma(S)=\operatorname{conv}_{\mathbb R}(\operatorname{bal}_{\mathbb C}S)Γ(S)=convR​(balC​S) and assume the hull condition: for every sequence (Wk)(W_k)(Wk​) of 000-neighbourhoods Wk⊆EkW_k\subseteq E_kWk​⊆Ek​ there is a sequence (Ok)(O_k)(Ok​) of 000-neighbourhoods Ok⊆EkO_k\subseteq E_kOk​⊆Ek​ with

F∩Γ(⋃kOk)⊆Γ(⋃k(Wk∩F)).F\cap\Gamma\Big(\bigcup_k O_k\Big)\subseteq\Gamma\Big(\bigcup_k (W_k\cap F)\Big).F∩Γ(k⋃​Ok​)⊆Γ(k⋃​(Wk​∩F)).

(Since the sets Γ(⋃kOk)\Gamma(\bigcup_k O_k)Γ(⋃k​Ok​) form a 000-basis of EEE, this condition is equivalent to FFF being a limit subspace.)

Then the quotient spectrum Pm=Em/(F∩Em)P_m=E_m/(F\cap E_m)Pm​=Em​/(F∩Em​) 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),

where q ⁣:E→E/Fq\colon E\to E/Fq:E→E/F; in Lean, q(x)∈q(W′)q(x)\in q(W')q(x)∈q(W′) for x∈Ux\in Ux∈U reads: x−y∈Fx-y\in Fx−y∈F for some y∈W′y\in W'y∈W′.

This is Retakh's theorem (limit subspace ⇒\Rightarrow⇒ (M)); one proof shows that the quotient spectrum is acyclic by a diagram chase on 0→⨁F∩Em→⨁Em→⨁Pm→00\to\bigoplus F\cap E_m\to\bigoplus E_m\to\bigoplus P_m\to 00→⨁F∩Em​→⨁Em​→⨁Pm​→0, and then uses that acyclic Fréchet spectra satisfy (M) (Retakh, Palamodov, Vogt, Wengenroth).

Preamble
import Definitions.Def_MasulloGRH_LocallyConvex

set_option autoImplicit false
Formal statement
namespace MasulloGRH

theorem strictLF_quotient_condM_of_hull_condition (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))
    (hhull : ∀ W : ∀ k, Set (X k), (∀ k, W k ∈ nhds (0 : X k)) →
      ∃ O : ∀ k, Set (X k), (∀ k, O k ∈ nhds (0 : X k)) ∧
        ∀ v ∈ V, v ∈ convexHull ℝ (balancedHull ℂ (⋃ k, Subtype.val '' O k)) →
          v ∈ convexHull ℝ (balancedHull ℂ (⋃ k, (Subtype.val '' W k) ∩ (V : Set E)))) :
    ∀ 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 := by sorry

end MasulloGRH
Source
A. M. Masullo, The Music of the Primes (draft 20 Nov 2026), Appendix C, Definition C.1.5.8 and Theorem C.1.5.11 (pp. 667-669); V. S. Retakh, Subspaces of a countable inductive limit, Soviet Math. Dokl. 11 (1970); J. Wengenroth, Acyclic inductive spectra of Fréchet spaces, Studia Math. 120 (1996).

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