Bounded sets in complete nuclear (DF)-spaces admit uniformly summable series representations
ProvedNuclearSpaces.completeDF_bounded_series_expansionLet be a complete nuclear Hausdorff locally convex space over with the following two properties: it has a countable fundamental family of bounded sets, and every countable intersection of closed, balanced, convex zero-neighbourhoods that absorbs every bounded set is itself a zero-neighbourhood.
For every bounded subset , there exist a bounded sequence in and a nonnegative summable real sequence such that every point of admits a series representation with the same coefficient bounds:
The sum converges unconditionally in the given topology of ; formally this is HasSum, not a totalized sum without a convergence assertion. The sequence and the envelope are independent of .
This result gives a common summable coefficient envelope for an entire bounded set. It is a scalar-factor specialization of Grothendieck's bounded-disk tensor-series theorem (section 2.4, Theorem 5), and provides the series-construction step needed for bounded nuclear domination in the mission's nuclear-duality argument.
Formalization note: this theorem is an open obligation. Its proof must construct the series independently of the target MasulloGRH.completeNuclearDF_bounded_nuclear_domination and of any strong-dual nuclearity theorem that reduces to that target.
import Definitions.Def_MasulloGRH_LocallyConvex set_option autoImplicit false open MasulloGRH
theorem NuclearSpaces.completeDF_bounded_series_expansion
(G : Type*) [AddCommGroup G] [Module ℂ G]
[TopologicalSpace G] (hC : IsCompleteTVS G) (hN : IsNuclear G)
(hB : ∃ B : ℕ → Set G, (∀ n, Bornology.IsVonNBounded ℂ (B n)) ∧
∀ S : Set G, Bornology.IsVonNBounded ℂ S → ∃ n, S ⊆ B n)
(hDF : ∀ U : ℕ → Set G, (∀ n, U n ∈ nhds (0 : G) ∧ IsClosed (U n) ∧ Balanced ℂ (U n) ∧ Convex ℝ (U n)) →
(∀ S : Set G, Bornology.IsVonNBounded ℂ S → Absorbs ℂ (⋂ n, U n) S) →
(⋂ n, U n) ∈ nhds (0 : G))
(B : Set G) (hBb : Bornology.IsVonNBounded ℂ B) :
∃ (y : ℕ → G) (c : ℕ → ℝ), Bornology.IsVonNBounded ℂ (Set.range y) ∧
(∀ n, 0 ≤ c n) ∧ Summable c ∧
∀ x ∈ B, ∃ a : ℕ → ℂ, (∀ n, ‖a n‖ ≤ c n) ∧
HasSum (fun n => a n • y n) x := by sorry