Skip to main content
Mathematics LibreTexts

Properties of Matrices

  • Page ID
    218292
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\dsum}{\displaystyle\sum\limits} \)

    \( \newcommand{\dint}{\displaystyle\int\limits} \)

    \( \newcommand{\dlim}{\displaystyle\lim\limits} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \(\newcommand{\longvect}{\overrightarrow}\)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)

    Properties of Matrix Operations

     

    Properties of Addition

    The basic properties of addition for real numbers also hold true for matrices. 

    Let A, B and C be m x n matrices

    1. A + B  =  B + A    commutative
       
    2. A + (B + C)  =  (A + B) + C    associative
       
    3. There is a unique m x n matrix O with

              A + O  =  A        additive identity

       
    4. For any  m x n matrix A there is an m x n matrix B (called -A) with

             A + B  =  O        additive inverse

     

    The proofs are all similar.  We will prove the first property.

     

    Proof of Property 1

    We have

            (A + B)ij  =  Aij + Bij     definition of addition of matrices

            =  Bij + Aij         commutative property of addition for real numbers

           =  (B + A)ij       definition of addition of matrices

    Notice that the zero matrix is different for different m and n.  For example

         \( O_{22} = \begin{pmatrix} 0 & 0 \\ 0 & 0  \end{pmatrix} \)      \(    O_{23} = \begin{pmatrix}  0 & 0 & 0 \\ 0 & 0 & 0  \end{pmatrix} \)

     

     

    Properties of Matrix Multiplication

    Unlike matrix addition, the properties of multiplication of real numbers do not all generalize to matrices.  Matrices rarely commute even if AB and BA are both defined.  There often is no multiplicative inverse of a matrix, even if the matrix is a square matrix.  There are a few properties of multiplication of real numbers that generalize to matrices.  We state them now.

    Let A, B and C be matrices of dimensions such that the following are defined.  Then

    1. A(BC)  =  (AB)C                 associative
       
    2. A(B + C)  =  AB + AC        distributive
       
    3. (A + B)C  =  AC + BC        distributive
       
    4. There are unique matrices Im and In with

              Im A  =  A In  =  A        multiplicative identity

    We will often omit the subscript and write I for the identity matrix.  The identity matrix is a square scalar matrix with 1's along the diagonal.  For example

         \( I_{22} = \begin{pmatrix} 1 & 0 \\ 0 & 1  \end{pmatrix} \)      \(    I_{33} = \begin{pmatrix}  1 & 0 & 0 \\ 0 & 1 & 0  \\ 0 & 0 & 1 \end{pmatrix} \)

            

    We will prove the second property and leave the rest for you.

     

    Proof of Property 2

    Again we show that the general element of the left hand side is the same as the right hand side.  We have

            (A(B + C))ij  = S(Aik(B + C)kj)        definition of matrix multiplication

            =  S(Aik(Bkj + Ckj))        definition of matrix addition

            =  S(AikBkj + AikCkj)       distributive property of the real numbers

            =  S AikBkj + S AikCkj     commutative property of the real numbers

            =  (AB)ij + (AC)ij        definition of matrix multiplication

    where the sum is taken from 1 to k.


    Example

    We will demonstrate property 1 with

     

         \( A = \begin{pmatrix} 1 & 2 \\ 3 & 4  \end{pmatrix} \)     \(  B = \begin{pmatrix}  2 & 0 & 1 \\ 3 & 5 & 1  \\ 0 & 0 & 1 \end{pmatrix}  \)    \(  C = \begin{pmatrix}  0 & 2 \\ 1 & 4  \\ -2 & -1 \end{pmatrix} \)

            

    We have

             \( BC = \begin{pmatrix} 2 & 5 \\ 3 & 25  \end{pmatrix} \)    

    so that   

             \( A(BC) = \begin{pmatrix} 8 & 55 \\ 18 & 115  \end{pmatrix} \)    

    We have

             \( AB = \begin{pmatrix} 8 & 10 & 1 \\ 18 & 20 & 1  \end{pmatrix} \)    

    so that

             \( AB(C) = \begin{pmatrix} 8 & 55 \\ 18 & 115  \end{pmatrix} \)    


    Properties of Scalar Multiplication

    Since we can multiply a matrix by a scalar, we can investigate the properties that this multiplication has.  All of the properties of multiplication of real numbers generalize.  In particular, we have

    Let r and s be real numbers and A and B be matrices.  Then

    1. r(sA)  =  (rs)A

        
    2. (r + s)A  =  rA + sA
       
    3. r(A + B)  =  rA + rB
       
    4. A(rB)  =  r(AB)  =  (rA)B

     

    We will prove property 3 and leave the rest for you.  We have

            (r(A + B))ij  =  (r)(A + B)ij          definition of scalar multiplication

            =  (r)(Aij + Bij)        definition of addition of matrices

            =  rAij + rBij        distributive property of the real numbers

            =  (rA)ij + (rB)ij        definition of scalar multiplication

            =  (rA + rB)ij        definition of addition of matrices


    Properties of the Transpose of a Matrix

    Recall that the transpose of a matrix is the operation of switching rows and columns.  We state the following properties.  We proved the first property in the last section.

    Let r be a real number and A and B be matrices.  Then

    1. (AT)T  =  A
       
    2. (A + B)T  =  AT + BT
       
    3. (AB)T  =  BTAT
       
    4. (rA)T  =  rAT


    Back to the Matrices and Applications Home Page

     

     

    Properties of Matrices is shared under a CC BY license and was authored, remixed, and/or curated by LibreTexts.

    • Was this article helpful?