<?xml version="1.0" encoding="utf-8"?>
<!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:m="http://www.w3.org/1998/Math/MathML" xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:bib="http://bibtexml.sf.net/" id="m10293"> 
  
  <name xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Null Space</name> 
  
  <metadata xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
  <md:version xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">2.8</md:version>
  <md:created xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">2001/08/09</md:created>
  <md:revised xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">2002/08/02</md:revised>
  <md:authorlist xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
      <md:author xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="rainking">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Doug</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Daniels</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">rainking@alumni.rice.edu</md:email>
    </md:author>
      <md:author xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="cox">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Steven</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Cox</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">cox@rice.edu</md:email>
    </md:author>
  </md:authorlist>

  <md:maintainerlist xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="rainking">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Doug</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Daniels</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">rainking@alumni.rice.edu</md:email>
    </md:maintainer>
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="markb">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Mark</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Barrett</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">markb@alumni.rice.edu</md:email>
    </md:maintainer>
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="cox">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Steven</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Cox</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">cox@rice.edu</md:email>
    </md:maintainer>
  </md:maintainerlist>
  
  <md:keywordlist xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
    <md:keyword xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">linear algebra</md:keyword>
    <md:keyword xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">null</md:keyword>
    <md:keyword xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">nullspace</md:keyword>
    <md:keyword xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">space</md:keyword>
    <md:keyword xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">unique</md:keyword>
    <md:keyword xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">uniqueness</md:keyword>
  </md:keywordlist>

  <md:abstract xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">This module defines the null space, shows an example of what one is, and describes how to find one given an arbitrary matrix.</md:abstract>
