An isolated singularity at means that the function is holomorphic on some punctured disc , while it is undefined or fails to be holomorphic at . The punctured neighbourhood contains no other singularities; this isolation is needed before applying the usual removable/pole/essential classification.
Away from zero, singularities occur exactly when , namely
For , differentiation at gives . Thus every is a simple pole, with residue .
As , these poles accumulate at zero. Therefore zero is a non-isolated singularity. Every punctured disc around it contains poles, so the function is not holomorphic on any punctured disc there. In particular zero cannot be classified as an isolated essential singularity; the isolated-singularity classification does not apply. The displayed poles and their accumulation point zero exhaust the finite singularities.
The possible singular points are . Near , put ; then
The numerator vanishes at , so the apparent pole cancels and is removable. Its extension value is , obtained from .
At , the first term has a simple pole with nonzero residue
The subtracted term is holomorphic there, so is a simple pole. At ,
so is a double pole. There are no other finite singularities.
A path-connected space has, for every pair , a continuous path with and . Every path-connected space is a connected space, because a separation of the target would pull a joining path apart and contradict connectedness of an interval.
A connected space cannot be expressed as with disjoint nonempty relatively open sets. Equivalently, the only subsets simultaneously relatively open and closed are and . A decomposition into such is a separation of the topological space.
In the subspace topology on , a subset is open in precisely when for some open set . A subset is closed in precisely when is open in , equivalently for some closed set .
A compact space is one for which every open cover has a finite subcover. Here the cover may use relatively open subsets of , or equivalently ambient open subsets covering it. The Heine-Borel theorem states that
Closedness and boundedness here refer to the ambient complex plane, not merely closedness in itself.
The union is bounded but is not a closed set: the points , , belong to the open disc and tend to , which lies in neither disc. Thus it is not compact by the Heine-Borel theorem.
Nevertheless it is connected, indeed path-connected. Every point of the open disc joins by a straight segment. The segment from to stays in the union, since its points before the endpoint belong to the open disc and the endpoint belongs to the closed disc. Every point of that closed disc joins inside it by convexity. Concatenating these paths joins any two points of the union. The fact that the two discs are disjoint does not imply disconnection: their contact point belongs to one of them. This illustrates connectedness at a one-sided contact point.
The disc is a closed set and is bounded in the complex plane, so it is compact by the Heine-Borel theorem. It is convex: the triangle inequality gives for all when both endpoints lie in it. Straight segments therefore supply paths, so it is path-connected and hence connected.
The integers are unbounded in the complex plane, so the Heine-Borel theorem shows they are not compact. They are also not connected: and are disjoint nonempty relatively open sets covering . Each integer is isolated, so the induced subspace topology is discrete.
Let count everyone present, including the host. The grouping, seating and departure conditions give the modular congruences
The first two imply , and oddness forces even. By the Chinese remainder theorem, the complete solution is
Because not every invitee attended, at most guests came, so . For , the only positive possibility is 39 people. It is feasible: seven groups of five and one of four; three tables of ten and one of nine; nineteen departing pairs and the host.
For , both 39 and 129 people are possible. The latter uses twenty-five groups of five and one of four, three tables of ten and eleven of nine, and sixty-four departing pairs. Thus the larger invitation count destroys uniqueness; it does not force a different attendance.
Take , and . Since are coprime integers, Bézout's identity gives , so . Their intersection is : it consists of integers divisible by both and , and coprimality makes this equivalent to divisibility by . Thus the Chinese remainder theorem gives
as a ring isomorphism. This includes or , where the corresponding factor is the zero ring.
The Chinese remainder theorem for two comaximal two-sided ideals of a ring states that the natural ring homomorphism induces
Indeed, the map has kernel of a ring homomorphism . Choose , with . Given target representatives , the element is congruent to modulo and to modulo , proving surjectivity. The first isomorphism theorem for rings gives the result. For a commutative ring, : if , then , while the reverse inclusion follows from the ideal properties.
Use the inner product with . The required first vector already has squared norm . Apply the Gram-Schmidt process to followed by . Since , its orthogonal remainder is . Its squared norm is . Therefore an orthonormal basis containing the specified vector is
The second vector may also be replaced by its negative.
A real inner product must be symmetric. Here and , forcing . For this value,
This is strictly positive for every nonzero vector. Bilinearity is already given, so symmetry and positive definiteness prove
The Gram-Schmidt process subtracts projections onto directions already constructed and then normalizes. Define recursively
where the empty sum for is zero. Assuming the preceding are orthonormal, taking the inner product of with , , gives zero. Moreover : otherwise would belong to the span of , contrary to linear independence. Normalization is therefore legitimate and produces an orthonormal basis. At each stage the first constructed vectors have the same span as the first original vectors.

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