Null-sequence images are bounded in a localized Frechet quotient stage
ProvedLocallyConvex.strictLF_localized_nullSequence_boundedLet be the strict countable locally convex inductive limit of its increasing Frechet subspaces , let be closed, and write . Let carry the quotient topology inherited from , rather than the subspace topology of . Assume that each has a zero-neighborhood such that the closure of in is contained in some .
For every there are and a zero-neighborhood with the following property. Whenever , a sequence tends to zero in , and for every , the sequence is bounded in . Explicitly, for every zero-neighborhood there exists such that
This separates the bounded-disk transport step from the first-countability argument giving the uniform neighborhood estimate in condition . It is an intermediate consequence reconstructed from the Banach-disk and closed-graph argument described for the localized-closure frontier, not a verbatim theorem of the cited paper. Its formal proof remains an open obligation. In particular, boundedness is required in the quotient-stage topology, not merely in .
import Definitions.Def_MasulloGRH_LocallyConvex set_option autoImplicit false open MasulloGRH
theorem LocallyConvex.strictLF_localized_nullSequence_bounded
(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))
(htop : ‹TopologicalSpace E› =
sInf {t | IsLocallyConvexTopology E t ∧ ∀ n, @Continuous (X n) E _ t Subtype.val})
(V : Submodule ℂ E) (hV : IsClosed (V : Set E))
(hloc : ∀ n : ℕ, ∃ U ∈ nhds (0 : X n), ∃ j : ℕ,
closure ((fun x : X n => V.mkQ (x : E)) '' U) ⊆
Set.range (Submodule.mapQ (V.comap (X j).subtype) V (X j).subtype le_rfl)) :
∀ n : ℕ, ∃ m : ℕ, n ≤ m ∧ ∃ U ∈ nhds (0 : X n),
∀ k : ℕ, m ≤ k → ∀ y : ℕ → X k,
Filter.Tendsto y Filter.atTop (nhds (0 : X k)) →
(∀ i, ∃ x ∈ U, ((x : E) - (y i : E)) ∈ V) →
∀ W ∈ nhds (0 : X m), ∃ R : ℝ, 0 < R ∧
∀ r : ℝ, R ≤ r → ∀ i, ∃ w ∈ W,
((y i : E) - (r : ℂ) • (w : E)) ∈ V := by sorry