The term produces a nondecaying velocity at infinity and the term a growing one, so decay forces . The first two boundary equations become and , giving
The remaining velocity terms decay respectively as and .
For , the angular differentiation gives
Trying in the fourth-order equation gives the indicial product
whose four distinct roots are . This proves that the stated four-term expression is the general separated solution of this angular type.
Put and . The velocity formulas become and . The four boundary conditions therefore give
For occupation numbers zero or one, the energy and particle number are additive over modes. The grand canonical partition function factorizes:
Dividing the product of Boltzmann weights by this product gives
The marginal mean occupation is therefore
This is the Fermi-Dirac distribution of a noninteracting Fermi gas: the exclusion principle allows only zero or one fermion in each single-particle state, including its spin label.
The grand canonical partition function is
The probabilities in part (i) and their logarithms give
At fixed volume and fixed , differentiate the partition sum:
Combining with the preceding identity yields
The variable held fixed is essential; this is the grand canonical derivative.
For independent weakly coupled systems, insert the product probabilities into the Gibbs entropy. Since each marginal sums to one and the logarithm of a product is a sum,
At fixed total energy and particle number, and . Part (i) gives
Independent exchange variations force both coefficients to vanish. Thus
Maximize the Gibbs entropy subject to normalization and the two mean constraints. Introduce multipliers and differentiate
Stationarity gives . Strict concavity of entropy gives the constrained maximum, on its support. Differentiating the maximum value with respect to the constrained means, or differentiating the entropy along the maximizing distribution and using , gives . The thermodynamic identification is , . Therefore
This is endpoint asymptotics after odd Gaussian cancellation. All interior algebraic terms cancel because is odd. Split the interval into and the remaining tail:
The right-hand integral has its minimum phase at its left endpoint, with and nonzero amplitude . Endpoint Laplace method therefore give
The answer is exponentially small, rather than zero; applying only the interior Gaussian approximation misses the asymmetric boundary tail.
The unique minimum is at zero with phase and amplitude . The interior Laplace method gives
For an additional check, extending to the real line gives the exact Gaussian Fourier integral . The omitted tails are exponentially small, so the displayed leading term follows directly.
Suppose first that the unique interior minimum is nondegenerate, , and . Outside a small neighbourhood of the phase exceeds by a fixed positive amount, so that region is exponentially smaller. Inside, expand
The rescaling and a dominated local Gaussian calculation give the Laplace method
If the minimum is at and , the scale is , giving . At with , replace the denominator by . A stationary quadratic endpoint gives half the interior Gaussian factor.
The printed assumptions do not guarantee nondegeneracy or . More generally, if with and even at an interior minimum, the leading phase scale is and, for , the factor is
At a one-sided endpoint the factor two is absent and the first positive one-sided phase power need not be even. If the amplitude vanishes, expand it to its first contributing term; parity can cancel interior terms. A phase flat to all orders requires its actual local behavior rather than a nonexistent quadratic Taylor coefficient.
For the interior stationary candidate, let . Its formal relation gives
Integration therefore gives . Imposing and yields
This recovers the printed expression algebraically, but does not turn its stationary control into an optimum; it may also violate .
The actual globally optimal wealth from part (ii) is
The budget equation makes the two branches agree at the switch. Direct differentiation gives on both branches, and . This solution remains nonnegative throughout, even though only the terminal nonnegativity constraint was imposed. It provides the complete corrected solution for .
The adjoint equation is , so . For the interior stationary candidate from part (i), writing gives . Therefore it formally has
which derives the printed formula as a stationary, generally nonoptimal candidate.
For the work-then-consume optimum for a nonconcave consumption-leisure utility, the endpoint maximization in part (i) gives
whenever consumption is chosen, and otherwise. Compare the two endpoint values: leisure and consumption are preferred when
Because the unconstrained consumption is increasing in time, there is at most one switch: work first, then cease work and consume at an increasing rate.
Here is a global verification, not just a Pontryagin maximum principle condition. The terminal constraint is equivalent to
For any , pointwise maximization of gives an upper bound on every feasible objective, after adding . A control attaining this pointwise maximum and using the full budget attains the bound, so it is globally optimal.
Let . If
the optimal switch time is and . Otherwise choose the unique such that
The left side of the second equality after substitution decreases strictly from to zero, while the right side increases from to a positive number. Thus the switch exists and is unique. The control is before and after it. It saturates the budget and attains the dual upper bound, completing the proof of optimality for the actual printed parameter range.
The requested properties are not properties of the optimum under the printed assumption . We first derive their origin, and then solve the actual constrained problem.
Put , so , and write the Hamiltonian of an optimal-control problem
For an interior stationary control, gives
This proves the printed identity only as a necessary stationarity condition for an interior candidate.
It fails the required maximization condition. For fixed positive and fixed , maximization over gives
Since , this is strictly convex in . Its maximum on is at an endpoint, not at its interior stationary point. Thus the actual optimum uses , or . On any consumption interval the printed relation would require , although the actual optimal consumption varies with time.
This proves a genuine failure of the printed premise, not just failure to check a boundary condition. If the parameter inequality were reversed and an interior solution stayed within the control bounds, these first-order equations would instead arise from a concave objective.
When , an excursion after the jump from zero to one visits before its reset with probability
This tends to zero, so a catastrophe eventually occurs with probability one. Both the original chain and its jump chain are recurrent.
The expected number of jumps in a return cycle is
Thus the jump chain is null recurrent. But its holding time at has mean , and the initial holding time at zero has mean . The expected elapsed cycle time is
The continuous-time Markov chain is therefore positive recurrent. Its equilibrium distribution, computed as mean time in a state per mean cycle time, is
The entries sum to one by telescoping. The contrast is explained by progressively shorter holding times at the large states, not by a change in return probabilities.
For this linear birth process with catastrophes, the off-diagonal entries of the Q-matrix are
with all other off-diagonal entries zero. The diagonal entries are and for . At zero there is no separate catastrophe transition, because it would not change the state.
The chain is irreducible: every positive state can jump to zero, and from zero any finite sequence of births has positive probability. To prove nonexplosion, couple it with the linear birth process with immigration having birth rate and no catastrophes. Its mean population is finite at each finite time, obtained from , or its exponential holding-time sum diverges since . Couple births monotonically and implement catastrophes with an independent rate- Poisson clock, resetting the smaller population. On a finite time interval the dominating pure-birth process has finitely many births, and the catastrophe clock finitely many rings. Thus the original chain is nonexplosive.
For its jump chain, the transitions are
The literal assertion needs . If , the two geodesic circles coincide, have equal tangent lines at every point, and do not intersect transversally; their intersection is not finite. We prove that close geodesic circles intersect twice for nearby distinct centres, and in fact find exactly two intersections.
Choose a strongly convex normal neighbourhood about and a sufficiently small so that every circle considered and all geodesics joining its points to nearby centres remain there. Squared distance is then smooth in both arguments, and the exponential map is nonsingular on the relevant radius- tangent circles. Consequently all these distance spheres are smooth embedded one-dimensional manifolds.
Write with and , and parameterize by . Define
The first variation of geodesic energy gives
Indeed differentiating the energy of the joining geodesic cancels the interior term by the geodesic equation, leaving the initial endpoint term . This is also the endpoint form of the Gauss lemma.
Since , the quotient extends smoothly to by integrating from zero to . At zero it is , with exactly two simple zeros. The implicit function theorem gives two nearby simple zeros for small positive . Compactness of the unit vector circle makes the choice of small uniform in ; away from fixed neighbourhoods of those two zeros the cosine is bounded away from zero, so there are no additional zeros.
A nonzero angular derivative at either zero says that the defining function of has a nonzero derivative along . Thus their tangent lines differ: the intersections are transverse. Shrinking the neighbourhood of centres accordingly proves
The Gauss lemma says that the radial and angular directions of the exponential map are orthogonal, with radial lengths preserved. On a surface it gives
so the metric in geodesic polar coordinates is .
To prove it, consider a smooth variation of geodesics with unit initial vectors . Put and . Each radial geodesic has constant unit speed, and the Levi-Civita connection is torsion free. Hence
At , because all geodesics start at , so the constant inner product is zero. Unit radial length follows from constant speed. General initial-vector variations split into a radial component, whose image has the same length, and a component tangent to the initial sphere, whose image is orthogonal to it. This proves the full Gauss lemma.
For for which the geodesic exists up to time one, the exponential map is , where and . The initial velocity determines the geodesic uniquely. Since is the identity, this map is a local diffeomorphism near zero.
Choose an orthonormal basis of and set . The geodesic polar coordinates are
in a normal neighbourhood, away from its centre. For sufficiently small positive , the geodesic circle is
within that neighbourhood. Outside the injectivity range the distance sphere need not have this smooth coordinate description.
The same pole-order argument provides a basis
For the first set contains elements, and the second contains . Distinct pole orders imply linear independence, and the coordinate-ring expression proves spanning. Hence
For a function in the space would have no poles anywhere and would vanish at infinity; a regular function on a projective integral curve is constant, so it must be zero. Equivalently the coordinate-ring pole argument first makes it constant, then the vanishing condition excludes nonzero constants.
A rational function with no poles away from is regular on the smooth affine curve. Its ring of regular functions is the coordinate ring
so it has a unique expression with polynomials . This regular-function assertion uses smoothness, hence normality, of the affine curve, not Riemann-Roch theorem.
The nonconstant leading term of has even pole order at infinity, while has odd pole order . These different parities prevent cancellation. Thus no nonconstant such function has a pole of order at most one. 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