False with the printed in the paper. Let the even-indexed surfaces be one fixed unit sphere and the odd-indexed surfaces one fixed ring torus. Then
but infinitely many surfaces are tori. The two fixed surfaces lie in one ball and have uniformly bounded area. Their injectivity radii have a positive common lower bound, and compactness gives a common bound on , hence on every radial derivative . Thus this alternating sequence satisfies all four additional conditions as well.
The intended statement becomes true if is replaced by
Here is the proof. Put , so . Choose maximizing distance from the centre of the fixed containing ball. The supporting-sphere curvature bound gives
Write and in geodesic polar coordinates. Choose a fixed sufficiently small and set . Conditions (3) and (4) allow to be chosen so that and
The Jacobi equation , with and , and the Sturm comparison theorem then give on this ball for a constant independent of . Consequently
Since elsewhere and ,
for all sufficiently large . Gauss-Bonnet forces , and the classification theorem for surfaces makes each such a sphere.
The preceding estimate makes equicontinuous, and
makes it uniformly bounded. The Arzelà-Ascoli theorem therefore supplies a subsequence converging uniformly to a continuous function . On every mesh interval,
including an endpoint by using the adjacent interval. Consequently uniformly along the same subsequence.
All and lie in one compact ball. The restriction of the continuous vector field to that ball is uniformly continuous, so uniformly. Passing to the limit in the defining equation gives
The fundamental theorem of calculus now makes differentiable and yields . This proves the required special case of the Peano existence theorem; uniqueness need not hold because was assumed continuous but not locally Lipschitz continuous.
Set and let . On the first interval, is the known constant , so the integral equation defines . Its endpoint value then defines the constant on the next interval, and induction over the subintervals defines the pair on all of . An integral of the bounded, piecewise constant function is continuous, so every is continuous. In fact,
so the approximations are uniformly Lipschitz continuous.
Write the closed oriented surface of genus as , where is a closed disk, is a slightly enlarged once-punctured surface, and is an annulus. Thus is contractible, is homotopy equivalent to the circle, and is homotopy equivalent to the wedge sum of circles. The boundary circle represents the product of the commutators in the fundamental group of , so its image in the first homology group, which is the abelianization of that group, is zero.
The relevant part of the Mayer–Vietoris sequence is consequently
The degree-zero part says that the connected space has , while the groups above degree two vanish. Hence
Yes. Order the proper filters containing the cofinite filter by inclusion. The union of every chain is again a proper filter containing : any finite collection of its members already lies in one filter in the chain. Zorn lemma gives a maximal proper filter .
A maximal proper filter is an ultrafilter. Indeed, if , adjoining cannot generate another proper filter, so some has . Thus , and upward closure gives . Finally, cannot equal any principal ultrafilter , because it contains the cofinite set whereas does not. Thus is a nonprincipal ultrafilter on .
The cofinite filter is nonempty, because ; finite unions of finite complements show closure under intersections, and taking a superset can only shrink the complement. The empty set is excluded because its complement is infinite. It is not an ultrafilter: the even numbers and the odd numbers both have infinite complements, so neither belongs to . Finally, is cofinite but does not belong to , proving for every .
The family is nonempty, excludes the empty set, is closed under finite intersections, and is upward closed. It is therefore a filter. For every , either or , so either or . Hence is the principal ultrafilter at .
For , Hamilton's equations give
Thus and . The Poisson bracket is , so the transformation is canonical for every . A type-2 generator is
Indeed , , and the transformed Hamiltonian is , as expected because are constants of motion.
Let
be the block-saturated mean space, and let
be the fitted GLM mean space. Full column rank and the regularity assumptions give dimensions and . The factorization in part (ii) makes the nuisance factor cancel from their likelihood ratio, while gives
As , the replicate count tends to infinity. Wilks theorem applied to these nested regular models makes twice the log-likelihood ratio converge in distribution to a chi-squared variable with the difference in dimensions:
Writing for block and using , the replicated likelihood factors as
The second factor is independent of , while the first depends on the data only through . The Fisher-Neyman factorization theorem therefore makes a sufficient statistic for in the replicated experiment.
Let . Within block , the replicated observations have dispersion and common natural parameter . Evaluating their joint MGF at the blockwise argument gives
Multiplying over blocks reproduces the MGF of from part (a). Since moment-generating functions uniquely determine distributions in this family, .
Consecutive convergents obey the standard error estimate
If the partial quotients are unbounded, then for every there are infinitely many indices with ; otherwise the whole sequence would be bounded after adjoining its finite initial segment. At each such index,
The denominators of the infinite continued fraction tend to infinity, so these give infinitely many distinct rational numbers of the required kind.
Suppose for every . Given , choose the first convergent denominator . Then and the recurrence gives . Part (i), applied at index , gives .
If is the complete quotient, the exact error formula is
Since , this is greater than and therefore greater than . It follows that every rational satisfies
Thus one may take .
The convergents satisfy
so and form an integer basis of . Put . Consecutive errors have opposite signs and .
For integers with , write
If , the denominator bound forces , while if positivity forces . Because and have opposite signs, in either case implies
If , the denominator bound gives unless the fraction is zero or has the same value as . Thus is a best approximation of the second kind. Dividing by gives
Set
Writing , direct differentiation gives
On the other hand,
Thus , which is precisely . The far-field condition is automatic because . No slip requires
so
For , decreases directly from to , matching flow everywhere toward the sink. For the negative root, initially becomes positive and creates a reverse-flow region next to the wall. The physically likely choice is therefore
Let
Using the Cartesian streamfunction convention , gives
At fixed ,
The terms proportional to cancel, leaving
Since , , while . The boundary-layer equation therefore becomes
Choosing the wall value of the streamfunction as zero, imposing no slip, and matching to give
Along , put and . If is the layer thickness, then
The boundary-layer thickness from an advection-diffusion balance therefore gives
and hence
up to a constant factor absorbed into the similarity coordinate.
Conservation of volume flux through a circular arc of radius gives
so the outer flow is the sink flow in a sector
This is a potential flow and already satisfies the no-penetration boundary condition on the radial walls. It has nonzero tangential speed there, however, and therefore violates the no-slip boundary condition. Thin vorticity-bearing boundary layers are needed to reduce that speed to zero at each wall.
Let , so
The new coefficient of is
It vanishes if
One choice that tends to zero as and also has a regular limit is
Substitution gives the outgoing null oblate spheroidal coordinates form
There is no term, so and is null for every .
Set and , so
Writing now and , the Minkowski metric becomes
The squared norm of the coordinate vector is its metric component:
For this is nonzero away from the symmetry axis, so is not a null vector.

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