The Transpose, Symmetric Matrices, Identity Matrices and Zero Matrices

The Transpose, Symmetric Matrices, Identity Matrices and Zero Matrices

Matrices contain more structure than simple rows and columns. Many important ideas in linear algebra come from operations such as reflecting a matrix, recognising symmetry, and identifying matrices that leave vectors unchanged.

This article covers four core ideas:

  • the transpose of a matrix
  • symmetric matrices
  • the identity matrix
  • the zero matrix


The Transpose of a Matrix

The transpose of a matrix is created by swapping its rows and columns. If a matrix A has an entry in row i, column j, then AT has the same entry in row j, column i.

Example:

A =
[ 1 4 ]
[ 2 5 ]
[ 3 6 ]

Its transpose is:

AT =
[ 1 2 3 ]
[ 4 5 6 ]

If A is n × m, then AT is m × n. A square matrix stays square, but its entries reflect across the main diagonal.



Symmetric Matrices

A square matrix is symmetric when it equals its own transpose:

A = AT

This means the matrix does not change when reflected across the diagonal.

2×2 symmetric matrix:

[ a b ]
[ b c ]

3×3 symmetric matrix:

[ a b c ]
[ b d e ]
[ c e f ]

Each entry above the diagonal mirrors the one below it. Symmetric matrices appear in systems with balanced or reciprocal relationships.



The Identity Matrix

The identity matrix behaves like the number 1 in multiplication. Multiplying a matrix or vector by the identity leaves it unchanged.

3×3 identity matrix:

I =
[ 1 0 0 ]
[ 0 1 0 ]
[ 0 0 1 ]

It satisfies:

  • Ix = x for any 3-dimensional vector x
  • AI = A and IA = A for any 3×3 matrix A

The identity matrix represents a transformation that leaves every point unchanged.



The Zero Matrix

The zero matrix is the matrix with every entry equal to zero.

0 =
[ 0 0 0 ]
[ 0 0 0 ]
[ 0 0 0 ]

Multiplying any compatible matrix or vector by the zero matrix gives the zero vector or zero matrix.



Summary

  • The transpose reflects a matrix across its diagonal.
  • Symmetric matrices do not change when transposed.
  • The identity matrix leaves vectors and matrices unchanged.
  • The zero matrix sends all vectors to the zero vector.

These ideas form the foundation for many topics in linear algebra, including transformations, eigenvalues, and matrix decompositions.



Comments

Post a Comment

Popular posts from this blog

The Method of Differences — A Clean Proof of the Sum of Cubes

The Method of Differences — A Clean Proof of the Sum of Cubes The method of differences is a remarkably elegant tool for evaluating finite sums. When each term of a series can be written in the form f(r+1) − f(r) , the sum “collapses” — all interior terms cancel, leaving only a boundary expression. This behaviour is called a telescoping sum . 1) Telescoping Sums Assume the general term u r can be written as: u r = f(r+1) − f(r). Then the finite sum from r = 1 to r = n becomes: Σ u r = Σ ( f(r+1) − f(r) ). To see what happens, write out a few terms: u₁ = f(2) − f(1) u₂ = f(3) − f(2) u₃ = f(4) − f(3) ⋮ uₙ = f(n+1) − f(n) When these are added, everything cancels except the first and last pieces: Σ u r = f(n+1) − f(1). This is the essence of the method: interior structure disappears, leaving just the difference between the final and initial states. 2) A Classic Application — The Sum of Cubes We will use this technique to prove the well-known ...
Read more

2×2 Orthogonal Matrix Mastery — A Generalised Construction

Image
2×2 Orthogonal Matrix Mastery — A Generalised Construction Orthogonal matrices in two dimensions reveal one of the cleanest structures in linear algebra. A 2×2 matrix is orthogonal when its columns (and rows) satisfy two conditions: They are perpendicular (their dot product is zero); They have unit length (their magnitude is one). This article presents a clear generalisation: any pair of perpendicular vectors with equal magnitude can be normalised to form an orthogonal matrix. 1. Begin with two perpendicular vectors Let the first vector be: (a, b) A perpendicular vector can be chosen as: (−b, a) Their dot products confirm orthogonality: (a, b) · (−b, a) = −ab + ab = 0 (a, −b) · (b, a) = ab − ab = 0 2. Compute their shared magnitude Both vectors have the same length: |(a, b)| = √(a² + b²) We can therefore normalise each one by dividing by √(a² + b²). 3. Form the matrix using the normalised vectors Place the two normalised vectors...
Read more

The Maclaurin Series — A Clean Derivation

Image
The Maclaurin Series — A Clean Derivation Many smooth functions can be written as an infinite polynomial. When this expansion is centred at x = 0 , we obtain the Maclaurin series . This article derives the Maclaurin formula directly from repeated differentiation, showing precisely why the coefficients involve derivatives and factorials. 1) Begin with a General Power Series Suppose a function f(x) can be expressed as f(x) = a₀ + a₁x + a₂x² + a₃x³ + … + aᵣxʳ + … The constants aᵣ are real coefficients whose values we wish to determine. 2) Evaluate at x = 0 f(0) = a₀ so a₀ = f(0). 3) Differentiate Once f′(x) = a₁ + 2a₂x + 3a₃x² + … + r·aᵣxʳ⁻¹ + … Setting x = 0 eliminates all higher powers: f′(0) = a₁. Thus, a₁ = f′(0). 4) Differentiate Again f″(x) = 2·1·a₂ + 3·2·a₃x + … + r(r−1)aᵣxʳ⁻² + … Evaluate at x = 0 : f″(0) = 2! · a₂ Hence a₂ = f″(0) / 2!. 5) The General Pattern Differentiate repeatedly. After r differentiations, a...
Read more