Nonnegativity of the Second Largest Eigenvalue of 4 × 4 Tridiagonal Stochastic Matrices

The spectral study of nonnegative and more specifically stochastic matrices is an important topic in matrix theory. We prove the conjecture of Ran and Teng that the second-largest eigenvalue, in algebraic order, of every irreducible 4×4 tridiagonal stochastic matrix is strictly positive. Our proof first uses a positive diagonal similarity to obtain a real symmetric tridiagonal matrix. An LDL⊤ factorisation and recurrences for its leading principal minors bound the number of negative eigenvalues. A perturbation argument removes the assumption that these minors are nonzero, and an explicit positive-subspace argument establishes strict positivity also when the matrix is singular. Finally, irreducible stochastic approximations and continuity of the ordered eigenvalues yield nonnegativity for all 4×4 tridiagonal stochastic matrices, including reducible matrices. An explicit one-parameter family illustrates both the result and the attainment of zero at a reducible limit.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-11-19
DOI
https://doi.org/10.3390/math14224268
Citations
1
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
1.60
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Nonnegativity of the Second Largest Eigenvalue of 4 × 4 Tridiagonal Stochastic Matrices

Brecht Verbeken, Marie‐Anne Guerry, Brando Vagenende
1 citations
Mathematics
Matrix Theory and Algorithms
1.60
article

Nonnegativity of the Second Largest Eigenvalue of 4 × 4 Tridiagonal Stochastic Matrices

Brecht Verbeken, Marie‐Anne Guerry, Brando Vagenende
article en
1 citations

Abstract

The spectral study of nonnegative and more specifically stochastic matrices is an important topic in matrix theory. We prove the conjecture of Ran and Teng that the second-largest eigenvalue, in algebraic order, of every irreducible 4×4 tridiagonal stochastic matrix is strictly positive. Our proof first uses a positive diagonal similarity to obtain a real symmetric tridiagonal matrix. An LDL⊤ factorisation and recurrences for its leading principal minors bound the number of negative eigenvalues. A perturbation argument removes the assumption that these minors are nonzero, and an explicit positive-subspace argument establishes strict positivity also when the matrix is singular. Finally, irreducible stochastic approximations and continuity of the ordered eigenvalues yield nonnegativity for all 4×4 tridiagonal stochastic matrices, including reducible matrices. An explicit one-parameter family illustrates both the result and the attainment of zero at a reducible limit.

MathematicsVol. 14(22)
Vrije Universiteit Brussel (BE)
Openalex Percentile: Top 25%
Matrix Theory and Algorithms
1.60
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon