Tensors: Geometry and Applications J.M. Landsberg - Texas A&M ...
Tensors: Geometry and Applications J.M. Landsberg - Texas A&M ...
Tensors: Geometry and Applications J.M. Landsberg - Texas A&M ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
2.1. Rust removal exercises 29<br />
This is sometimes referred to as the fundamental theorem of linear<br />
algebra. It implies rank(f) = rank(f T ), i.e., that for a matrix, row<br />
rank equals column rank, as was already seen in Exercise (4) above.<br />
(7) Let V denote the vector space of 2 × 2 matrices. Take a basis<br />
� � � � � � � �<br />
1 0 0 1 0 0 0 0<br />
v1 = , v2 = , v3 = , v4 =<br />
0 0 0 0 1 0 0 1<br />
Fix a,b,c,d ∈ C <strong>and</strong> let<br />
A =<br />
� �<br />
a b<br />
.<br />
c d<br />
Write out a 4 × 4 matrix expressing the linear map<br />
LA : V → V<br />
X ↦→ AX<br />
that corresponds to left multiplication by A. Write the analogous<br />
matrix for right multiplication. For which matrices A are the two<br />
induced linear maps the same?<br />
(8) Given a 2 × 2 matrix A, write out a 4 × 4 matrix expressing the<br />
linear map<br />
ad(A) : V → V<br />
X ↦→ AX − XA.<br />
What is the largest possible rank of this linear map?<br />
(9) Let A be a 3 × 3 matrix <strong>and</strong> write out a 9 × 9 matrix representing<br />
the linear map LA : Mat3×3 → Mat3×3.<br />
(10) Choose new bases such that the matrices of Exercises 7 <strong>and</strong> 9 become<br />
block diagonal (i.e., the only non-zero entries occur in 2 × 2<br />
(resp. 3 × 3) blocks centered about the diagonal). What will the<br />
n × n case look like?<br />
(11) A vector space V admits a direct sum decomposition V = U ⊕<br />
W if U,W ⊂ V are linear subspaces <strong>and</strong> if for all v ∈ V there<br />
exists unique u ∈ U <strong>and</strong> w ∈ W such that v = u + w. Show<br />
that that a necessary <strong>and</strong> sufficient condition to have a direct sum<br />
decomposition V = U ⊕ W is that dim U + dim W ≥ dim V <strong>and</strong><br />
U ∩W = (0). Similarly, show that another necessary <strong>and</strong> sufficient<br />
condition to have a direct sum decomposition V = U ⊕ W is that<br />
dim U + dim W ≤ dim V <strong>and</strong> span{U,W } = V .<br />
(12) Let S 2 C n denote the vector space of symmetric n × n matrices.<br />
Calculate dim S 2 C n . Let Λ 2 C n denote the vector space of skew