Recognition: 2 theorem links
· Lean TheoremOn the Spectral Region of 4-Cycle Stochastic Matrices
Pith reviewed 2026-05-11 00:52 UTC · model grok-4.3
The pith
The spectral region of 4-cycle row-stochastic matrices is exactly determined as the interval [-1,1] for real eigenvalues and a bounded planar region for complex eigenvalues.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We study the spectrum of 4-cycle row-stochastic matrices. For real eigenvalues the spectral region is [-1,1]. For nonreal eigenvalues a+ib we derive necessary conditions in terms of the real and imaginary parts, including the inequality a+|b| <= 1 and the condition (b^2+a^2+a)^2+2a^2-b^2 >= 0. We also prove conversely that every point in the corresponding interior region occurs as an eigenvalue of a 4-cycle matrix. The proof is organized through a reformulation of the characteristic equation, an argument parametrization, a convex-analytic criterion, and explicit boundary constructions. Hence, the spectral region for the 4-cycle row-stochastic matrices is exactly and explicitly determined.
What carries the argument
Reformulation of the characteristic equation of a 4-cycle row-stochastic matrix that permits parametrization by a single argument and application of convex-analytic criteria to identify the precise boundary.
If this is right
- Real eigenvalues of any 4-cycle row-stochastic matrix lie in the closed interval [-1,1].
- Non-real eigenvalues a+ib satisfy both a + |b| ≤ 1 and the inequality (b² + a² + a)² + 2a² - b² ≥ 0.
- Every complex number strictly inside the region bounded by these inequalities is realized as an eigenvalue of some 4-cycle row-stochastic matrix.
- The spectral radius and the rate of convergence of matrix powers are thereby determined exactly for this class.
- Explicit constructions on the boundary allow direct verification of limiting cases.
Where Pith is reading between the lines
- The same reformulation technique may yield analogous exact regions for stochastic matrices supported on cycles of other even lengths.
- Knowledge of the forbidden eigenvalue zones constrains possible oscillation frequencies in periodic stochastic systems.
- The boundary constructions supply test cases for numerical linear-algebra routines specialized to nonnegative matrices.
- In applications to periodic population or queueing models, the explicit region supplies sharp bounds on damping rates without computing full spectra.
Load-bearing premise
The support of the matrix is exactly a 4-cycle, which permits the characteristic equation to be rewritten in a form that admits argument parametrization and convex-analytic analysis.
What would settle it
A single 4-cycle row-stochastic matrix whose eigenvalue lies strictly outside the stated region, or the absence of any 4-cycle matrix realizing a chosen interior point of that region.
Figures
read the original abstract
We study the spectrum of 4-cycle row-stochastic matrices. For real eigenvalues the spectral region is [-1,1]. For nonreal eigenvalues a+ib we derive necessary conditions in terms of the real and imaginary parts, including the inequality a+|b| <= 1 and the condition (b^2+a^2+a)^2+2a^2-b^2 >= 0. We also prove conversely that every point in the corresponding interior region occurs as an eigenvalue of a 4-cycle matrix. The proof is organized through a reformulation of the characteristic equation, an argument parametrization, a convex-analytic criterion, and explicit boundary constructions. Hence, the spectral region for the 4-cycle row-stochastic matrices is exactly and explicitly determined.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper determines the spectral region of 4-cycle row-stochastic matrices. For real eigenvalues the region is exactly [-1,1]. For non-real eigenvalues a+ib it derives the necessary conditions a+|b|≤1 together with the quartic inequality (b²+a²+a)²+2a²-b²≥0, and conversely shows that every point in the open region defined by the strict inequalities is realized as an eigenvalue of some 4-cycle row-stochastic matrix. The argument proceeds by reformulating the characteristic polynomial, introducing an argument parametrization, applying a convex-analytic criterion to obtain the necessary conditions, and constructing explicit matrices that attain the boundary.
Significance. If the stated conditions are both necessary and sufficient, the manuscript supplies an explicit, closed-form description of the possible eigenvalues for this concrete family of nonnegative matrices. Such a complete characterization is uncommon and useful for spectral theory of stochastic matrices and for Markov chains whose transition graphs contain a single 4-cycle. The combination of algebraic reformulation, convex-analytic necessity, and explicit sufficiency constructions is a methodological strength that directly supports the central claim.
minor comments (2)
- In the abstract the quartic inequality is referred to as 'the given quartic inequality'; stating the explicit expression already in the introduction would improve readability for readers who consult only the front matter.
- The boundary constructions in the final section would benefit from a short table listing the parameter values (p,q,r,s) that realize a few representative boundary points, to make the sufficiency argument easier to verify.
Simulated Author's Rebuttal
We thank the referee for the careful reading of the manuscript and for the positive recommendation to accept. The referee's summary correctly reflects the main contributions: the explicit determination of the spectral region for 4-cycle row-stochastic matrices via necessary conditions derived from convex analysis and sufficiency via explicit constructions.
Circularity Check
No significant circularity; derivation is self-contained
full rationale
The paper establishes the exact spectral region for 4-cycle row-stochastic matrices via a direct proof: reformulation of the characteristic equation into a form allowing argument parametrization, application of convex-analytic criteria (such as a + |b| <= 1 and the quartic inequality), and explicit constructions to achieve boundary points. These steps use standard linear-algebra identities and convex analysis applied to the characteristic polynomial without any reduction to fitted parameters, self-referential definitions, or load-bearing self-citations. Necessity and sufficiency are shown independently through the outlined strategy, with no step equivalent to its inputs by construction.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Row-stochastic matrices have non-negative entries summing to 1 in each row.
- standard math Eigenvalues of a matrix are the roots of its characteristic polynomial.
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/AlexanderDuality.leanalexander_duality_circle_linking unclear4-cycle row-stochastic matrices A(α1,α2,α3,α4)
Reference graph
Works this paper leans on
-
[1]
F. I. Karpelevich,On the characteristic roots of matrices with nonnegative elements, Izvestiya Akademii Nauk SSSR Seriya Matematicheskaya extbf15 (1951), 361–383
1951
-
[2]
Dmitriev and E
N. Dmitriev and E. Dynkin,On characteristic roots of stochastic matrices, Izvestiya Akademii Nauk SSSR Seriya Matematicheskaya extbf10 (1946), 167–184
1946
-
[3]
A. C. M. Ran and Z. E. Teng,The nonnegative inverse eigenvalue problem with prescribed zero patterns in dimension three, Electronic Journal of Linear Algebra extbf40 (2024), 506–537
2024
-
[4]
Verbeken, B
B. Verbeken, B. Vagenende, M.-A. Guerry, A. Algaba, and V. Ginis,Early evidence of vibe- proving with consumer LLMs: A case study on spectral region characterization with ChatGPT- 5.2 (Thinking), preprint, 2026. 13
2026
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.