<?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 Midterm I</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>
<h2 align="center">Midterm I: October 4, 2007 </h2>


<p><strong> Part A:</strong> Definitions</p>

<p>Define the following terms.</p>

<ol>
<li> 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>k</mi></math> mod
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>n</mi></math>
</li>
<li> 
kernel
</li>
<li> 
product (of groups)
</li>
<li> 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>&Copf;</mi><mo>[</mo><mo>[</mo><mi>x</mi><mo>]</mo><mo>]</mo>
</math>
</li>
<li> 
ring
</li>
<li> 
inverse (of an element in a ring)
</li>
<li> 
invertible (element of a ring)
</li>
</ol>

<p><strong>Part B:</strong> Examples and Proofs
</p>

<ol>
<li> <p>Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>&phiv;</mi><mo>&colon;</mo>
<mi>G</mi><mo>&xrarr;</mo><mi>H</mi>
</math> be a group homomorphism.  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>1</mn></math>.
</p></li>
<li> <p>Let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>R</mi></math> be a ring and let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>r</mi><mo>&isin;</mo><mi>R</mi></math>.
Show that 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>–</mo><mn>1</mn><mo>&sdot;</mo><mi>r</mi><mo>=</mo>
<mo>–</mo><mi>r</mi></math>.
</p>
</li>
<li> <p>Let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msub><mi>C</mi><mi>n</mi></msub></math>
denote the cyclic group with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>n</mi></math> elements.
Show that 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msub><mi>C</mi><mn>5</mn></msub><mo>&times;</mo>
<msub><mi>C</mi><mn>2</mn></msub><mo>&sime;</mo>
<msub><mi>C</mi><mn>10</mn></msub></math>.
</p>
</li>
<li> 
<dl>
<dt><p> (a) What are the invertible elements of
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>&Zopf;</mi>
</math>?
</p></dt>
<dt><p> (b) Find the inverse of 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mn>1</mn><mo>–</mo><mi>x</mi></math>
in the ring 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>&Copf;</mi><mo>[</mo><mo>[</mo><mi>x</mi><mo>]</mo><mo>]</mo>
</math>.
</p></dt>
</dl>
</li>
<li> <p>An <em>integral domain</em> is a ring 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>R</mi></math> such that 
<dl>
<dt><p> (a) If
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>a</mi><mo>,</mo><mi>b</mi><mo>&isin;</mo><mi>R</mi>
</math> then
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>a</mi><mi>b</mi><mo>=</mo><mi>b</mi><mi>a</mi>
</math>,
</p></dt>
<dt><p> (b) If
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>a</mi><mo>,</mo><mi>b</mi><mo>&isin;</mo><mi>R</mi>
</math>  and
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>a</mi><mi>b</mi><mo>=</mo><mi>0</mi>
</math>
then
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>a</mi><mo>=</mo><mi>0</mi></math>
or
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>b</mi><mo>=</mo><mi>0</mi></math>.
</p></dt>
</dl>
Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>R</mi></math> be an integral domain.  The 
<em>field of fractions</em> of 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>R</mi></math> is the field
<table class="dispeq">
<tr><td class="eq">
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>&Fopf;</mi>
  <mo>=</mo>
<mrow>
  <mo>{</mo>
  <mfrac>
    <mi>a</mi>
    <mi>b</mi>
  </mfrac>
  <mo>&mid;</mo>
  <mi>a</mi>
  <mo>,</mo>
  <mi>b</mi>
  <mo>&isin;</mo>
  <mi>R</mi>
  <mo>,</mo>
  <mi>b</mi>
  <mo>&ne;</mo>
  <mn>0</mn>
  <mo>}</mo>
</mrow>
 <mspace width="2em"/>
 <mtext>with</mtext>
 <mspace width="2em"/>
  <mfrac>
    <mi>a</mi>
    <mi>b</mi>
  </mfrac>
  <mo>=</mo>
  <mfrac>
    <mi>c</mi>
    <mi>d</mi>
  </mfrac>
  <mo>,</mo>
  <mspace width="2em"/>
  <mtext>if</mtext>
  <mspace width="1em"/>
  <mi>a</mi><mi>d</mi>
  <mo>=</mo>
  <mi>b</mi><mi>c</mi>
  <mo>,</mo>
</math></td>
</tr></table>
and operations given by 
<table class="dispeq">
<tr><td class="eq">
<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mfrac>
    <mi>a</mi>
    <mi>b</mi>
  </mfrac>
  <mo>+</mo>
  <mfrac>
    <mi>c</mi>
    <mi>d</mi>
  </mfrac>
  <mo>=</mo>
  <mfrac>
    <mrow>
      <mi>a</mi> <mi>d</mi>
      <mo>+</mo>
      <mi>b</mi> <mi>c</mi>
    </mrow>
    <mrow><mi>b</mi><mi>d</mi></mrow>
  </mfrac>
  <mspace width="2em"/>
  <mtext>and</mtext>
  <mspace width="2em"/>
  <mfrac>
    <mi>a</mi>
    <mi>b</mi>
  </mfrac>
  <mo>&sdot;</mo>
  <mfrac>
    <mi>c</mi>
    <mi>d</mi>
  </mfrac>
  <mo>=</mo>
  <mfrac>
    <mrow><mi>a</mi><mi>c</mi></mrow>
    <mrow><mi>b</mi><mi>d</mi></mrow>
  </mfrac>
  <mo>.</mo>
</math></td>
</tr></table>
Show that the operation 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>+</mo><mo>&colon;</mo>
<mi>&Fopf;</mi><mo>&times;</mo><mi>&Fopf;</mi>
<mo>&xrarr;</mo><mi>&Fopf;</mi></math> is well defined.
</p>
</li>
</ol>

    

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