True. Divide a limit ordinal by using part a: with . If , the right side is a successor, contrary to the limit assumption. Hence and . For a nonzero limit, ; if zero is allowed as a limit, it is represented by .
Under the convention that a limit ordinal is nonzero and not a successor, the assertion is false at , since . It is true for . If , then has no greatest predecessor. If is a nonzero limit, , again a nonzero limit. If zero is counted as a limit ordinal by convention, the unrestricted assertion is true with that convention.
False. For and , the left side is , whereas the right side is .
True. This is left distributivity of ordinal multiplication. Fix and induct on . The zero case is immediate. The successor step uses and associativity of ordinal addition. At a limit, multiplication and addition are continuous in their right argument, so taking suprema of the earlier equalities gives .
False. Take , . For finite , with is finite. For infinite , implies . Neither case gives the required expression.
True. For , multiplication is strictly increasing and continuous at limit ordinals, and . Thus there is a greatest with : the set is bounded, and its supremum still satisfies the inequality by continuity if it is a limit. The remaining ordered interval in has an ordinal order type , so . If , then , contradicting maximality. Hence .
Differentiate and use , with . Division by gives
This is homogeneous adiabatic expansion without entropy production or exchange across the comoving element.
The origin has Jacobian and is unstable because . At a positive equilibrium, , giving
The linearization is
Its trace is and determinant . Elimination gives . For distinct roots,
At a repeated root replace the first expression by and use .
As , , so the roots approach one and zero. The characteristic polynomial at one is , putting the larger real root just below one and the other positive root below it. No real root can ever equal one. Moreover
since its numerator exceeds . At , , so the roots are conjugate and nonreal. Just above this point their modulus is .
The unit-disc conditions are , , and . The last two hold automatically here, so stability is equivalent to . The unique crossing and its eigenvalue argument satisfy
Indeed . This is the stability threshold of a discrete exponential predator-prey model. The sketch uses : the real moduli merge and then coincide, increasing through one at the threshold. Linearization decides stability below and instability above; it does not determine nonlinear stability exactly at the crossing.
Figure 1.
Eigenvalue moduli and the stability threshold of the discrete predator-prey model
. Details.
Use as the time unit and define , . Direct substitution gives the dimensionless equations
is the interval between generations or censuses, and the prey multiplication without predators. The factor can be the probability of escaping a Poisson number of encounters with mean , so measures attack intensity. The factor converts prey resources into predator recruitment, and modifies the fraction of prey contributing no recruitment. At predators recruit from attacked prey; adds background recruitment, even at . A population interpretation valid at every nonnegative state needs , since otherwise the second equation gives negative recruitment near .
Let be the uniform closure on of polynomials. It is a closed algebra: uniform convergence on a compact set is preserved under sums and products. For , put and . If , then and
The series converges uniformly, its ratio having modulus at most one half. Each partial sum is in , so its limit is too. Hence in this neighbourhood. For empty , approximation is vacuous and the assertion is immediate.
All poles lie outside some circle with . The rational function is holomorphic in that disc, so its Taylor series at zero converges uniformly on . Its polynomial partial sums therefore approximate uniformly on . If there are no finite poles, the function is already a polynomial.
For an matrix here, . The sine vectors give eigenvalues
Thus every eigenvalue lies strictly between and . For , , so , including the upper endpoint . Hence the iteration converges for the entire stated range.
The extreme eigenvalues are and , with . The spectral radius is for . It decreases up to one and increases after one, since . Therefore
For the same formula gives zero spectral radius and exact solution in one ordinary Jacobi step.
Positive definiteness of implies . Let , a symmetric positive definite matrix. The additional hypothesis says , so all eigenvalues of satisfy . The ordinary Jacobi error matrix is similar to and therefore has eigenvalues . Its spectral radius is less than one. The convergence criterion for stationary linear iterations consequently gives convergence from every starting vector.
With invertible, the weighted Jacobi method is
Each new component uses only the previous iterate's components; is ordinary Jacobi iteration. Errors evolve by .
Balance the time derivative, cubic dispersion and quadratic transport using the cylindrical KdV equation similarity ansatz , on . For the same real cube-root convention can be used separately. Substitution and removal of the common factor give
Every term is a total derivative: and . Integration therefore gives the requested second-order equation
where is a constant determined by any additional boundary data. No condition in the question forces .
The Cole-Hopf transformation for the sign convention here is , with and . Indeed , so
Conversely a solution determines a locally nonzero through , ; their compatibility is this Burgers equation. A spatially constant term can be removed by rescaling in time.
Set in the heat-equation pair. Division by gives
Their compatibility can be checked without referring back to : writing , , we have , . The coefficient of in is , and the constant term is . Thus this linear auxiliary pair is compatible exactly for the required viscous Burgers equation. As in part (a), adjoining a constant component turns it into a homogeneous matrix Lax pair.
Let . Expanding shows that the required flux is
Indeed , cancelling the from the time derivative. Introduce a potential by , . Equality of its mixed derivatives is precisely the conservation law. With , these equations become the linear auxiliary system
This is a Lax pair in the affine-potential form used for linear evolution equations. If a homogeneous matrix pair is preferred, set and use , . Its zero-curvature condition has upper-right entry and all other entries zero.

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