answersLogoWhite

0


Best Answer

Given a matrix A=([a,b],[c,d]), the trace of A is a+d, and the det of A is ad-bc.

By using the characteristic equation, and representing the eigenvalues with x, we have the equation

x2-(a+d)x+(ad-bc)=0

Which, using the formula for quadratic equations, gives us the eigenvalues as,

x1=[(a+d)+√((a+d)2-4(ad-bc))]/2

x2=[(a+d)-√((a+d)2-4(ad-bc))]/2

now by adding the two eigenvalues together we get:

x1+x2=(a+d)/2+[√((a+d)2-4(ad-bc))]/2+ (a+d)/2-[√((a+d)2-4(ad-bc))]/2

The square roots cancel each other out being the same value with opposite signs, leaving us with:

x1+x2=(a+d)/2+(a+d)/2

x1+x2= 2(a+d)/2

x1+x2=(a+d)

x1+x2=trace(A)

Q.E.D.

General proofThe above answer only works for 2x2 matrices. I'm going to answer it for nxn matrices. (Not mxn; the question only makes sense when the matrix is square.)

The proof uses the following ingredients:

(1) Every nxn matrix is conjugate to an upper-triangular matrix

(2) If A is upper-triangular, then tr(A) is the sum of the eigenvalues of A

(3) If A and B are conjugate, then tr(A) = tr(B)

(4) If A and B are conjugate, then A and B have the same characteristic polynomial (and hence the same sum-of-eigenvalues)

If these are all true, then we can do the following: Given a matrix A, find an upper-triangular matrix U conjugate to A; then (letting s(A) denote the sum of the eigenvalues of A) s(A) = s(U) = tr(U) = tr(A).

Now to prove (1), (2), (3) and (4):

(1) This is an inductive process. First you prove that your matrix is conjugate to one with a 0 in the bottom-left corner. Then you prove that this, in turn, is conjugate to one with 0s at the bottom-left and the one above it. And so on. Eventually you get a matrix with no nonzero entries below the leading diagonal, i.e. an upper-triangular matrix.

(2) Suppose A is upper-triangular, with elements a1, a2, ... , an along the leading diagonal. Let f(t) be the characteristic polynomial of A. So f(t) = det(tI-A). Note that tI-A is also upper-triangular. Therefore its determinant is simply the product of the elements in its leading diagonal. So f(t) = det(tI-A) = (t-a1) * ... * (t-an). And its eigenvalues are a1, ... , an. So the sum of the eigenvalues is a1 + ... + an, which is the sum of the diagonal elements in A.

(3) This is best proved using Summation Convention. Summation convention is a strange but rather useful trick. Basically, the calculations I've written below aren't true as they're written. For each expression, you need to sum over all possible values of the subscripts. For example, where it says b_ii, it really means b11 + b22 + ... + bnn. Where it says bil deltali, it means (b11 delta11 + ... + b1n deltan1) + ... + (bn1 delta1n + ... + bnn deltann). Oh, and deltakj=1 if k=j, and 0 otherwise.

Suppose B = PAP-1. Let's say the element in row j and column k of A is ajk. Similarly, say the (i,j) element of P is pij, the (k,l) element of P-1 is p*kl, and the (i,l) element of B is bil. Then:

bil = pij ajk p*kl

And the trace of B is given by:

tr(B) = bii

= bil deltali

= p*kl deltali pij ajk

= p*kl plj ajk

= deltakj ajk (since p and p* are inverses)

= ajj

= tr(A)

(4) Again, suppose B = PAP-1. Then, for any scalar t, we have tI-B = P(tI-A)P-1. Hence det(tI-B) = det(P).det(tI-A).det(P-1). Since det(P).det(P-1)=det(PP-1)=det(I)=1, we have det(tI-B) = det(tI-A).

User Avatar

Wiki User

