<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0//EN"
   "http://www.w3.org/Math/DTD/mathml2/xhtml-math11-f.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<title>Math 541 Fall 2007 Homework 14</title>
<style type="text/css">
body {
    counter-reset: section 0;
    text-align: justify
}

h2.title {
    text-align:center
}
p.author {
    text-align:center
}
li {
    text-indent: 0em;
}
p.indent {
    text-indent: 2em;
}

h2.section {
    counter-reset: eqn 0 result 0 subsection 0;
}
h2.section:before {
    content: counter(section) ". ";
    counter-increment: section 1;  /* Add 1 to section */
}
h3.subsection:before {
    content: counter(section) "." counter(subsection);
    counter-increment: subsection;  /* Add 1 to subsection */
}

div.theorem:before {
    content: "Theorem " counter(section) "." counter(result) " ";
    counter-increment: result 1;
    font-style: normal;
    font-weight: bold;
}
div.theorem{ font-style:italic }
div.proposition:before {
    content: "Proposition " counter(section) "." counter(result) " ";
        counter-increment: result 1;
    font-style: normal;  
    font-weight: bold;
}
div.proposition{ font-style:italic }
div.lemma:before { 
    content: "Lemma " counter(section) "." counter(result) " ";
    counter-increment: result;
    font-style: normal; 
    font-weight: bold; 
}
div.lemma{ font-style:italic }

table.dispeq {
   width:100%;
   }
td.eq {
   text-align:center;
     }
td.eqno {
    width: 10px;
    text-align:right;
    }
td.eqno:after {
     content: "("counter(section)"."counter(eqn)")";
     counter-increment: eqn;
     font-style: normal;
  }
</style>
</head>

<body>
<table border="0" cellpadding="5" cellspacing="0" width="100%">
  <tbody>
    <tr>
      <td valign="top"><div align="center">
              <img src="http://www.math.wisc.edu/~ram/UW_logo_150.gif" alt="University of Wisconsin-Madison" border="0" height="150" vspace="2" width="150" /><br />
      </div>
          <h5 align="center"><a href="http://www.wisc.edu/">University of Wisconsin-Madison </a><br />
              <a href="http://www.math.wisc.edu/">Mathematics
                Department</a></h5></td>
      <td align="center" valign="middle"><h2> Math 541 <br />
        Modern Algebra <br />
        A first course in Abstract Algebra<br />
        Lecturer: <a href="http://www.math.wisc.edu/%7Eram">Arun Ram </a> </h2></td>
      <td><h3>
        <large>
          <div align="center">Fall 2007</div>
        </large>
      </h3>
          <h3></h3></td>
    </tr>
  </tbody>
</table>
<hr />
<h2 align="center">&nbsp;</h2>
<h2 align="center">Homework 14: Due December 13, 2007 </h2>

<h3>To grade: 13, 14, 15, 16.</h3>



