Extend a self-injective self-map of `s` to a permutation of the whole index set.
ProvedTropicalLA.exists_perm_of_mapsToaether-catalogalgebra
Extend a self-injective self-map of s to a permutation of the whole index set.
theorem TropicalLA.exists_perm_of_mapsTo{s : Finset ι} {f : ι → ι} (hmaps : ∀ i ∈ s, f i ∈ s)
(hinj : Set.InjOn f s) : ∃ σ : Equiv.Perm ι, ∀ i ∈ s, σ i = f i := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Algebra/TropicalLinearAlgebra/TropicalCharPoly.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/TropicalCharPoly.lean
import Mathlib
import Definitions.Def_Algebra_TropicalLinearAlgebra_TropicalCharPoly
import Definitions.Def_Algebra_TropicalLinearAlgebra_TropicalEigenvalue
/-
# The tropical characteristic polynomial and its roots
For a max-plus matrix `A` on an `n`-element index set the tropical characteristic
polynomial is
`p_A(x) = max_{0 ≤ k ≤ n} ( c_k + (n - k)·x )`, `c_k = max_{|s| = k, σ(s) = s} Σ_{i ∈ s} A i (σ i)`,
the coefficient `c_k` being the tropical determinant of the best principal `k × k`
minor (`charCoeff`). A point `x` is a **tropical root** when the maximum defining
`p_A(x)` is attained at two different degrees `k` (the standard corner-locus
definition of a root of a tropical polynomial).
Main results:
* `charCoeff_card_eq_tdet` : the top coefficient is the tropical determinant;
* `charCoeff_le_of_eigen` : if `lam` is an eigenvalue then `c_k ≤ k·lam` for all `k`;
* `exists_charCoeff_eq_of_eigen` : equality `c_k = k·lam` holds for some `1 ≤ k ≤ n`,
witnessed by the critical cycle turned into a genuine permutation;
* `eigen_isTropicalRoot` : **every tropical eigenvalue is a root of the tropical
characteristic polynomial**, with the maximum attained both at degree `0` and at
the length of a critical cycle, and `p_A(lam) = n·lam`.
-/
open TropicalLA
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
variable [Nonempty ι] {A : Matrix ι ι ℝ} {lam : ℝ} {v : ι → ℝ}
omit [Nonempty ι] inFormal statement
theorem TropicalLA.exists_perm_of_mapsTo{s : Finset ι} {f : ι → ι} (hmaps : ∀ i ∈ s, f i ∈ s)
(hinj : Set.InjOn f s) : ∃ σ : Equiv.Perm ι, ∀ i ∈ s, σ i = f i := by sorrySource