Skip to content

Mathematics · Ch 3 — Matrices

Transpose of a Matrix

3.5

Transpose of a Matrix

3.5 Transpose of a Matrix

A natural operation on a matrix is to flip it — turning rows into columns and columns into rows. This is called transposition, and the result is the transpose of the original. It leads to two important families of matrices — symmetric and skew-symmetric — that appear throughout mathematics and physics.

What is the Transpose?

Take a matrix AA of size m×nm \times n with entry aija_{ij} in row ii, column jj:

A=[aij]m×nA = [a_{ij}]_{m \times n}

Swapping the roles of rows and columns moves the entry at (i,j)(i, j) to (j,i)(j, i). The result is the transpose of AA, denoted A′A' or ATA^T (NCERT uses A′A'), of size n×mn \times m.

If A=[aij]m×nA = [a_{ij}]_{m \times n}, then A′=[aji]n×mA' = [a_{ji}]_{n \times m}.

Example.

Let

A=[2315−30]3×2A = \begin{bmatrix} 2 & 3 \\ 1 & 5 \\ -3 & 0 \end{bmatrix}_{3 \times 2}

Writing each row of AA as a column gives

A′=[21−3350]2×3A' = \begin{bmatrix} 2 & 1 & -3 \\ 3 & 5 & 0 \end{bmatrix}_{2 \times 3}

The entry a12=3a_{12} = 3 in AA becomes the (2,1)(2,1) entry of A′A'; a31=−3a_{31} = -3 becomes the (1,3)(1,3) entry, and so on.

Tip

Simplest rule: first row becomes first column, second row becomes second column, etc.

Properties of the Transpose

Each property below follows directly from the definition; full proofs are given.

Property (I): Transpose of a Transpose

(A′)′=A(A')' = A — transposing twice returns the original matrix.

Proof.

Let A=[aij]m×nA = [a_{ij}]_{m \times n}, so A′=[aji]n×mA' = [a_{ji}]_{n \times m}. The (i,j)(i, j) entry of (A′)′(A')' is the (j,i)(j, i) entry of A′A', which is aija_{ij}. Hence (A′)′=[aij]m×n=A(A')' = [a_{ij}]_{m \times n} = A. ∎

Property (II): Transpose of a Sum

(A+B)′=A′+B′(A + B)' = A' + B', provided AA and BB are of the same order.

Proof.

Let A=[aij]m×nA = [a_{ij}]_{m \times n} and B=[bij]m×nB = [b_{ij}]_{m \times n}, so A+B=[aij+bij]A + B = [a_{ij} + b_{ij}]. The (i,j)(i, j) entry of (A+B)′(A+B)' is the (j,i)(j, i) entry of A+BA+B, namely aji+bjia_{ji} + b_{ji} — which is the (i,j)(i,j) entry of A′+B′A' + B'. Hence (A+B)′=A′+B′(A+B)' = A' + B'. ∎

Property (III): Transpose of a Scalar Multiple

(kA)′=kA′(kA)' = kA', where kk is any scalar.

Proof.

Let A=[aij]m×nA = [a_{ij}]_{m \times n}, so kA=[kaij]kA = [k a_{ij}]. The (i,j)(i, j) entry of (kA)′(kA)' is the (j,i)(j, i) entry of kAkA, i.e. kajik a_{ji} — exactly kk times the (i,j)(i,j) entry of A′A'. Hence (kA)′=kA′(kA)' = k A'. ∎

Property (IV): Transpose of a Product

(AB)′=B′A′(AB)' = B' A', provided AA and BB are conformable for multiplication.

This is the most important property — note the reversal of order. It is not (AB)′=A′B′(AB)' = A'B'.

Proof.

Let A=[aij]m×nA = [a_{ij}]_{m \times n} and B=[bjk]n×pB = [b_{jk}]_{n \times p}, so ABAB is m×pm \times p with

(AB)ik=∑j=1naijbjk(AB)_{ik} = \sum_{j=1}^{n} a_{ij} b_{jk}

Then (AB)′(AB)' is p×mp \times m, and its (k,i)(k, i) entry is the (i,k)(i, k) entry of ABAB:

[(AB)′]ki=∑j=1naijbjk[(AB)']_{ki} = \sum_{j=1}^{n} a_{ij} b_{jk}

Now B′B' is p×np \times n with (B′)kj=bjk(B')_{kj} = b_{jk}, and A′A' is n×mn \times m with (A′)ji=aij(A')_{ji} = a_{ij}, so …

Definition 3Transpose of a Matrix

Definition

If A=[aij]A = [a_{ij}] is an m×nm \times n matrix, then the transpose of AA, denoted by A′A' or ATA^T, is the n×mn \times m matrix obtained by interchanging the rows and columns of AA.

In index notation:

If A=[aij]m×nA = [a_{ij}]_{m \times n}, then A′=[aji]n×mA' = [a_{ji}]_{n \times m}.

This means:

  • The element in the ii-th row and jj-th column of AA becomes the element in the jj-th row and ii-th column of A′A'.
  • The first row of AA becomes the first column of A′A', the second row becomes the second column, and so on.

Intuition

Think of the transpose as flipping the matrix over its main diagonal — the row and column indices swap places.


Example

Let

A=[23351−1]3×2A = \begin{bmatrix} 2 & 3 \\ 3 & 5 \\ 1 & -1 \end{bmatrix}_{3 \times 2}

Then the transpose is …