The transpose is one of the simplest yet most useful operations on a matrix: you flip the matrix across its main diagonal, so that its rows become columns and its columns become rows.
The intuition
Picture writing a table of marks with students down the rows and subjects across the columns. If instead you want subjects down the rows and students across the columns, you don't recollect the data — you just turn the table on its side. That turn is the transpose.
The precise definition
If A=[aij] is a matrix of order m×n, its transpose, written A′ (or AT), is the n×m matrix obtained by interchanging rows and columns:
A′=[aji],so the (i,j) entry of A′ is the (j,i) entry of A.
The entry in row i, column j of A moves to row j, column i of A′.
A worked look
A=[205314]2×3⟹A′=2510343×2.
The first row(2,5,1) of A has become the first column of A′.
Properties you must know
For matrices A,B of suitable orders and a scalar k:
(A′)′=A — transposing twice returns the original.
(kA)′=kA′ — a scalar comes straight through.
(A+B)′=A′+B′ — transpose distributes over addition.
(AB)′=B′A′ — the reversal law: the transpose of a product reverses the order of the factors. …
Since transpose is linear, (A+2B)′=A′+2B′. Computing B′ from B and adding gives (A+2B)′=[−4156].
The transpose operation distributes over addition and scalar multiplication, so we can work directly with the transposes we are given, without recovering A itself.
Mistake 1: Reconstructing A and transposing again unnecessarily
Why it's wrong: since (A+2B)′=A′+2B′, using the given A′ directly is faster and less error-prone than recovering A. Correct approach: apply the linearity of the transpose.
Mistake 2: Doing only one of "transpose B" and "scale by 2" …
Q.Which of the following statements is not correct?
(A) A row matrix has only one row
(B) A diagonal matrix has all diagonal elements equal to zero
(C) A symmetric matrix A is a square matrix satisfying A′=A
(D) A skew symmetric matrix has all diagonal elements equal to zero
›Reveal solutionSolution
A diagonal matrix has zero off-diagonal entries, not zero diagonal entries — statement (B) inverts the definition.
Step 1 — Check (A): "A row matrix has only one row."
True by definition. A row matrix (row vector) has order 1×n, e.g. [257]. ✓
Step 2 — Check (B): "A diagonal matrix has all diagonal elements equal to zero."
False. The definition is: a square matrix A=[aij] is diagonal if
aij=0for all i=j
That is, everything off the main diagonal is zero; the diagonal entries aii are unrestricted. Counter-example:
I2=[1001]
is diagonal, yet both diagonal elements are 1, not 0. (A matrix with every entry zero is the null matrix, a special case — not the definition.) ✗
Step 3 — Check (C): "A symmetric matrix A is a square matrix satisfying A′=A."
True — that is precisely the definition: aij=aji for all i,j. ✓
Step 4 — Check (D): "A skew-symmetric matrix has all diagonal elements equal to zero." …