<?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 6: 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 6:
Due 5pm on 30 October</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 30 October in the appropriate assignment box on the ground floor of Richard Berry. </p>



<ol>
<li> Determine the area of a parabola topped slice with 
left edge at 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>x</mi><mo>=</mo><mi>l</mi>
</mrow></math>,
right edge at 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>x</mi><mo>=</mo><mi>l</mi><mo>+</mo><mn>2</mn><mi>&Delta;</mi><mi>x</mi>
</mrow></math>,
middle at 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>x</mi><mo>=</mo><mi>l</mi><mo>+</mo><mi>&Delta;</mi><mi>x</mi>
</mrow></math>,
left height
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>f</mi><mo>(</mo><mi>l</mi><mo>)</mo>
</mrow></math>,
middle height
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>f</mi><mo>(</mo><mi>l</mi><mo>+</mo><mi>&Delta;</mi><mi>x</mi><mo>)</mo>
</mrow></math>,
and right height
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>f</mi><mo>(</mo><mi>l</mi><mo>+</mo><mn>2</mn><mi>&Delta;</mi><mi>x</mi><mo>)</mo>
</mrow></math>.<br /><br />
</li>
<li> Assume that
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<munder><mi>lim</mi><mrow><mi>x</mi><mo>&rarr;</mo><mi>a</mi></mrow></munder>
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
</math> and
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<munder><mi>lim</mi><mrow><mi>x</mi><mo>&rarr;</mo><mi>a</mi></mrow></munder>
	<mi>g</mi><mo>(</mo><mi>x</mi><mo>)</mo>
</math> exist.  Show that 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<munder><mi>lim</mi><mrow><mi>x</mi><mo>&rarr;</mo><mi>a</mi></mrow></munder>
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mo>+</mo>
	<mi>g</mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mo>=</mo>
<munder><mi>lim</mi><mrow><mi>x</mi><mo>&rarr;</mo><mi>a</mi></mrow></munder>
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
<mo>+</mo><munder><mi>lim</mi><mrow><mi>x</mi><mo>&rarr;</mo><mi>a</mi></mrow></munder>
	<mi>g</mi><mo>(</mo><mi>x</mi><mo>)</mo>
</math>.<br /><br />
</li>
<li> Assume that
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<munder><mi>lim</mi><mrow><mi>x</mi><mo>&rarr;</mo><mi>a</mi></mrow></munder>
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
</math> exists.  Show that
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<munder><mi>lim</mi><mrow><mi>x</mi><mo>&rarr;</mo><mi>a</mi></mrow></munder>
	<mi>exp</mi><mo>(</mo>
	<mrow><mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo></mrow><mo>)</mo>
	<mo>=</mo>
	<mi>exp</mi>
	<mrow><mo>(</mo>
	<munder><mi>lim</mi><mrow><mi>x</mi><mo>&rarr;</mo><mi>a</mi></mrow></munder>
	<mrow><mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo></mrow>
 	<mo>)</mo></mrow>
</math>.  <br /><br />
</li>
<li> Assume that
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mo>=</mo>
	<msub><mi>c</mi><mn>0</mn></msub>
	<mo>+</mo>
	<msub><mi>a</mi><mn>1</mn></msub><mi>cos</mi><mi>x</mi>
	<mo>+</mo>
	<msub><mi>b</mi><mn>1</mn></msub><mi>sin</mi><mi>x</mi>
		<mo>+</mo>
	<msub><mi>a</mi><mn>2</mn></msub><mi>cos</mi><mn>2</mn><mi>x</mi>
	<mo>+</mo>
	<msub><mi>b</mi><mn>2</mn></msub><mi>sin</mi><mn>2</mn><mi>x</mi>
	<mo>+</mo><mi>&ctdot;</mi>
