A contractive linear equation retains its decay under faster forcing
ProvedBianchiIX.norm_le_exp_of_faster_forcingbianchi-ix-era-statisticsdynamical-systems
For a finite index type , a real matrix , and , define its signed row sum by
Vectors in carry the supremum norm. Let , , and . On , assume , every signed row sum of is at most , and . Then for every ,
Preamble
import Definitions.Def_BianchiIX_Analysis_SignedRowGrowth
import Mathlib.Analysis.ODE.Gronwall
import Mathlib.Data.Matrix.Mul
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.FunProp
import Mathlib.Analysis.Calculus.Deriv.Prod
noncomputable section
open BianchiIX
open Set
variable {ι : Type*} [Fintype ι] [DecidableEq ι] [Nonempty ι]
Formal statement
theorem BianchiIX.norm_le_exp_of_faster_forcing {f q : ℝ → (ι → ℝ)}
{A : ℝ → Matrix ι ι ℝ} {ρ Q T : ℝ} (hρ : 0 < ρ) (hQ : 0 ≤ Q)
(hf : ∀ t ∈ Icc 0 T, HasDerivAt f ((A t).mulVec (f t) + q t) t)
(hA : ∀ t ∈ Icc 0 T, ∀ i, signedRowSum (A t) i ≤ -ρ)
(hq : ∀ t ∈ Icc 0 T, ‖q t‖ ≤ Q * Real.exp (-2 * ρ * t)) :
∀ t ∈ Icc 0 T, ‖f t‖ ≤ (‖f 0‖ + Q / ρ) * Real.exp (-ρ * t) := by sorry
Source