Let and . Given , the next value is one of . The martingale property makes its upward and downward conditional probabilities equal; their sum is the conditional variance of the increment, . Thus
The discrete Dupire equation therefore recovers all positive-probability one-step conditional transitions from the European call option price surface. No Markov property is required: these are conditional probabilities given the current value, not necessarily given the whole past.
Recovery is impossible at a zero-probability state. For example, satisfies every stated assumption, but at a different integer can satisfy while . Its conditional transitions can be specified arbitrarily without altering . Thus the literal all-states claim needs the positive-probability qualification.
Taking expectations in the single-step discrete Tanaka formula, the martingale transform term vanishes because is bounded and -measurable. Hence
At a state with , the tower property of conditional expectation gives , so the conditional second moment of the increment is . Part (a) gives . Combining these identities yields the discrete Dupire equation
The conditional variance needs a positive-probability conditioning state. The bound does not guarantee . If , both the call-price curvature and the time increment above are zero; the equation can be extended by assigning an arbitrary finite value to at such a state, but its conditional variance is not determined there.
For an integer and , verify the single-step identity
If , the positive part is linear across the step and ; if , it remains zero and . At , , which is checked for the three permitted values of .
Apply this with and , and telescope over . The result is the discrete Tanaka formula
The first sum is a martingale transform; the second records the correction at the kink of the positive part. The algebraic identity itself needs only the integer values and permitted increments, not the martingale property.
Since the initial value and increments are integers, is an integer. If , all three positive parts in the second difference are zero. If , the second difference is , including . At it equals . Thus
The original PDF has the first term ; the TeX's is an extraction error. This discrete call-price curvature identity isolates an individual integer state.
A unit-face-value zero-coupon bond pays at maturity. The martingale deflator pricing identity is
Use the affine process Markov property with respect to the market filtration; if that filtration contains extra predictive information, the natural Markov property alone would not suffice. Part (b), with every future coefficient equal to , gives the exponential-affine form. More explicitly, the exponential-affine bond pricing recursion is
Indeed, conditioning the first future step in an -step horizon transforms into . Therefore
This uses the true martingale deflator pricing identity; a merely local martingale deflator would not by itself justify replacing prices by conditional terminal expectations.
Iterating the autoregressive process of order one gives
For , regrouping the sum of the exponents gives
The independent innovations factorize the moment-generating function. Consequently
Finite sums avoid a division by , so these formulas include and ; zeroth powers in these sums are .
Use the time-homogeneous Markov property and define backward effective parameters by
Conditioning the last exponential factor on replaces by . Repeating the tower property of conditional expectation combines this with the preceding exponent, then with each earlier exponent. The last remaining conditional transform is at time , so
These are finite because the one-step affine process transforms are finite at every real parameter. The argument establishes the entire joint affine transform, including when the coefficients have different signs.
Assume the innovations are independent of the previous history and have finite exponential moments at every real argument, as required by the finite-valued affine definition. Conditioning on gives
Hence the autoregressive process of order one is an affine process, with
Here and in the remaining parts, an affine process uses a time-homogeneous Markov process: the one-step transform is the same at every time. The displayed definition at time alone would not determine later transitions of an arbitrary time-inhomogeneous Markov process.
For fixed integers , belongs to and there. The supermartingale property and nonnegativity imply
Therefore almost surely on . Taking the finite union over gives on almost surely; taking the countable intersection over all integer makes the assertion simultaneous at every time. Thus zero is absorbing for a nonnegative supermartingale in discrete time.
Take an increasing localizing sequence for and define the stopping times
The predictable process condition makes a stopping time. For each fixed finite time range, the finitely many coefficients are finite almost surely; hence almost surely.
The stopped martingale transform can be written
Its coefficient is -measurable and bounded in absolute value by . Each summand is consequently integrable with zero conditional expectation given , since is a true martingale. Thus is a true martingale and
The original PDF fixes ; the TeX extraction omits this equality.
Under the standard local martingale definition, is integrable. For a nonnegative , the Fatou lemma and a localizing sequence give
Hence every is integrable, and part (a) applies. Therefore a nonnegative discrete-time local martingale is a true martingale. This is stronger than the continuous-time supermartingale conclusion.
Let be a localizing sequence for the discrete-time local martingale . For , the increment of the stopped martingale is
and . Thus, for any ,
The assumed integrability gives the dominating random variable . The dominated convergence theorem now yields , or . Iterating the tower property of conditional expectation proves an integrable discrete-time local martingale is a true martingale. The proof uses the discrete-time increment indicator; the conclusion does not extend to continuous time.
Write for holdings of cash, the stock and the European put option, and let be initial consumption. At the given price, , and the three terminal payoffs, in descending order of the stock price, are
Nonnegative terminal payoffs require and . Together with , these imply . If they force , which is not an arbitrage. If , the highest-state payoff is at least , so every such choice is an arbitrage. Consequently the complete set is
The pure-investment arbitrages are exactly the choices :
For example, costs zero and pays .
Write for the state probabilities under an equivalent martingale measure. Since cash is constant and the European put option pays only in the lowest state, the pricing equations are
Their unique solution is , , . Every physical state has positive probability, so equivalence requires all three values to be strictly positive. Thus
For each price in this open interval the pricing kernel takes values in the three equally likely states, proving absence of arbitrage.
The necessity, including the exclusion of endpoints, can also be checked directly. The three terminal payoff vectors of cash, the stock and the European put option form the invertible matrix
Each unit state payoff therefore has a replicating strategy, whose initial cost is the corresponding . A zero or negative supplies an arbitrage, so the endpoints are genuinely excluded.
For any holdings , the pricing kernel identity implies . If almost surely, then , so an arbitrage cannot have . If also , then the nonnegative integrable random variable has zero expectation and hence is zero almost surely. Since almost surely, almost surely, ruling out a positive terminal gain. Therefore a pricing kernel rules out arbitrage.
A pricing kernel is a strictly positive random variable such that is integrable and
It is a one-period state-price density, converting a terminal payoff into its initial price. Strict positivity means almost surely, not merely . When cash has price at both dates, this identity forces , so defines an equivalent martingale measure.
For holdings , let and . Under the investment-consumption arbitrage convention used here, an arbitrage satisfies
The initial consumption is , and the terminal consumption is : there is a possible gain with no external funding and no negative consumption. A pure-investment arbitrage additionally requires . This convention is important because the last part distinguishes initial consumption from pure investment.
For the exponential distribution with mean , and . Therefore
Since ties have probability zero, . Taking expected values in the definition of gives
There is also an imputation interpretation. If A is observed first, ; if B censors A, memorylessness of the exponential distribution and independence imply that the remaining mean lifetime is . Thus is the conditional expectation of given the observed minimum and censoring indicator. The tower property of conditional expectation gives the same equality. This does not say that and have the same distribution.
The minimum exceeds exactly when both times exceed . By independence,
Differentiating its survivor function gives
The tail integral formula for moments then gives
Equivalently, integration by parts in gives . The assumed makes the boundary term vanish, since .
The stated tail condition does not itself guarantee a finite mean. For example, the proper survivor functions
satisfy , but their product behaves as , whose integral diverges. Thus the displayed expectation is valid as an extended nonnegative value; finiteness needs integrability of the product. The exponential distribution in the next part guarantees that finiteness.
Let , and assume so that both conditional distributions are defined. By independence, the joint density of and is , whereas the joint density of and is . Normalizing gives
Both are densities of the latent event time . The second is not the density of the observed first event in cases where B wins. Their integrals are 1 by the definitions of and its complement.

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