Trace (mathematics)

| Main Article
| Discussion
| Related Articles  [?]
| Bibliography  [?]
| External Links  [?]
| Citable Version  [?]

|
|
|
|
|
|
|
|

This editable Main Article is under development and subject to a disclaimer.

[edit intro]

In mathematics, a trace is a property of a matrix and of a linear operator on a vector space. The trace plays an important role in the representation theory of groups (the collection of traces is the character of the representation) and in statistical thermodynamics (the trace of a thermodynamic observable times the density operator is the thermodynamic average of the observable).

## Contents

* 1 Definition and properties of matrix traces
* 1.1 Relation to eigenvalues
* 2 Definition for a linear operator on a finite-dimensional vector space
* 2.1 Finite-dimensional inner product space
* 3 Infinite-dimensional space
* 4 Reference

## Definition and properties of matrix traces[edit]

Let A be an n × n matrix; its trace is defined by

Tr(𝐀)=def∑i=1nAii

where Aii is the ith diagonal element of A.

Example

𝐀=(2.11.30.05.0−0.18.37.0−4.73.0)⟹Tr(𝐀)=2.1−0.1+3.0=5.0

Theorem
Let A and B be n×n matrices, then Tr(A B) = Tr (B A).
Proof

Tr(𝐀𝐁)=∑i=1n(𝐀𝐁)ii=∑i=1n∑j=1nAijBji=∑j=1n∑i=1nBjiAij=∑j=1n(𝐁𝐀)jj=Tr(𝐁𝐀)

Theorem
The trace of a matrix is invariant under a similarity transformation Tr(B−1A B) = Tr(A).
Proof

Tr(𝐁−1(𝐀𝐁))=Tr((𝐀𝐁)𝐁−1)=Tr(𝐀𝐄)=Tr(𝐀),

where we used B B−1 = E (the identity matrix).

Other properties of traces are (all matrices are n × n matrices):

Tr(𝐀+𝐁)=Tr(𝐀)+Tr(𝐁)Tr(𝐄)=n(trace of identity matrix)Tr(𝐎)=0(trace of zero matrix)Tr(𝐀𝐁𝐂)=Tr(𝐂𝐀𝐁)=Tr(𝐁𝐂𝐀)Tr(c𝐀)=cTr(𝐀)c∈ℂTr(𝐀T)=Tr(𝐀)

Theorem
Let S be a symmetric matrix, ST = S, and A be an antisymmetric matrix, AT = −A. Then

Tr(𝐒𝐀)=Tr(𝐀𝐒)=0.

Proof

Tr(𝐒𝐀)=Tr((𝐒𝐀)T)=Tr(𝐀T𝐒T)=−Tr(𝐀𝐒)=−Tr(𝐒𝐀)

A number equal to minus itself can only be zero.

### Relation to eigenvalues[edit]

We will show that the trace of an n×n matrix is equal to the sum of its n eigenvalues (the n roots of its secular equation).

The secular determinant of an n × n matrix A is the determinant of A −λ E, where λ is a number (an element of a field F). If we put the secular determinant equal to zero we obtain the secular equation of A (also known as the characteristic equation),

Δ(λ)≡|A11−λA12⋯⋯A1nA21A22−λ⋯⋯A2n⋯⋯⋱An1An2⋯Ann−λ|=0

The secular determinant is a polynomial in λ:

Δ(λ)=(−λ)n+P1(−λ)n−1+P2(−λ)n−2+⋯+Pn−1(−λ)+Pn=0.

The coefficient P1 of (−λ)n−1 is equal to the trace of A (and incidentally Pn is the determinant of A). If the field F is algebraically closed (such as the field of complex numbers) then the fundamental theorem of algebra states that the secular equation has exactly n roots (zeros) λi, i =1, ..., n, the eigenvalues of A and the following factorization holds

Δ(λ)=(λ1−λ)(λ2−λ)⋯(λn−λ).

Expansion shows that the coefficient P1 of (−λ)n−1 is equal to

∑i=1nλi=P1=Tr(𝐀).

Note: It is not necessary that A has n linearly independent eigenvectors, although any A has n eigenvalues in an algebraically closed field.

## Definition for a linear operator on a finite-dimensional vector space[edit]

Let Vn be an n-dimensional vector space (also known as linear space). Let A^ be a linear operator (also known as linear map) on this space,

A^:Vn->Vn.

Let

{v1,v2,…,vn}

be a basis for Vn, then the matrix of A^ with respect to this basis is given by

