A critical point is an equilibrium: . Put , . The Jacobian matrix gives the first-order linearized equation . The following eigenvalue tests classify that linearized system. For a continuously differentiable nonlinear system, the cases with nonzero real parts persist as the usual local node, saddle or spiral classifications. The purely imaginary case needs extra nonlinear information, as explained in (iv).
The domain has two connected components. The zeros force the function to vanish on the upper half-plane but impose nothing on the lower one. Define
This function is locally constant and hence holomorphic on the stated open set, and is not identically zero on that whole set. Thus the answer is yes. Connectedness is exactly the missing hypothesis for a global identity conclusion.
Here the zeros accumulate only at the boundary point zero. An explicit holomorphic, nonzero example on the upper half-plane is
At its argument is , so it vanishes. It is holomorphic because the only excluded point of its formula is zero; it is not identically zero, for instance at . Thus the answer is yes.
The denominator vanishes at for every nonzero integer . These points approach zero, the denominator has a simple zero at each, and because a nonzero purely imaginary number is not a zero of sine. Hence there are poles arbitrarily close to zero. The origin is a nonisolated singularity, so it has no residue defined by a Laurent series on a punctured disc. In particular it must not be classified as an isolated essential singularity merely because has one.
Use and
Their product is . Thus the singularity is a pole of order two, with .
Both numerator and denominator have simple zeros at zero, and . Their quotient tends to one and extends holomorphically with that value. Hence the singularity is removable, and because its Laurent series has no negative powers.
If a holomorphic bijection existed, its inverse would be an entire function taking values in the unit disc. Liouville theorem would make that inverse constant, contradicting bijectivity. Thus no holomorphic bijection exists.
A continuous bijection does exist, even a homeomorphism:
Both maps preserve the argument and change the radius by the mutually inverse strictly increasing functions and . The displayed formulas also prove continuity at zero and everywhere else.
Let , and . Continuity of gives as , and injectivity gives when . Therefore
The assumed nonvanishing derivative makes this limit well defined. It exists at every , so is holomorphic, with .
Squaring maps the first quadrant bijectively onto the upper half-plane. For in that half-plane, , and the Cayley transform maps it bijectively onto the unit disc. Their composition is
The inverse is the unique first-quadrant square root of , and is holomorphic by the first argument. Hence is holomorphic throughout the disc. Its Taylor series at zero converges for , locally uniformly there. Substituting gives the stated expansion, with , convergent at every point of the quadrant and locally uniformly on it.
A Euclidean domain is an integral domain equipped with a function such that for every and nonzero there are with and either or . One may additionally require for nonzero ; degree on a polynomial ring also satisfies this convention.
For equal-length crystallographic root configurations in a plane, taking in the closure condition gives , so every vector occurs with its negative. For fixed , a vector has , because both vectors are unit vectors. Thus its angle relative to belongs to the finite list .
If all vectors are collinear, the set is exactly , giving two opposite points of the unit circle.
If an orthogonal vector occurs, closure supplies . A unit vector making an angle of or with would have inner product with , contradicting integrality of twice that inner product. Thus these four points are the whole set: the vertices of a square.
In the remaining case a noncollinear pair makes an angle of or . Changing a sign, take their angles as . Reflecting the second in the line perpendicular to the first supplies the angle , and negation supplies the other three hexagon vertices. No perpendicular vector can occur, by the preceding inner-product obstruction. The initial finite list now leaves only these six points. Conversely the opposite pair, square and regular hexagon each satisfy both reflection closure and the integrality condition. Hence
The functional is linear and nonzero because . It therefore has rank one, and rank-nullity theorem gives
No Gram–Schmidt argument is needed. Every vector decomposes uniquely as , where and . Substitution gives . Thus the eigenspace for is , and that for is . The latter is an actual eigenvalue when ; when its eigenspace is zero and only occurs. In the plane the map is reflection in the line perpendicular to .
Write . Cayley-Hamilton theorem gives . Its minimal polynomial is therefore for exactly one , so the possibilities for that of are
Let , which is the dimension of the only eigenspace. If , then and .
If , rank-nullity theorem gives . The restriction of the nilpotent map to this invariant line is zero, so . Choose with , and choose independent of . Then , so these three vectors form a basis; its matrix for is the printed .
If , then has dimension two, so cannot vanish: otherwise . Choose with and set , . Applying and then to a putative linear relation proves these three vectors independent. The matrix is the printed .
These cases exhaust the possible eigenspace dimensions. They are pairwise dissimilar because similarity preserves the eigenspace dimension, equivalently the three different minimal polynomials. Hence every matrix is similar to exactly one of the three displayed forms.
Proceed by induction on . The zero-dimensional case is immediate. Over , the fundamental theorem of algebra supplies a root of the characteristic polynomial. Since , there is a nonzero vector with . The line is invariant, so induces a linear map on . By induction, choose an upper triangular basis for that quotient and lift its vectors to . Then for every . Thus is the required basis and .
The same conclusion holds over when the characteristic polynomial splits over . Indeed an eigenvalue then lies in , and the block matrix arising from the invariant line gives . The quotient characteristic polynomial therefore also splits, so the induction works over without requiring algebraic closure.
Suppose a nonconstant periodic orbit exists for the continuously differentiable planar vector field. Uniqueness implies that its image over a minimal period is a simple closed curve, enclosing a region of positive area. Along the orbit, the differential form vanishes because and . Green's theorem, with positive orientation, therefore gives
a contradiction. This is the Bendixson-Dulac criterion in the whole plane; the fact that the enclosed region also lies in the domain is essential.
For the second-order equation set . The equivalent system is , . Its divergence is throughout the plane. Hence there are no nonconstant periodic solutions.
The nonconstant qualification is necessary: the equilibrium solutions , , do exist and are periodic in the literal sense of satisfying every positive period. The source's usual dynamical interpretation of “periodic solution” here is a nonconstant periodic orbit.

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