Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $a_1,\dots,a_n$ be real numbers, and set $a_{ij} = a_ia_j$. Consider the $n \times n$ matrix $A=(a_{ij})$. Then

  1. It is possible to choose $a_1.\dots,a_n$ such that $A$ is non-singular

  2. matrix $A$ is positive definite if $(a_1,\dots,a_n)$ is nonzero vector

  3. matrix $A$ is positive semi definite for all $(a_1,\dots,a_n)$

  4. for all $(a_1,\dots,a_n)$, $0$ is an eigen value of $A$

Please help. I can't even make a guess.

share|improve this question

marked as duplicate by Lord_Farin, azimut, Tom Oldfield, Chris Godsil, Davide Giraudo May 25 '13 at 11:22

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

    
Consider the case $n = 2$. Then $A = \begin{pmatrix} a_1^2 & a_1 a_2 \\ a_1 a_2 & a_2^2 \end{pmatrix}$ is always singular because $\det(A) = 0$. In fact, as defined, the matrix $A$ always has rank $\leq 1$ and so is singular for all $n > 1$. –  Michael Joyce Jun 13 '12 at 15:06
3  
Note that $A = \begin{pmatrix}a_1 \\ \vdots \\ a_n\end{pmatrix} \begin{pmatrix} a_1 & \cdots & a_n\end{pmatrix}$. –  Dylan Moreland Jun 13 '12 at 15:08
    
@DylanMoreland Could you please tell me what does that indicate? –  Une Femme Douce May 25 '13 at 4:37

3 Answers 3

up vote 2 down vote accepted

If $v=\begin{pmatrix}a_1\\a_2\\\vdots\\a_n\end{pmatrix}$ then $A=(a_{ij})=vv^T$

(1) is false for such a matrix always has rank no more than 1

(2) is false for positive definite matrices better be invertible!

(3) is true, for $x^TAx=x^Tvv^Tx=(v^Tx)^Tv^Tx$ which is a non-negative real number for all vectors $x$ as it is just self inner product.

(4) is true if $n>1$ for then $A$ is singular.

share|improve this answer
    
Small nit: $v^Tx$ is a scalar, so $(v^Tx)^T=(v^Tx)$ and $(v^Tx)^Tv^Tx=(v^Tx)^2$. And that's really what establishes the non-negativity. –  Michael Grant May 31 '13 at 7:20
    
@MichaelC.Grant Thank you! –  Une Femme Douce Jun 18 '13 at 6:55

If $n=1$ the question is trivial, so assume $n>1$.

The determinant of $A$ is given by the Laplace rule

$$\det (A)=\sum_{\sigma\in S_n}sgn(\sigma)\prod a_{i,\sigma(i)}$$

In your definition $a_{i,\sigma(i)}=a_ia_{\sigma(i)}$ and since $\sigma$ is bijective we have $$\prod a_{i,\sigma(i)}=\prod a_i^2.$$

For $n\geq 2$ there are equally many positive and negative permutations and therfore the sum vanishes. So the matrix is always singular, has thus the eigenvalue $0$ and is not positive definite.

Edit: For the positive semidefiniteness observe that a matrix is positive semidefinite if and only if it is the Gram matrix of some set of vectors (not necessarily linear independent). Choose $b_i=a_ie_1$ (possibly trivial). We are done.

share|improve this answer

Hint for 2: For any such matrix, the $2\times 2$ matrix in the upper left corner has determinant zero. Look up Sylvester's criterion.

Hint for 4: A real square matrix is singular iff it has zero as an eigenvalue. Add this to the fact other commentors have pointed out the matrix has rank one and...

share|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.