|
本帖最后由 hbghlyj 于 2024-10-13 19:31 编辑 云0.2. 由于
\[
\operatorname{Tr}(AB) = \operatorname{Tr}(BA),
\]
根据数学归纳法, 对$\tau \in S_k$,
\[
\operatorname{Tr}(A_1\cdots A_k) = \operatorname{Tr}(A_{\tau(1)}\cdots A_{\tau(k)}).
\]
云0.2的错误在于:由${\rm Tr}(AB)={\rm Tr}(BA)$,只能得到对$τ∈C_k,\operatorname{Tr}\left(A_{1} \cdots A_{k}\right)=\operatorname{Tr}\left(A_{\tau(1)} \cdots A_{\tau(k)}\right)$,而不能得到$τ∈S_k$时的结论.
维基百科:
Cyclic property
More generally, the trace is invariant under cyclic permutations, that is,
$$\operatorname{tr}(\mathbf{A}\mathbf{B}\mathbf{C}\mathbf{D}) = \operatorname{tr}(\mathbf{B}\mathbf{C}\mathbf{D}\mathbf{A}) = \operatorname{tr}(\mathbf{C}\mathbf{D}\mathbf{A}\mathbf{B}) = \operatorname{tr}(\mathbf{D}\mathbf{A}\mathbf{B}\mathbf{C}).$$
This is known as the ''cyclic property''.
Arbitrary permutations are not allowed: in general,
$$\operatorname{tr}(\mathbf{A}\mathbf{B}\mathbf{C}) \ne \operatorname{tr}(\mathbf{A}\mathbf{C}\mathbf{B}).$$
However, if products of three symmetric matrices are considered, any permutation is allowed, since:
$$\operatorname{tr}(\mathbf{A}\mathbf{B}\mathbf{C}) = \operatorname{tr}\left(\left(\mathbf{A}\mathbf{B}\mathbf{C}\right)^{\mathsf T}\right) = \operatorname{tr}(\mathbf{C}\mathbf{B}\mathbf{A}) = \operatorname{tr}(\mathbf{A}\mathbf{C}\mathbf{B}),$$
where the first equality is because the traces of a matrix and its transpose are equal. Note that this is not true in general for more than three factors. |
|