Limit subspaces of strict LF-spaces give quotient spectra satisfying Retakh's condition (M)
ProvedMasulloGRH.strictLF_quotient_condM_of_limit_subspaceLet be a strict countable locally convex inductive limit of nuclear Fréchet spaces (each carries the topology induced by , and carries the finest locally convex topology making all inclusions continuous). Let be a closed linear subspace, the quotient map, and with the quotient topology of ; the natural maps () and are continuous linear injections.
Assume is a limit subspace: the topology induced on by equals the locally convex inductive limit topology of the subspaces (each with the topology induced from ). Then the quotient spectrum satisfies Retakh's condition (M) for the quotient spectrum , written in terms of the steps (neighbourhoods of in are exactly the sets containing the image of a -neighbourhood of ):
In words: on the image of the topologies induced by all steps , , coincide (at ) with the topology of . In Lean, for is written as: for some .
Proof idea: the rows are topologically exact; the strict spectra and are acyclic, and since carries the inductive limit topology the map is open, which by a diagram chase makes the map of Definition C.1.5.8 for a topological embedding with closed range, i.e. is acyclic. For spectra of Fréchet spaces acyclicity is equivalent to condition (M) (Retakh, Palamodov, Vogt; see Wengenroth).
import Definitions.Def_MasulloGRH_LocallyConvex set_option autoImplicit false
namespace MasulloGRH
theorem strictLF_quotient_condM_of_limit_subspace (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))
(hlim : (instTopologicalSpaceSubtype : TopologicalSpace V) =
sInf {t | IsLocallyConvexTopology V t ∧
∀ n, @Continuous ↥(V ⊓ X n) V _ t (Submodule.inclusion inf_le_left)}) :
∀ 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