Bounded-set lifting through factorizations of strict inductive-limit stages
ProvedMasulloGRH.bounded_lifting_of_stage_factorizationsLet and be complex vector spaces equipped with topologies, with a Hausdorff locally convex topological vector space. Suppose is the strict locally convex inductive limit of an increasing exhaustive sequence of closed subspaces , each carrying its subspace topology.
For each , let be complex vector spaces with topologies. Suppose there are continuous linear maps and , maps and , and a map , such that
where is the inclusion. If each lifts bounded sets, then so does :
This abstracts the bounded-set assembly in the last paragraph of the proof of Corollary C.1.5.13. There the auxiliary quotient is a suitable quotient of a nuclear Frechet step, and 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 and need to be continuous and linear for this assembly step; may be arbitrary functions satisfying the displayed conditions. The Lean statement accordingly assumes only vector-space topologies on , and explicitly assumes a Hausdorff locally convex topology on . The topology of is specified as the finest locally convex topology making all stage inclusions continuous. Bounded means von Neumann bounded.
import Definitions.Def_MasulloGRH_LocallyConvex set_option autoImplicit false open Set MasulloGRH
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