全部书籍

专业

应用 关于 Coach 登录 开始阅读

书籍暂未推出简体中文版——当前显示英文版。

Mathematics · 术语表

什么是 Transpose; trace?

又称: trace

Definition 21.5 University Mathematics — Year 1 · 第 21 章 — Matrices

The transpose of A=(aij)∈Mn,pA = (a_{ij}) \in \mathcal{M}_{n,p} is AT=(aji)∈Mp,nA^{\mathsf T} = (a_{ji}) \in \mathcal{M}_{p,n}; it satisfies (AB)T=BTAT(AB)^{\mathsf T} = B^{\mathsf T} A^{\mathsf T} and (AT)T=A(A^{\mathsf T})^{\mathsf T} = A. The trace of a square matrix is tr⁡A=∑iaii\operatorname{tr} A = \sum_i a_{ii}; it is linear, and

tr⁡(AB)=tr⁡(BA)(A∈Mn,p, B∈Mp,n).\operatorname{tr}(AB) = \operatorname{tr}(BA) \qquad (A \in \mathcal{M}_{n,p},\ B \in \mathcal{M}_{p,n}).

示例

Example 21.6 (The trace at work)

The projection of Chapter 20 onto Vect⁡(1,1)\operatorname{Vect}(1,1) along Vect⁡(0,1)\operatorname{Vect}(0,1), p(x,y)=(x,x)p(x, y) = (x, x), has matrix A=(1010)A = \begin{pmatrix} 1 & 0\\ 1 & 0\end{pmatrix} in the canonical basis: indeed A2=AA^2 = A, and

tr⁡A=1=rk⁡A,\operatorname{tr} A = 1 = \operatorname{rk} A ,

illustrating Exercise 21.8: for idempotents the trace counts the dimension of the image, whatever slanted basis the matrix is written in. The invariance mechanism is the identity tr⁡(AB)=tr⁡(BA)\operatorname{tr}(AB) = \operatorname{tr}(BA):

tr⁡(P−1(AP))=tr⁡((AP)P−1)=tr⁡A,\operatorname{tr}\bigl(P^{-1}(AP)\bigr) = \operatorname{tr}\bigl((AP)P^{-1}\bigr) = \operatorname{tr} A ,

so all matrices similar to AA share its trace — the first numerical invariant of an endomorphism, to be joined by the determinant in Chapter 22 (the pair (s,p)(s, p) of the weekend problem below).

Example 21.7 (Symmetric plus antisymmetric)

Call AA symmetric when AT=AA^{\mathsf T} = A, antisymmetric when AT=−AA^{\mathsf T} = -A. Every square matrix splits uniquely as one plus the other:

A=A+AT2⏟symmetric+A−AT2⏟antisymmetric,A = \underbrace{\frac{A + A^{\mathsf T}}{2}}_{\text{symmetric}} + \underbrace{\frac{A - A^{\mathsf T}}{2}}_{\text{antisymmetric}},

and a matrix that is both is zero (A=−AA = -A): the two sets are supplementary subspaces of Mn(K)\mathcal{M}_n(K) — the exact analogue of the even/odd split of functions (Example 18.11), with transposition playing the role of x↦−xx \mapsto -x. Dimensions: a symmetric matrix is free on and above the diagonal, an antisymmetric one strictly above (zero diagonal):

n(n+1)2+n(n−1)2=n2,\frac{n(n+1)}{2} + \frac{n(n-1)}{2} = n^2 ,

and the count balancing is Grassmann’s confirmation of directness. For n=2n = 2: (1512)=(1332)+(02−20)\begin{pmatrix} 1 & 5\\ 1 & 2\end{pmatrix} = \begin{pmatrix} 1 & 3\\ 3 & 2\end{pmatrix} + \begin{pmatrix} 0 & 2\\ -2 & 0\end{pmatrix}. Symmetric matrices return as the second-derivative data of Chapter 25 (the Monge triple r,s,tr, s, t), and the symmetric-orthogonal ones are classified in Exercise 23.12.

在原文中阅读 →