Positive semi-definition of Diagonal Dominant Matrix (with non-negative diagonal) is an important property in numeric linear algebra. Here I record two prooves, one following the idea of Gershgorin Circle Theorem, the other is a proof for the weakened version of strictly diagonal dominance.
A diagonal dominant matrix A={aij}i,j=1n satisties
∣aii∣≥j=i∑∣aij∣,∀i
Gershgorin Circle Theorem
The eigen vector x with eigen value λ, say xi is the element with largest absolute value.
Immediately we would find that for diagonal dominant matrix with non-negative diagonal elements, all eigen vectors would be non-negative, thus A is positive semi-definite.
Another Interesting Proof for Strictly Diagonal Dominant
Strictly Diagonal Dominant Matrix:
∣aii∣>j=i∑∣aij∣,∀i
A strictly diagonal dominant matrix is non-singular: Assume there ∃x,s.t.Ax=0, with xi the element with largest absolute value, then follows similar idea as in Gershgorin thm.: