Uniform two-sided bound.
ProvedTropicalLA.abs_specNorm_sub_leaether-catalogalgebra
Uniform two-sided bound. With v an eigenvector of spread
C = max v - min v, every power satisfies |‖A^{⊗(m+1)}‖ - (m+1)·lam| ≤ C.
theorem TropicalLA.abs_specNorm_sub_le{lam : ℝ} {v : ι → ℝ} (h : IsTropEigen A lam v) (m : ℕ) :
|specNorm A m - (m + 1) * lam| ≤
Finset.univ.sup' (Finset.univ_nonempty (α := ι)) v
- Finset.univ.inf' (Finset.univ_nonempty (α := ι)) v := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Algebra/TropicalLinearAlgebra/TropicalGelfand.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Algebra/TropicalLinearAlgebra/TropicalGelfand.lean
import Mathlib
import Definitions.Def_Algebra_TropicalLinearAlgebra_TropicalEigenvalue
import Definitions.Def_Algebra_TropicalLinearAlgebra_TropicalGelfand
import Definitions.Def_Algebra_TropicalLinearAlgebra_TropicalPerronFrobenius
/-
# A tropical Gelfand formula: growth rate of matrix powers
Classically the spectral radius of a matrix is the limit of `‖A^m‖^{1/m}`. In the
max-plus world exponentiation becomes multiplication, and the statement becomes
`‖A^{⊗ m}‖ / m → λ(A)`,
where `‖·‖` is the largest entry and `λ(A)` is the maximum cycle mean. This file
proves the sharp two-sided form: the largest entry of `A^{⊗(m+1)}` differs from
`(m+1)·λ` by at most the *spread* `max v - min v` of a tropical eigenvector,
uniformly in `m`, hence the normalised growth rate converges to `λ`.
The bridge is that the eigenvector is preserved by the tropical action:
`A^{⊗(m+1)} ⊗ v = ((m+1)·λ) ⊗ v` (`IsTropEigen.tmulVec_tpow`).
-/
open TropicalLA
open Filter Topology
variable {ι : Type*} [Fintype ι] [Nonempty ι]
open IsTropEigen
variable {A : Matrix ι ι ℝ} {lam : ℝ} {v : ι → ℝ}
variable (A : Matrix ι ι ℝ)
variable {A}Formal statement
theorem TropicalLA.abs_specNorm_sub_le{lam : ℝ} {v : ι → ℝ} (h : IsTropEigen A lam v) (m : ℕ) :
|specNorm A m - (m + 1) * lam| ≤
Finset.univ.sup' (Finset.univ_nonempty (α := ι)) v
- Finset.univ.inf' (Finset.univ_nonempty (α := ι)) v := by sorrySource