theorem
PerronFrobenius.simplex_le_one
{ι : Type u_1}
[Fintype ι]
{v : ι → ℝ}
(hv : v ∈ stdSimplex ℝ ι)
(i : ι)
:
Each coordinate of a point in the standard simplex is bounded above by 1.
theorem
PerronFrobenius.mulVec_pos
{ι : Type u_1}
[Fintype ι]
(M : Matrix ι ι ℝ)
(hM : ∀ (i j : ι), 0 < M i j)
{v : ι → ℝ}
(hv : v ∈ stdSimplex ℝ ι)
(i : ι)
:
For a strictly positive matrix M and any point in the standard simplex, every
coordinate of M.mulVec v is strictly positive.
Collatz-Wielandt set: pairs (v, t) with v in the standard simplex, t ≥ 0, and
t * v i ≤ (M.mulVec v) i for all i. The Perron-Frobenius eigenvalue is realised as the
supremum of t over this set.
Instances For
noncomputable def
PerronFrobenius.perronFrobeniusExistence
{ι : Type u_1}
[Fintype ι]
[Nonempty ι]
(M : Matrix ι ι ℝ)
(hM : ∀ (i j : ι), 0 < M i j)
:
Perron-Frobenius existence theorem for strictly positive matrices: there exist a
strictly positive scalar r and a strictly positive eigenvector v such that
M.mulVec v = r • v. The proof maximises the second coordinate over the Collatz-Wielandt
set.