An Euler-step supremum-norm estimate from signed row sums
ProvedBianchiIX.norm_euler_le_of_signedRowSumbianchi-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. Assume is nonempty. Let , , and for every . 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
noncomputable section
open BianchiIX
open Set Filter
open scoped Topology
variable {ι : Type*} [Fintype ι] [DecidableEq ι] [Nonempty ι]
Formal statement
theorem BianchiIX.norm_euler_le_of_signedRowSum {A : Matrix ι ι ℝ} {ρ h : ℝ}
(hA : ∀ i, signedRowSum A i ≤ ρ) (hh : 0 ≤ h)
(hdiag : ∀ i, 0 ≤ 1 + h * A i i) (x : ι → ℝ) :
‖x + h • A.mulVec x‖ ≤ (1 + h * ρ) * ‖x‖ := by sorry
Source