Skip to main content

[Community Question] Linear-algebra: non-negative matrix satisfying two conditions

One of our user asked:

A real matrix $B$ is called non-negative if every entry is non-negative. We will denote this by $B\ge 0$.

I want to find a non-negative matrix $B$ satisfying the following two conditions:

(1) $(I-B)^{-1}$ exists but not non-negative. Here $I$ is the identity matrix.

(2) There is a non-zero and non-negative vector $\vec{d}$ such that $(I-B)^{-1}\vec{d}\ge 0$.

I tried all the $2\times 2$ matrices, but it did not work. I conjecture that such a $B$ does not exist, but don't know how to prove it.


Comments

Popular posts from this blog

[Community Question] Calculus: Asymptotic behavior of $\sum\limits_{n=0}^{\infty}x^{b^n}$

One of our user asked: This follow my previous post here , where Song has proven that $\forall b>1,\lim\limits_{x\to 1^{-}}\frac{1}{\ln(1-x)}\sum\limits_{n=0}^{\infty}x^{b^n}=-\frac{1}{\ln(b)}$ , that is to say : $$\forall b>1,\sum\limits_{n=0}^{\infty}x^{b^n}=-\log_b(1-x)+o_{x\to1^-}\left(\log_b(1-x)\right)$$ (The $o_{x\to1^-}\left(\log_b(1-x)\right)$ representing a function that is asymptotically smaller than $\log_b(1-x)$ when $x\to1^{-}$ , that is to say whose quotient by $\log_b(1-x)$ converges to $0$ as $x\to1^{-}$ , see small o notation ) So we have here a first asymptotical approximation of $\sum\limits_{n=0}^{\infty}x^{b^n}$ . I now want to take it one step further and refine the asymptotical behaviour, by proving a stronger result which I conjecture to be true (backed by numerical simulations) : $$\sum\limits_{n=0}^{\infty}x^{b^n}=-\log_b(1-x)+O_{x\to1^-}\left(1\right)$$ (The $O_{x\to1^-}\left(1\right)$ representing a function that is asymptotically bounded wh...