Questions tagged [positive-matrices]

A positive matrix is one whose entries are positive.

An $m\times n$ matrix $M$ is positive if each entry $m_{ij}>0$, $1\leq i\leq m,1\leq j\leq n$; the closely related term non-negative allows for the case $m_{ij}\geq 0$ (see ). Note that this is not the same notion as positive definite: $\pmatrix{5&4\\ 3&2}$ is positive but not positive definite and $\pmatrix{5&4\\ -3&2}$ is positive definite but not positive.

Non-negative matrices are more common (for example, as transition matrices in Markov chains) but positive matrices are interesting in their own right. For instance, the Perron-Frobenius theorem asserts the existence of a unique largest positive eigenvalue of positive matrices.

65 questions
25
votes
8 answers

What is the implication of Perron Frobenius Theorem?

The Perron Frobenius theorem states: Any square matrix $A$ with positive entries has a unique eigenvector with positive entries (up to a multiplication by a positive scalar), and the corresponding eigenvalue has multiplicity one and is…
Fraïssé
  • 11,656
17
votes
4 answers

Theorem about positive matrices

We will call a matrix positive matrix if all elements in the matrix are positive, and we will denote the largest eigenvalue with $\lambda_{\max}$, what is exist because of the Perron–Frobenius theorem. Theorem. Let $A$ be a positive square matrix.…
12
votes
2 answers

Is spectral radius = operator norm for a positive valued matrix?

For any real-valued square matrix with all positive entries, by Perron-Frobenius theory, we have that the matrix has a dominant eigenvalue that is real, positive, and of multiplicity 1. Thus, the spectral radius is equal to the largest eigenvalue.…
10
votes
2 answers

Lower and upper bound for the largest eigenvalue

We will call a matrix positive matrix if all elements in the matrix are positive, and we will denote the largest eigenvalue with $\lambda_{\max}$, what is exist because of the Perron–Frobenius theorem. Theorem. Let $A$ be a positive square matrix.…
9
votes
1 answer

Geometric Proof of Perron-Frobenius II

The following is proved in these lecture notes. Let $A$ be an $n\times n$ real matrix with all entries positive. Then $A$ has a unique positive eigenvector (up to positve scaling), and the eigenvalue of $A$ corresponding to this eigenvector is…
9
votes
2 answers

Geometric Proof of Perron-Frobenius

I am reading this paper (A Geometric Proof of the Perron-Frobenius Theorem, A. Borobia, U. R. Trias, Revista Mathematica de la Universidad Conplutense de Madrid, Vol. 5, 1992) where a short geometric proof of the Perron-Frobenius theorem is given. I…
8
votes
2 answers

Powers of a Positive Matrix in the Limit

I'm trying to prove a standard result: for a positive $n \times n$ matrix $A$, the powers of $A$ scaled by its leading eigenvalue $\lambda$ converge to a matrix whose columns are just scalar multiples of $A$'s leading eigenvector $\mathbf{v}$. More…
7
votes
2 answers

Understanding matrices whose powers have positive entries

A regular matrix $A$ is described as a square matrix that for all positive integer $n$, is such that $A^n$ has positive entries. How then would I prove something is regular? I mean I can prove something is irregular if $A^2$ has some 0 or negative…
vora
  • 71
6
votes
0 answers

Are all entrywise nonnegative positive semidefinite matrices has a rank-1 decomposition with nonnegative vectors?

I know that all positive semidefinite matrices has a rank-1 decomposition. (Equivalently, all quadratic nonnegative polynomial is sum of squares of linear function.) $$A = \sum_{i=1}^r x_i x_i^T = X X^T$$. I am wondering if there is an entrywise…
6
votes
0 answers

Making sense of Strang's proof for the Perron-Frobenius theorem

A proof of Perron-Frobenius theorem is given in "Introduction to Linear Algebra" by Gilbert Strang as: This is asked before, check Perron-Frobenius theorem proof, but the explanation given by @Kavi Rama Murthy only addresses part of the proof which…
5
votes
4 answers

Positive matrix with integer eigenvalues

Is there any way of creating a positive matrix which has integer eigenvalues? Each entry $a_{ij}$ of the matrix must be strictly greater than $0$. I get how to create a matrix with certain eigenvalues using diagonal matrices, but I do not know how…
5
votes
1 answer

$n \times n$ positive matrix with $a_{ij} a_{ji} = 1$ has an eigenvalue not less than $n$

$A$ is a real $n \times n$ matrix with positive elements $\{a_{ij}\}$. For all pairs $(i, j), a_{ij} a_{ji}=1$. Prove that $A$ has an eigenvalue not less than $n$.
4
votes
1 answer

Perron–Frobenius theorem

What exactly is the Perron–Frobenius theorem? In different books and papers I read different statements, and I don't know what the truth is. In Wikipedia there are also a lot of statements under this label. And if somebody can characterize the…
4
votes
0 answers

A generalization of Sinkhorn's theorem

Let $A$ be an entry-wise strictly positive matrix. Sinkhorn's theorem assures that there exist strictly positive diagonal matrices (unique up to scaling) $D_1, D_2$ such that $D_1 A D_2$ is doubly stochastic. If I am given with two probability…
4
votes
0 answers

How many elements in the inverse of an $n\times n$ positive matrix can be positive?

Find all possible numbers that of positive elements in the inverse of an $n\times n$ positive matrix. For $n=2$, that is only $2$. This is because the inverse of a $2\times2$ positive matrix is of the form of $\begin{pmatrix}+&-\\\ -&+\end{pmatrix}$…
dodicta
  • 1,451
1
2 3 4 5