0

Let constant $0<k<1$. Prove that the $n\times n$ matrix $A$, where its diagonal entries $a_{ii} =1$ and $a_{ij}=k$ for $i \neq j$, is Positive definite.

By definition, I know that a matrix $A$ is positive definite if $x^T A x>0$ for all vectors $x\neq 0$. And I also know that an $n \times n$ matrix is positive definite iff all its eigenvalues are positive. But I am stuck here.

Any help or hint is appreciated. Thanks

Pacific
  • 495

2 Answers2

1

Bit of calculation is needed to prove it for a general $n \times n$ matrix. The fact $\left( \sum_{i=1}^n x_i \right)^2 = \sum_{i=1}^n x_i{}^2 + 2 \sum_{1 \leq i < j \leq n} x_i x_j$ is used.

Let $x=\begin{pmatrix} x_1 \\ x_2 \\ x_3 \\ \vdots \\ x_n \end{pmatrix}$, $x^TAx$ will be of the form \begin{align} \sum_{i=1}^n x_i^2 + 2k \sum_{1 \leq i < j \leq n} x_i x_j. \end{align} If $\sum_{1 \leq i < j \leq n} x_i x_j \ge 0$ we're done. So let $\sum_{1 \leq i < j \leq n} x_i x_j < 0$. Then \begin{align} \sum_{i=1}^n x_i^2 + 2k \sum_{1 \leq i < j \leq n} x_i x_j &= \left(\sum_{i=1}^n x_i \right)^2 -2 \sum_{1 \leq i < j \leq n} x_i x_j +2k \sum_{1 \leq i < j \leq n} x_i x_j \\ &= \left(\sum_{i=1}^n x_i \right)^2+2(1-k) \left(-\sum_{1 \leq i < j \leq n} x_i x_j \right) \\ &>0. \end{align}

absolute0
  • 1,027
1

Let $J=\mathbf {11}^T$ be the $n\times n$ ones matrix. Then

$A= (1-k) I_n + k\cdot J\succeq (1-k) I_n \succ \mathbf 0$
Therefore A is PD.
In words: a PD matrix plus a PSD matrix is PD.

user8675309
  • 10,034
  • please why did you use $n \times n$ ones matrix. Since the conditions are $a_{ii} =1$ and $0<a_{ij}<1$. – Pacific Jun 25 '21 at 04:40
  • Since every off-diagonal entry is the identical, equal to $k$, we can write your matrix as $ D + k \cdot J$ for some diagonal matrix $D$. Furthermore, since all diagonal entries identically are equal to 1, this implies $D=(1-k)I_n$. – user8675309 Jun 25 '21 at 17:29