A^vi=∑j=1nvjAjifori=1,…,n,and𝐀≡(Aij).

Definition: The trace of the linear operator A^ is the trace of the matrix of the operator in any basis. This definition is possible since the trace is independent of the choice of basis.

We prove that a trace of an operator does not depend on choice of basis. Consider two bases connected by the non-singular matrix B (a basis transformation matrix),

wi=∑j=1nvjBji,i=1,…,n.

Above we introduced the matrix A of A^ in the basis vi. Write A' for its matrix in the basis wi

A^wi=∑j=1nwjA'jiwith𝐀′=(A'ij).

It is not difficult to prove that

𝐀′=𝐁−1𝐀𝐁⟹Tr(𝐀′)=Tr(𝐀),

from which follows that the trace of A^ in both bases is equal.

Theorem

Let a linear operator A^ on Vn have n linearly independent eigenvectors,

A^vi=αiviwithαi∈ℂandi=1,…,n.

Then its trace is the sum of the eigenvalues

Tr(A^)=∑i=1nαi.

Proof

The matrix of A^ in basis of its eigenvectors is

A^vi=∑j=1nvj(αjδji)⟹𝐀=(α10⋯00α2⋯⋯⋱0αn),

where δji is the Kronecker delta.

Note. To avoid misunderstanding: not all linear operators on Vn possess n linearly independent eigenvectors.

### Finite-dimensional inner product space[edit]

When the n-dimensional linear space Vn is equipped with a positive definite inner product, an expression for the matrix of a linear operator and its trace can be given. These expressions can be generalized to inner product spaces of infinite dimension and are of great importance in quantum mechanics.

Let

{v1,v2,…,vn}with⟨vi|vj⟩=δij,i,j=1,…,n,

be an orthonormal basis for Vn. The symbol δij stands for the Kronecker delta. The matrix of A^ with respect to this basis is given by

A^vi=∑j=1nvjAji.

Project with vk:

⟨vk|A^|vi⟩=∑j=1n⟨vk|vj⟩Aji=∑j=1nδkjAji=Aki.

Hence

Aij=⟨vi|A^|vj⟩⟹Tr(A^)=∑i=1n⟨vi|A^|vi⟩.

## Infinite-dimensional space[edit]

The trace of a linear operator on an infinite-dimensional linear space is not always defined. For instance, we saw above that the trace of the identity operator on a finite-dimensional space is equal to the dimension of the space, so that a simple extension of the definition leads to a trace of the identity operator that is infinite, i.e., the trace is undefined. In fact, the property of having a finite trace is a severe restriction on a linear operator.

We consider an infinite-dimensional space with an inner product (a Hilbert space). Let T^ be a linear operator on this space with the property

(T^†T^)vi=αi2vi,i=1,2,…,∞andαi2∈ℝ,

where {vi} is an orthonormal basis of the space. Note that the operator T^†T^ is self-adjoint and positive definite, i.e.,

⟨(T†T)w|w⟩=⟨w|(T†T)w⟩=⟨Tw|Tw⟩≥0for anyw.

From this follows that the eigenvalues of T^†T^ are positive--so that they may be written as squares--and its eigenvectors vi are orthonormal.

If the following sum of square roots of eigenvalues converges,

∑i=1∞αi<∞,

then the trace of T^ can be defined by

Tr(T^)≡∑i=1∞⟨vi|T|vi⟩,

i.e., it can be proved that this summation converges as well. Operators that have a well-defined trace are called "trace class operators" or sometimes "nuclear operators".

As in the finite-dimensional case the trace is independent of the choice of (orthonormal) basis,

Tr(T^)=∑i=1∞⟨wi|T|wi⟩<∞,

for any orthonormal basis {wi}.

An important example of a trace class operator is the exponential of the self-adjoint operator H,

e−βH^,β∈ℝ,0<β<∞.

The operator H, being self-adjoint, has only real eigenvalues εi. When H is bounded from below (its lowest eigenvalue is finite) then the sum

Tre−βH=∑i=1∞e−βϵi<∞

converges. This trace is the canonical partition function  of statistical physics.

## Reference[edit]

* F. R. Gantmacher, Matrizentheorie, Translated from the Russian by H. Boseck, D. Soyka, and K. Stengert, Springer Verlag, Berlin (1986). ISBN 3540165827
* N. I Achieser and I. M. Glasmann, Theorie der linearen Operatoren im Hilbert Raum, Translated from the Russian by H. Baumgärtel, Verlag Harri Deutsch, Thun (1977). ISBN 3871443263