A finite bound on ordinary peak-to-trough
financial drawdown does
not follow. Choose
a long alternating
sequence of
driving signs,
at=(−1)t. It produces
Xt=−1+(−1)t, alternating
−2 and
0. The price never recovers during that episode and its cumulative loss grows without bound
as the episode
length grows. Every finite such
driving sequence has positive
probability. Thus
no finite worst drawdown magnitude or duration exists without a horizon bound. More precisely, over an
N-
month window and over admissible starting
histories, the maximum possible drawdown is
One derivation keeps the last two
signs as a four-state
dynamic program. Let
dn(a,b) be the smallest cumulative
increment after
n steps ending with
signs (a,b), with
d0(a,b)=0 for each permitted initial
pair. Then
dn+1(b,c)=mina=±1[dn(a,b)+ab+c]. Induction gives the negative of the displayed minimum. The bound is attained by
increments (−2,0)k,−2 for
N=2k+1, or
(−2,0)k−1,−2,−2 for
N=2k, so it is also an attained peak-to-trough loss over
N months, not only an algebraic net
displacement bound.
For comparison, the index with
increments at=±1 has
Dmax(N)=N, attained by
N successive negative
signs; it too has no finite horizon-
free bound. If “drawdown” were intended to
mean a strictly decreasing consecutive run, the
first model permits at most two successive
−2 increments, for
a loss of four over two
months, whereas the simple walk permits arbitrarily long such runs. That different run
statistic must not be substituted for the usual drawdown
definition: zero
increments can separate continuing losses without any recovery.