While this submission is a draft, it cannot be used by other submissions.

Elementary properties of the growth function

Lax606786.GrowthFunctionProperties · concepts/Lax606786/GrowthFunctionProperties.lean · lax-606786

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    Let X,Y,ZX, Y, Z be real normed spaces, T:X→YT : X \to Y and S:Y→ZS : Y \to Z bounded operators and V≤XV \le X a subspace. Then

    • 0≤g(T,V)≤∥T∥0 \le g(T, V) \le \|T\|, and g(T,V) ∥x∥≤∥Tx∥g(T, V)\,\|x\| \le \|Tx\| for every x∈Vx \in V;
    • g(T,V)≤g(T,W)g(T, V) \le g(T, W) whenever 0≠W≤V0 \ne W \le V;
    • g(T,span⁡{u})=∥Tu∥g(T, \operatorname{span}\{u\}) = \|Tu\| for every unit vector uu (for T:X→XT : X \to X);
    • (the growth inequality)g(T,V) g(S,TV)≤g(ST,V)≤min⁡(∥T∥ g(S,TV), g(T,V) ∥S∥).g(T, V)\, g(S, TV) \le g(ST, V) \le \min\bigl(\|T\|\, g(S, TV),\ g(T, V)\,\|S\|\bigr).
    Concept map
    3 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 6 statements. Each proof establishes one of them relative to its assumptions.

    1 growth_comp_bounds proven

    6 growth_span_singleton proven

    In the paper

    • page 3 of this submission's paper

    Lean source view on GitLab

    1import Lax606786.OperatorStatistics
    2
    3/-!
    4---
    5title: Elementary properties of the growth function
    6type: theorem
    7---
    8Let X,Y,ZX, Y, Z be real normed spaces, T:X→YT : X \to Y and S:Y→ZS : Y \to Z bounded operators and
    9V≤XV \le X a subspace. Then
    10
    11- 0≤g(T,V)≤∥T∥0 \le g(T, V) \le \|T\|, and g(T,V) ∥x∥≤∥Tx∥g(T, V)\,\|x\| \le \|Tx\| for every x∈Vx \in V;
    12- g(T,V)≤g(T,W)g(T, V) \le g(T, W) whenever 0≠W≤V0 \ne W \le V;
    13- g(T,span⁡{u})=∥Tu∥g(T, \operatorname{span}\{u\}) = \|Tu\| for every unit vector uu (for T:X→XT : X \to X);
    14- (the growth inequality)
    15 g(T,V) g(S,TV)≤g(ST,V)≤min⁡(∥T∥ g(S,TV), g(T,V) ∥S∥).g(T, V)\, g(S, TV) \le g(ST, V) \le \min\bigl(\|T\|\, g(S, TV),\ g(T, V)\,\|S\|\bigr).
    16-/
    17
    18namespace Lax606786.GrowthFunctionProperties
    19
    20open Lax606786.OperatorStatistics
    21
    22variable {X Y Z : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
    23 [NormedAddCommGroup Y] [NormedSpace ℝ Y] [NormedAddCommGroup Z] [NormedSpace ℝ Z]
    24
    25/-- `g(T, V) ≥ 0`. -/
    26axiom growth_nonneg (T : X →L[ℝ] Y) (V : Submodule ℝ X) : 0 ≤ growth T V
    27
    28/-- `g(T, V) ≤ ‖T‖`. -/
    29axiom growth_le_opNorm (T : X →L[ℝ] Y) (V : Submodule ℝ X) : growth T V ≤ ‖T‖
    30
    31/-- `g(T, V) ‖u‖ ≤ ‖T u‖` for `u ∈ V`. -/
    32axiom growth_mul_norm_le (T : X →L[ℝ] Y) {V : Submodule ℝ X} {u : X} (hu : u ∈ V) :
    33 growth T V * ‖u‖ ≤ ‖T u‖
    34
    35/-- Shrinking the subspace can only increase the slowest growth. -/
    36axiom growth_le_growth {T : X →L[ℝ] X} {W V : Submodule ℝ X} (hWV : W ≤ V) (hW : W ≠ ⊥) :
    37 growth T V ≤ growth T W
    38
    39/-- The growth on a line is the growth of its unit vector. -/
    40axiom growth_span_singleton (T : X →L[ℝ] X) {u : X} (hu : ‖u‖ = 1) :
    41 growth T (Submodule.span ℝ {u}) = ‖T u‖
    42
    43/-- The growth inequality for a composition. -/
    44axiom growth_comp_bounds (T : X →L[ℝ] Y) (S : Y →L[ℝ] Z) (V : Submodule ℝ X) :
    45 growth T V * growth S (V.map (T : X →ₗ[ℝ] Y)) ≤ growth (S.comp T) V ∧
    46 growth (S.comp T) V ≤ min (‖T‖ * growth S (V.map (T : X →ₗ[ℝ] Y))) (growth T V * ‖S‖)
    47
    48end Lax606786.GrowthFunctionProperties
    49
    Show ProofShow ProofShow ProofShow ProofShow ProofShow Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…