is_principal_vertex
For 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 ≤ vec u for all vertices v.
Statement
def is_principal_vertex {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (u : V) : Prop
- Defined in
- arXiv:2610.17078, Section 2
- Verified
- 24 Oct 2026
- Axioms
- none listed
- Built on 1
- is_perron_vectorFor 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…
- Used by 1
- 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.
Read back from the Lean
Given a finite type V with decidable equality, a simple graph G on V, and a vertex u : V, is_principal_vertex G u asserts that there exists a vector vec : V → ℝ such that:
1. vec is a Perron vector of G, meaning:
a. vec is strictly positive at every vertex (0 < vec i for all i : V), and
b. vec is an eigenvector of the real adjacency matrix of G with eigenvalue equal to the real spectral radius of the adjacency matrix ((G.adjMatrix ℝ).mulVec vec = (ENNReal.toReal (adjacency_spectral_radius G)) • vec); and
2. the entry of vec at u is maximal, in the sense that for all v : V, vec v ≤ vec u.
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 principal vertex of a simple graph is a vertex where some Perron vector achieves its maximum coordinate. -/ def is_principal_vertex {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) (u : V) : Prop := ∃ vec, is_perron_vector G vec ∧ ∀ v, vec v ≤ vec u