</metadata>

  <content xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
    
    <section 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="nullspc">
      <name xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Null Space</name>
      <definition 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="defn1">
	<term xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Null Space</term>
	<meaning xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">The null space of an m-by-n matrix 
	  <m:math>
	    <m:ci>A</m:ci>
	  </m:math> is the collection of those vectors in
	  <m:math>
	    <m:ci>
	      <m:msup> 
		<m:mi>ℝ</m:mi>
		<m:mi>n</m:mi>
	      </m:msup></m:ci>
	  </m:math>

	  that 

	  <m:math>
	    <m:ci>A</m:ci>
	  </m:math> maps to the zero vector in
	  <m:math>
	    <m:ci>
	      <m:msup>
		<m:mi>ℝ</m:mi>
		<m:mi>m</m:mi>
	      </m:msup></m:ci>
	  </m:math>. More precisely,

	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:ci type="fn">𝒩</m:ci>
		<m:ci type="matrix">A</m:ci>
	      </m:apply>
	      <m:set>
		<m:condition>
		  <m:apply>
		    <m:eq/>
		    <m:apply>
		      <m:times/>
		      <m:ci>A</m:ci>
		      <m:ci>x</m:ci>
		    </m:apply>
		    <m:cn>0</m:cn>
		  </m:apply>
		</m:condition>
		<m:bvar>
		  <m:apply>
		    <m:in/>
		    <m:ci>x</m:ci>
		    <m:ci>
		      <m:msup>
			<m:mi>ℝ</m:mi>
			<m:mi>n</m:mi>
		      </m:msup></m:ci>
		  </m:apply>
		</m:bvar>
	      </m:set>
	    </m:apply>
	  </m:math>
	</meaning>
      </definition>
    </section>
    
    
    <section 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="ex">
      <name xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Null Space Example</name>

      <para 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="p2">
	As an example, we examine the matrix 
	<m:math>
	  <m:ci type="matrix">A</m:ci>
	</m:math>:
	

	<equation 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="eq2">
	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:ci type="matrix">A</m:ci>
	      <m:matrix>
		<m:matrixrow><m:cn>0</m:cn><m:cn>1</m:cn><m:cn>0</m:cn><m:cn>0</m:cn></m:matrixrow>
		<m:matrixrow><m:cn>-1</m:cn><m:cn>0</m:cn><m:cn>1</m:cn><m:cn>0</m:cn></m:matrixrow>
		<m:matrixrow><m:cn>0</m:cn><m:cn>0</m:cn><m:cn>0</m:cn><m:cn>1</m:cn></m:matrixrow>
	      </m:matrix>
	    </m:apply>
	  </m:math>
	</equation>
      </para>

      
      <para 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="p3">
	It is fairly easy to see that the null space of this matrix is:
	
	<equation 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="eq3">
	  <m:math display="block">
	    <m:apply><m:eq/>
	      <m:apply>
		<m:ci type="fn">𝒩</m:ci>
		<m:ci type="matrix">A</m:ci>
	      </m:apply> 
	      <m:set>
		<m:condition>
		  <m:apply>
		    <m:in/>
		    <m:ci>t</m:ci>
		    <m:reals/>
		  </m:apply>
		</m:condition>
		<m:bvar>
		  <m:apply>
		    <m:times/>
		    <m:ci>t</m:ci>
		    <m:matrix>
		      <m:matrixrow><m:cn>1</m:cn></m:matrixrow>
		      <m:matrixrow><m:cn>0</m:cn></m:matrixrow>
		      <m:matrixrow><m:cn>1</m:cn></m:matrixrow>
		      <m:matrixrow><m:cn>0</m:cn></m:matrixrow>
		    </m:matrix>
		  </m:apply>
		</m:bvar>
	      </m:set>
	    </m:apply>
	  </m:math>
	</equation>
      </para>


      <para 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="p4">
	This is a line in
	<m:math>
	  <m:ci>
	    <m:msup>
	      <m:mi>ℝ</m:mi>
	      <m:mn>4</m:mn>
	    </m:msup></m:ci>
	</m:math>.
      </para>

      <para 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="p5">
	The null space answers the question of uniqueness of solutions to
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:apply><m:times/>
	      <m:ci type="matrix">S</m:ci>
	      <m:ci type="vector">x</m:ci>
	    </m:apply>
	    <m:ci type="vector">f</m:ci>
	  </m:apply>
	</m:math>.  
	For, if 
	<m:math>
	  <m:apply><m:eq/>
	    <m:apply><m:times/>
	      <m:ci type="matrix">S</m:ci>
	      <m:ci type="vector">x</m:ci>
	    </m:apply>
	    <m:ci type="vector">f</m:ci>
	  </m:apply>
	</m:math> and 
	<m:math>
	  <m:apply><m:eq/>
	    <m:apply><m:times/>
	      <m:ci type="matrix">S</m:ci>
	      <m:ci type="vector">y</m:ci>
	    </m:apply>
	    <m:ci type="vector">f</m:ci>
	  </m:apply>
	</m:math> then
	<m:math>
	  <m:apply><m:eq/>
	    <m:apply><m:times/>
	      <m:ci type="matrix">S</m:ci>
	      <m:apply><m:minus/>
	        <m:ci type="vector">x</m:ci>
		<m:ci type="vector">y</m:ci>
	      </m:apply>
	    </m:apply>
	    <m:apply><m:minus/>
	      <m:apply><m:times/>
		<m:ci type="matrix">S</m:ci>
		<m:ci type="vector">x</m:ci>
	      </m:apply>
	      <m:apply><m:times/>
		<m:ci type="matrix">S</m:ci>
		<m:ci type="vector">y</m:ci>
	      </m:apply>
	    </m:apply>
	    <m:apply><m:minus/>
	      <m:ci type="vector">f</m:ci>
	      <m:ci type="vector">f</m:ci>
	    </m:apply>
	    <m:cn>0</m:cn>
	  </m:apply>
	</m:math> 
	and so
	<m:math>
	  <m:apply><m:in/>
	    <m:apply><m:minus/>
	      <m:ci type="vector">x</m:ci>
	      <m:ci type="vector">y</m:ci>
	    </m:apply>
	    <m:apply>
	      <m:ci type="fn">𝒩</m:ci>
	      <m:ci type="matrix">S</m:ci>
	    </m:apply>
	  </m:apply>
	</m:math>. Hence, a solution to 
	
	<m:math>
	  <m:apply><m:eq/>
	    <m:apply><m:times/>
	      <m:ci type="matrix">S</m:ci>
	      <m:ci type="vector">x</m:ci>
	    </m:apply>
	    <m:ci type="vector">f</m:ci>
	  </m:apply>
	</m:math> will be unique if, and only if, 
	
	<m:math>
	  <m:apply><m:eq/> 
	    <m:apply>
	      <m:ci type="fn">𝒩</m:ci>
	      <m:ci type="matrix">S</m:ci>
	    </m:apply>
	    <m:set><m:cn>0</m:cn></m:set>
	  </m:apply>
	</m:math>.
      </para>
    </section>

    <section 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="process">
      <name xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Method for Finding the Basis</name>
      
      <para 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="p6">
	Let us now exhibit a basis for the null space of an arbitrary matrix 
	<m:math>
	  <m:ci type="matrix">A</m:ci>
	</m:math>.

      	We note that to solve
	<m:math>
	  <m:apply><m:eq/>
	    <m:apply><m:times/>
	      <m:ci type="matrix">A</m:ci>
	      <m:ci type="vector">x</m:ci>
	    </m:apply>
	    <m:cn>0</m:cn>
          </m:apply>
	</m:math> is to solve
	<m:math>
	  <m:apply><m:eq/>
	    <m:apply><m:times/>
	      <m:ci><m:msub>
		  <m:mi>A</m:mi>
		  <m:mi>red</m:mi>
		</m:msub></m:ci>
	      <m:ci type="vector">x</m:ci>
	    </m:apply>
	    <m:cn>0</m:cn>
	  </m:apply>
	</m:math>.
	
	With respect to the latter, we suppose that

	<equation 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="eqins1">
	  <m:math display="block">
	    <m:set>
	      <m:condition>
		<m:apply>
		  <m:eq/>
		  <m:ci>j</m:ci>
		  <m:set>
		    <m:cn>1</m:cn>
		    <m:ci>…</m:ci>
		    <m:ci>r</m:ci>
		  </m:set>
		</m:apply>
	      </m:condition>
	      <m:bvar><m:ci>
		  <m:msub>
		    <m:mi>c</m:mi>
		    <m:mi>j</m:mi>
		  </m:msub>
		</m:ci></m:bvar>
	    </m:set>
	  </m:math>
	</equation>
	
	are the indices of the pivot columns and that

	<equation 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="eqins2">
	  <m:math display="block">
	    <m:set>
	      <m:condition>
		<m:apply>
		  <m:eq/>
		  <m:ci>j</m:ci>
		  <m:set>
		    <m:apply>
		      <m:plus/>
		      <m:ci>r</m:ci>
		      <m:cn>1</m:cn>
		    </m:apply>
		    <m:ci>…</m:ci>
		    <m:ci>n</m:ci>
		  </m:set>
		</m:apply>
	      </m:condition>
	      <m:bvar><m:ci>
		  <m:msub>
		    <m:mi>c</m:mi>
		    <m:mi>j</m:mi>
		  </m:msub>
		</m:ci>
	      </m:bvar>
	    </m:set>
	  </m:math>
	</equation>
	
	are the indices of the nonpivot columns. We accordingly define the 

	<m:math><m:ci>r</m:ci></m:math>
	
	pivot variables

	<!-- We need to first place the given matrix into 
      <cnxn document="reduced" strength="8">row reduced form</cnxn>, i.e. 
      <m:math display="inline">
      <m:ci type="matrix"><m:msub>
      <m:mi>A</m:mi>
      <m:mi>red</m:mi>
      </m:msub></m:ci>
      </m:math>. We exploit the fact that
      <m:math>
      <m:apply><m:eq/>
      <m:ci type="matrix">A</m:ci>
      <m:ci type="matrix"><m:msub>
      <m:mi>A</m:mi>
      <m:mi>red</m:mi>
      </m:msub></m:ci>
      </m:apply>
      </m:math>. We partition 
      <m:math>
      <m:ci type="matrix"><m:msub>
      <m:mi>A</m:mi>
      <m:mi>red</m:mi>
      </m:msub></m:ci>
      </m:math>'s elements of x into so called pivot variables
	-->
	
	<equation 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="eq4">
	  <m:math display="block">
	    <m:set>
	      <m:condition>
		<m:apply><m:eq/>
		  <m:ci>j</m:ci>
		  <m:set>
		    <m:cn>1</m:cn>
		    <m:ci>…</m:ci>
		    <m:ci>r</m:ci>
		  </m:set>
		</m:apply>
	      </m:condition>
	      <m:bvar>
		<m:ci>
		  <m:msub>
		    <m:mi>x</m:mi>
		    <m:mrow>
		      <m:msub>
			<m:mi>c</m:mi>
			<m:mi>j</m:mi>
		      </m:msub>
		    </m:mrow>
		  </m:msub>
		</m:ci>
	      </m:bvar>
	    </m:set>
	  </m:math>
	</equation>
	
	and the 
	
	<m:math>
	  <m:apply>
	    <m:minus/>
	    <m:ci>n</m:ci>
	    <m:ci>r</m:ci>
	  </m:apply>
        </m:math> free variables


	<equation 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="eq6">
	  <m:math display="block">
	    <m:set>
	      <m:condition>
		<m:apply>
		  <m:eq/>
		  <m:ci>j</m:ci>
		  <m:set>
		    <m:apply>
		      <m:plus/>
		      <m:ci>r</m:ci>
		      <m:cn>1</m:cn>
		    </m:apply>
		    <m:ci>…</m:ci>
		    <m:ci>n</m:ci>
		  </m:set>
		</m:apply>
	      </m:condition>
	      <m:bvar>
		<m:ci>
		  <m:msub>
		    <m:mi>x</m:mi>
		    <m:mrow>
		      <m:msub>
			<m:mi>c</m:mi>
			<m:mi>j</m:mi>
		      </m:msub>
		    </m:mrow>
		  </m:msub>
		</m:ci>
	      </m:bvar>
	    </m:set>
	  </m:math>
	</equation>
      </para>
      
      
      <para 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="p7">
	One solves
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:apply>
	      <m:times/>
	      <m:ci type="matrix">
		<m:msub>
		  <m:mi>A</m:mi>
		  <m:mi>red</m:mi>
		</m:msub></m:ci>
	      <m:ci type="vector">x</m:ci>
	    </m:apply>
	    <m:cn>0</m:cn>
	  </m:apply>
	</m:math> by expressing each of the pivot variables in terms of the
	nonpivot, or free, variables. In the example above,
	<m:math>
	  <m:ci>
	    <m:msub>
	      <m:mi>x</m:mi>
	      <m:mn>1</m:mn>
	    </m:msub>
	  </m:ci>
	</m:math>,
	<m:math>
	  <m:ci>
	    <m:msub>
	      <m:mi>x</m:mi>
	      <m:mn>2</m:mn>
	    </m:msub>
	  </m:ci>
	</m:math>, and 
	<m:math>
	  <m:ci>
	    <m:msub>
	      <m:mi>x</m:mi>
	      <m:mn>4</m:mn>
	    </m:msub>
	  </m:ci>
	</m:math> are pivot while 
	<m:math>
	  <m:ci>
	    <m:msub>
	      <m:mi>x</m:mi>
	      <m:mn>3</m:mn>
	    </m:msub>
	  </m:ci>
	</m:math> is free. Solving for the pivot in terms of the free, we find
	
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:ci>
	      <m:msub>
		<m:mi>x</m:mi>
		<m:mn>4</m:mn>
	      </m:msub>
	    </m:ci>
	    <m:cn>0</m:cn>
	  </m:apply>
	</m:math>,
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:ci>
	      <m:msub>
		<m:mi>x</m:mi>
		<m:mn>3</m:mn>
	      </m:msub>
	    </m:ci>
	    <m:ci>
	      <m:msub>
		<m:mi>x</m:mi>
		<m:mn>1</m:mn>
	      </m:msub>
	    </m:ci>
	  </m:apply>
	</m:math>, 
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:ci>
	      <m:msub>
		<m:mi>x</m:mi>
		<m:mn>2</m:mn>
	      </m:msub>
	    </m:ci>
	    <m:cn>0</m:cn>
	  </m:apply>
	</m:math>,
	or, written as a vector,
	

	<equation 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="eq7">
	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:ci type="vector">x</m:ci>
	      <m:apply>
		<m:times/>
		<m:ci>
		  <m:msub>
		    <m:mi>x</m:mi>
		    <m:mn>3</m:mn>
		  </m:msub>
		</m:ci>
		<m:vector>
		  <m:cn>1</m:cn><m:cn>0</m:cn><m:cn>1</m:cn><m:cn>0</m:cn>
		</m:vector>
	      </m:apply>
	    </m:apply>
	  </m:math>
	</equation>
	where
	<m:math>
	  <m:ci>
	    <m:msub>
	      <m:mi>x</m:mi>
	      <m:mn>3</m:mn>
	    </m:msub>
	  </m:ci>
	</m:math> is free. As 
	<m:math>
	  <m:ci>
	    <m:msub>
	      <m:mi>x</m:mi>
	      <m:mn>3</m:mn>
	    </m:msub>
	  </m:ci>
	</m:math> ranges over all real numbers the x above traces out a line in
	<m:math>
	  <m:ci>
	    <m:msup>
	      <m:mi>ℝ</m:mi>
	      <m:mn>4</m:mn>
	    </m:msup>
	  </m:ci>
	</m:math>. This line is precisely the null space of
	
	<m:math><m:ci type="matrix">A</m:ci></m:math>.  
	Abstracting these calculations we arrive at:
      </para>


      <para 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="p8">
	<definition 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="insdefn1"><term xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">A Basis for the Null Space</term>
	  <meaning xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Suppose that
	    <m:math>
	      <m:ci type="matrix">A</m:ci>
	    </m:math> is m-by-n with pivot indices
	    
	    <m:math>
	      <m:set>
		<m:condition>
		  <m:apply>
		    <m:eq/>
		    <m:ci>j</m:ci>
		    <m:set>
		      <m:cn>1</m:cn>
		      <m:ci>…</m:ci>
		      <m:ci>r</m:ci>
		    </m:set>
		  </m:apply>
		</m:condition>
		<m:bvar>
		  <m:ci>
		    <m:msub>
		      <m:mi>c</m:mi>
		      <m:mi>j</m:mi>
		    </m:msub>
		  </m:ci>
		</m:bvar>
	      </m:set>
	    </m:math>
	    
	    and free indices
	    
	    <m:math>
	      <m:set>
		<m:condition>
		  <m:apply>
		    <m:eq/>
		    <m:ci>j</m:ci>
		    <m:set>
		      <m:apply>
			<m:plus/>
			<m:ci>r</m:ci>
			<m:cn>1</m:cn>
		      </m:apply>
		      <m:ci>…</m:ci>
		      <m:ci>n</m:ci>
		    </m:set>
		  </m:apply>
		</m:condition>
		<m:bvar>
		  <m:ci>
		    <m:msub>
		      <m:mi>c</m:mi>
		      <m:mi>j</m:mi>
		    </m:msub>
		  </m:ci></m:bvar>
	      </m:set>
	    </m:math>.
	    A basis for
	    <m:math>
	      <m:apply>
		<m:ci type="fn">𝒩</m:ci>
		<m:ci type="matrix">A</m:ci>
	      </m:apply>
	    </m:math> may be constructed of 
	    
	    <m:math>
	      <m:apply><m:minus/>
		<m:ci>n</m:ci>
		<m:ci>r</m:ci>
	      </m:apply>
	    </m:math> vectors
	    
	    <m:math>
	      <m:set>
		<m:ci><m:msup>
		    <m:mi>z</m:mi>
		    <m:mn>1</m:mn>
		  </m:msup></m:ci>
		<m:ci><m:msup>
		    <m:mi>z</m:mi>
		    <m:mn>2</m:mn>
		  </m:msup></m:ci>
		<m:ci>…</m:ci>
		<m:ci><m:msup>
		    <m:mi>z</m:mi>
		    <m:mrow>
		      <m:mi>n</m:mi>
		      <m:mo>-</m:mo>
		      <m:mi>r</m:mi>
		    </m:mrow>
		  </m:msup></m:ci>
	      </m:set>
	    </m:math> 
	    
	    where
	    <m:math>   
	      <m:ci><m:msup>
		  <m:mi>z</m:mi>
		  <m:mi>k</m:mi>
		</m:msup></m:ci>
	    </m:math>, 
	    and only
	    
	    <m:math>
	      <m:ci><m:msup>
		  <m:mi>z</m:mi>
		  <m:mi>k</m:mi>
		</m:msup></m:ci>
	    </m:math>,
	    possesses a nonzero in its
	    <m:math>
	      <m:ci><m:msub>
		  <m:mi>c</m:mi>
		  <m:mrow>
		    <m:mi>r</m:mi>
		    <m:mo>+</m:mo>
		    <m:mi>k</m:mi>
		  </m:mrow>
		</m:msub></m:ci>
	    </m:math>
	    component.
	  </meaning>
	</definition>
      </para>
    </section>


    <section 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="fin">
      <name xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">A MATLAB Observation</name>
      <para 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="p9">
	As usual, MATLAB has a way to make our lives simpler. If you
	have defined a matrix A and want to find a basis for its null
	space, simply call the function <code xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">null(A)</code>. One
	small note about this function: if one adds an extra flag,
	<code xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">'r'</code>, as in <code xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">null(A, 'r')</code>, then the
	basis is displayed "rationally" as opposed to purely
	mathematically.  The MATLAB help pages define the difference
	between the two modes as the rational mode being useful
	pedagogically and the mathematical mode of more value
	<emphasis xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">(gasp!)</emphasis> mathematically.
      </para>
    </section>


    <section 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="nullfin">
      <name xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Final thoughts on null spaces</name>
      <para 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="nullfinp1">
	There is a great deal more to finding null spaces; enough, in
	fact, to warrant <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" strength="5" document="findingnull">another module</cnxn>. One important
	aspect and use of null spaces is their ability to inform us
	about the uniqueness of solutions. If we use the <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" strength="5" document="columnspace">column space</cnxn> to
	determine the <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" strength="5" document="columnspace" target="colspcfin">existence</cnxn> of a solution
	<m:math><m:ci type="vector">x</m:ci></m:math> to the equation
	<m:math>
	  <m:apply><m:eq/>
	    <m:apply><m:times/>
	      <m:ci type="matrix">A</m:ci>
	      <m:ci type="vector">x</m:ci>
	    </m:apply>
	    <m:ci>b</m:ci>
	  </m:apply>
	</m:math>.  Once we know that a solution exists it is a
	perfectly reasonable question to want to know whether or not
	this solution is the <emphasis xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">only</emphasis> solution to
	this problem. The hard and fast rule is that a solution
	<m:math><m:ci type="vector">x</m:ci></m:math> is unique if and
	only if the null space of <m:math><m:ci type="matrix">A</m:ci></m:math> is empty. One way to think
	about this is to consider that if
	
	<m:math>
	  <m:apply><m:eq/>
	    <m:apply><m:times/>
	      <m:ci type="matrix">A</m:ci>
	      <m:ci type="vector">x</m:ci>
	    </m:apply>
	    <m:cn>0</m:cn>
	  </m:apply>
	</m:math>
	does not have a unique solution then, by linearity, neither
	does 
	<m:math>
	  <m:apply><m:eq/>
	    <m:apply><m:times/>
	      <m:ci type="matrix">A</m:ci>
	      <m:ci type="vector">x</m:ci>
	    </m:apply>
	    <m:ci>b</m:ci>
	  </m:apply>
	</m:math>.

	Conversely, if

	<m:math>
	  <m:apply><m:and/>
	    <m:apply><m:eq/>
	      <m:apply><m:times/>
		<m:ci type="matrix">A</m:ci>
		<m:ci>z</m:ci>
	      </m:apply>
	      <m:cn>0</m:cn>
	    </m:apply>
	    <m:apply><m:neq/>
	      <m:ci>z</m:ci>
	      <m:cn>0</m:cn>
	    </m:apply>
	    <m:apply><m:eq/>
	      <m:apply><m:times/>
		<m:ci type="matrix">A</m:ci>
		<m:ci type="vector">y</m:ci>
	      </m:apply>
	      <m:cn>b</m:cn>
	    </m:apply>
	  </m:apply>
	</m:math>
	then
	<m:math>
	  <m:apply><m:eq/>
	    <m:apply><m:times/>
	      <m:ci type="matrix">A</m:ci>
	      <m:apply><m:plus/>
		<m:ci>z</m:ci>
		<m:ci type="vector">y</m:ci>
	      </m:apply>
	    </m:apply>
	    <m:ci>b</m:ci>
	  </m:apply>
	</m:math>
	as well.
      </para>
    </section>
  </content>
</document>
