Adjacency eigenvalues below twelve give ordinary walk gap above one seventh
ProvedOPG37364.spectralGap_gt_one_seventh_of_adjacency_boundLet be a connected finite -regular simple graph, and let be its real adjacency matrix. Suppose every real eigenvalue of whose value is not satisfies .
Then the ordinary simple-random-walk matrix satisfies
The matrix is . The platform definition of the ordinary gap is . The adjacency hypothesis is expressed directly by Mathlib real matrix spectrum membership, with a strict one-sided bound. It permits the bipartite eigenvalue and does not use the absolute spectral gap. No bipartiteness, girth, cut expansion, immunity or perfect-matching assumption is required.
Formalization Note. The direct value-based formulation avoids identifying an ordered second eigenvalue with a value-excluding supremum. Connectedness is an explicit hypothesis; no simplicity theorem for the top eigenvalue is an additional assumption.
import Definitions.Def_opg37364_matching_cuts import Definitions.Def_mm_spectral import Mathlib.Combinatorics.SimpleGraph.AdjMatrix import Mathlib.Analysis.Matrix.Spectrum set_option autoImplicit false open scoped Classical
namespace OPG37364
theorem spectralGap_gt_one_seventh_of_adjacency_bound
{n : ℕ} (G : SimpleGraph (Fin n))
(hconn : IsConnected G) (hreg : IsRegularOfDegree G 14)
(hAdj : ∀ μ : ℝ, μ ∈ spectrum ℝ (G.adjMatrix ℝ) → μ ≠ 14 → μ < 12) :
(1 : ℝ) / 7 < MarkovMixing.spectralGap (MarkovMixing.graphWalk G) := by sorry
end OPG37364