is_perron_vector
For a simple graph G on a finite vertex type V, a vector vec : V → ℝ is a Perron vector if every component vec i is strictly positive and vec is an eigenvector of the real adjacency matrix of G with eigenvalue equal to the real value of the adjacency spectral radius of G.
Statement
noncomputable def is_perron_vector {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (vec : V → ℝ) : Prop
- Defined in
- arXiv:2610.17078, Section 2
- Verified
- 24 Oct 2026
- Axioms
- none listed
- Built on 1
- adjacency_spectral_radiusThe adjacency spectral radius of a simple graph G on a finite vertex set is the spectral radius of its real adjacency matrix.
- Used by 2
- exists_principal_vertex_of_is_perron_vectorIn any finite nonempty simple graph G, if there exists a Perron vector vec, then there exists a principal vertex u of G.
- is_principal_vertexFor a simple graph G on a finite vertex type V, a vertex u is a principal vertex if there exists a Perron vector vec of G such that vec v…
Read back from the Lean
Given a finite type V with decidable equality, a simple graph G on V, and a vector vec : V → ℝ, is_perron_vector G vec is the proposition that:
1. Every component of vec is strictly positive: for all i : V, 0 < vec i; and
2. vec is an eigenvector of the real adjacency matrix of G with eigenvalue equal to the real value of the adjacency spectral radius of G: (G.adjMatrix ℝ).mulVec vec = (ENNReal.toReal (adjacency_spectral_radius G)) • vec.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A Perron vector of a simple graph is a strictly positive eigenvector of its adjacency matrix with eigenvalue equal to its spectral radius. -/ noncomputable def is_perron_vector {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (vec : V → ℝ) : Prop := open scoped Classical in (∀ i, 0 < vec i) ∧ (G.adjMatrix ℝ).mulVec vec = (ENNReal.toReal (adjacency_spectral_radius G)) • vec