Trace (mathematics): Difference between revisions
imported>Paul Wormer |
imported>Paul Wormer No edit summary |
||
Line 2: | Line 2: | ||
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 [[Group (mathematics)|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). | 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 [[Group (mathematics)|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). | ||
==Definition for matrices== | ==Definition for matrices== | ||
Let '''A''' be | Let '''A''' be an ''n'' × ''n'' matrix; its trace is defined by | ||
:<math> | :<math> | ||
\mathrm{Tr}(\mathbf{A})\; \stackrel{\mathrm{def}}{=} \; \sum_{i=1}^n A_{ii} | \mathrm{Tr}(\mathbf{A})\; \stackrel{\mathrm{def}}{=} \; \sum_{i=1}^n A_{ii} | ||
</math> | </math> | ||
where ''A''<sub>ii</sub> is the ''i''th diagonal element of '''A'''. | where ''A''<sub>''ii''</sub> is the ''i''th diagonal element of '''A'''. | ||
'''Example''' | '''Example''' | ||
Line 28: | Line 28: | ||
'''Theorem''' | '''Theorem''' | ||
The trace is invariant under a similarity transformation Tr('''B'''<sup>−1</sup>'''A B''') = Tr('''A'''). | The trace of a matrix is invariant under a similarity transformation Tr('''B'''<sup>−1</sup>'''A B''') = Tr('''A'''). | ||
'''Proof''' | '''Proof''' | ||
Line 36: | Line 36: | ||
where we used '''B B'''<sup>−1</sup> = '''E''' (the identity matrix). | where we used '''B B'''<sup>−1</sup> = '''E''' (the identity matrix). | ||
Other properties are (all matrices are ''n'' × ''n'' matrices): | Other properties of traces are (all matrices are ''n'' × ''n'' matrices): | ||
:<math> | :<math> | ||
\begin{align} | \begin{align} | ||
Line 62: | Line 62: | ||
</math> | </math> | ||
'''Definition:''' The trace of the linear operator <font style="vertical-align: top"><math>\hat{A}</math></font> is the trace of | '''Definition:''' The trace of the linear operator <font style="vertical-align: top"><math>\hat{A}</math></font> 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), | |||
:<math> | :<math> | ||
w_i = \sum_{j=1}^n\; v_j B_{ji}, \quad i=1,\ldots, n. | w_i = \sum_{j=1}^n\; v_j B_{ji}, \quad i=1,\ldots, n. | ||
Line 70: | Line 70: | ||
Above we introduced the matrix '''A''' of <font style="vertical-align: top"><math>\hat{A}</math></font> in the basis ''v''<sub>''i''</sub>. Write <b>A'</b> for its matrix in the basis ''w''<sub>''i''</sub> | Above we introduced the matrix '''A''' of <font style="vertical-align: top"><math>\hat{A}</math></font> in the basis ''v''<sub>''i''</sub>. Write <b>A'</b> for its matrix in the basis ''w''<sub>''i''</sub> | ||
:<math> | :<math> | ||
\hat{A} | \hat{A} w_i = \sum_{j=1}^n\; w_j A'_{ji} \quad\hbox{with}\quad \mathbf{A}' = (A'_{ij}). | ||
</math> | </math> | ||
It is not difficult to prove that | It is not difficult to prove that | ||
Line 78: | Line 78: | ||
</math> | </math> | ||
from which follows that the trace of <font style="vertical-align: top"><math>\hat{A}</math></font> in both bases is equal. | from which follows that the trace of <font style="vertical-align: top"><math>\hat{A}</math></font> in both bases is equal. | ||
'''Theorem''' | |||
Let a linear operator <font style="vertical-align: top"><math>\hat{A}</math></font> on ''V''<sub>''n''</sub> have ''n'' linearly independent eigenvectors, | |||
:<math> | |||
\hat{A}\; v_i = \alpha_i v_i\quad\hbox{with}\quad \alpha_i \in \mathbb{C}\quad\hbox{and}\quad i=1,\ldots,n. | |||
</math> | |||
Then its trace is the sum of the eigenvalues | |||
:<math> | |||
\mathrm{Tr}(\hat{A}) = \sum_{i=1}^n \alpha_i. | |||
</math> | |||
'''Proof''' | |||
The matrix of <font style="vertical-align: top"><math>\hat{A}</math></font> in basis of its eigenvectors is | |||
:<math> | |||
\hat{A}\; v_i = \sum_{j=1}^n \;v_j (\alpha_j \delta_{ji}) \quad\Longrightarrow\quad | |||
\mathbf{A}= | |||
\begin{pmatrix} | |||
\alpha_1 & 0 & \cdots & 0 \\ | |||
0 &\alpha_2 & \cdots \\ | |||
\cdots & & \ddots \\ | |||
0 & & &\alpha_n \\ | |||
\end{pmatrix}, | |||
</math> | |||
where δ<sub>''ji''</sub> is the [[Kronecker delta]]. | |||
'''Note'''. To avoid misunderstanding: not all linear operators on ''V''<sub>''n''</sub> possess ''n'' linearly independent eigenvectors. | |||
==Infinite-dimensional space== | |||
The trace of an operator on an infinite-dimensional linear space is not well-defined for all operators on all infinite-dimensional spaces. Even if we restrict our attention to infinite-dimensional spaces with countable bases, the generalization of the definition is not always possible. 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., not defined). | |||
However, certain linear operators have the property | |||
:<math> | |||
\hat{A} v_i = \alpha_i w_i,\quad i=1,2,\ldots, \quad \hbox{and} \quad \alpha_i\in \mathbb{C}, | |||
</math> | |||
where both ''v''<sub>''i''</sub> and ''w''<sub>''i''</sub> form a basis of the space. Note that often ''v''<sub>''i''</sub> = ''w''<sub>''i''</sub> (for instance for [[self-adjoint operator]]s and [[unitary operator]]s), but this is not necessary. When, furthermore, the following sum converges, one may define the trace of <font style="vertical-align: top"><math>\hat{A}</math></font>: | |||
:<math> | |||
\mathrm{Tr}(\hat{A}) = \sum_{i=1}^\infty \alpha_i < \infty | |||
</math> | |||
Operators that have a well-defined trace are called "trace class operators". As in the finite-dimensional case it can be proved that this trace is independent of basis. | |||
An important example is the exponential of the self-adjoint operator ''H'', | |||
:<math> | |||
e^{-\beta\hat{H}},\quad \beta \in \mathbb{R},\quad 0< \beta < \infty. | |||
</math> | |||
The operator ''H'' being self-adjoint has only real eigenvalues ε<sub>''i''</sub>. When ''H'' is bounded from below (its lowest eigenvalue is finite) then the sum | |||
:<math> | |||
\mathrm{Tr}e^{-\beta H} = \sum_{i=1}^\infty e^{-\beta \epsilon_i} < \infty | |||
</math> | |||
converges. This trace is the canonical [[partition function (statistical physics)|partition function ]] of [[statistical physics]]. |
Revision as of 08:22, 17 January 2009
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).
Definition for matrices
Let A be an n × n matrix; its trace is defined by
where Aii is the ith diagonal element of A.
Example
Theorem.
Let A and B be square finite-sized matrices, then Tr(A B) = Tr (B A).
Proof
Theorem
The trace of a matrix is invariant under a similarity transformation Tr(B−1A B) = Tr(A).
Proof
where we used B B−1 = E (the identity matrix).
Other properties of traces are (all matrices are n × n matrices):
Definition for a linear operator on a finite-dimensional vector space
Let Vn be an n-dimensional vector space (also known as linear space). Let be a linear operator (also known as linear map) on this space,
- .
Let
be a basis for Vn, then the matrix of with respect to this basis is given by
Definition: The trace of the linear operator 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),
Above we introduced the matrix A of in the basis vi. Write A' for its matrix in the basis wi
It is not difficult to prove that
from which follows that the trace of in both bases is equal.
Theorem
Let a linear operator on Vn have n linearly independent eigenvectors,
Then its trace is the sum of the eigenvalues
Proof
The matrix of in basis of its eigenvectors is
where δji is the Kronecker delta.
Note. To avoid misunderstanding: not all linear operators on Vn possess n linearly independent eigenvectors.
Infinite-dimensional space
The trace of an operator on an infinite-dimensional linear space is not well-defined for all operators on all infinite-dimensional spaces. Even if we restrict our attention to infinite-dimensional spaces with countable bases, the generalization of the definition is not always possible. 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., not defined).
However, certain linear operators have the property
where both vi and wi form a basis of the space. Note that often vi = wi (for instance for self-adjoint operators and unitary operators), but this is not necessary. When, furthermore, the following sum converges, one may define the trace of :
Operators that have a well-defined trace are called "trace class operators". As in the finite-dimensional case it can be proved that this trace is independent of basis.
An important example is the exponential of the self-adjoint operator H,
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
converges. This trace is the canonical partition function of statistical physics.