Uniqueness of the tropical eigenvalue.
ProvedTropicalLA.tropEigenvalue_uniqueaether-catalogalgebra
Uniqueness of the tropical eigenvalue. Any two eigenvalues of the same max-plus matrix coincide — both equal the maximum cycle mean.
theorem TropicalLA.tropEigenvalue_unique{A : Matrix ι ι ℝ} {lam₁ lam₂ : ℝ} {v₁ v₂ : ι → ℝ}
(h₁ : IsTropEigen A lam₁ v₁) (h₂ : IsTropEigen A lam₂ v₂) : lam₁ = lam₂ := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Algebra/TropicalLinearAlgebra/TropicalEigenvalue.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/TropicalEigenvalue.lean
import Mathlib
import Definitions.Def_Algebra_TropicalLinearAlgebra_TropicalDeterminant
import Definitions.Def_Algebra_TropicalLinearAlgebra_TropicalEigenvalue
/-
# Tropical eigenvalues and the max-plus Perron–Frobenius theorem
An eigenpair of a max-plus matrix `A` (finite real entries) is a pair `(lam, v)`
with `A ⊗ v = lam ⊗ v`, i.e.
`max_j (A i j + v j) = lam + v i` for every `i`.
Main results of this file:
* `IsTropEigen.cycle_le` : every closed walk (cycle) of `A` has weight at most
`length · lam` — an eigenvalue dominates all cycle means;
* `IsTropEigen.exists_critical_cycle` : some *simple* cycle attains the mean `lam`
exactly (the critical cycle), obtained from the argmax function of the eigenvector
by a minimal-period pigeonhole argument;
* `IsTropEigen.isGreatest_cycleMean` : **tropical Perron–Frobenius (spectral part)** —
`lam` is the *maximum cycle mean* of `A`, and hence
* `tropEigenvalue_unique` : a max-plus matrix has at most one eigenvalue.
-/
open TropicalLA
variable {ι : Type*} [Fintype ι] [Nonempty ι]
open IsTropEigen
variable {A : Matrix ι ι ℝ} {lam : ℝ} {v : ι → ℝ}Formal statement
theorem TropicalLA.tropEigenvalue_unique{A : Matrix ι ι ℝ} {lam₁ lam₂ : ℝ} {v₁ v₂ : ι → ℝ}
(h₁ : IsTropEigen A lam₁ v₁) (h₂ : IsTropEigen A lam₂ v₂) : lam₁ = lam₂ := by sorrySource