<?xml version="1.0" encoding="iso-8859-1"?>
<?xml-stylesheet type="text/xsl" href="pmathml.xsl"?>

<!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" xml:lang="en"> 


<head>

<title>Record of daily activities, Math 618, Spring 2006, Texas
A&amp;M University</title>
</head>
<body>
<h1>Record of daily activities for <a href="./">Math 618</a>,
Theory of Functions of a Complex Variable&nbsp;II,
Spring&nbsp;2006</h1>

<p>
  This page is formatted with <a href="http://www.w3.org/Math/">MathML</a>. 
  If the mathematics does not display properly in your browser, try a standards-compliant
  browser, such as <a href="http://www.mozilla.com/firefox/">Firefox</a>.
</p>

<dl>
  
  <dt>Tuesday, May 2</dt>
  <dd>We compiled the following list of ten results that will be the basis of the final examination: the Bohr-Mollerup theorem;
     Cauchy's integral theorem for multiply connected domains (the homology version);
     the general pole-pushing lemma;
     Jensen's formula;
     Hadamard's factorization theorem for entire functions;
     Hadamard's gap theorem;
     the monodromy theorem;
     Picard's little theorem (about the range of entire
    functions);
     Runge's approximation theorem; and the
 Weierstrass factorization theorem for entire functions.
  </dd>
  
  <dt>Monday, May 1</dt>
  <dd>We discussed the overview of the proof of the prime number theorem.<br />
    <strong>Assignment:</strong> 
    Finish reading Chapter&nbsp;16 (namely, section&nbsp;16.3). In preparation for the final examination, make a list of the major theorems from the course.
  </dd>
  
  <dt>Friday, April 28</dt>
  <dd>We discussed properties of Riemann's
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>&zeta;</mi>
    </math>
    function and the statements of the prime number theorem and the Riemann hypothesis.<br />
    <strong>Assignment:</strong> 
    Read in Chapter&nbsp;16 through the proof of Proposition&nbsp;16.2.2.
  </dd>
  
  <dt>Wednesday, April 26</dt>
  <dd>We discussed characterizations of the gamma function and proved Wielandt's uniqueness theorem. ChangChun presented a solution to exercise&nbsp;2 on page&nbsp;465.<br />
    <strong>Assignment:</strong> 
    Read the first five pages of Chapter&nbsp;16.
  </dd>
  
  <dt>Monday, April 24</dt>
  <dd>We discussed the solution to the third problem from last Wednesday, and we looked at the integral representation of the gamma function using the Hankel contour.<br />
    <strong>Assignment:</strong>
    Finish reading section&nbsp;15.2, and do either exercise&nbsp;2 or exercise&nbsp;3 on page&nbsp;465.
  </dd>
  
  <dt>Friday, April 21</dt>
  <dd>ChangChun presented a solution to the first problem from last time, and Brad presented a solution to the second problem. We also computed the volume and the surface area of the unit ball in 
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <msup>
      <mi>&reals;</mi> <mi>n</mi>
    </msup>
  </math> in terms of the gamma function.<br />
  <strong>Assignment:</strong>
  Read the first part of section&nbsp;15.2, pages 455-460 (through Proposition&nbsp;15.2.4), and work on problem&nbsp;3 from last time.
  </dd>
  
  <dt>Wednesday, April 19</dt>
  <dd>We discussed properties of the gamma function.<br />
    <strong>Assignment:</strong> Finish reading section&nbsp;15.1, and do one of the following three problems.
    <ol>
      <li>Show that <math xmlns="http://www.w3.org/1998/Math/MathML">
         <mi>&Gamma;</mi><mfenced>
          <mrow><mn>1</mn><mo>/</mo><mn>2</mn></mrow>
         </mfenced>
         <mo>=</mo> <msqrt> <mi>&pi;</mi> </msqrt>
        </math> (compare exercise&nbsp;5b on page&nbsp;465 of the textbook).</li>
      <li>Show that
        <math xmlns="http://www.w3.org/1998/Math/MathML">
          <msup><mi>&Gamma;</mi> <mi>&prime;</mi></msup>
          <mfenced><mi>1</mi> 
          </mfenced>
          <mo>=</mo> <mo>-</mo> <mi>&gamma;</mi>
        </math> (exercise&nbsp;6 on page&nbsp;466).
      </li>
      <li>Show that
        <math xmlns="http://www.w3.org/1998/Math/MathML">
          <mstyle displaystyle="true">
          <msubsup><mo largeop="true">&Product;</mo>
            <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn>
            </mrow>
            <mi>&infin;</mi>
          </msubsup>
          <mfrac>
            <mrow><mi>n</mi> <mfenced><mrow>
                  <mi>n</mi><mo>+</mo> <mn>1</mn></mrow>
                </mfenced></mrow>
                        <mrow>
               <msup><mfenced>
                 <mrow>
                    <mi>n</mi> <mo>+</mo> <mfrac>
                      <mn>1</mn> <mn>2</mn>
                    </mfrac>
                 </mrow>
               </mfenced>
                 <mn>2</mn>
             </msup>
            </mrow>
          </mfrac>
          <mo>=</mo>
          <mfrac>
            <mi>&pi;</mi> <mn>4</mn>
          </mfrac>
        </mstyle>
        </math>.
      </li>
    </ol>
    Challenge problem: show that
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mstyle displaystyle="true">
      <msubsup><mo largeop="true">&int;</mo>
        <mn>0</mn> <mi>&infin;</mi>
          </msubsup>
        <mfrac>
           <mrow>
              <mo>sin</mo>
              <mfenced>
                <mi>t</mi>
              </mfenced>
           </mrow>
           <mi>t</mi>
        </mfrac>
        <mo>&thinsp;</mo>
        <mo>log</mo>
        <mfenced>
          <mi>t</mi>
        </mfenced>
        <mo>&thinsp;</mo>
        <mo>&DifferentialD;</mo><mi>t</mi>
              </mstyle>
              <mo>=</mo>
        <mo>-</mo> 
        <mfrac>
          <mn>1</mn> <mn>2</mn>
        </mfrac>
        <mi>&pi;</mi> <mi>&gamma;</mi> 
    </math>.
  </dd>
  
  <dt>Monday, April 17</dt>
  <dd>We discussed the proof of Mergelyan's theorem.<br />
    <strong>Assignment:</strong> Read the first part of section&nbsp;15.1, pages 447-451 (through Corollary&nbsp;15.1.7).
  </dd>
    
  <dt>Wednesday, April 12</dt>
  <dd>We worked on an <a href="apr12.pdf">exercise on Swiss cheese</a>.<br />
    <strong>Assignment:</strong> This Friday is a reading day, and classes do not meet. Finish reading Chapter&nbsp;12, and finish the <a href="apr12.pdf">exercise</a> from class.
  </dd>
  
  <dt>Monday, April 10</dt>
  <dd>Jared presented a construction of an entire function, not identically equal to zero, that tends to zero along every line.
  </dd>
  
  <dt>Friday, April 7</dt>
  <dd>We discussed the <a href="apr05.pdf">exercise</a> from last time.<br />
    <strong>Assignment:</strong> Next time Jared will preview his Master's exam presentation.
  </dd>
  
  <dt>Wednesday, April 5</dt>
  <dd>We worked on an <a href="apr05.pdf">exercise on the 
      <math xmlns="http://www.w3.org/1998/Math/MathML">
        <mover> <mi>&part;</mi> <mi>&OverBar;</mi></mover>               </math> equation</a>.<br />
    <strong>Assignment:</strong> Finish the exercise, and read Lemmas 12.2.4 and&nbsp;12.2.5 (and the proofs) on pages 371-372.
  </dd>
  
  <dt>Monday, April 3</dt>
  <dd>We worked on an <a href="apr03.pdf">exercise on Runge's theorem</a>.<br />
    <strong>Assignment:</strong>
      Read the proof of the inhomogeneous Cauchy integral formula in Appendix&nbsp;A, pages 488-489 (the section labelled &ldquo;Green's theorem&rdquo;).
    </dd>
  
  <dt>Friday, March 31</dt>
  <dd>We discussed the <a href="mar29.pdf">exercise on overconvergence</a> from last time.<br />
    <strong>Assignment:</strong>
    Do exercise&nbsp;6 on page&nbsp;380 (to hand in).
  </dd>
  
  <dt>Wednesday, March 29</dt>
  <dd>We worked on an <a href="mar29.pdf">exercise on overconvergence</a>.<br />
    <strong>Assignment:</strong>
    Finish the exercise, and read the proof of Runge's theorem in section&nbsp;12.1, pages 364-367.
  </dd>
  
  <dt>Monday, March 27</dt>
  <dd>Chris gave a solution to the problem from last time, and we started discussing approximation theorems.<br />
    <strong>Assignment:</strong>
    Read the first part of section&nbsp;12.1 (pages 361-364) and do exercise&nbsp;1 on page&nbsp;379 (to hand in).
  </dd>
  
  <dt>Friday, March 24</dt>
  <dd>Aaron showed that the Weierstrass&nbsp;&weierp; function with periods <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mn>1</mn>
    </math>
    and
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>&ImaginaryI;</mi>
    </math> maps the open subsquare of the fundamental unit square with side
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mn>1</mn><mo>/</mo><mn>2</mn>
    </math>
    one-to-one onto the lower half-plane. Also we discussed the topological properties from the <a href="mar20.pdf">exercise on simple connectivity</a>.<br />
    <strong>Assignment:</strong>
    Do problem&nbsp;3 from the <a href="http://www.math.tamu.edu/teaching/graduate/quals/complex/j04.pdf">January 2004 qualifying exam</a>: namely, exhibit a closed path
     in the complex plane such that 
    the integral over the path of the function
    <math xmlns="http://www.w3.org/1998/Math/MathML">
    <mn>1</mn> <mo>/</mo><mfenced>
        <mrow>
           <mi>z</mi> <mo>-</mo> <mn>1</mn>
        </mrow>
     </mfenced>
     <mfenced>
       <mrow>
         <mi>z</mi> <mo>-</mo> <mn>14</mn>
   </mrow>
     </mfenced>
    </math>
    is equal to 
    <math xmlns="http://www.w3.org/1998/Math/MathML">
        <mn>2004</mn>
    </math>.
  </dd>
  
  <dt>Wednesday, March 22</dt>
  <dd>We discussed the notion of simple connectivity and the question of whether connectedness should be a part of the definition (in connection with exercise&nbsp;4 on page&nbsp;352). Also we discussed part&nbsp;9 of the <a href="mar20.pdf">exercise on simple connectivity</a> and observed that the case of the square would be solved if we knew that the Riemann map from the square to the disc can be approximated uniformly on compact sets by polynomials.<br />
    <strong>Assignment:</strong>
    Read section&nbsp;11.5, pages 349-352, and verify that the Weierstrass &weierp;&nbsp;function (the doubly periodic meromorphic function defined in the textbook with periods
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mn>1</mn>
    </math>
    and
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>&ImaginaryI;</mi>
    </math>)
    maps the open subsquare of the fundamental unit square with side
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mn>1</mn><mo>/</mo><mn>2</mn>
    </math>
    one-to-one onto an open half-plane.
  </dd>
  
  <dt>Monday, March 20</dt>
  <dd>We worked on an <a href="mar20.pdf">exercise on simple connectivity</a>.
    <br />
    <strong>Assignment:</strong>
    Prepare to present the <a href="mar20.pdf">exercise on simple connectivity</a> in class next time, and write up a solution to exercise&nbsp;4 on page&nbsp;352 to hand in next time.
  </dd>
  
  <dt>Friday, March 10</dt>
  <dd>We finished the second part of the <a href="mar08.pdf">exercise on Picard's theorems</a> and recapitulated the key idea in the proof of the homology version of Cauchy's integral formula.<br />
    <strong>Assignment:</strong>
  Read sections 11.3 and 11.4, pages 343-349.
  </dd>
  
  <dt>Wednesday, March 8</dt>
  <dd>We worked out the first part of an <a href="mar08.pdf">exercise on Picard's theorems</a>.<br />
      <strong>Assignment:</strong>
      Do the second part of the exercise, and read section&nbsp;11.2, pages&nbsp;338-343.
    </dd>
    
  
  <dt>Monday, March 6</dt>
  <dd>We discussed the <a href="mar03.pdf">exercise on the Weierstrass&nbsp;&wp; function</a>.<br />
    <strong>Assignment:</strong>
    Read section 11.1, pages 335-338.
  </dd>
  
  <dt>Friday, March 3</dt>
  <dd>We discussed exercises 19, 20, and&nbsp;21 on pages 332-333 at the end of chapter&nbsp;10.<br />
    <strong>Assignment:</strong>
    Do the <a href="mar03.pdf">exercise on the Weierstrass&nbsp;&wp; function</a>.
  </dd>
  
  <dt>Wednesday, March 1</dt>
  <dd>We concluded the discussion of the <a href="feb24.pdf">exercises on the modular function</a>.<br />
    <strong>Assignment:</strong>
    Various subsets of the class will prepare exercises 19, 20, and&nbsp;21 on pages 332-333 at the end of chapter&nbsp;10.
  </dd>
  
  <dt>Monday, February 27</dt>
  <dd>We discussed the <a href="feb24.pdf">exercises</a> from last time and
    the geometry involved in the construction of the modular function.<br />
    <strong>Assignment:</strong>
    Continue working on the <a href="feb24.pdf">exercises</a> from last time, and read section&nbsp;10.6 in the textbook (pages 323-330).
  </dd>
      
    
  <dt>Friday, February 24</dt>
  <dd>Chris showed that no two points of the fundamental domain are equivalent under an element of the modular group. One difference from the case of the congruence subgroup considered in the textbook is that there exist two transformations in the full modular group that leave a point in the boundary of the fundamental domain fixed. Indeed, the transformation
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>z</mi> <mo>&mapsto;</mo> <mo>-</mo><mn>1</mn> <mo>/</mo> <mi>z</mi>
    </math>
    fixes the point
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>i</mi>
    </math>,
    and the transformation
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>z</mi> <mo>&mapsto;</mo> <mo>-</mo><mn>1</mn> <mo>/</mo> 
      <mfenced><mrow>
          <mi>z</mi><mo>-</mo> <mn>1</mn> 
        </mrow></mfenced>
          </math>
          fixes the point 
          <math xmlns="http://www.w3.org/1998/Math/MathML">
            <mo>exp</mo>
            <mfenced>
              <mrow>
                <mi>i</mi><mi>&pi;</mi> <mo>/</mo> <mn>3</mn>
              </mrow>
            </mfenced>
          </math>.<br />
          <strong>Assignment:</strong>
          Prepare to discuss the <a href="feb24.pdf">exercises on the modular function</a> next time.
  </dd> 
  
   <dt>Wednesday, February 22</dt>
   <dd>Jared presented a solution to the first part of the <a href="feb20.pdf">exercise on the modular group</a> from last time; Aaron will write this up for distribution. For the second part, Brad showed that every point of the upper half-plane is the image of some point of the alleged fundamental domain under some transformation in the modular group; Lidia will write this up for distribution.<br />
     Next time Chris will show that no two points of the alleged fundamental domain are equivalent under an element of the modular group.
   </dd>
  
  <dt>Monday, February 20</dt>
  <dd>We worked on an <a href="feb20.pdf">exercise on the modular group</a>.<br />
    <strong>Assignment:</strong>
    Prepare to present the solution to the exercise next time, and also
  read the rest of section&nbsp;10.5, pages 320-323.
  </dd>
  
  <dt>Friday, February 17</dt>
  
  <dd>ChangChun presented a solution of exercise&nbsp;11 on page&nbsp;331; the function 
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>g</mi>
    </math> extends to be a meromorphic function on the whole plane with simple poles at the integers that are congruent to&nbsp;3 modulo&nbsp;4.
   Aaron presented a solution to problem&nbsp;10 from the May 2005 qualifying examination.<br />
   <strong>Assignment:</strong>
   Read the first part of section&nbsp;10.5, pages 314-320, and do exercise&nbsp;16 on page&nbsp;332.
  </dd>
  
  <dt>Wednesday, February 15
  </dt>
  
  <dd>Jared presented a solution to exercise&nbsp;9 on page&nbsp;331 about analytic continuation of the power series 
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mstyle displaystyle="true">
      <msubsup><mo>&sum;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn></mrow> <mi>&infin;</mi></msubsup>
      <mfrac><mrow><msup><mi>z</mi><mi>j</mi></msup></mrow>
                <mrow><msup><mi>j</mi> <mn>2</mn></msup></mrow>
              </mfrac>
            </mstyle>
    </math>. Also we discussed the Vivanti-Pringsheim theorem.
    <br />
    <strong>Assignment:</strong>
    Do problem&nbsp;10 from the <a href="http://www.math.tamu.edu/teaching/graduate/quals/complex/m05.pdf">May 2005 complex analysis qualifying examination</a>: namely, if
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>f</mi>
    </math>
    and
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>g</mi>
    </math>
    are entire functions such that 
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <msup>
        <mrow>
          <mi>f</mi> <mfenced> <mi>z</mi></mfenced>
        </mrow>
        <mn>2</mn>
      </msup>
      <mo>+</mo>
      <msup>
        <mrow>
          <mi>g</mi> <mfenced> <mi>z</mi></mfenced>
        </mrow>
        <mn>2</mn>
      </msup> <mo>=</mo>
      <mn>1</mn>
    </math>
    for all
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>z</mi>
    </math>,
    then there exists an entire function
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>h</mi>
    </math>
    such that 
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>f</mi> <mfenced><mi>z</mi></mfenced>
      <mo>=</mo>
      <mo>cos</mo> <mfenced>
        <mrow>
          <mi>h</mi><mfenced> <mi>z</mi> </mfenced>
        </mrow>
      </mfenced>
    </math>
    and
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>g</mi> <mfenced><mi>z</mi></mfenced>
      <mo>=</mo>
      <mo>sin</mo> <mfenced>
        <mrow>
          <mi>h</mi><mfenced> <mi>z</mi> </mfenced>
        </mrow>
      </mfenced>
    </math>
    for all
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>z</mi>
    </math>.
    (What does this have to do with the monodromy theorem?)
  </dd>
  
  <dt>Monday, February 13</dt>
  <dd>We looked at an example of an entire function for which 
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>&lambda;</mi> <mo>=</mo> <mi>&mu;</mi> <mo>+</mo> <mn>1</mn>
    </math>
    (the order attains its maximal value of 1 plus the genus): namely,
    the infinite product
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mstyle displaystyle="true">
      <msubsup> <mo largeop="true">&prod;</mo>
        <mrow><mi>n</mi><mo>=</mo><mn>2</mn>
        </mrow>
        <mi>&infin;</mi>
      </msubsup>
      <mfenced><mrow>
         <mn>1</mn> <mo>-</mo> 
         <mfrac>
           <mi>z</mi>
           <mrow> <mi>n</mi> 
             <msup><mfenced><mrow>
                 <mo>log</mo><mi>n</mi>
               </mrow>
             </mfenced>
             <mn>2</mn>
           </msup>
           </mrow>
         </mfrac>
        </mrow>
      </mfenced>
    </mstyle>
    </math>, which has genus&nbsp;0 and order&nbsp;1.
    Then we worked in groups on exercises 9 and&nbsp;11 on page&nbsp;331.<br />
    <strong>Assignment:</strong>
    Read sections 10.3 and 10.4. Each group will present its exercise in class next time.
  </dd>
  
  <dt>Friday, February 10
  </dt>
  
  <dd>Aaron presented a solution to the second part of the exercise from last time. Also we discussed a solution to exercise&nbsp;12 on page&nbsp;297 (the second half of Hadamard's theorem).<br />
    <strong>Assignment:</strong>
    Read sections 10.1 and&nbsp;10.2, pages 299-307.
  </dd>
  
  <dt>Wednesday, February 8</dt>
  <dd>We discussed the solution of exercise&nbsp;3 on page&nbsp;296 about genus, and ChangChun presented a solution of exercises 1 and&nbsp;2 on page&nbsp;296 (proofs of the Poisson-Jensen formula).<br />
    <strong>Assignment:</strong>
    Do the <a href="feb08.pdf">exercise</a> on the order of an entire function (to hand in next class).
  </dd>
  
  <dt>Monday, February 6
  </dt>
  
  <dd>We discussed the construction of a gap power series that has the unit circle as natural boundary, yet derivatives of all orders extend continuously to the boundary. Also we discussed the definition of order of an entire function and some examples.<br />
    <strong>Assignment:</strong>
    Read the rest of section&nbsp;9.3 and do exercise&nbsp;3 on page&nbsp;296 (about genus).
  </dd>
  
  <dt>Friday, February 3</dt>
  <dd>Aaron presented a proof that Jensen's formula carries over unchanged when there are (finitely many) zeroes on the boundary of the disc; the integral is then a convergent improper integral.<br />
    <strong>Assignment:</strong>
    <ul>
      <li>
    Read part of section&nbsp;9.3 (pages 288-290 and pages 293-296), skipping the technical lemmas for the moment.</li>
  <li>Use Hadamard's gap theorem to construct a holomorphic function in the unit disc
    <math xmlns="http://www.w3.org/1998/Math/MathML">
     <mi>D</mi> <mfenced> <mn>0</mn> <mn>1</mn> </mfenced>
    </math>
  such that no point on the boundary of the disc is regular for the function
  (in the sense of the definition on page&nbsp;270), yet the function and  its derivatives of all orders extend continuously to the closed disc
  <math xmlns="http://www.w3.org/1998/Math/MathML">
    <mover><mi>D</mi><mi>&OverBar;</mi> </mover> <mfenced> <mn>0</mn> <mn>1</mn> </mfenced>
    </math>.
      </li>
  </ul>
  </dd>
  
  <dt>Wednesday, February 1</dt>
  <dd>Students presented proofs of some of the generalizations of Jensen's formula from last time.<br />
    <strong>Assignment:</strong>
    Read section&nbsp;9.2 about the Hadamard gap theorem.
  </dd>
  
  <dt>Monday, January 30</dt>
  <dd>We discussed some possible generalizations of Jensen's formula (Theorem&nbsp;9.1.2 on page&nbsp;280): 
    (A)&nbsp;removing the hypothesis that 
    <math xmlns="http://www.w3.org/1998/Math/MathML">
      <mi>f</mi> <mfenced> <mn>0</mn></mfenced> <mo>&ne;</mo> <mn>0</mn>
    </math>;
    (B)&nbsp;moving 
    <math xmlns="http://www.w3.org/1998/Math/MathML">
     <mn>0</mn>
    </math> to a different point by a linear fractional transformation (the Poisson-Jensen formula, which is exercise&nbsp;1 on page&nbsp;296 at the end of the chapter);
    (C)&nbsp;extending the formula to cover the case of meromorphic functions;
    (D)&nbsp;relaxing the hypothesis that the function is holomorphic in a neighborhood of the closure to allow the function to be merely continuous on the closure and holomorphic on the interior;
    (E)&nbsp;allowing the function to have zeroes on the boundary.<br />
    <strong>Assignment:</strong>
    Everyone will prepare one of these cases to present next time (except Chris, who will do exercise&nbsp;8 on page&nbsp;296 at the end of the chapter).
  </dd>
  
  <dt>Friday, January 27
  </dt>
  
  <dd>We discussed an improvement of the version of Mittag-Leffler's theorem stated in the book (Theorem&nbsp;8.3.8): namely, in addition to prescribing finite chunks of the Laurent series of a meromorphic function at prescribed points, one can guarantee that the function has no extraneous zeroes.<br />
    Aaron presented an elegant solution of exercise&nbsp;12 on page&nbsp;276 based on periodicity and a computation showing that both sides of the equation tend to
    <math xmlns="http://www.w3.org/1998/Math/MathML">
     <mn>0</mn>
    </math> when 
    <math xmlns="http://www.w3.org/1998/Math/MathML">
     <mfenced open="|" close="|">
       <mrow><mo>Im</mo> <mi>z</mi></mrow>
     </mfenced>
     <mo>&rarr;</mo> <mi>&infin;</mi>
   </math>. Chris will write up a solution for distribution.
   The exercise is essentially the same as starred exercise&nbsp;68 on page&nbsp;155.<br />
   <strong>Assignment:</strong>
   Read section&nbsp;9.1 and do exercise&nbsp;6 on page&nbsp;296 (to hand in).
  </dd>
  
  <dt>Wednesday, January 25
  </dt>
  
  <dd>We completed the discussion of the approximation problem held over from last time. Lidia observed that one can simplify the proof by using an exhaustion of the open set
    <math xmlns="http://www.w3.org/1998/Math/MathML">
    <mi>U</mi>
  </math> by an increasing sequence of compact sets (as on page&nbsp;194 of the textbook in the proof of Montel's theorem). Also she observed that the problem is a corollary of the generalized pole-pushing lemma&nbsp;12.1.6 (which we will get to later). We also discussed how to generalize problem&nbsp;4 on page&nbsp;275 of the textbook to remove the hypothesis that <math xmlns="http://www.w3.org/1998/Math/MathML">
    <msub><mi>b</mi><mi>n</mi></msub> <mo>&gt;</mo> <mn>1</mn>
  </math>.<br />
  <strong>Assignment:</strong>
  Solve exercises 10 and&nbsp;12 on page&nbsp;276 of the textbook (to discuss on Friday). These exercises can be viewed as concrete instances of the theorems of Weierstrass and Mittag-Leffler.
  </dd>
  
  <dt>Monday, January 23
  </dt>
  <dd>We discussed solutions of the two problems assigned last class. Brad will write up a solution of the first problem for distribution. Some technical topological issues in the second problem are held over for next class.<br />
    <strong>Assignment:</strong>
    Write up a solution (to hand in) of problem&nbsp;4 on page&nbsp;275 of the textbook. The hypothesis &ldquo;<math 
xmlns="http://www.w3.org/1998/Math/MathML">
    <msub><mi>b</mi><mi>n</mi></msub> <mo>&gt;</mo> <mn>1</mn>
    </math>&rdquo;
    can be substantially weakened; prove the most general statement that you can. <br />
    (The key technical issue is whether one can choose a consistent branch of the logarithm for all the terms.)
  </dd>
<dt>Friday, January 20</dt>
<dd>We discussed some of the ideas in the proofs of the Weierstrass and Mittag-Leffler theorems.<br />
<strong>Assignment:</strong>
Prepare solutions to the following exercises to present at the next class meeting.
<ol>
  <li>Suppose <math 
xmlns="http://www.w3.org/1998/Math/MathML"><mi>U</mi>
 </math> is an open set 
 in&nbsp;<math xmlns="http://www.w3.org/1998/Math/MathML">
   <mi>&complexes;</mi></math>, and <math 
xmlns="http://www.w3.org/1998/Math/MathML">
 <mfenced open="{" close="}"> 
 <msub> <mi>a</mi> <mi>j</mi></msub>
 </mfenced>
 </math> 
 is a sequence of points 
 in&nbsp;<math xmlns="http://www.w3.org/1998/Math/MathML"><mi>U</mi>
 </math> with no interior accumulation point. Assume (after making a translation, if necessary) that 
 <math xmlns="http://www.w3.org/1998/Math/MathML">
 <mn>0</mn><mo>&in;</mo><mi>U</mi> <mo>\</mo> 
 <mfenced open="{" close="}"> 
 <msub> <mi>a</mi> <mi>j</mi></msub></mfenced>
 </math>.
 Let
 <math xmlns="http://www.w3.org/1998/Math/MathML">
 <msub><mi>b</mi><mi>j</mi></msub>
 </math> be a point of 
 <math xmlns="http://www.w3.org/1998/Math/MathML">
 <mover> <mi>&complexes;</mi> <mi>&circ;</mi></mover>
 <mo>\</mo> <mi>U</mi></math> that minimizes 
 <math xmlns="http://www.w3.org/1998/Math/MathML">
 <mi>d</mi> <mfenced> <mrow> <msub> <mi>a</mi> <mi>j</mi> </msub> </mrow>
 <mrow> <msub> <mi>b</mi> <mi>j</mi> </msub> </mrow>
 </mfenced>
  </math>,
 where <math xmlns="http://www.w3.org/1998/Math/MathML">
 <mover><mi>&complexes;</mi> <mi>&circ;</mi></mover>
 </math> denotes the extended complex 
 numbers&nbsp;<math xmlns="http://www.w3.org/1998/Math/MathML">
 <mi>&complexes;</mi> <mo>&cup;</mo> 
 <mfenced open="{" close="}"> <mi>&infin;</mi> </mfenced>
 </math>,
and <math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>d</mi></math> denotes
 the spherical metric described in exercise&nbsp;34 on page&nbsp;150 of the textbook. <br />
 Define a linear fractional transformation 
 <math xmlns="http://www.w3.org/1998/Math/MathML">
 <msub> <mi>L</mi> <mi>j</mi></msub>
 </math> such that
 <math xmlns="http://www.w3.org/1998/Math/MathML">
   <mstyle displaystyle="true">
   <msub> <mi>L</mi> <mi>j</mi></msub> <mfenced><mi>z</mi></mfenced>
    <mo>=</mo>
    <mfenced> <mrow> <mfrac> <mi>z</mi> <mrow> <msub> <mi>a</mi> <mi>j</mi> </msub> </mrow> </mfrac> </mrow></mfenced>
    <mfenced> <mrow> <mfrac> <mrow> <msub> <mi>a</mi> <mi>j</mi> </msub> 
        <mo>-</mo> <msub><mi>b</mi> <mi> j</mi> </msub>
      </mrow> 
      <mrow>
        <mi>z</mi> <mo>-</mo> <msub> <mi>b</mi> <mi>j</mi> </msub></mrow>  </mfrac> </mrow> </mfenced>
</mstyle>
 </math> 
 if <math xmlns="http://www.w3.org/1998/Math/MathML">
 <msub> <mi>b</mi> <mi>j</mi></msub> <mo>&ne; </mo> <mi>&infin;</mi>
 </math>
 and
 <math xmlns="http://www.w3.org/1998/Math/MathML">
   <mstyle displaystyle="true">
     <msub> <mi>L</mi> <mi>j</mi></msub>
     <mfenced><mi>z</mi></mfenced>
     <mo>=</mo> <mfrac> <mi>z</mi> <mrow> <msub> <mi>a</mi> <mi>j</mi> </msub> </mrow> </mfrac>
   </mstyle>
 </math> if
 <math xmlns="http://www.w3.org/1998/Math/MathML">
   <msub> <mi>b</mi> <mi>j</mi></msub> <mo>= </mo> <mi>&infin;</mi>
 </math>.
 Prove that the infinite product
 <math xmlns="http://www.w3.org/1998/Math/MathML">
  <munderover> <mo>&prod;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn>  </mrow>
  <mi>&infin;</mi>
  </munderover>
  <msub><mi>E</mi> <mi>j</mi></msub>
  <mfenced> <mrow><msub> <mi>L</mi><mi>j</mi> </msub> 
  <mfenced> <mi>z</mi> </mfenced></mrow>
  </mfenced>
 </math> 
 converges normally on&nbsp;<math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>U</mi>
 </math>
 to a holomorphic function whose zero set is
 <math xmlns="http://www.w3.org/1998/Math/MathML">
  <mfenced open="{" close="}"> <msub> <mi>a</mi> <mi>j</mi> </msub> </mfenced>
 </math> (counted according to multiplicity). Here the functions
 <math xmlns="http://www.w3.org/1998/Math/MathML">
  <msub><mi>E</mi> <mi>j</mi> </msub>
</math> are the Weierstrass elementary factors defined on page&nbsp;263 of the textbook.<br />
(This exercise is a variation on the proof of the Weierstrass 
factorization theorem. Notice that if the set
<math xmlns="http://www.w3.org/1998/Math/MathML">
 <mi>U</mi>
</math> happens to be the whole complex plane, then this proof is <em>exactly</em> the proof given for the case of entire functions in section&nbsp;8.2 of the textbook.)
</li>
<li>Let 
  <math xmlns="http://www.w3.org/1998/Math/MathML">
  <mi>U</mi>
  </math> be an open set such that the complement
  <math xmlns="http://www.w3.org/1998/Math/MathML">
   <mi>&complexes;</mi><mo>\</mo> <mi>U</mi>
  </math>
  is both connected and unbounded. (A weaker hypothesis that still suffices
is that every connected component of 
<math xmlns="http://www.w3.org/1998/Math/MathML">
   <mi>&complexes;</mi><mo>\</mo> <mi>U</mi>
  </math> is unbounded. A statement 
that is equivalent to this weaker hypothesis is that 
  <math xmlns="http://www.w3.org/1998/Math/MathML">
    <mi>U</mi>
  </math> is a simply-connected open set that is not the whole plane, 
but we do not yet officially know that equivalence.)
  <br />
  Suppose that 
  <math xmlns="http://www.w3.org/1998/Math/MathML">
   <mi>f</mi> <mfenced> <mi>z</mi> </mfenced>
  </math> 
  is a rational function whose poles lie in the complement
  <math xmlns="http://www.w3.org/1998/Math/MathML">
    <mi>&complexes;</mi><mo>\</mo> <mi>U</mi>
  </math>.
  Prove that there is a sequence 
  <math xmlns="http://www.w3.org/1998/Math/MathML">
   <mfenced open="{" close="}">
    <mrow> <msub> <mi>p</mi> <mi>j</mi> </msub> <mfenced><mi>z</mi></mfenced></mrow>
  </mfenced>
  </math>
  of polynomials 
  converging normally to
  <math xmlns="http://www.w3.org/1998/Math/MathML">
   <mi>f</mi> <mfenced> <mi>z</mi> </mfenced>
  </math>
  on
  <math xmlns="http://www.w3.org/1998/Math/MathML">
    <mi>U</mi>
  </math>.<br />
  Suggestion: use the pole-pushing lemma&nbsp;8.3.5 (and/or its proof) to push the poles off to infinity.
</li>
</ol>
</dd>
<dt>Wednesday, January 18</dt>
<dd>We discussed reasons why convergence of an infinite product is
<em>not</em> defined to mean simply convergence of the partial
products, and we reviewed the statement of the Weierstrass
factorization theorem for entire functions.<br />
<strong>Assignment:</strong> Read section&nbsp;8.3 in the textbook
concerning the general Weierstrass and Mittag-Leffler theorems
about construction of meromorphic functions with prescribed
principal parts.<br />
Do exercise&nbsp;1 on page&nbsp;275 at the end of
chapter&nbsp;8 (to hand in next class).</dd>
</dl>
</body>
</html>

