A backtest on a price that moves up or down by one currency unit each period, with equal probabilities, holds one share long before every up move and one share short before every down move. It earns one unit in every period on every path at zero cost, which looks like an arbitrage. The arithmetic is right and the timing is wrong, because each holding uses a price move that has not happened when the position is opened. This lesson makes the timing precise with filtrations, adapted and predictable processes and stopping times, and shows on a four-path model that predictable trading against increments with conditional mean zero earns nothing on average.
Key terms
Adapted process
Definition Fix a probability space and a time set , either the dates or the interval . A filtration is a family of sigma algebras with
where an event belongs to when the information available at time decides whether it has occurred. A stochastic process is a family of random variables on , one for each time. It is adapted to the filtration when
for every . The natural filtration is the smallest filtration to which is adapted. Adaptedness is a statement about information only. It says nothing about continuity or smoothness, or about how well future values can be forecast, and a process adapted to one filtration need not be adapted to a smaller one.
In plain words A filtration is the growing record of what the model lets a trader know, and a process is adapted when its current value can be read off that record. Information is never forgotten as time passes, and the inclusion says nothing about prices going up.
Example In a constructed two-period model, two independent fair coins give price moves in currency units, each value with probability . Let be the price at date minus the price at date , so , and . The natural filtration has the trivial , the sigma algebra generated by the two atoms and , and containing every subset of the four paths. The process is adapted. The process for is not, because is not constant and so is not -measurable.
Predictable process
Definition In discrete time, let be the number of shares held from date to date , for . The strategy is predictable when each is -measurable, so every holding is fixed with the information available when the position is opened. Many texts index the same holding by the right endpoint of its period, and then predictability says that the holding over the period from to is -measurable. The gain process, in currency units, is
Suppose is a martingale under for the filtration, so each is integrable and with , and suppose each is bounded. Then the known factor comes out of the conditional expectation,
so is a martingale and for every . Boundedness of can be weakened to integrability of each product . The argument uses that is -measurable and fails for a holding that depends on .
In plain words A predictable holding is decided before the price move it earns. Against price moves whose conditional mean is zero, such a holding multiplies a zero conditional mean, so it cannot produce an average profit, however cleverly it reacts to the past. In pricing, the same argument is applied to discounted prices under a pricing measure.
Example In the two-coin model, hold share through the first move, then shares if and if . Both holdings are predictable, and the four equally likely paths give these gains.
| Path | Gain |
|---|---|
The mean is . After an up move the two remaining gains and average to , which is exactly , and after a down move both paths end at . So , and doubling the position after a gain adds no conditional average profit.
Predictable sigma algebra
Definition In continuous time with a filtration , the predictable sigma algebra is the sigma algebra on generated by all adapted processes with left-continuous paths, each viewed as the map . Equivalently, it is generated by the sets with and with and . A process is predictable when it is measurable with respect to . A simple predictable process has the form
with times and each bounded and -measurable, and its gain against a price up to time is . Every left-continuous adapted process, in particular every continuous adapted process, is predictable, and every predictable process is adapted. An adapted process with jumps need not be predictable.
In plain words The predictable sigma algebra is the continuous-time form of deciding at the left end of each interval. A holding that is chosen at and kept on the interval from to , left end excluded, is predictable, and so is anything built from such holdings by limits. Such a holding may use everything known just before time , but not a jump that happens at time itself.
Example Embed the two-coin model in continuous time, with for and the price jumping at times and . The holding equal to on and to on is simple predictable, and its gain is the of the table above. The holding equal to on is not even adapted, since is not -measurable for . With jumps, adaptedness alone is not enough. Let be a Poisson process with intensity and , a martingale. The holding , equal to at the jump times and otherwise, is adapted but not predictable. Its pathwise Stieltjes gain on is the number of jumps , with mean at no cost, because the position is opened at the instant of the jump it collects. The left limit is predictable.
Stopping time
Definition A random time with values in is a stopping time for the filtration when
for every . In discrete time this is equivalent to for every date . The value means that the event never happens. Constant times are stopping times, and so are the minimum and the maximum of two stopping times. For a continuous adapted price and a lower barrier , the first hitting time
with , is a stopping time. The set of levels at most is closed, so exactly when the minimum of over is at most , and by continuity that minimum equals the infimum over the rational times in together with , which is -measurable. For the strict condition the first hitting time is a stopping time once the filtration is right-continuous, which is one reason for the usual conditions below.
In plain words A stopping rule is legitimate when at every time you can tell from what you have seen whether you have already stopped. You do not need to know in advance when that will happen. A rule that needs the rest of the path, such as stopping at the highest price of the period, fails this test.
Example In the two-coin model, stop at the first up move, or at date if there is none. Then , and , so is a stopping time. Now let be the first date at which reaches its maximum over the dates , and . On the path the values are and , while on they are and . The two paths agree up to date , yet only one of them has stopped there, so and is not a stopping time. The rule that stops at date exactly when fails for the same reason.
Usual conditions
Definition A filtered probability space satisfies the usual conditions when the probability space is complete, contains every -null set of , and the filtration is right-continuous, which means for every , where
Every filtration can be enlarged to a smallest filtration that satisfies both conditions, its usual augmentation. Completeness ensures that a process equal at each time, almost surely, to an adapted process is itself adapted. Right-continuity ensures that the first time a right-continuous adapted process enters an open set is a stopping time. A standard result, stated here without proof, is that the completed natural filtration of a Brownian motion is already right-continuous and that the process is still a Brownian motion for it. This lesson defines the usual conditions and uses them only as hypotheses.
In plain words Completeness says that events of probability zero never decide anything. Right-continuity says that whatever is known at every moment after is already known at . They are conventions that make hitting times and modified versions of processes behave well, and they never add information beyond what the model reveals at times arbitrarily close to .
Example Let equal or with probability each, the direction of a trend that shows immediately, and let . The natural filtration has , since , and for every . Hence , and the filtration is not right-continuous. The first time enters the open set is when and when . The event is not in , so is not a stopping time for the natural filtration, although it is one for the right-continuous filtration .
Anticipatory strategy
Definition A trading strategy is anticipatory when some holding is not measurable with respect to the information available when the position is opened, so in discrete time some is not -measurable. Its gains are outside the predictable-gain argument above, and an exercise or stopping rule that is not a stopping time anticipates in the same sense. Revealing a future move early, by replacing with a larger filtration for which is -measurable, changes the model. Then , so the increment no longer has conditional mean zero unless it is zero almost surely, and is not a martingale for .
In plain words An anticipatory strategy peeks at the future. Its backtested profit comes from the timing error, not from the trading idea, and a conclusion such as “predictable gains have mean zero” holds only together with the information assumption it was proved under.
Example In the two-coin model, keep but set , the sign of the second move. The second-period gain is on every path, so , and the second trade on its own is a costless position that pays one unit in every state. It is not an arbitrage of the model, because is not -measurable. On the atom it equals on one path and on the other, while every predictable is constant on each atom and gives
Check yourself
- In the two-coin model with , decide whether each random time is a stopping time. The first is the first date at which , with the value if that never happens. The second is the last of the dates , and at which .
Show the answer
List the paths. On the values are , on they are , on they are , and on they are .
The first hitting time of , call it , is on the two paths that start with an up move and on the two that start with a down move. So and , which lies in . It is a stopping time.
The last date with , call it , is on and , and on and . So , which is not in the trivial . It is not a stopping time. Deciding at date that this is the last visit to requires knowing that the path will not come back, and last exit times typically look into the future in this way.
- In the two-coin model let the share price be currency units, take a zero interest rate, and use the fair-coin probabilities as pricing weights, under which this price is a martingale. An American put with strike pays if exercised at date . A simulation exercises on each path at the date with the largest payoff and averages the results. Compute that average and the value over stopping times with values in , and explain the difference.
Show the answer
On the paths and the payoffs are at every date. On they are , and on they are . The best payoffs in hindsight are , with average
Backward induction over stopping times, as in American options and optimal stopping, starts with the value at date . At date after an up move both exercise and continuation are worth . After a down move exercise pays and continuation is worth , so the value is . At date exercise pays and continuation is worth , so the value is .
The hindsight rule exercises at date on and at date on . These paths agree up to date , so the rule is not a stopping time. Since for every stopping time , picking the best date path by path never gives less than the value, and here it overstates the value by .
- Let be a martingale in a discrete model and a stopping time. Show that the stopped price is a gain from a predictable strategy,
and deduce that when for a fixed date . Check this for the stopping time “first up move, or date ” in the two-coin model. Then explain why the first time a symmetric random walk started at reaches has without contradicting the result.
Show the answer
The holding is bounded and -measurable, because is the complement of . It equals for and for , so the sum keeps exactly the increments up to date and telescopes to . By the predictable-gain argument, for every . If , then , and so .
In the two-coin model, with when , and with , which is or , when . Then .
For the random walk, the first passage time to is a stopping time, and it is finite with probability one, a standard recurrence result not proved here. Since whenever is finite, . Each still holds, but this is unbounded and the limit in cannot be taken inside the expectation. Being a stopping time is not enough on its own, and optional sampling results need further conditions such as boundedness.