Summable sequence synthesis #
This module develops norm and convergence estimates for synthesis from a summable sequence of vectors.
noncomputable def
L1Seq.synthesis
{H : Type u}
[NormedAddCommGroup H]
[NormedSpace ℝ H]
[CompleteSpace H]
(u : ℕ → H)
{K : ℝ}
(hu : ∀ (n : ℕ), ‖u n‖ ≤ K)
:
L1Seq →L[ℝ] H
The continuous linear synthesis operator for a uniformly bounded vector family.
Instances For
theorem
L1Seq.summable_norm_smul
{H : Type u}
[NormedAddCommGroup H]
[NormedSpace ℝ H]
[CompleteSpace H]
(u : ℕ → H)
{K : ℝ}
(hu : ∀ (n : ℕ), ‖u n‖ ≤ K)
(a : L1Seq)
:
Summable fun (n : ℕ) => ‖↑a n • u n‖
The terms synthesized from an L1Seq element and a uniformly bounded vector family
are absolutely summable.
theorem
L1Seq.norm_synthesis_le
{H : Type u}
[NormedAddCommGroup H]
[NormedSpace ℝ H]
[CompleteSpace H]
(u : ℕ → H)
{K : ℝ}
(hu : ∀ (n : ℕ), ‖u n‖ ≤ K)
:
‖synthesis u hu‖ ≤ K
The operator norm of synthesis is at most the uniform bound on the vector family.