<?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>Assignment 2: 620-295 Real Analysis with Applications</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>
<h2 class="title">
620-295 Real Analysis with Applications<br /><br />
Assignment 2:
Due 5pm on 21 August</h2>

<p class="author">
Lecturer: Arun Ram <br />
Department of Mathematics and Statistics <br />
University of Melbourne <br />
Parkville VIC 3010 Australia <br />
aram@unimelb.edu.au <br />
<br />
</p>


<p> Due 5pm on 21 August in the appropriate assignment box on the ground floor of Richard Berry. </p>


<ol>
<li>  Let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>f</mi><mo>&colon;</mo><mi>S</mi><mo>&rarr;</mo><mi>T</mi>
</math>
be a function.  Show that 
the inverse function to
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>f</mi>
</math>
exists if and only if  
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>f</mi>
</math>
is bijective. <br /><br />
</li>
<li> Add up the positive integers from 1 to 100.  Then add up 
the squares 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msup><mn>1</mn><mn>2</mn></msup>
</math> 
to 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msup><mn>100</mn><mn>2</mn></msup>
</math>.
<br /><br /></li>

<li>  Let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>S</mi>
</math> 
be a set with an associative operation with identity.  Show that the identity is unique.
(This tells us that any commutative monoid has only one heart.) <br /><br />
</li>

<li>  Let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>S</mi>
</math> 
be a set with an associative operation with identity.  Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>s</mi><mo>&isin;</mo><mi>S</mi>
</math> 
and assume that 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>s</mi>
</math> 
has an inverse in 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>S</mi>
</math>. 
Show that the inverse of
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>s</mi>
</math> 
is unique. (This tells us that any element of an abelian group has only one mate.)  <br /><br />
</li>

<li> Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>S</mi>
</math> 
be a ring.  Show that if
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>s</mi><mo>&isin;</mo><mi>S</mi>
</math> then 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>s</mi><mo>&sdot;</mo><mn>0</mn>
<mo>=</mo><mn>0</mn>
</math>. <br /><br />
</li>

<li> Prove that
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mstyle displaystyle="true">
<munderover><mo>&sum;</mo><mrow><mi>k</mi><mo>=</mo><mn>1</mn></mrow>
<mi>n</mi></munderover>
<msup><mi>k</mi><mn>2</mn></msup>
</mstyle>
<mo>=</mo>
<mfrac><mn>1</mn><mn>6</mn></mfrac> <mi>n</mi>
<mo>(</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo>)</mo>
<mo>(</mo><mn>2</mn><mi>n</mi><mo>+</mo><mn>1</mn><mo>)</mo>
</math>. <br /><br />
</li>

<li> Define the following and give an example for each:
<dl> 
<dt> (a) &nbsp;
order, </dt>
<dt> (b) &nbsp;
maximum,</dt>
<dt> (c) &nbsp;
minimum, </dt>
<dt> (d) &nbsp;
upper bound,</dt> 
<dt> (e) &nbsp;
lower bound, </dt>
<dt> (f) &nbsp;
bounded above, </dt>
<dt> (g) &nbsp;
bounded below, </dt>
<dt> (j) &nbsp;
supremum, </dt>
<dt> (k) &nbsp;
infimum, </dt>
</dl><br />
</li>

<li> Prove that if 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>n</mi><mo>&isin;</mo>
<msub><mi>&Zopf;</mi><mrow><mo>&gt;</mo><mn>0</mn></mrow></msub>
</math>
then 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>x</mi><mo>-</mo><mi>y</mi>
</math>
is a factor of
<math xmlns="http://www.w3.org/1998/Math/MathML">
<msup><mi>x</mi><mi>n</mi></msup>
<mo>-</mo>
<msup><mi>y</mi><mi>n</mi></msup>
</math>. <br /><br />
</li>

<li> For each of the following subsets of 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>&Ropf;</mi>
</math> find the maximum, the minimum, an upper bound, a lower bound, the supremum, and the infimum:

<dl> 
<dt> (a) &nbsp;
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mrow><mo>{</mo>
<msup><mn>2</mn><mrow><mo>-</mo><mi>m</mi></mrow></msup>
<mo>-</mo>
<msup><mn>3</mn><mi>n</mi></msup>
<mo>&vert;</mo>
<mi>m</mi><mo>,</mo><mi>n</mi><mo>&isin;</mo>
<msub><mi>&Zopf;</mi><mrow><mo>&ge;</mo><mn>0</mn></mrow></msub>
<mo>}</mo></mrow>
</math>,
</dt>
<dt> (b) &nbsp;
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>{</mo>
<mi>x</mi><mo>&isin;</mo><mi>&Ropf;</mi>
<mo>&vert;</mo>
<msup><mi>x</mi><mn>3</mn></msup>
<mo>-</mo><mn>4</mn><mi>x</mi>
<mo>&lt;</mo><mn>0</mn>
<mo>}</mo>
</math>,
</dt>
<dt> (c) &nbsp;
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mo>{</mo>
<mn>1</mn><mo>+</mo><msup><mi>x</mi><mn>2</mn></msup>
<mo>&vert;</mo>
<mi>x</mi><mo>&isin;</mo><mi>&Ropf;</mi>
<mo>}</mo>
</math>,
</dt>


</dl><br />
</li>

<li> What is the triangle inequality and how do you justify it?<br /><br /></li>
</ol>







</body>
</html>
