Use the corrected interpolant from part (a). The error has , and the chosen auxiliary function has as well as . There are distinct zeros of : all the nodes and the additional evaluation point. Rolle's theorem supplies zeros of between these ordered zeros. Together with its nodal zeros, this gives distinct derivative zeros. Repeated Rolle applications therefore give an interior such that .
The extra claim that itself must be a zero of is false. For nodes zero and one and , the Hermite interpolant is , so . The auxiliary function is then , and at any interior evaluation point. The corrected zero count above is all that is needed.
Since has degree at most and is monic of degree , differentiating the auxiliary function at the supplied gives
Hence
At interpolation nodes the error and the prefactor are zero, so the formula remains valid there as well.
The difference has at every node. Rolle's theorem supplies an additional zero of in each of the open intervals between successive nodes. Together with the nodal derivative zeros, these are distinct zeros of , including the two endpoints. But is a polynomial of degree at most , so it is identically zero. Since , is also identically zero.
Thus the interpolation polynomial is unique. Once identically, it indeed has arbitrarily many zeros in the open interval as requested. The initial Rolle count naturally includes the endpoints, rather than initially supplying open-interval zeros. Equivalently, every node is a double root of , so a nonzero difference would be divisible by the degree- polynomial , exceeding its allowed degree.
The printed product omits the node with index zero. The correct cardinal polynomial is
For example, with two nodes zero and one, values zero and one, and both derivative data zero, the printed index range gives and its displayed interpolant is the constant one, which fails the value condition at zero. Thus the source formula cannot be proved literally.
With the corrected product, . For , has a double zero at , so both basis functions and their derivatives vanish there. At , put . The value basis satisfies and . The derivative basis satisfies and . Both have degree at most . Consequently
has every prescribed value and derivative, proving membership in the interpolation class after the required index correction. This corrected Hermite interpolant is used in the following parts.
Stationarity at zero gives , hence . At one, ; substituting gives . More generally the interior equations are . Induction gives
Since , normalization of this geometric series gives
These probabilities satisfy detailed balance , including the boundary balance with the holding probability. Thus they do define a stationary distribution. Irreducibility then gives its uniqueness.
A Poisson process of rate is a counting process starting at zero with independent stationary increments, with Poisson of mean for , and right-continuous paths with unit jumps. Equivalently the small-interval probabilities are for one event and for two or more.
Independence of the two processes makes their joint increments over disjoint intervals independent. On an interval of length , the sum of their independent Poisson increments has probability generating function
so it is Poisson with mean . Simultaneous arrivals have probability zero, so the sum retains unit jumps. It is therefore a Poisson process of rate .
The first arrival times are independent exponential variables of rates and . For positive rates,
The functional is unbounded above. Let be the positive affine interpolant between the two endpoint values, and choose a smooth nonnegative function that vanishes at the endpoints and is positive somewhere inside. The admissible curves satisfy
The claimed minimum conclusion does not follow and is false in general. A stationary point may have a negative second variation, even though the functional is unbounded above. Here is an explicit example within the allowed positive-graph class.
Take the stationary profile on , and the endpoint-zero variation . For sufficiently small perturbation parameter , remains positive and preserves both endpoint values. Put . Differentiating the area twice and integrating its mixed term by parts gives
This is strictly negative: the first term is less than , while . For example gives and , whose product already exceeds . Thus nearby positive profiles have smaller area. This catenoid is not a local minimum.
The corrected conclusion is that any smooth positive minimizer, if attained, must have the catenoid form. That necessary condition is not sufficient, and existence or stability requires a separate argument.
Figure 1. . Endpoint-preserving positive perturbations of an extended catenoid lower the area; the stationary profile is not a local minimum. Details.
Discard the constant factor when forming the Euler-Lagrange equation. For it becomes
The Beltrami identity, since has no explicit dependence, gives . Combining with the differential equation yields . Its exponential solution has coefficients whose product is , by . Positivity therefore puts it in the form
Its constants must satisfy and . Depending on the endpoint data, these equations may have no solution or more than one. A constant function can satisfy a formal first-integral equation but fails the full Euler-Lagrange equation; it is not an extra extremal.
Parametrize the surface by , with . Its tangent vectors are orthogonal, of lengths and . Thus the area element is . Integrating over the angle gives
The surface is a Klein bottle. Here is a cell-count justification that keeps all the arrow directions. Name the corners of the first square , beginning at its upper left and proceeding clockwise; name those of the second in the same way. The single-arrow gluing identifies with and with . The triple-arrow gluing identifies with and with . The first square's quadruple-arrow gluing identifies with and with . The second square's double-arrow gluing identifies with one another. There are exactly two resulting vertex classes:
There are four edge classes and two faces, so the Euler characteristic is . Every edge is paired and the corner links close into circles, giving a compact surface without boundary; the cross-square identifications make it connected. It is nonorientable: the quadruple-arrow identification glues two boundary edges of the same square in the same boundary-traversal direction, so no orientation of that face can extend across the gluing. The classification of compact connected surfaces now identifies the nonorientable surface of Euler characteristic zero as the Klein bottle.
Geometrically, the internal identification in each square produces a Möbius band. The remaining single- and triple-arrow edges comprise their two boundary circles, which are glued together. The double of a Möbius band is another description of the same Klein bottle.
For the surjection to the set of equivalence classes, define a subset of the quotient to be open exactly when is open in . Inverse images preserve the empty and full sets, arbitrary unions and finite intersections. Applying the topology axioms in proves this is a topology on the quotient, and it makes continuous.
The map need not be open. On , identify zero with one and leave every other point in its own class. The set is open, but its saturation is
which is not open in . Thus is not open in the quotient topology. Continuity of a quotient map does not imply openness.
False. Let be an indiscrete two-point space and a one-point space. The constant map is continuous and onto; is compact because it is finite and connected because its only nonempty open set is the whole space. It is not Hausdorff, since its two points have no disjoint nonempty neighbourhoods. The one-point codomain is Hausdorff.
False. Take , and , with their usual topologies. The domain is compact and connected, the codomain is Hausdorff, and the map is continuous and onto. But the fibre over one is , a disconnected two-point subspace.
True. Every singleton in a Hausdorff space is closed. Thus is closed in by continuity. A closed subset of a compact space is compact, whether or not that compact space is Hausdorff. Hence every fibre is compact.
True. A separation of into two disjoint nonempty open sets would pull back to a separation of : continuity gives openness, and surjectivity gives nonemptiness. This contradicts connectedness of .
At each , eventually , and the stipulated power limit gives . At nonpositive the functions vanish. On their positive support,
The supplied integrable exponential therefore dominates the sequence. Dominated convergence gives
The final improper integral is absolutely convergent, so agrees with its Lebesgue integral.
The dominated convergence theorem says that if measurable almost everywhere and for an integrable , then is integrable, , and consequently .
First derive Fatou's lemma from monotone convergence. For nonnegative , the measurable functions increase to , and . Monotone convergence therefore yields .
Now is measurable and almost everywhere, so is integrable. Apply Fatou's lemma to , which converges almost everywhere to :
The last integrals are nonnegative, so they tend to zero. Finally . This argument also works for complex-valued functions.
Use , . It sends the diamond-shaped open square onto , and the inverse Jacobian has absolute determinant . On this rectangle and , so the original function is measurable, bounded by one and supported on a finite-area set, proving integrability. The transformed integral separates:
The two one-dimensional integrals follow from the fundamental theorem of calculus; Fubini's theorem applies by the established integrability.
The change-of-variables formula is
For an integrable , the transformed function with its absolute-Jacobian factor is integrable as well. The absolute value is essential because the integral does not depend on whether the coordinate change preserves orientation.
A coordinate transformation is a continuously differentiable bijection from the open set onto an open image, with continuously differentiable inverse. Equivalently one may specify a one-to-one continuously differentiable map whose Jacobian determinant is everywhere nonzero; the inverse function theorem gives the corresponding smooth inverse on its image.

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