vix.ing · top · new · best · stats · spec

Demystifying the Karpelevic theorem

2023/09/07 by Devon N. Munger, Munger, Devon N., Andrew L. Nickerson +3
Computer Science · Mathematics · #15A18 #15B51 #30C15 #Advanced Topics in Algebra #Complex Variables (math.CV) #FOS: Mathematics #Mathematics and Applications #Matrix Theory and Algorithms #Spectral Theory (math.SP)

paper · pdf · doi:10.48550/arxiv.2309.03849

openalex publication_date 2023/09/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The statement of the Karpelevic theorem concerning the location of the eigenvalues of stochastic matrices in the complex plane (known as the Karpelevic region) is long and complicated and his proof methods are, at best, nebulous. Fortunately, an elegant simplification of the statement was provided by Ito -- in particular, Ito's theorem asserts that the boundary of the Karpelevic region consists of arcs whose points satisfy a polynomial equation that depends on the endpoints of the arc. Unfortunately, Ito did not prove his version and only showed that it is equivalent. More recently, Johnson and Paparella showed that points satisfying Ito's equation belong to the Karpelevic region. Although not the intent of their work, this initiated the process of proving Ito's theorem and hence the Karpelevic theorem. The purpose of this work is to continue this effort by showing that an arc appears in the prescribed sector. To this end, it is shown that there is a continuous function λ:[0,1] \longrightarrow ℂ such that PI(λ(α)) = 0, ∀ α∈ [0,1], where PI is a Type I reduced Ito polynomial. It is also shown that these arcs are simple. Finally, an elementary argument is given to show that points on the boundary of the Karpelevic region are extremal whenever n > 3.

Related