Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded-set lifting through factorizations of strict inductive-limit stages

Proved
MasulloGRH.bounded_lifting_of_stage_factorizations

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

functional-analysislocally-convex-spacesmasullo

Let EEE and QQQ be complex vector spaces equipped with topologies, with QQQ a Hausdorff locally convex topological vector space. Suppose QQQ is the strict locally convex inductive limit of an increasing exhaustive sequence of closed subspaces YnY_nYn​, each carrying its subspace topology.

For each nnn, let Fn,PnF_n,P_nFn​,Pn​ be complex vector spaces with topologies. Suppose there are continuous linear maps jn:Fn→Ej_n:F_n\to Ejn​:Fn​→E and vn:Yn→Pnv_n:Y_n\to P_nvn​:Yn​→Pn​, maps pn:Fn→Pnp_n:F_n\to P_npn​:Fn​→Pn​ and rn:Pn→Qr_n:P_n\to Qrn​:Pn​→Q, and a map q:E→Qq:E\to Qq:E→Q, such that

q∘jn=rn∘pn,rn∘vn=ιn,q\circ j_n=r_n\circ p_n,\qquad r_n\circ v_n=\iota_n,q∘jn​=rn​∘pn​,rn​∘vn​=ιn​,

where ιn:Yn↪Q\iota_n:Y_n\hookrightarrow Qιn​:Yn​↪Q is the inclusion. If each pnp_npn​ lifts bounded sets, then so does qqq:

∀B⊂Q bounded,∃D⊂E bounded,B⊂q(D).\forall B\subset Q\text{ bounded},\quad \exists D\subset E\text{ bounded},\quad B\subset q(D).∀B⊂Q bounded,∃D⊂E bounded,B⊂q(D).

This abstracts the bounded-set assembly in the last paragraph of the proof of Corollary C.1.5.13. There the auxiliary quotient PnP_nPn​ is a suitable quotient of a nuclear Frechet step, and vnv_nvn​ comes from the factorization argument. This lemma does not assert existence of those factorizations or prove the bounded lifting property of the auxiliary quotients.

Formalization Note Only jnj_njn​ and vnv_nvn​ need to be continuous and linear for this assembly step; pn,rn,qp_n,r_n,qpn​,rn​,q may be arbitrary functions satisfying the displayed conditions. The Lean statement accordingly assumes only vector-space topologies on E,Fn,PnE,F_n,P_nE,Fn​,Pn​, and explicitly assumes a Hausdorff locally convex topology on QQQ. The topology of QQQ is specified as the finest locally convex topology making all stage inclusions continuous. Bounded means von Neumann bounded.

Preamble
import Definitions.Def_MasulloGRH_LocallyConvex
set_option autoImplicit false
open Set MasulloGRH
Formal statement
theorem MasulloGRH.bounded_lifting_of_stage_factorizations
    (E Q : Type*) [AddCommGroup E] [Module ℂ E] [TopologicalSpace E]
    [AddCommGroup Q] [Module ℂ Q] [TopologicalSpace Q]
    (hQ : IsHLCS Q) (Y : ℕ → Submodule ℂ Q) (hmono : Monotone Y)
    (hexh : ∀ y : Q, ∃ n, y ∈ Y n) (hcl : ∀ n, IsClosed (Y n : Set Q))
    (htop : ‹TopologicalSpace Q› =
      sInf {t | IsLocallyConvexTopology Q t ∧ ∀ n, @Continuous (Y n) Q _ t Subtype.val})
    (F P : ℕ → Type*) [∀ n, AddCommGroup (F n)] [∀ n, Module ℂ (F n)]
    [∀ n, TopologicalSpace (F n)] [∀ n, AddCommGroup (P n)] [∀ n, Module ℂ (P n)]
    [∀ n, TopologicalSpace (P n)]
    (q : E → Q) (j : ∀ n, F n →L[ℂ] E) (p : ∀ n, F n → P n)
    (r : ∀ n, P n → Q) (v : ∀ n, Y n →L[ℂ] P n)
    (hlift : ∀ n, LiftsBoundedSets (p n))
    (hcomm : ∀ n x, q (j n x) = r n (p n x))
    (hfactor : ∀ n y, r n (v n y) = (y : Q)) :
    LiftsBoundedSets q := by sorry
Source
A. M. Masullo, The Music of the Primes, frozen 20 November 2026 draft, Corollary C.1.5.13, proof, p. 669, final paragraph; bounded-set concentration is Proposition C.1.5.3, pp. 664–665. This is an abstraction of the final assembly step, not the entire corollary. https://math216.wordpress.com/wp-content/uploads/2026/11/the-music-of-the-primes.pdf

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