<ol>
<li><p> Define the following terms.
<ul><li> vector space</li>
<li> subspace </li>
<li> <math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>span</mi><mo>(</mo><mi>S</mi><mo>)</mo></math></li>
<li> linear combination</li>
<li> linearly independent </li>
<li> basis</li>
<li> linear transformation</li>
<li> kernel (of a linear transformation)</li>
<li> image (of a linear transformation)</li>
<li> eigenvector with eigenvalue 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>&lambda;</mi></math></li>
</ul></p></li>
<li><p>  Define
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msub><mi>M</mi><mi>n</mi></msub><mo>(</mo><mi>&Fopf;</mi><mo>)</mo></math>
and appropriate operations
and prove that it is a ring.</p></li>
<li><p>  Define
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msub><mi>M</mi><mrow><mi>n</mi><mo>&times;</mo><mi>m</mi></mrow></msub>
<mo>(</mo><mi>&Fopf;</mi><mo>)</mo></math> and appropriate operations/actions
and prove that it is a vector space.</p></li>
<li><p>  Define
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msup><mi>&Fopf;</mi><mi>n</mi></msup></math>
and prove that it is a vector space.</p></li>
<li><p> Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>V</mi></math> be a vector space with basis
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>{</mo><msub><mi>s</mi><mn>1</mn></msub><mo>,</mo>
<mo>&ctdot;</mo>
<msub><mi>s</mi><mi>n</mi></msub><mo>}</mo></math>.
Prove that <math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>V</mi><mo>&sime;</mo><msup><mi>&Fopf;</mi><mi>n</mi></msup></math>.
</p></li>
<li><p> Let <math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>V</mi></math>
and <math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>W</mi></math> be vector spaces and let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>Hom</mi><mo>(</mo><mi>V</mi><mo>,</mo><mi>W</mi><mo>)</mo></math>
be the set of linear transformations from 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>V</mi></math> to
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>W</mi></math>.  Define appropriate operations/actions and prove that
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>Hom</mi><mo>(</mo><mi>V</mi><mo>,</mo><mi>W</mi><mo>)</mo></math>
is a vector space.
</p></li>
<li><p> Let <math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>V</mi></math> be a vector space.
Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>End</mi><mo>(</mo><mi>V</mi><mo>)</mo></math>
be the set of linear transformations from 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>V</mi></math> to
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>V</mi></math>.  Define appropriate operations and prove that
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>End</mi><mo>(</mo><mi>V</mi><mo>)</mo></math>
is a ring.
</p></li>
<li><p> Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>V</mi></math> be a vector space with basis
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>{</mo><msub><mi>s</mi><mn>1</mn></msub><mo>,</mo>
<mo>&ctdot;</mo>
<msub><mi>s</mi><mi>n</mi></msub><mo>}</mo></math>.
Prove that <math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>End</mi><mo>(</mo><mi>V</mi><mo>)</mo>
<mo>&sime;</mo><msub><mi>M</mi><mi>n</mi></msub><mo>(</mo><mi>&Fopf;</mi><mo>)</mo></math> (as rings).
</p></li>
<li><p> Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>W</mi></math> be a vector space with basis
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>{</mo><msub><mi>t</mi><mn>1</mn></msub><mo>,</mo>
<mo>&ctdot;</mo>
<msub><mi>t</mi><mi>m</mi></msub><mo>}</mo></math>
and let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>V</mi></math> be a vector space with basis
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>{</mo><msub><mi>s</mi><mn>1</mn></msub><mo>,</mo>
<mo>&ctdot;</mo>
<msub><mi>s</mi><mi>n</mi></msub><mo>}</mo></math>.
Prove that
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>Hom</mi><mo>(</mo><mi>V</mi><mo>,</mo><mi>W</mi><mo>)</mo>
<mo>&sime;</mo><msub><mi>M</mi>
<mrow><mi>n</mi><mo>&times;</mo><mi>m</mi></mrow></msub><mo>(</mo><mi>&Fopf;</mi><mo>)</mo></math> 
(as vector spaces).
</p></li>
<li><p> Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>f</mi><mo>&colon;</mo><mi>V</mi><mo>&rarr;</mo><mi>W</mi></math> be a 
linear transformation.  Show that 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>f</mi></math> is injective if and only if
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>ker</mi><mi>&thinsp;</mi><mi>f</mi><mo>=</mo><mn>0</mn></math>.
</p></li>
<li><p> Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>V</mi></math> be a finite dimensional vector space and let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>f</mi><mo>&colon;</mo><mi>V</mi><mo>&rarr;</mo><mi>V</mi></math> be a 
linear transformation.  Show that 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>f</mi></math> is invertible if and only if
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>ker</mi><mi>&thinsp;</mi><mi>f</mi><mo>=</mo><mn>0</mn></math>.
</p></li>
<li><p> Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>V</mi></math> be a finite dimensional vector space and let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>f</mi><mo>&colon;</mo><mi>V</mi><mo>&rarr;</mo><mi>V</mi></math> be a 
linear transformation.  Let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>&lambda;</mi><mo>&isin;</mo><mi>&Fopf;</mi></math>.
Define the 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>&lambda;</mi></math>-eigenspace
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msub><mi>V</mi><mi>&lambda;</mi></msub></math>
of
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>f</mi></math>.  Find a linear transformation
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>h</mi><mo>&colon;</mo><mi>V</mi><mo>&rarr;</mo><mi>V</mi></math> 
such that 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>ker</mi><mi>&thinsp;</mi><mi>h</mi><mo>=</mo>
<msub><mi>V</mi><mi>&lambda;</mi></msub></math>.
</p></li>
<li><p> Define the determinant.
<dl>
<dt> (a) Prove that the determinant is a monoid homomorphism.
</dt>
<dt> (b) Prove that the determinant is a group homomorphism.</dt>
<dt> (c) Prove that the determinant is a ring homomorphism.</dt>
</dl>
</p></li>
<li><p> Write a formula for <math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>det</mi><mo>(</mo><mi>A</mi><mo>)</mo></math> which corresponds
to Laplace expansion down the first column.  Prove this formula.
Interpret this formula in terms of cosets.
</p></li>
<li><p> Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>A</mi></math> be an <em>n</em>&times;<em>n</em> matrix.
Prove that <math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>A</mi></math> is invertible if and only if 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>det</mi><mo>(</mo><mi>A</mi><mo>)</mo></math> is invertible.
</p></li>
<li><p> Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>W</mi></math> be a vector space with basis
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>{</mo><msub><mi>t</mi><mn>1</mn></msub><mo>,</mo>
<mo>&ctdot;</mo>
<msub><mi>t</mi><mi>m</mi></msub><mo>}</mo></math>
and let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>V</mi></math> be a vector space with basis
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>{</mo><msub><mi>s</mi><mn>1</mn></msub><mo>,</mo>
<mo>&ctdot;</mo>
<msub><mi>s</mi><mi>n</mi></msub><mo>}</mo></math>.
Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msub><mi>&phiv;</mi><mi>S</mi></msub><mo>&colon;</mo>
<mi>V</mi><mo>&rarr;</mo><msup><mi>&Fopf;</mi><mi>n</mi></msup></math>,
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msub><mi>&phiv;</mi><mi>T</mi></msub><mo>&colon;</mo>
<mi>W</mi><mo>&rarr;</mo><msup><mi>&Fopf;</mi><mi>m</mi></msup></math>
and
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>&Phi;</mi><mo>&colon;</mo>
<mi>Hom</mi><mo>(</mo><mi>V</mi><mo>,</mo><mi>W</mi><mo>)</mo>
<mo>&rarr;</mo>
<msub><mi>M</mi>
<mrow><mi>n</mi><mo>&times;</mo><mi>m</mi></mrow></msub><mo>(</mo><mi>&Fopf;</mi><mo>)</mo></math> 
be the corresponding isomorphisms (see problem 5 and problem 13).
Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>f</mi><mo>&colon;</mo><mi>V</mi><mo>&rarr;</mo><mi>V</mi></math> be a 
linear transformation.
Prove that
<dl>
<dd> (a) <math xmlns="http://www.w3.org/1998/Math/MathML">
<msub><mi>&phiv;</mi><mi>S</mi></msub>
<mo>(</mo><mi>ker</mi><mi>&thinsp;</mi><mi>f</mi><mo>)</mo></math>
is equal to the null space of 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>&Phi;</mi><mo>(</mo><mi>f</mi><mo>)</mo></math>.
</dd>
<dd> (b) <math xmlns="http://www.w3.org/1998/Math/MathML">
<msub><mi>&phiv;</mi><mi>T</mi></msub>
<mo>(</mo><mi>im</mi><mi>&thinsp;</mi><mi>f</mi><mo>)</mo></math>
is equal to the column space of 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>&Phi;</mi><mo>(</mo><mi>f</mi><mo>)</mo></math>.
</dd>
</dl>
If you give proof machine definitions of <em>null space</em> and <em>column space</em> before beginning these proofs
this problem is not difficult but if you don't it is impossible (and probably doesn't make any sense).
</p></li>

</ol>

    

<p></p>
</body>
</html>
