The Bendixson-Dulac criterion says the following. Let be a simply connected domain, let be continuously differentiable, and suppose there is a continuously differentiable function such that
has one sign throughout and does not vanish identically on any open subset. Then has no periodic orbit contained in .
Indeed, if a periodic orbit existed, simple connectivity would put its interior inside . The vector field , and hence , is tangent to , so its outward flux is zero. The divergence theorem would give
contradicting the sign hypothesis.
The Poincaré-Bendixson theorem states that a nonempty compact omega-limit set of a continuously differentiable planar flow that contains no equilibrium point is a periodic orbit. More generally, when the omega-limit set contains only finitely many equilibria, it is either an equilibrium, a periodic orbit, or a union of equilibria and connecting trajectories.
For each -element coordinate set , let contain the lower orthants whose finite thresholds occur precisely in the coordinates in . Ignoring the remaining coordinates identifies with the lower-orthant class in , so part (a) gives . Moreover,
is a union of such classes. Part (c) and give
If is shattered by , then all label vectors belong to the union of the label-vector sets generated by the individual classes. The shattering coefficient of a union and the Sauer-Shelah lemma therefore give
Taking base-two logarithms yields
For , apply the stated elementary bound with and :
If , the assertion follows directly from . Taking the largest shattered sample size proves
The Sauer-Shelah lemma states that if , then
In particular, the Sauer-Shelah growth bound gives .
A sample is shattered by when every binary labeling is realized:
The shattering coefficient and VC dimension are
For the lower orthants in , the points are shattered: to realize a subset , choose for and otherwise. Conversely, among any points choose, for each coordinate, one point attaining the maximum in that coordinate. At most points have been chosen, so there is an unchosen point . Any lower orthant containing every chosen coordinate maximizer must contain every sample point, including . It cannot realize the labeling that includes all chosen points and excludes . This proves
Suppose the claim , payable at time , were replicable. Holdings chosen at time zero are constants, so the time- value of any self-financing portfolio has the affine form
But has a continuous positive density on . No affine function of can equal the quadratic function almost surely. Therefore is not attainable and the market is not complete.
The same argument applies if is viewed as a time- claim: once is known at time , its required discounted value at time is fixed, and the first-period portfolio value would still have to reproduce a nonaffine function of .
There is no arbitrage. Indeed, part (iii) supplies an equivalent martingale measure, so the fundamental theorem of asset pricing implies absence of arbitrage. Directly, the discounted terminal value of a zero-cost admissible self-financing strategy is a -martingale with mean zero; it cannot be nonnegative almost surely and positive with positive probability.
Set and
Define a probability measure by the positive density
The density has expectation one and is strictly positive, so is equivalent to . By exponential tilting, the variables remain independent under and have distribution . Thus has a log-normal distribution and
For the discounted stock ,
Hence is an equivalent martingale measure.
The model is a complete market when every contingent claim in the specified class, usually every -measurable payoff satisfying the required integrability condition, is the terminal value of some admissible self-financing portfolio.
Let be a predictable self-financing portfolio, and let be its value. An arbitrage is such a strategy with
Here the total holding rate is
and therefore the jump chain has state-independent transitions
It is an upward biased random walk on . By the strong law of large numbers, almost surely, so . The jump chain, and hence , is transient.
Counting measure is invariant for this jump chain: for every , its incoming mass is . The invariant-measure transfer between a jump chain and a CTMC therefore gives an invariant measure proportional to . Since
the normalized invariant distribution of a continuous-time Markov chain is
This does not contradict transience because an invariant distribution of an explosive chain need not imply positive recurrence.
It remains to verify explosion. Starting from zero, the probability that the biased walk ever reaches is . Once it reaches any state, its probability of returning after departure is
so its expected total number of visits to that state, conditional on reaching it, is . If is the number of visits to , then
Consequently the expected sum of all holding times is
The nonnegative random variable is therefore finite almost surely. By explosion by summable holding times, makes infinitely many jumps by time , so it is explosive.
Write for the total rate of leaving . The jump chain of a continuous-time Markov chain is the discrete-time chain recording the states occupied after successive jumps. Its transition probabilities are
whenever .
The chain is irreducible if every state can be reached from every other state with positive probability. A state is recurrent if, after leaving , the process returns to with probability one; an irreducible chain is recurrent when one, and hence every, state is recurrent.
The continuous-time Markov chain and its jump chain have exactly the same successive states. If is transient, it visits each state only finitely often, so is transient. If is recurrent, it visits a fixed state infinitely often. At those visits, has independent exponential holding times of rate . Their sum diverges almost surely, so explosion cannot occur before all those returns. Hence returns to infinitely often and is recurrent. Thus, for an irreducible chain,

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