</math>.  Show that
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msub><mi>a</mi><mn>0</mn></msub>
	<mo>=</mo>
	<mfrac><mn>1</mn><mrow><mn>2</mn><mi>&pi;</mi></mrow></mfrac>
	<msubsup><mi>&int;</mi><mn>0</mn><mrow><mn>2</mn><mi>&pi;</mi></mrow></msubsup>
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>,
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msub><mi>a</mi><mi>k</mi></msub>
	<mo>=</mo>
	<mfrac><mn>1</mn><mrow><mi>&pi;</mi></mrow></mfrac>
	<msubsup><mi>&int;</mi><mn>0</mn><mrow><mn>2</mn><mi>&pi;</mi></mrow></msubsup>
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo> <mi>cos</mi><mi><mi>k</mi><mi>x</mi></mi>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msub><mi>b</mi><mn>k</mn></msub>
	<mo>=</mo>
	<mfrac><mn>1</mn><mrow><mi>&pi;</mi></mrow></mfrac>
	<msubsup><mi>&int;</mi><mn>0</mn><mrow><mn>2</mn><mi>&pi;</mi></mrow></msubsup>
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo> <mi>sin</mi><mi><mi>k</mi><mi>x</mi></mi>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.
<br /><br />
</li>
<li> Write a quadratic approximation for
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mo>=</mo>
	<msup><mi>x</mi><mn>1/3</mn></msup>
</math>
near 8 and approximate
9<sup>1/3</sup>.  Estimate the error and find the smallest interval that you can be sure contains the 
value.
<br /><br /></li>
	
<li>Define the following and give an example of each:
<dl>
<dt> (a) &nbsp;
converges pointwise
</dt>
<dt> (b) &nbsp;
converges uniformly
</dt>
<dt> (b) &nbsp;
Taylor series
</dt>
<dt> (b) &nbsp;
Maclaurin series
</dt>
<dt> (b) &nbsp;
Lagrange's remainder
</dt>
<dt> (b) &nbsp;
Riemann's integral
</dt>
<dt> (b) &nbsp;
Trapezoidal integral
</dt>
<dt> (b) &nbsp;
Simpson's integral
</dt>
</dl><br />
</li>
<li> Carefully state and prove the mean value theorem.<br /><br /></li>
<li> 

<dl>
<dt> (a) &nbsp;
Define topological space.
</dt>
<dt> (b) &nbsp;
Define closure of a set.
</dt>
<dt> (b) &nbsp;
Define close point.
</dt>
<dt> (d) &nbsp;
Let
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>X</mi>
</math> be a topological space and let
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>E</mi>
</math> be a subset of 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>X</mi>
</math>.
Show that the closure of 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>E</mi>
</math> is equal to the set of close points to
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>E</mi>
</math>.
</dt>
</dl><br />
</li>
<li> Assume that 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>f</mi><mo>&colon;</mo><mo>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>]</mo>
	<mo>&rarr;</mo><mi>&Ropf;</mi>
</mrow></math> and
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>g</mi><mo>&colon;</mo><mo>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>]</mo>
	<mo>&rarr;</mo><mi>&Ropf;</mi>
</mrow></math> are functions, 
if
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>x</mi><mo>&isin;</mo><mo>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>]</mo>
</mrow></math> then
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>&le;</mo>
	<mi>g</mi><mo>(</mo><mi>x</mi><mo>)</mo>
</math>, and
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mi>a</mi><mi>b</mi></msubsup><mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mi>a</mi><mi>b</mi></msubsup><mi>g</mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> exist. Show that
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mi>a</mi><mi>b</mi></msubsup><mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mi><mi>d</mi><mi>x</mi></mi>
<mo>&le;</mo>
<msubsup><mi>&int;</mi><mi>a</mi><mi>b</mi></msubsup><mi>g</mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.
<br /><br />
</li>
<li>
Assume that
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>f</mi><mo>&colon;</mo><mo>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>]</mo>
	<mo>&rarr;</mo><mi>&Ropf;</mi>
</mrow></math> is continuous.
Show that there exists 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>c</mi><mo>&isin;</mo><mo>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>]</mo>
</mrow></math> such that if 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>x</mi><mo>&isin;</mo><mo>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>]</mo>
</mrow></math> then
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>&le;</mo>
	<mi>f</mi><mo>(</mo><mi>c</mi><mo>)</mo>
</mrow></math> (i.e. 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>f</mi>
</math> has a maximum at
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>c</mi>
</math>).
</li>



</ol>



</body>
</html>
