<?xml version="1.0" encoding="utf-8" standalone="no"?>
<!DOCTYPE document PUBLIC "-//CNX//DTD CNXML 0.5 plus MathML//EN" "http://cnx.rice.edu/cnxml/0.5/DTD/cnxml_mathml.dtd">
<document xmlns="http://cnx.rice.edu/cnxml" xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="m10090">
  
  <name>Matrix Arithmetic</name>

  <metadata>
  <md:version>2.6</md:version>
  <md:created>2001/06/13</md:created>
  <md:revised>2002/05/29</md:revised>
  <md:authorlist>
    <md:author id="mselik">
      <md:firstname>Melissa</md:firstname>
      
      <md:surname>Selik</md:surname>
      <md:email>mselik@alumni.rice.edu</md:email>
    </md:author>
    <md:author id="richb">
      <md:firstname>Richard</md:firstname>
      <md:othername>G.</md:othername>
      <md:surname>Baraniuk</md:surname>
      <md:email>richb@rice.edu</md:email>
    </md:author>
  </md:authorlist>

  <md:maintainerlist>
    <md:maintainer id="mselik">
      <md:firstname>Melissa</md:firstname>
      
      <md:surname>Selik</md:surname>
      <md:email>mselik@alumni.rice.edu</md:email>
    </md:maintainer>
    <md:maintainer id="jrom">
      <md:firstname>Justin</md:firstname>
      
      <md:surname>Romberg</md:surname>
      <md:email>jrom@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer id="rars">
      <md:firstname>Ricardo</md:firstname>
      <md:othername>Anthony</md:othername>
      <md:surname>Radaelli-Sanchez</md:surname>
      <md:email>ricky@alumni.rice.edu</md:email>
    </md:maintainer>
    <md:maintainer id="richb">
      <md:firstname>Richard</md:firstname>
      <md:othername>G.</md:othername>
      <md:surname>Baraniuk</md:surname>
      <md:email>richb@rice.edu</md:email>
    </md:maintainer>
  </md:maintainerlist>
  
  <md:keywordlist>
    <md:keyword>matrix</md:keyword>
    <md:keyword>conjugate</md:keyword>
    <md:keyword>matrix arithmetic</md:keyword>
    <md:keyword>addition</md:keyword>
    <md:keyword>multiplication</md:keyword>
    <md:keyword>transpose</md:keyword>
    <md:keyword>hermetian</md:keyword>
  </md:keywordlist>

  <md:abstract>Describes basic matrix operations.</md:abstract>
