Explain tensor. prove that the sum of two tensor is a tensor. Show that by contraction, the rank of tensor is reduced by two.
Solution
A i n + 1 … i n + m i 1 … i n , B i n + 1 … i n + m i 1 … i n is tensors of (n,m)-type. A _ {i _ {n + 1} \dots i _ {n + m}} ^ {i _ {1} \dots i _ {n}}, B _ {i _ {n + 1} \dots i _ {n + m}} ^ {i _ {1} \dots i _ {n}} \text{ is tensors of (n,m)-type.} A i n + 1 … i n + m i 1 … i n , B i n + 1 … i n + m i 1 … i n is tensors of (n,m)-type.
According to the transformation law of tensors we have
A ~ i n + 1 … i n + m i 1 … i n = ( R ) − 1 i 1 … ( R ) − 1 i n R i n + 1 j n + 1 … R i n + m j n + m A j n + 1 … j n + m j 1 … j n B ~ i n + 1 … i n + m i 1 … i n = ( R ) − 1 i 1 … ( R ) − 1 i n R i n + 1 j n + 1 … R i n + m j n + m B j n + 1 … j n + m j 1 … j n \begin{array}{l}
\tilde {A} _ {i _ {n + 1} \dots i _ {n + m}} ^ {i _ {1} \dots i _ {n}} = (R) ^ {- 1 ^ {i _ {1}}} \dots (R) ^ {- 1 ^ {i _ {n}}} R _ {i _ {n + 1}} ^ {j _ {n + 1}} \dots R _ {i _ {n + m}} ^ {j _ {n + m}} A _ {j _ {n + 1} \dots j _ {n + m}} ^ {j _ {1} \dots j _ {n}} \\
\tilde {B} _ {i _ {n + 1} \dots i _ {n + m}} ^ {i _ {1} \dots i _ {n}} = (R) ^ {- 1 ^ {i _ {1}}} \dots (R) ^ {- 1 ^ {i _ {n}}} R _ {i _ {n + 1}} ^ {j _ {n + 1}} \dots R _ {i _ {n + m}} ^ {j _ {n + m}} B _ {j _ {n + 1} \dots j _ {n + m}} ^ {j _ {1} \dots j _ {n}} \\
\end{array} A ~ i n + 1 … i n + m i 1 … i n = ( R ) − 1 i 1 … ( R ) − 1 i n R i n + 1 j n + 1 … R i n + m j n + m A j n + 1 … j n + m j 1 … j n B ~ i n + 1 … i n + m i 1 … i n = ( R ) − 1 i 1 … ( R ) − 1 i n R i n + 1 j n + 1 … R i n + m j n + m B j n + 1 … j n + m j 1 … j n
Where R i j R_{i}^{j} R i j is a matrix. The components, ν i \nu^{i} ν i , of a regular (or column) vector, v \mathbf{v} v , transform with the inverse of the matrix R R R ,
\widehat {\boldsymbol {v}} ^ {i} = \left(R\right) ^ {- 1} _ {j} ^ {i} \boldsymbol {v} ^ {j}
where the hat denotes the components in the new basis. While the components, w n w_{n} w n of a covector (or row vector), w \mathbf{w} w transform with the matrix R itself,
w ^ i = R i j w j ⇒ α A j 1 … j k i 1 … i n + β B j 1 … j k i 1 … i n = ( R ) − 1 i 1 … ( R ) − 1 i n R j n + 1 j n + 1 … R j n + m j n + m ( α A j n + 1 … j n + m j 1 … j n + β B j n + 1 … j n + m j 1 … j n ) \begin{array}{l}
\widehat {\boldsymbol {w}} _ {i} = R _ {i} ^ {j} \boldsymbol {w} _ {j} \\
\Rightarrow \\
\alpha A _ {j _ {1} \dots j _ {k}} ^ {i _ {1} \dots i _ {n}} + \beta B _ {j _ {1} \dots j _ {k}} ^ {i _ {1} \dots i _ {n}} = (R) ^ {- 1 ^ {i _ {1}}} \dots (R) ^ {- 1 ^ {i _ {n}}} R _ {j _ {n + 1}} ^ {j _ {n + 1}} \dots R _ {j _ {n + m}} ^ {j _ {n + m}} (\alpha A _ {j _ {n + 1} \dots j _ {n + m}} ^ {j _ {1} \dots j _ {n}} + \beta B _ {j _ {n + 1} \dots j _ {n + m}} ^ {j _ {1} \dots j _ {n}}) \\
\end{array} w i = R i j w j ⇒ α A j 1 … j k i 1 … i n + β B j 1 … j k i 1 … i n = ( R ) − 1 i 1 … ( R ) − 1 i n R j n + 1 j n + 1 … R j n + m j n + m ( α A j n + 1 … j n + m j 1 … j n + β B j n + 1 … j n + m j 1 … j n ) α , β \alpha, \beta α , β is constant
From hence α A j n + 1 … j n + m j 1 … j n + β B j n + 1 … j n + m j 1 … j n \alpha A_{j_{n + 1}\dots j_{n + m}}^{j_1\dots j_n} + \beta B_{j_{n + 1}\dots j_{n + m}}^{j_1\dots j_n} α A j n + 1 … j n + m j 1 … j n + β B j n + 1 … j n + m j 1 … j n transformed as tensor.
From hence α A j n + 1 … j n + m j 1 … j n + β B j n + 1 … j n + m j 1 … j n \alpha A_{j_{n + 1}\dots j_{n + m}}^{j_1\dots j_n} + \beta B_{j_{n + 1}\dots j_{n + m}}^{j_1\dots j_n} α A j n + 1 … j n + m j 1 … j n + β B j n + 1 … j n + m j 1 … j n is tensor
Contraction is A i 1 … i n + m i 1 … i n A_{i_1\dots i_{n + m}}^{i_1\dots i_n} A i 1 … i n + m i 1 … i n
A ~ i 1 … i n + m i 1 … i n = ( R ) − 1 i 1 … ( R ) − 1 i n R i 1 j 1 … R i n + m j n + m A j 1 … j n + m j 1 … j n ⇒ A ~ i 1 … i n + m i 1 … i n = ( R ) − 1 i 2 … ( R ) − 1 i n R j n j n + 2 … R i n + m j n + m A j 1 … j n + m j 1 … j n \begin{array}{l}
\tilde {A} _ {i _ {1} \dots i _ {n + m}} ^ {i _ {1} \dots i _ {n}} = (R) ^ {- 1 ^ {i _ {1}}} \dots (R) ^ {- 1 ^ {i _ {n}}} R _ {i _ {1}} ^ {j _ {1}} \dots R _ {i _ {n + m}} ^ {j _ {n + m}} A _ {j _ {1} \dots j _ {n + m}} ^ {j _ {1} \dots j _ {n}} \Rightarrow \\
\tilde {A} _ {i _ {1} \dots i _ {n + m}} ^ {i _ {1} \dots i _ {n}} = (R) ^ {- 1 ^ {i _ {2}}} \dots (R) ^ {- 1 ^ {i _ {n}}} R _ {j _ {n}} ^ {j _ {n + 2}} \dots R _ {i _ {n + m}} ^ {j _ {n + m}} A _ {j _ {1} \dots j _ {n + m}} ^ {j _ {1} \dots j _ {n}} \\
\end{array} A ~ i 1 … i n + m i 1 … i n = ( R ) − 1 i 1 … ( R ) − 1 i n R i 1 j 1 … R i n + m j n + m A j 1 … j n + m j 1 … j n ⇒ A ~ i 1 … i n + m i 1 … i n = ( R ) − 1 i 2 … ( R ) − 1 i n R j n j n + 2 … R i n + m j n + m A j 1 … j n + m j 1 … j n
Because ( R ) − 1 j 1 ∗ R j 1 j 1 = E (R)^{-1^{j_1}} * R_{j_1}^{j_1} = E ( R ) − 1 j 1 ∗ R j 1 j 1 = E is identity matrix.
From hence A j 1 ⋯ j n − m j 1 ⋯ j n A_{j_1 \cdots j_{n-m}}^{j_1 \cdots j_n} A j 1 ⋯ j n − m j 1 ⋯ j n transformed as tensor ( n − 1 , m − 1 ) (n-1, m-1) ( n − 1 , m − 1 ) rank.
From hence A j 1 ⋯ j n − m j 1 ⋯ j n A_{j_1 \cdots j_{n-m}}^{j_1 \cdots j_n} A j 1 ⋯ j n − m j 1 ⋯ j n is ( n − 1 , m − 1 ) (n-1, m-1) ( n − 1 , m − 1 ) rank.