12y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Prove that the trace of a matrix A is equal to the sum of its eigenvalues?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Prove that trace of the matrix is invariant under similarity transformation?

The trace of an nxn matrix is usually thought of as the sum of the diagonal entries in the matrix. However, it is also the sum of the eigenvalues. This may help to understand why the proof works. So to answer your question, let's say A and B are matrices and A is similar to B. You want to prove that Trace A=Trace B If A is similar to B, there exists an invertible matrix P such that A=(P^-1 B P) Now we use the fact that Trace (AB)= Trace(BA) for any nxn matrices A and B.This is easy to prove directly from the definition of trace. (ask me if you need to know) So using this we have the following: Trace(A)=Trace(P^-1 B P)=Trace (BPP^-1)=Trace(B) and we are done! Dr. Chuck


What is density matrix in quantum mechanics?

It is a Hermitian positive-semidefinite matrix of trace one that describes the statistical state of a quantum system. Hermitian matrix is defined as A=A^(dagger). Meaning that NxN matrix A is equal to it's transposed complex conjugate. Trace is defined as adding all the terms on the diagonal.


What is the trace of a matrix to a power?

It is the diagonal entries of the matrix raised to a power.


What is the definition of a trace of a 3 3 matrix?

The trace of a 3 by 3 matrix A is defined as the summation of n=3;i=1;aii.


How can you prove that similar matrices have the same trace?

you tell me


What matrix is an aid to trace requirements across different phases of development?

kncsJVKS;


Matrix is an aid to trace requirements across different phases of development?

kncsJVKS;


To find discriminant of a matrix?

Well, Im not sure if this is true for all matrices of all sizes, but for a 2x2 square matrix the discriminant is... dis(A) = tr(A)^2 - 4 det(A) The discriminant of matrix A is equal to the square of the trace of matrix A, minus four times the determinant of matrix A. I know this to be true for all 2x2 square matrice, but I have never seen any statement one way or the other for larger matrices. Thus, for matrix A = [ a, b; c, d ] tr(A) = a+d det(A) = ad-bc tr(A)^2 = a^2 + 2ad + d^2 4 det(A) = 4ad - 4bc dis(A) = a^2 - 2ad + 4bc + d^2


What are two types os substances are stored in bone matrix?

Bone matrix is composed mostly of calcium, phosphorus, and trace minerals like iron, copper, and magnesium.


What is matrix programming in C programming?

C Examples on Matrix OperationsA matrix is a rectangular array of numbers or symbols arranged in rows and columns. The following section contains a list of C programs which perform the operations of Addition, Subtraction and Multiplication on the 2 matrices. The section also deals with evaluating the transpose of a given matrix. The transpose of a matrix is the interchange of rows and columns.The section also has programs on finding the trace of 2 matrices, calculating the sum and difference of two matrices. It also has a C program which is used to perform multiplication of a matrix using recursion.C Program to Calculate the Addition or Subtraction & Trace of 2 MatricesC Program to Find the Transpose of a given MatrixC Program to Compute the Product of Two MatricesC Program to Calculate the Sum & Difference of the MatricesC Program to Perform Matrix Multiplication using Recursion


How do you pay off something on your credit report?

You contact them and ask for a settlement amount in writing so they have to remove it once you can prove you paid that amount then send a payment you can trace like a check to prove payment.


C program to find trace and norm of a matrix?

#include<stdio.h> #include<conio.h> #include<math.h> void main() { int a[10][10],sum=0,i,j,m,n,trace=0; float norm; printf("enter order"); scanf("%d %d",&m,&n); printf("enter elements "); for(i=0;i<m;i++) {for(j=0;j<m;j++) scanf("%d",&a[i][j]); } for(i=0;i<m;i++) { for(j=0;j<m;j++) { sum=sum+(a[i][j]*a[i][j]); if(i==j) trace=trace+a[i][j]; } } norm=sqrt(sum); printf("norm=%f\n trace=%d",norm,trace); }