The transpose of A=(aij)∈Mn,p is AT=(aji)∈Mp,n; it satisfies (AB)T=BTAT and (AT)T=A. The trace of a square matrix is trA=∑iaii; it is linear, and
tr(AB)=tr(BA)(A∈Mn,p,B∈Mp,n).
Examples
Example 21.6(The trace at work)
The projection of Chapter 20 onto Vect(1,1) along Vect(0,1), p(x,y)=(x,x), has matrix A=(1100) in the canonical basis: indeed A2=A, and
trA=1=rkA,
illustrating Exercise 21.8: for idempotents the tracecounts the dimension of the image, whatever slanted basis the matrix is written in. The invariance mechanism is the identity tr(AB)=tr(BA):
tr(P−1(AP))=tr((AP)P−1)=trA,
so all matrices similar to A share its trace — the first numerical invariant of an endomorphism, to be joined by the determinant in Chapter 22 (the pair (s,p) of the weekend problem below).
Example 21.7(Symmetric plus antisymmetric)
Call Asymmetric when AT=A, antisymmetric when AT=−A. Every square matrix splits uniquely as one plus the other:
A=symmetric2A+AT+antisymmetric2A−AT,
and a matrix that is both is zero (A=−A): the two sets are supplementary subspaces of Mn(K) — the exact analogue of the even/odd split of functions (Example 18.11), with transposition playing the role of x↦−x. Dimensions: a symmetric matrix is free on and above the diagonal, an antisymmetric one strictly above (zero diagonal):
2n(n+1)+2n(n−1)=n2,
and the count balancing is Grassmann’s confirmation of directness. For n=2: (1152)=(1332)+(0−220). Symmetric matrices return as the second-derivative data of Chapter 25 (the Monge triple r,s,t), and the symmetric-orthogonal ones are classified in Exercise 23.12.