Put . Multiplication of the radial wave equation by gives for . In the characteristic coordinates , , this becomes . Integrating first in and then in gives . Consequently
The two terms are incoming and outgoing radial disturbances. If the field is finite at the origin, their numerators must cancel there; arbitrary independent choices generally produce a singularity.
Let , which lies strictly between zero and . On the lower ray , the integral is . On the upper ray , the positive boundary orientation runs from down to zero. Since , that contribution is . The circular contribution vanishes by part (b); hence
Use to obtain
The result is positive as expected. Convergence near zero follows from , so both endpoint limits used in the contour argument are justified.
On the circular arc, , the reverse triangle inequality gives . The arc length is , so the ML inequality gives
The strict assumption is exactly what makes the exponent negative; it also ensures convergence of the positive-real-axis integral at infinity.
The sector contains exactly one simple pole, at . All roots of are simple, and its residue is
since . For the positively oriented boundary, the residue theorem gives
The vertex at zero is harmless: is analytic there for nonnegative integer , or a small indent may be removed because its integral is .
Let , , and . The isomorphism of part (c) preserves dimensions, so the formulas of part (a), applied also to , give
If , cancellation proves . If , both maps are zero and the equality remains true. This argument derives dual-rank equality from the requested subspace correspondence without assuming it beforehand.
Here acts on , so it is the same dualization construction with the source and target interchanged: . This is the natural family interpretation of the symbol used in part (b).
If , composition reversal gives , so . Conversely, if , the isomorphism in part (b) writes uniquely. Then implies ; injectivity of dualization gives . Thus
Similarly, is equivalent to , giving
Equivalently, the reverse implications follow by taking double duals and using the canonical double-dual identification. The equalities are of subspaces under an isomorphism, not only inclusions.
The dual map is defined by . Suppose . Then for every and every . The dual space separates vectors: a nonzero vector can be included in a basis and a coordinate functional takes value one on it. Thus for every , and . This proves injectivity of .
Its source and target have the same finite dimension:
An injective linear map between equal finite dimensions is surjective by the rank-nullity theorem. Therefore is an isomorphism. The inverse is also described by taking the dual again and identifying each space canonically with its double dual.
The zero-composition subspaces of a linear map are subspaces because the defining equations are homogeneous linear equations in : they hold for the zero map and are preserved by addition and scalar multiplication. A map with vanishes on , so it factors uniquely through the quotient vector space . Conversely every map from that quotient to gives such a . Therefore
The condition says exactly that the image of lies in . Consequently
Both dimension formulas use the fact that the space of maps between spaces of dimensions has dimension : matrix units in any chosen bases supply a basis.
Let count roots in the open unit disk. A boundary crossing can occur only at the real values found above, so the count is constant between them. Also , because the polynomial is odd. At , has one root inside and four on the circle, giving .
For small positive , the root near zero stays inside. At each boundary root , , so implicit differentiation gives . The radial crossing test for polynomial root counts is
The two roots with positive real part enter and the other two leave. Hence for .
At , the boundary roots are . Since , their radial derivative is . Both leave as increases, so the count becomes one; at itself they are excluded, also leaving one interior root. At , the remaining boundary root has radial derivative and leaves. For no interior root is possible, since in the open disk. Combining these facts and odd symmetry gives
This also gives the corresponding winding numbers of the image contour away from its crossings. Boundary roots are excluded at the crossing values; using a nearby winding number at would incorrectly count two extra roots.
The image contour has polar representation . It is invariant under complex conjugation and under reflection through the origin. As runs from zero to , the successive real-axis visits are
at angles . To specify the crossing direction, differentiate:
Its imaginary component is at the point , at , at either visit to , and at either visit to . At a visit to zero it is , nonzero for each of the four angles. Therefore all these visits are transverse crossings of the real axis, even though different arcs share the same image point.
Figure 1.
Oriented image of the unit circle under z to the fifth power plus z, showing its real-axis crossings
. Details.
Write . The trigonometric sum formulas give
Thus the imaginary part is zero either when , , or when , . These two lists are disjoint. At the latter four points . At the former six points the real values, in increasing angular order, are
Equivalently, maps to , to , to , to , and the four roots of map to zero. These are all the unit-circle points with real image.
For a closed piecewise smooth contour in a domain, null-homologous there and avoiding the poles of a meromorphic function , the residue theorem is
where is the winding number and the sum runs over enclosed poles with their indices. Suppose now is meromorphic and has neither zeros nor poles on . At a zero or pole , write with holomorphic and nonzero, where for a zero and for a pole. Then
so its residue is . Substituting into the residue theorem and changing variables along the image contour gives the argument principle:
For a positively oriented simple boundary, this is the number of zeros minus poles inside, counted with multiplicity. The winding-number form also applies to self-intersecting image paths.
The far-field derivative fixes the growing cosine coefficient to and removes all other growing modes. The possible logarithmic term has derivative at the wall, so the zero wall derivative removes it. For each decaying Fourier mode, the wall condition relates its coefficient to its growing partner: the cosine partner has coefficient , and every other partner vanishes. Thus the potential flow around a circular cylinder has
Indeed, , which is zero at and tends to at infinity. The additive constant does not change the velocity. The equipotential curves satisfy . They approach vertical straight lines far away and meet the cylinder radially wherever the tangential velocity is nonzero. The two stagnation points are at .
Use separation of variables, . After multiplying the Laplace equation by , the two separated equations are
Single-valuedness requires -periodicity. Thus the nonconstant angular modes have , , and angular factors . Their radial factors are . The zero mode has constant angular factor and radial solution ; a term proportional to would be multivalued.
Finiteness at the origin removes the logarithm and negative powers. In the disk the general regular harmonic expansion is
For the exterior, regularity at every finite radius allows
Coefficients must give convergent harmonic expansions on the domain and the intended boundary regularity at . If “finite” is intended to mean bounded as , then and only the constant and decaying modes remain. Infinity is not included in the printed interval; moreover part (b)'s uniform background flow necessarily has an unbounded potential. Stating both interpretations avoids discarding that background mode.
At a simple root of a polynomial of , differentiating the product gives . Consequently the Lagrange basis polynomials can be written
Divide the polynomial interpolation identity from part (a) by , at points outside the nodes. This gives the partial fraction decomposition
Every denominator of is simple, and the rational function is proper because , so no polynomial part is missing.
The Lagrange basis polynomials satisfy : for , the product has a zero factor, whereas for every factor is one. The polynomial
has degree of a polynomial at most and has distinct roots of a polynomial. The root bound for a polynomial implies . Hence the interpolation identity holds for every polynomial of degree at most .
The composition is an entire function, and
By Liouville's theorem, is constant. Since the exponential function never vanishes,
Thus is constant. Notice that constancy of an exponential alone need not be inverted by choosing a global logarithm; differentiating supplies the conclusion directly.
Fix any . The Cauchy estimate on the circle applies for every because is an entire function. It gives
Therefore . Since was arbitrary and is connected, is constant. This is the sublinear case of the polynomial growth theorem for entire functions.
Take any positive definite inner product on and define the inner product adapted to an idempotent linear map
It is symmetric and bilinear. If its quadratic value at is zero, positive definiteness of the original inner product forces both and , hence . Thus it is positive definite.
Using and gives
The map is therefore self-adjoint for this new inner product and remains idempotent, so it is an orthogonal projection for the explicitly constructed inner product. Geometrically the construction makes its complementary kernel and image orthogonal.
The finite-dimensional inner product space has the orthogonal decomposition . Define for , . This is a linear map with image , satisfies , and is self-adjoint by taking inner products between decomposed vectors. Hence it is an orthogonal projection.
Any other orthogonal projection with image has kernel by part (a); it is identity on by idempotence and zero on its kernel. Its values are therefore forced to agree with , proving uniqueness.
If , every has , so and . Conversely, if , every image is killed by . Therefore

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