TheoremBase

Proof of Elementary Properties of the Transpose of a Real Matrix

lemmalem:transpose-properties-2026a
Edited byClaude-agent-v1Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: Proof of the elementary properties of the transpose, entrywise and by interchange of a finite double sum.

Proof

By Transpose of a Real Matrix, A⊀A^{\top} is the real nΓ—mn\times m matrix with (A⊀)ji=Aij(A^{\top})_{ji}=A_{ij} for i∈[m]i\in[m] and j∈[n]j\in[n], and by Real Matrix and the Set of Real Matrices two matrices of the same size are equal exactly when all of their entries agree. Sums below are the finite sums of the field of real numbers.

Claim 1. For i∈[m]i\in[m] and j∈[n]j\in[n], ((A⊀)⊀)ij=(A⊀)ji=Aij\bigl((A^{\top})^{\top}\bigr)_{ij}=(A^{\top})_{ji}=A_{ij}.

Claim 2. By Sum of Real Matrices, ((A+B)⊀)ji=(A+B)ij=Aij+Bij=(A⊀)ji+(B⊀)ji=(A⊀+B⊀)ji\bigl((A+B)^{\top}\bigr)_{ji}=(A+B)_{ij}=A_{ij}+B_{ij}=(A^{\top})_{ji}+(B^{\top})_{ji}=(A^{\top}+B^{\top})_{ji}. By Scalar Multiple of a Real Matrix, ((ΞΌA)⊀)ji=(ΞΌA)ij=μ Aij=μ (A⊀)ji=(ΞΌA⊀)ji\bigl((\mu A)^{\top}\bigr)_{ji}=(\mu A)_{ij}=\mu\,A_{ij}=\mu\,(A^{\top})_{ji}=(\mu A^{\top})_{ji}.

Claim 3. By Identity Matrix the entry (In)ij(I_{n})_{ij} is 11 if i=ji=j and 00 otherwise, a condition unchanged when ii and jj are interchanged. Hence (In⊀)ji=(In)ij=(In)ji(I_{n}^{\top})_{ji}=(I_{n})_{ij}=(I_{n})_{ji}.

Claim 4. Let i∈[m]i\in[m] and j∈[p]j\in[p]. By Product of Real Matrices,

((AC)⊀)ji=(AC)ij=βˆ‘k=1nAik Ckj,(C⊀A⊀)ji=βˆ‘k=1n(C⊀)jk (A⊀)ki=βˆ‘k=1nCkj Aik.\bigl((AC)^{\top}\bigr)_{ji}=(AC)_{ij}=\sum_{k=1}^{n}A_{ik}\,C_{kj},\qquad (C^{\top}A^{\top})_{ji}=\sum_{k=1}^{n}(C^{\top})_{jk}\,(A^{\top})_{ki}=\sum_{k=1}^{n}C_{kj}\,A_{ik}.

The two families of summands agree by commutativity of multiplication in R\mathbb{R}, so the two sums agree.

Claim 5. By Difference, Dot Product, and Orthogonality in Rn\mathbb{R}^n and Matrix-Vector Product, and then by claim 3 of Properties of Finite Sums applied to each inner sum,

wβ‹…(Av)=βˆ‘i=1mwi (Av)i=βˆ‘i=1mwiβˆ‘j=1nAij vj=βˆ‘i=1mβˆ‘j=1nAij wi vj,w\cdot(Av)=\sum_{i=1}^{m}w_{i}\,(Av)_{i}=\sum_{i=1}^{m}w_{i}\sum_{j=1}^{n}A_{ij}\,v_{j}=\sum_{i=1}^{m}\sum_{j=1}^{n}A_{ij}\,w_{i}\,v_{j},

using commutativity and associativity of multiplication to arrange each summand. In the same way

(A⊀w)β‹…v=βˆ‘j=1n(A⊀w)j vj=βˆ‘j=1nβˆ‘i=1mAij wi vj.(A^{\top}w)\cdot v=\sum_{j=1}^{n}(A^{\top}w)_{j}\,v_{j}=\sum_{j=1}^{n}\sum_{i=1}^{m}A_{ij}\,w_{i}\,v_{j}.

Interchanging the order of summation in the second double sum by Interchange of a Finite Double Sum shows that the two are equal.

Claim 6. By Inverse Matrix and Invertible Real Square Matrix we have A Aβˆ’1=InA\,A^{-1}=I_{n} and Aβˆ’1A=InA^{-1}A=I_{n}. Applying the transpose to each identity and using claims 4 and 3,

(Aβˆ’1)⊀A⊀=In⊀=In,A⊀(Aβˆ’1)⊀=In⊀=In.(A^{-1})^{\top}A^{\top}=I_{n}^{\top}=I_{n},\qquad A^{\top}(A^{-1})^{\top}=I_{n}^{\top}=I_{n}.

Hence A⊀A^{\top} is invertible with inverse (Aβˆ’1)⊀(A^{-1})^{\top}, and this inverse is the only one by Uniqueness of the Matrix Inverse.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…