ELIAS EBNER

  • Home
  • Blog
  • Courses
  • About

Linear Algebra

  1. Vectors
    1. Scalars
    2. Vectors vs Sets
    3. Addition and Subtraction
    4. Scalar Multiplication
    5. Zero Vectors
    6. Linear Combinations
    7. Real Dot Product
    8. Length of a Vector
    9. Orthogonal Vectors
    10. Parallel Vectors
    11. Angle Between Vectors
    12. Unit Vectors
  2. Matrices
    1. Notation
    2. Indexing
    3. Submatrices
    4. Matrix-by-Vector Product
    5. Addition and Subtraction
    6. Scalar Multiplication
    7. Transpose
    8. Symmetries
    9. Matrix Multiplication
    10. Identity Matrix
    11. Non-Negative Integer Powers
    12. Reverse Order Law of Transposition
  3. Linear Systems
    1. Inverse Matrices
    2. Singular Matrices
    3. Linear Dependence
    4. Solutions
  4. Planes
    1. Vector Cross Product
  5. Gaussian Elimination
Linear Algebra โ€บMatrices โ€บTranspose

Matrix Transpose

The transpose of a matrix is the first matrix operation introduced in this course not defined in terms of scalar algebra.

The transpose of some matrix AAA is denoted by the symbol ATA^TAT. If AAA is an mร—nm \times nmร—n matrix, ATA^TAT will be an nร—mn \times mnร—m matrix.

The transpose of a matrix is obtained by swapping the rows with the columns of AAA. More formally, for each row iii and column jjj of AAA,

[AT]ij=[A]ji.[A^T]_{ij} = [A]_{ji}.[AT]ijโ€‹=[A]jiโ€‹.

In other words, if

A=[a11a12โ‹ฏa1na21a22โ‹ฏa2nโ‹ฎโ‹ฎโ‹ฑโ‹ฎam1am2โ‹ฏamn],A = \begin{bmatrix} a_{11} & a_{12} & \cdots & a_{1n} \\ a_{21} & a_{22} & \cdots & a_{2n} \\ \vdots & \vdots & \ddots & \vdots \\ a_{m1} & a_{m2} & \cdots & a_{mn} \end{bmatrix},A=โ€‹a11โ€‹a21โ€‹โ‹ฎam1โ€‹โ€‹a12โ€‹a22โ€‹โ‹ฎam2โ€‹โ€‹โ‹ฏโ‹ฏโ‹ฑโ‹ฏโ€‹a1nโ€‹a2nโ€‹โ‹ฎamnโ€‹โ€‹โ€‹,

then

AT=[a11a21โ‹ฏan1a12a22โ‹ฏan2โ‹ฎโ‹ฎโ‹ฑโ‹ฎa1ma2mโ‹ฏanm].A^T = \begin{bmatrix} a_{11} & a_{21} & \cdots & a_{n1} \\ a_{12} & a_{22} & \cdots & a_{n2} \\ \vdots & \vdots & \ddots & \vdots \\ a_{1m} & a_{2m} & \cdots & a_{nm} \end{bmatrix}.AT=โ€‹a11โ€‹a12โ€‹โ‹ฎa1mโ€‹โ€‹a21โ€‹a22โ€‹โ‹ฎa2mโ€‹โ€‹โ‹ฏโ‹ฏโ‹ฑโ‹ฏโ€‹an1โ€‹an2โ€‹โ‹ฎanmโ€‹โ€‹โ€‹.

By transposing a matrix twice, you return to the starting matrix. That is

(AT)T=A.(A^T)^T = A.(AT)T=A.

Example

Here is a simple numerical example to ease understanding. Let

A=[123456].A = \begin{bmatrix} 1 & 2 \\ 3 & 4 \\ 5 & 6 \end{bmatrix}.A=โ€‹135โ€‹246โ€‹โ€‹.

Then,

AT=[135246].A^T = \begin{bmatrix} 1 & 3 & 5 \\ 2 & 4 & 6 \end{bmatrix}.AT=[12โ€‹34โ€‹56โ€‹].

One helpful trick to compute the transpose of a matrix manually is to think of it in the following way:

The first column of AAA - which had the entries 111, 333, and 555 - became the first row of ATA^TAT. The second column of AAA - with the entries 222, 444, and 666 - became the second row of ATA^TAT.

By proceeding in this fashion, the process becomes rather trivial.

Properties of the Transpose of a Matrix

The following properties hold for the transposition of matrices:

Distributivity Over Matrix Addition

Let AAA and BBB be two matrices of the same shape. Then

(A+B)T=AT+BT.(A + B)^T = A^T + B^T.(A+B)T=AT+BT.

Since the proof is very short, if youโ€™re interested, here it is:

For each iii and jjj,

[(A+B)T]ij=[A+B]ji=[A]ji+[B]ji=[AT]ij+[BT]ij=[AT+BT]ij.\begin{align*} \left[ (A + B)^T \right]_{ij} &= [A + B]_{ji} \\ &= [A]_{ji} + [B]_{ji} \\ &= \left[ A^T \right]_{ij} + \left[ B^T \right]_{ij} \\ &= \left[ A^T + B^T \right]_{ij}. \end{align*}[(A+B)T]ijโ€‹โ€‹=[A+B]jiโ€‹=[A]jiโ€‹+[B]jiโ€‹=[AT]ijโ€‹+[BT]ijโ€‹=[AT+BT]ijโ€‹.โ€‹

We proved that all entries of (A+B)T(A + B)^T(A+B)T and AT+BTA^T + B^TAT+BT are the same, therefore

(A+B)T=AT+BT.(A + B)^T = A^T + B^T.(A+B)T=AT+BT.

Distributivity Over Scalar Multiplication

Let AAA be a matrix and let ccc be a scalar. Then,

(cA)T=cAT.(cA)^T = cA^T.(cA)T=cAT.

This proof is also very simple, so if youโ€™re interested, read along:

For each iii and jjj,

[(cA)T]ij=[cA]ji=c[A]ji=c[AT]ij.\begin{align*} \left[ (cA)^T \right]_{ij} &= [cA]_{ji} \\ &= c[A]_{ji} \\ &= c \left[ A^T \right]_{ij}. \end{align*}[(cA)T]ijโ€‹โ€‹=[cA]jiโ€‹=c[A]jiโ€‹=c[AT]ijโ€‹.โ€‹

Again, we proved that the entries of (cA)T(cA)^T(cA)T and cATcA^TcAT are all the same, therefore

(cA)T=cAT. (cA)^T = cA^T.(cA)T=cAT.
Previous
Scalar Multiplication of a Matrix
Next
Matrix Symmetries
This website does not collect personal data, does not use cookies, and does not perform any tracking.