</metadata>
  <content>

    
    <!-- ****************************************** -->
    
    <section id="sect1">
      <name>Matrix Addition</name>
      <para id="para1">
	Given two
	<m:math>
	  <m:apply>
	    <m:mo>×</m:mo>
	    <m:ci> m </m:ci>	    
	    <m:ci> n </m:ci>
	  </m:apply>
	</m:math>
	matrices <m:math><m:ci>A</m:ci></m:math> and
	<m:math><m:ci>B</m:ci></m:math>, we define the sum to be the new 
	<m:math>
	  <m:apply>
	    <m:mo>×</m:mo>
	    <m:ci> m </m:ci>	    
	    <m:ci> n </m:ci>
	  </m:apply>
	</m:math>
	matrix
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:ci> C </m:ci>
	    <m:apply>
	      <m:plus/>
	      <m:ci> A </m:ci>
	      <m:ci> B </m:ci>
	    </m:apply>
	  </m:apply>
	</m:math>, where each entry, 
	<m:math>
	  <m:apply>
	    <m:selector/>
	    <m:ci> c </m:ci>
	    <m:ci> i </m:ci>
	    <m:ci> j </m:ci>
	  </m:apply>
	</m:math>, is the sum of 
	<m:math>
	  <m:apply>
	    <m:selector/>
	    <m:ci> a </m:ci>
	    <m:ci> i </m:ci>
	    <m:ci> j </m:ci>
	  </m:apply>
	</m:math>
	and 
	<m:math>
	  <m:apply>
	    <m:selector/>
	    <m:ci> b </m:ci>
	    <m:ci> i </m:ci>
	    <m:ci> j </m:ci>
	  </m:apply>
	</m:math>.
      </para>

      <equation id="eqn1">
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:apply>
	      <m:plus/>
	      <m:matrix>
		<m:matrixrow>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 1 </m:cn>
		    <m:cn> 1 </m:cn>
		  </m:apply>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 1 </m:cn>
		    <m:cn> 2 </m:cn>
		  </m:apply>
		  <m:ci> ⋯ </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 1 </m:cn>
		    <m:ci> n </m:ci>
		  </m:apply>
		</m:matrixrow>
		<m:matrixrow>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 2 </m:cn>
		    <m:cn> 1 </m:cn>
		  </m:apply>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 2 </m:cn>
		    <m:cn> 2 </m:cn>
		  </m:apply>
		  <m:ci> ⋯ </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 2 </m:cn>
		    <m:ci> n </m:ci>
		  </m:apply>
		</m:matrixrow>
		<m:matrixrow>
		  <m:ci>⋮</m:ci> 
		  <m:ci>⋮</m:ci> 
		  <m:ci>⋮</m:ci> 
		  <m:ci>⋮</m:ci>
		</m:matrixrow>
		<m:matrixrow>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:ci> m </m:ci>
		    <m:cn> 1 </m:cn>
		  </m:apply>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:ci> m </m:ci>
		    <m:cn> 2 </m:cn>
		  </m:apply>
		  <m:ci> ⋯ </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:ci> m </m:ci>
		    <m:ci> n </m:ci>
		  </m:apply>
		</m:matrixrow>
	      </m:matrix>
	      <m:matrix>
		<m:matrixrow>
		  <m:apply>
		    <m:selector/>
		    <m:ci> b </m:ci>
		    <m:cn> 1 </m:cn>
		    <m:cn> 1 </m:cn>
		  </m:apply>
		  <m:apply>
		    <m:selector/>
		    <m:ci> b </m:ci>
		    <m:cn> 1 </m:cn>
		    <m:cn> 2 </m:cn>
		  </m:apply>
		  <m:ci> ⋯ </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> b </m:ci>
		    <m:cn> 1 </m:cn>
		    <m:ci> n </m:ci>
		  </m:apply>
		</m:matrixrow>
		<m:matrixrow>
		  <m:apply>
		    <m:selector/>
		    <m:ci> b </m:ci>
		    <m:cn> 2 </m:cn>
		    <m:cn> 1 </m:cn>
		  </m:apply>
		  <m:apply>
		    <m:selector/>
		    <m:ci> b </m:ci>
		    <m:cn> 2 </m:cn>
		    <m:cn> 2 </m:cn>
		  </m:apply>
		  <m:ci> ⋯ </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> b </m:ci>
		    <m:cn> 2 </m:cn>
		    <m:ci> n </m:ci>
		  </m:apply>
		</m:matrixrow>
		<m:matrixrow>
		  <m:ci> ⋮ </m:ci> 
		  <m:ci> ⋮ </m:ci> 
		  <m:ci> ⋮ </m:ci> 
		  <m:ci> ⋮ </m:ci>
		</m:matrixrow>
		<m:matrixrow>
		  <m:apply>
		    <m:selector/>
		    <m:ci> b </m:ci>
		    <m:ci> m </m:ci>
		    <m:cn> 1 </m:cn>
		  </m:apply>
		  <m:apply>
		    <m:selector/>
		    <m:ci> b </m:ci>
		    <m:ci> m </m:ci>
		    <m:cn> 2 </m:cn>
		  </m:apply>
		  <m:ci> ⋯ </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> b </m:ci>
		    <m:ci> m </m:ci>
		    <m:ci> n </m:ci>
		  </m:apply>
		</m:matrixrow>
	      </m:matrix>
	    </m:apply>
	    <m:apply>
	      <m:matrix>
		<m:matrixrow>
		  <m:apply>
		    <m:plus/>
		    <m:apply>
		      <m:selector/>
		      <m:ci> a </m:ci>
		      <m:cn> 1 </m:cn>
		      <m:cn> 1 </m:cn>
		    </m:apply>
		    <m:apply>
		      <m:selector/>
		      <m:ci> b </m:ci>
		      <m:cn> 1 </m:cn>
		      <m:cn> 1 </m:cn>
		    </m:apply>
		  </m:apply>
		  <m:apply>
		    <m:plus/>
		    <m:apply>
		      <m:selector/>
		      <m:ci> a </m:ci>
		      <m:cn> 1 </m:cn>
		      <m:cn> 2 </m:cn>
		    </m:apply>
		    <m:apply>
		      <m:selector/>
		      <m:ci> b </m:ci>
		      <m:cn> 1 </m:cn>
		      <m:cn> 2 </m:cn>
		    </m:apply>
		  </m:apply>
		  <m:ci> ⋯ </m:ci>
		  <m:apply>
		    <m:plus/>
		    <m:apply>
		      <m:selector/>
		      <m:ci> a </m:ci>
		      <m:cn> 1 </m:cn>
		      <m:ci> n </m:ci>
		    </m:apply>
		    <m:apply>
		      <m:selector/>
		      <m:ci> b </m:ci>
		      <m:cn> 1 </m:cn>
		      <m:ci> n </m:ci>
		    </m:apply>
		  </m:apply>
		</m:matrixrow>
		<m:matrixrow>
		  <m:apply>
		    <m:plus/>
		    <m:apply>
		      <m:selector/>
		      <m:ci> a </m:ci>
		      <m:cn> 2 </m:cn>
		      <m:cn> 1 </m:cn>
		    </m:apply>
		    <m:apply>
		      <m:selector/>
		      <m:ci> b </m:ci>
		      <m:cn> 2 </m:cn>
		      <m:cn> 1 </m:cn>
		    </m:apply>
		  </m:apply>
		  <m:apply>
		    <m:plus/>
		    <m:apply>
		      <m:selector/>
		      <m:ci> a </m:ci>
		      <m:cn> 2 </m:cn>
		      <m:cn> 2 </m:cn>
		    </m:apply>
		    <m:apply>
		      <m:selector/>
		      <m:ci> b </m:ci>
		      <m:cn> 2 </m:cn>
		      <m:cn> 2 </m:cn>
		    </m:apply>
		  </m:apply>
		  <m:ci> ⋯ </m:ci>
		  <m:apply>
		    <m:plus/>
		    <m:apply>
		      <m:selector/>
		      <m:ci> a </m:ci>
		      <m:cn> 2 </m:cn>
		      <m:ci> n </m:ci>
		    </m:apply>
		    <m:apply>
		      <m:selector/>
		      <m:ci> b </m:ci>
		      <m:cn> 2 </m:cn>
		      <m:ci> n </m:ci>
		    </m:apply>
		  </m:apply>
		</m:matrixrow>
		<m:matrixrow>
		  <m:ci> ⋮ </m:ci> 
		  <m:ci> ⋮ </m:ci> 
		  <m:ci> ⋮ </m:ci> 
		  <m:ci> ⋮ </m:ci>
		</m:matrixrow>
		<m:matrixrow>
		  <m:apply>
		    <m:plus/>
		    <m:apply>
		      <m:selector/>
		      <m:ci> a </m:ci>
		      <m:ci> m </m:ci>
		      <m:cn> 1 </m:cn>
		    </m:apply>
		    <m:apply>
		      <m:selector/>
		      <m:ci> b </m:ci>
		      <m:ci> m </m:ci>
		      <m:cn> 1 </m:cn>
		    </m:apply>
		  </m:apply>
		  <m:apply>
		    <m:plus/>
		    <m:apply>
		      <m:selector/>
		      <m:ci> a </m:ci>
		      <m:ci> m </m:ci>
		      <m:cn> 2 </m:cn>
		    </m:apply>
		    <m:apply>
		      <m:selector/>
		      <m:ci> b </m:ci>
		      <m:ci> m </m:ci>
		      <m:cn> 2 </m:cn>
		    </m:apply>
		  </m:apply>
		  <m:ci> ⋯ </m:ci>
		  <m:apply>
		    <m:plus/>
		    <m:apply>
		      <m:selector/>
		      <m:ci> a </m:ci>
		      <m:ci> m </m:ci>
		      <m:ci> n </m:ci>
		    </m:apply>
		    <m:apply>
		      <m:selector/>
		      <m:ci> b </m:ci>
		      <m:ci> m </m:ci>
		      <m:ci> n </m:ci>
		    </m:apply>
		  </m:apply>
		</m:matrixrow>
	      </m:matrix>
	    </m:apply>
	  </m:apply>
	</m:math>
      </equation>
      
      <example id="exa1">
	<para id="exa1a">
	  <m:math>
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:plus/>
		<m:matrix>
		  <m:matrixrow>
		    <m:cn> -1 </m:cn> <m:cn> 7 </m:cn> <m:cn> 9 </m:cn>
		  </m:matrixrow>
		  <m:matrixrow>
		    <m:cn> 4 </m:cn> <m:cn> 5 </m:cn> <m:cn> 2 </m:cn>
		  </m:matrixrow>
		  <m:matrixrow>
		    <m:cn> 2 </m:cn> <m:cn> 2 </m:cn> <m:cn> 0 </m:cn>
		  </m:matrixrow>
		</m:matrix>
		<m:matrix>
		  <m:matrixrow>
		    <m:cn> 3 </m:cn> <m:cn> 2 </m:cn> <m:cn> 4 </m:cn>
		  </m:matrixrow>
		  <m:matrixrow>
		    <m:cn> 3 </m:cn> <m:cn> 1 </m:cn> <m:cn> 8 </m:cn>
		  </m:matrixrow>
		  <m:matrixrow>
		    <m:cn> -1 </m:cn> <m:cn> 5 </m:cn> <m:cn> -2 </m:cn>
		  </m:matrixrow>
		</m:matrix>
	      </m:apply>
	      <m:matrix>
		<m:matrixrow>
		  <m:cn> 2 </m:cn> <m:cn> 9 </m:cn> <m:cn> 13 </m:cn>
		</m:matrixrow>
		<m:matrixrow>
		  <m:cn> 7 </m:cn> <m:cn> 6 </m:cn> <m:cn> 10 </m:cn>
		</m:matrixrow>
		<m:matrixrow>
		  <m:cn> 1 </m:cn> <m:cn> 7 </m:cn> <m:cn> -2 </m:cn>
		</m:matrixrow>
	      </m:matrix>
	    </m:apply>
	  </m:math>
	</para>
      </example>
    </section>
    
    <section id="sect2">
      <name>Scalar Multiplication</name>
      <para id="para2">
	Given an
	<m:math>
	  <m:apply>
	    <m:mo>×</m:mo>
	    <m:ci> m </m:ci>
	    <m:ci> n </m:ci>
	  </m:apply>
	</m:math>
	matrix <m:math><m:ci>A</m:ci></m:math> and a scalar
	<m:math><m:ci>k</m:ci></m:math>, we define the product to be
	the
	<m:math>
	  <m:apply>
	    <m:mo>×</m:mo>
	    <m:ci> m </m:ci>
	    <m:ci> n </m:ci>
	  </m:apply>
	</m:math>
	matrix <m:math><m:ci>B</m:ci></m:math>
	where
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:apply>
	      <m:selector/>
	      <m:ci> b </m:ci>
	      <m:ci> i </m:ci>
	      <m:ci> j </m:ci>
	    </m:apply>
	    <m:apply>
	      <m:times/>
	      <m:ci> k </m:ci>
	      <m:apply>
		<m:selector/>
		<m:ci> a </m:ci>
		<m:ci> i </m:ci>
		<m:ci> j </m:ci>
	      </m:apply>
	    </m:apply>
	  </m:apply>
	</m:math>.
      </para>
      
      <equation id="eqn2">
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:apply>
	      <m:times/>
	      <m:ci> k </m:ci>
	      <m:matrix>
		<m:matrixrow>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 1 </m:cn>
		    <m:cn> 1 </m:cn>
		  </m:apply>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 1 </m:cn>
		    <m:cn> 2 </m:cn>
		  </m:apply>
		  <m:ci> ⋯ </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 1 </m:cn>
		    <m:ci> n </m:ci>
		  </m:apply>
		</m:matrixrow>
		<m:matrixrow>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 2 </m:cn>
		    <m:cn> 1 </m:cn>
		  </m:apply>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 2 </m:cn>
		    <m:cn> 2 </m:cn>
		  </m:apply>
		  <m:ci> ⋯ </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 2 </m:cn>
		    <m:ci> n </m:ci>
		  </m:apply>
		</m:matrixrow>
		<m:matrixrow>
		  <m:ci> ⋮ </m:ci> 
		  <m:ci> ⋮ </m:ci> 
		  <m:ci> ⋮ </m:ci> 
		  <m:ci> ⋮ </m:ci>
		</m:matrixrow>
		<m:matrixrow>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:ci> m </m:ci>
		    <m:cn> 1 </m:cn>
		  </m:apply>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:ci> m </m:ci>
		    <m:cn> 2 </m:cn>
		  </m:apply>
		  <m:ci> ⋯ </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:ci> m </m:ci>
		    <m:ci> n </m:ci>
		  </m:apply>
		</m:matrixrow>
	      </m:matrix>
	    </m:apply>
	    <m:matrix>
	      <m:matrixrow>
		<m:apply>
		  <m:times/>
		  <m:ci> k </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 1 </m:cn>
		    <m:cn> 1 </m:cn>
		  </m:apply>
		</m:apply>
		<m:apply>
		  <m:times/>
		  <m:ci> k </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 1 </m:cn>
		    <m:cn> 2 </m:cn>
		  </m:apply>
		</m:apply>
		<m:ci> ⋯ </m:ci>
		<m:apply>
		  <m:times/>
		  <m:ci> k </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 1 </m:cn>
		    <m:ci> n </m:ci>
		  </m:apply>
		</m:apply>
	      </m:matrixrow>
	      <m:matrixrow>
		<m:apply>
		  <m:times/>
		  <m:ci> k </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 2 </m:cn>
		    <m:cn> 1 </m:cn>
		  </m:apply>
		</m:apply>
		<m:apply>
		  <m:times/>
		  <m:ci> k </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 2 </m:cn>
		    <m:cn> 2 </m:cn>
		  </m:apply>
		</m:apply>
		<m:ci> ⋯ </m:ci>
		<m:apply>
		  <m:times/>
		  <m:ci> k </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:cn> 2 </m:cn>
		    <m:ci> n </m:ci>
		  </m:apply>
		</m:apply>
	      </m:matrixrow>
	      <m:matrixrow>
		<m:ci> ⋮ </m:ci> 
		<m:ci> ⋮ </m:ci> 
		<m:ci> ⋮ </m:ci> 
		<m:ci> ⋮ </m:ci>
	      </m:matrixrow>
	      <m:matrixrow>
		<m:apply>
		  <m:times/>
		  <m:ci> k </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:ci> m </m:ci>
		    <m:cn> 1 </m:cn>
		  </m:apply>
		</m:apply>
		<m:apply>
		  <m:times/>
		  <m:ci> k </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:ci> m </m:ci>
		    <m:cn> 2 </m:cn>
		  </m:apply>
		</m:apply>
		<m:ci> ⋯ </m:ci>
		<m:apply>
		  <m:times/>
		  <m:ci> k </m:ci>
		  <m:apply>
		    <m:selector/>
		    <m:ci> a </m:ci>
		    <m:ci> m </m:ci>
		    <m:ci> n </m:ci>
		  </m:apply>
		</m:apply>
	      </m:matrixrow>
	    </m:matrix>
	  </m:apply>   
	</m:math>
      </equation>
      
      <example id="exa2">
	<para id="exa2a">
	  <m:math>
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:times/>
		<m:cn> -7 </m:cn>
		<m:matrix>
		  <m:matrixrow>
		    <m:cn> 2 </m:cn> <m:cn> 3 </m:cn> <m:cn> 9 </m:cn>
		  </m:matrixrow>
		  <m:matrixrow>
		    <m:cn> -11 </m:cn> <m:cn> 3 </m:cn> <m:cn> -4 </m:cn>
		  </m:matrixrow>
		  <m:matrixrow>
		    <m:cn> -1 </m:cn> <m:cn> -2 </m:cn> <m:cn> 7 </m:cn>
		  </m:matrixrow>
		</m:matrix>
	      </m:apply>
	      <m:matrix>
		<m:matrixrow>
		  <m:cn> -14 </m:cn> <m:cn> -21 </m:cn> <m:cn> -81 </m:cn>
		</m:matrixrow>
		<m:matrixrow>
		  <m:cn> 77 </m:cn> <m:cn> -21 </m:cn> <m:cn> 28 </m:cn>
		</m:matrixrow>
		<m:matrixrow>
		  <m:cn> 7 </m:cn> <m:cn> 14 </m:cn> <m:cn> -49 </m:cn>
		</m:matrixrow>
	      </m:matrix>
	    </m:apply>
	  </m:math>
	</para>
      </example>
    </section>
    
    <section id="sect3">
      <name>Matrix Multiplication</name>
      <para id="para3">
	Given an
	<m:math>
	  <m:apply>
	    <m:mo>×</m:mo>
	    <m:ci> m </m:ci>
	    <m:ci> n </m:ci>
	  </m:apply>
	</m:math>
	matrix <m:math><m:ci>A</m:ci></m:math>
	and an
	<m:math>
	  <m:apply>
	    <m:mo>×</m:mo>
	    <m:ci> n </m:ci>
	    <m:ci> p </m:ci>
	  </m:apply>
	</m:math>
	matrix <m:math><m:ci>B</m:ci></m:math>
	we define the product
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:ci> C </m:ci>
	    <m:apply>
	      <m:times/>
	      <m:ci> A </m:ci>
	      <m:ci> B </m:ci>
	    </m:apply>
	  </m:apply>
	</m:math>
	to be the
	<m:math>
	  <m:apply>
	    <m:mo>×</m:mo>
	    <m:ci> m </m:ci>
	    <m:ci> p </m:ci>
	  </m:apply>
	</m:math>
	matrix with entries given by

	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:apply>
	      <m:selector/>
	      <m:ci> c </m:ci>
	      <m:ci> i </m:ci>
	      <m:ci> j </m:ci>
	    </m:apply>
	    <m:apply>
	      <m:sum/>
	      <m:bvar>
		<m:ci> k </m:ci>
	      </m:bvar>
	      <m:lowlimit>
		<m:cn> 1 </m:cn>
	      </m:lowlimit>
	      <m:uplimit>
		<m:ci> n </m:ci>
	      </m:uplimit>
	      <m:apply>
		<m:times/>
		<m:apply>
		  <m:selector/>
		  <m:ci> a </m:ci>
		  <m:ci> i </m:ci>
		  <m:ci> k </m:ci>
		</m:apply>
		<m:apply>
		  <m:selector/>
		  <m:ci> b </m:ci>
		  <m:ci> k </m:ci>
		  <m:ci> j </m:ci>
		</m:apply>
	      </m:apply>
	    </m:apply>
	  </m:apply>
	</m:math>
	This is also called the dot product of the
	<m:math><m:ci>i</m:ci></m:math>th row of
	<m:math><m:ci>A</m:ci></m:math> and the
	<m:math><m:ci>j</m:ci></m:math>th column of
	<m:math><m:ci>B</m:ci></m:math>.  This process can be
	described as simultaneously walking across each row of
	<m:math><m:ci>A</m:ci></m:math>, column of
	<m:math><m:ci>B</m:ci></m:math> pair, multiplying
	corresponding entries and adding them together.
      </para>

      <para id="para4">
	This definition carries with it several properties:
      </para>

      <list id="list1">
	<item>The <term>inner dimensions</term> of the matrices being
	  multiplied must agree.  This is to say that
	  <m:math><m:ci>A</m:ci></m:math> must have as many columns as
	  <m:math><m:ci>B</m:ci></m:math> has rows.
	</item>

	<item>Matrix multiplication does not commute (ie 
	  <m:math>
	    <m:apply>
	      <m:neq/>
	      <m:apply>
		<m:times/>
		<m:ci> A </m:ci>
		<m:ci> B </m:ci>
	      </m:apply>
	      <m:apply>
		<m:times/>
		<m:ci> B </m:ci>
		<m:ci> A </m:ci>
	      </m:apply>
	    </m:apply>
	  </m:math>.  In fact, this "reverse" operation may not even
	  be defined since the inner dimensions will not necessarily
	  agree.
	</item>

	<item>An 
	  <m:math>
	    <m:apply>
	      <m:mo>×</m:mo>
	      <m:ci> m </m:ci>
	      <m:ci> n </m:ci>
	    </m:apply>
	  </m:math>
	  matrix <m:math><m:ci>A</m:ci></m:math> defines a mapping from 
	  <m:math>
	    <m:apply>
	      <m:real/>
	      <m:ci> n </m:ci>
	    </m:apply>
	  </m:math>
	  to 
	  <m:math>
	    <m:apply>
	      <m:real/>
	      <m:ci> m </m:ci>
	    </m:apply>
	  </m:math>.  This can be seen by "premultiplying" an
	  <m:math>
	    <m:apply>
	      <m:mo>×</m:mo>
	      <m:ci> n </m:ci>
	      <m:cn> 1 </m:cn>
	    </m:apply>
	  </m:math>
	  column vector <m:math><m:ci>x</m:ci></m:math>
	  by <m:math><m:ci>A</m:ci></m:math>
	  (<foreign>i.e.</foreign>
	  <m:math>
	    <m:apply>
	      <m:times/>
	      <m:ci> A </m:ci>
	      <m:ci> x </m:ci>
	    </m:apply>
	  </m:math>).  The result of this can be shown to be an
	  <m:math>
	    <m:apply>
	      <m:mo>×</m:mo>
	      <m:ci> m </m:ci>
	      <m:cn> 1 </m:cn>
	    </m:apply>
	  </m:math>
	  column vector.  Thus the matrix
	  <m:math>
	    <m:ci> A </m:ci>
	  </m:math>
	  mapped a length-<m:math><m:ci>n</m:ci></m:math> vector to a
	  length-<m:math><m:ci>m</m:ci></m:math> vector.</item>
      </list>
      
      <example id="exa3">
	<para id="exa3a">
	  <m:math>
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:times/>
		<m:matrix>
		  <m:matrixrow>
		    <m:cn> -1 </m:cn> <m:cn> 7 </m:cn> <m:cn> 9 </m:cn>
		  </m:matrixrow>
		  <m:matrixrow>
		    <m:cn> 4 </m:cn> <m:cn> 5 </m:cn> <m:cn> 2 </m:cn>
		  </m:matrixrow>
		  <m:matrixrow>
		    <m:cn> 2 </m:cn> <m:cn> 2 </m:cn> <m:cn> 0 </m:cn>
		  </m:matrixrow>
		</m:matrix>
		<m:matrix>
		  <m:matrixrow>
		    <m:cn> 3 </m:cn> <m:cn> 2 </m:cn> <m:cn> 4 </m:cn>
		  </m:matrixrow>
		  <m:matrixrow>
		    <m:cn> 3 </m:cn> <m:cn> 1 </m:cn> <m:cn> 8 </m:cn>
		  </m:matrixrow>
		  <m:matrixrow>
		    <m:cn> -1 </m:cn> <m:cn> 5 </m:cn> <m:cn> -2 </m:cn>
		  </m:matrixrow>
		</m:matrix>
	      </m:apply>
	      <m:matrix>
		<m:matrixrow>
		  <m:cn> 9 </m:cn> <m:cn> 50 </m:cn> <m:cn> 34 </m:cn>
		</m:matrixrow>
		<m:matrixrow>
		  <m:cn> 25 </m:cn> <m:cn> 23 </m:cn> <m:cn> 52 </m:cn>
		</m:matrixrow>
		<m:matrixrow>
		  <m:cn> 12 </m:cn> <m:cn> 6 </m:cn> <m:cn> 24 </m:cn>
		</m:matrixrow>
	      </m:matrix>
	    </m:apply>
	  </m:math>
	</para>
      </example>
    </section>
    
    <section id="sect4"><name>Transposition</name>
      <para id="para5">
	There are two forms of transposition, the standard transpose
	(denoted by a superscript <m:math><m:ci>T</m:ci></m:math>) and
	the Hermetian or Conjugate transpose (denoted by a superscript
	<m:math><m:ci>H</m:ci></m:math> or
	<m:math><m:ci>*</m:ci></m:math>).  For matrices defined over
	the field of real numbers, these operations are exactly
	equivalent.  However, for matrices defined over the field of
	complex numbers, the Hermetian transpose is found by taking
	the complex conjugate of each entry of the standard transpose.
      </para>

      <para id="para6">
	Transposition of a matrix <m:math><m:ci>A</m:ci></m:math>, results in a
	matrix
	<m:math>
	  <m:apply>
	    <m:transpose/>
	    <m:ci> A </m:ci>
	  </m:apply>
	</m:math>
	where
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:apply>
	      <m:transpose/>
	      <m:apply>
		<m:selector/>
		<m:ci> a </m:ci>
		<m:ci> i </m:ci>
		<m:ci> j </m:ci>
	      </m:apply>
	    </m:apply>
	    <m:apply>
	      <m:selector/>
	      <m:ci> a </m:ci>
	      <m:ci> j </m:ci>
	      <m:ci> i </m:ci>
	    </m:apply>
	  </m:apply>
	</m:math>
	This can also be viewed as converting the columns of
	<m:math><m:ci>A</m:ci></m:math>
	to rows of 
	<m:math>
	  <m:apply>
	    <m:transpose/>
	    <m:ci> A </m:ci>
	  </m:apply>
	</m:math>
	and <foreign>vice versa</foreign> or as reflecting the matrix
	<m:math><m:ci>A</m:ci></m:math> across its main diagonal.
      </para>

      <para id="para7">
	Note that the transposition of an 
	<m:math>
	  <m:apply>
	    <m:mo>×</m:mo>
	    <m:ci> m </m:ci>
	    <m:ci> n </m:ci>
	  </m:apply>
	</m:math>
	matrix yields an
	<m:math>
	  <m:apply>
	    <m:mo>×</m:mo>
	    <m:ci> n </m:ci>
	    <m:ci> m </m:ci>
	  </m:apply>
	</m:math>
	matrix.
      </para>
      
      <example id="exa4">
	<para id="exa4a">
	  
	  <equation id="eq_trans1">
	    <name>Original Matrix</name>
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:ci> A </m:ci>
		<m:matrix>
		  <m:matrixrow>
		    <m:cn type="complex-cartesian">3<m:sep/>2</m:cn>
		    <m:cn type="complex-cartesian">2<m:sep/>1</m:cn>
		    <m:cn type="complex-cartesian">-3<m:sep/>7</m:cn>
		  </m:matrixrow>
		  <m:matrixrow>
		    <m:cn type="complex-cartesian">-5<m:sep/>4</m:cn>
		    <m:cn type="complex-cartesian">3<m:sep/>-2</m:cn>
		    <m:cn type="complex-cartesian">9<m:sep/>0</m:cn>	  
		  </m:matrixrow>
		</m:matrix>
	      </m:apply>
	    </m:math>
	  </equation>

	  <equation id="eq_trans2"> 
	    <name>Standard Transpose</name>
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:transpose/>
		  <m:ci> A </m:ci>
		</m:apply>
		<m:matrix>
		  <m:matrixrow>
		    <m:cn type="complex-cartesian">3<m:sep/>2</m:cn>
		    <m:cn type="complex-cartesian">-5<m:sep/>4</m:cn>
		  </m:matrixrow>      
		  <m:matrixrow>
		    <m:cn type="complex-cartesian">2<m:sep/>1</m:cn>
		    <m:cn type="complex-cartesian">3<m:sep/>-2</m:cn>
		  </m:matrixrow>      
		  <m:matrixrow>
		    <m:cn type="complex-cartesian">-3<m:sep/>7</m:cn>
		    <m:cn type="complex-cartesian">9<m:sep/>0</m:cn>
		  </m:matrixrow>      
		</m:matrix>
	      </m:apply>
	    </m:math>
	  </equation>
	  
	  <equation id="eq_trans3">
	    <name>Hermetian or Conjugate Transpose</name>
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#adjoint"/>
		  <m:ci>A</m:ci>
		</m:apply>
	        <m:matrix>
		  <m:matrixrow>
		    <m:cn type="complex-cartesian">3<m:sep/>-2</m:cn>
		    <m:cn type="complex-cartesian">-5<m:sep/>-4</m:cn>
		  </m:matrixrow>      
		  <m:matrixrow>
		    <m:cn type="complex-cartesian">2<m:sep/>-1</m:cn>
		    <m:cn type="complex-cartesian">3<m:sep/>2</m:cn>
		  </m:matrixrow>      
		  <m:matrixrow>
		    <m:cn type="complex-cartesian">-3<m:sep/>-7</m:cn>
		    <m:cn type="complex-cartesian">9<m:sep/>-0</m:cn>
		  </m:matrixrow>  
		</m:matrix>
	      </m:apply>
	    </m:math>
	  </equation>

	</para>
      </example>
    </section>

  </content>
</document>
