Compact logarithmic composition controls the weak row without the strong-wall error
ProvedBianchiIX.compact_log_composition_boundsbianchi-ix-era-statisticsdynamical-systems
Let be linear, with , and let , , , and . For , assume
For ,
Preamble
import Mathlib.Analysis.Normed.Operator.Basic import Mathlib.LinearAlgebra.Matrix.Notation import Mathlib.Tactic.FinCases import Mathlib.Tactic.Ring import Mathlib.Tactic.Linarith import Mathlib.Tactic.Positivity import Mathlib.Analysis.Real.Sqrt namespace BianchiIX end BianchiIX noncomputable section open BianchiIX
Formal statement
theorem BianchiIX.compact_log_composition_bounds
(J : (Fin 4 → ℝ) →L[ℝ] (Fin 2 → ℝ)) (d : Fin 4 → ℝ)
{A B u v L ℓ s t : ℝ} (hA : 0 ≤ A) (hB : 0 ≤ B) (hu : 0 < u) (hv : 0 < v)
(hℓ : 0 ≤ ℓ) (hs : 0 ≤ s) (ht : 0 ≤ t) (hlog : L ≤ A + ℓ)
(hd0 : |d 0| ≤ A) (hd1 : |d 1| ≤ A)
(hdu : |d 1| ≤ u * (A + s)) (hdv : |d 2| ≤ v * (A + t)) (hd3 : d 3 = 0)
(hUr : |J (Pi.single 0 1) 0| ≤ B * L)
(hUu : |J (Pi.single 1 1) 0 - 1 / u| ≤ B)
(hUv : |J (Pi.single 2 1) 0| ≤ 4 * B / v)
(hWr : |J (Pi.single 0 1) 1| ≤ B * L)
(hWu : |J (Pi.single 1 1) 1| ≤ B)
(hWv : |J (Pi.single 2 1) 1| ≤ B / v) :
let C := B * A ^ 2 + 6 * (B * A) + A + 4 * B + 1
|J d 0| ≤ C * (1 + ℓ + s + t) ∧ |J d 1| ≤ C * (1 + ℓ + t) := by sorry
Source