The empty set is bounded. Otherwise choose in the compact metric space . The open balls , , form an open cover. A finite subcover exists by compactness; because the balls are nested, the largest one already covers . Hence for some .
For , the triangle inequality gives . Thus
The proof uses only compactness and the metric, not a coordinate system.
The Heine-Borel theorem says that a subset of finite-dimensional Euclidean space is compact exactly when it is both closed and bounded:
Here compactness refers to the subspace topology induced by the usual Euclidean metric, and closedness and boundedness are measured in the ambient Euclidean space. This characterization does not hold for arbitrary metric spaces.
Consider the counterclockwise unit circle and set
The parametrization gives
The imaginary part is zero: replacing by conjugates the integrand, since is an integer and is real. The real part is precisely the defining Bessel integral, so .
Both exponential series converge absolutely and uniformly on the circle. Their product may therefore be integrated term by term:
Uniform absolute convergence can also be checked by summing the absolute coefficient bounds, which gives . The residue is obtained exactly when , or . The Cauchy coefficient formula consequently yields
This proves the Bessel function of the first kind series directly from its integral, including the sign and factorial normalization.
A simple zero means and . The local factorization is , where is holomorphic and . Thus
The numerator is holomorphic near , so its constant Taylor coefficient is the coefficient of in the quotient. Therefore
If , the possible pole cancels and the residue is zero; the formula does not require actually to have a pole. This is the residue formula for a quotient at a simple denominator zero.
Write the Laurent series about as . The isolated singularity is:
These cases exhaust the possible principal parts. The residue is
For the first example, gives
Thus zero is a double pole, with residue zero. For the other example,
so the ratio is . Its singularity is removable, with extended value zero and residue zero. The numerator's zero has higher order than the denominator's, so there is no pole.
For fixed , integrate
counterclockwise around the specified square of half-side , choosing . The integer poles inside it are , and their residues are because has residue one at each integer.
The two other possible poles are and . Their residues are each , hence sum to . This formula still applies when the numerator vanishes and a possible pole is removable. The residue theorem gives
On the square, , its perimeter is , and the supplied cotangent bound gives
The series converges absolutely by part (b), so its symmetric partial sums have the same limit as the full sum. Therefore
At half-integers the cotangent form makes the value zero explicit; the reciprocal-tangent notation is understood by its continuous extension there. The cotangent contour summation rests on the contour estimate, not only on formally matching poles.
Fix any bounded disk avoiding the integers, and choose with on it. For sufficiently large , say and ,
The convergent numerical series and the Weierstrass M-test give absolute and uniform convergence of the tails. The finitely many remaining summands are holomorphic away from their integer poles. Thus the partial sums converge locally uniformly on .
By part (a)(iii), the sum is a holomorphic function on . The term is and is harmless on this domain; it must not be omitted.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact