Grothendieck’s bounded-disk expansion with scalar tensor factor
ProvedMasulloGRH.bounded_disk_scalar_expansionLet G be a complete Hausdorff nuclear locally convex space which is either Fréchet or of type (DF). For each bounded subset B of G there is a sequence y_n converging to zero in G, a nonnegative summable sequence c_n, and linear functionals a_n on the algebraic span of B. Every x in that span has the convergent expansion x = Σ a_n(x)y_n, and for each x in B the simultaneous bounds |a_n(x)| ≤ c_n hold. The functionals depend linearly on x and the envelope is uniform over B.
This is the scalar specialization of Grothendieck's bounded-disk expansion theorem. Take the second tensor factor to be the scalar field, which is of both indicated types. Completeness identifies the completed projective tensor product with G. Apply Theorem 5 to the closed absolutely convex hull A of B. Its disk norm gives norm at most one to points of B. Equicontinuity on the normed space generated by A bounds all of the source's coefficient functionals uniformly on B. Restrict them to the span of B and absorb the source's summable scalar weights into the functionals to obtain a_n and c_n. The assertion asks for an actual series in G, simultaneously for the entire span.
import Definitions.Def_MasulloGRH_LocallyConvex set_option autoImplicit false
namespace MasulloGRH
theorem bounded_disk_scalar_expansion (G : Type*) [AddCommGroup G] [Module ℂ G]
[TopologicalSpace G] (hC : IsCompleteTVS G) (hN : IsNuclear G)
(hclass : IsFrechet G ∨
((∃ B : ℕ → Set G, (∀ n, Bornology.IsVonNBounded ℂ (B n)) ∧
∀ S : Set G, Bornology.IsVonNBounded ℂ S → ∃ n, S ⊆ B n) ∧
(∀ 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 : ℕ → ℝ) (a : ℕ → (Submodule.span ℂ B) →ₗ[ℂ] ℂ),
Filter.Tendsto y Filter.atTop (nhds (0 : G)) ∧
(∀ n, 0 ≤ c n) ∧ Summable c ∧
(∀ n (x : Submodule.span ℂ B), (x : G) ∈ B → ‖a n x‖ ≤ c n) ∧
∀ x : Submodule.span ℂ B, HasSum (fun n => a n x • y n) (x : G) := by sorry
end MasulloGRH