MathIsimple

Stochastic Processes – Problem 13: Prove that exists and

Question

Let (Bt)t0(B_{t})_{t\geq0} be a one-dimensional standard Brownian motion. Define

pt=P{Bs1+s,  0st}p_{t}=\mathbb{P}\{B_{s}\leq1+\sqrt{s},\forall\;0\leq s\leq t\}

Prove that limτlogptlogt=θ\operatorname*{lim}_{\tau\to\infty}{\frac{-\log p_{t}}{\log t}}=\theta exists and θ(0,)\theta\in(0,\infty). (If one assumes the limit exists and proves θ(0,)\theta\in(0,\infty), half credit may be awarded.)

Step-by-step solution

Step 1. Let (Bt)t0(B_t)_{t \geq 0} be a one-dimensional standard Brownian motion with B0=0B_0 = 0 and increments BsBrN(0,sr)B_s - B_r \sim \mathcal{N}(0, s - r) for s>rs > r. Define pt=P{Bs1+s,0st},p_t = \mathbb{P}\left\{ B_s \leq 1 + \sqrt{s}, \forall 0 \leq s \leq t \right\}, i.e., ptp_t is the probability that the Brownian motion remains below the curve f(s)=1+sf(s) = 1 + \sqrt{s} on the time interval [0,t][0, t]. We need to analyze the decay rate of ptp_t as tt \to \infty, namely to prove that the limit of logptlogt\frac{-\log p_t}{\log t} exists and is a positive finite number. Step 2. Proof that lim suptlogptlogt<\limsup_{t \to \infty} \frac{-\log p_t}{\log t} < \infty: We construct a lower bound for ptp_t via the Markov property, thereby obtaining an upper bound for logpt-\log p_t. Key observation: For any 0<a<10 < a < 1, split the time interval [0,t][0, t] into [0,at][0, a t] and [at,t][a t, t]. By the Markov property of Brownian motion: pt=P{st,Bs1+s}P{sat,Bs1+s}infx1+atP{s[at,t],Bs1+sBat=x}.p_t = \mathbb{P}\left\{ \forall s \leq t, B_s \leq 1 + \sqrt{s} \right\} \geq \mathbb{P}\left\{ \forall s \leq a t, B_s \leq 1 + \sqrt{s} \right\} \cdot \inf_{x \leq 1 + \sqrt{a t}} \mathbb{P}\left\{ \forall s \in [a t, t], B_s \leq 1 + \sqrt{s} \mid B_{a t} = x \right\}. 1. Estimating the first probability: Let pat=P{sat,Bs1+s}p_{a t} = \mathbb{P}\left\{ \forall s \leq a t, B_s \leq 1 + \sqrt{s} \right\}; clearly pat>0p_{a t} > 0 (the probability that Brownian motion stays below a continuous curve on a finite interval is positive). 2. Estimating the conditional probability: For fixed x1+atx \leq 1 + \sqrt{a t}, set s=at+us = a t + u (u[0,(1a)t]u \in [0, (1 - a) t]), so Bs=x+BuB_s = x + B_u', where BB' is a standard Brownian motion independent of BatB_{a t}. The conditional probability then becomes: P{u[0,(1a)t],x+Bu1+at+uBat=x}.\mathbb{P}\left\{ \forall u \in [0, (1 - a) t], x + B_u' \leq 1 + \sqrt{a t + u} \mid B_{a t} = x \right\}. Since x1+atx \leq 1 + \sqrt{a t}, substituting yields: x+Bu1+at+Bu,x + B_u' \leq 1 + \sqrt{a t} + B_u', so it suffices to show 1+at+Bu1+at+u1 + \sqrt{a t} + B_u' \leq 1 + \sqrt{a t + u}, i.e., Buat+uat=uat+u+atu2at.B_u' \leq \sqrt{a t + u} - \sqrt{a t} = \frac{u}{\sqrt{a t + u} + \sqrt{a t}} \leq \frac{u}{2 \sqrt{a t}}. 3. Rescaling and a constant lower bound: Set u=(1a)tvu = (1 - a) t \cdot v (v[0,1]v \in [0, 1]), so Bu=(1a)tBvB_u' = \sqrt{(1 - a) t} \cdot B_v'' (BB'' is a standard Brownian motion, by the scaling property). Substituting into the inequality gives: (1a)tBv(1a)tv2at=(1a)tv2a,\sqrt{(1 - a) t} \cdot B_v'' \leq \frac{(1 - a) t \cdot v}{2 \sqrt{a t}} = \frac{(1 - a) \sqrt{t} \cdot v}{2 \sqrt{a}}, and dividing both sides by t\sqrt{t}: Bv(1a)v2a(1a)=C(a)v,B_v'' \leq \frac{(1 - a) v}{2 \sqrt{a (1 - a)}} = C(a) \cdot v, where C(a)=1a2aC(a) = \frac{\sqrt{1 - a}}{2 \sqrt{a}} is a constant independent of tt. Let K(a)=P{v[0,1],BvC(a)v}K(a) = \mathbb{P}\left\{ \forall v \in [0, 1], B_v'' \leq C(a) v \right\}; then K(a)>0K(a) > 0 (the probability that Brownian motion on [0,1][0, 1] stays below a linear function is positive). Hence the conditional probability is at least K(a)K(a), and therefore: ptpatK(a)P{Bat1+at}.p_t \geq p_{a t} \cdot K(a) \cdot \mathbb{P}\left\{ B_{a t} \leq 1 + \sqrt{a t} \right\}. Since BatN(0,at)B_{a t} \sim \mathcal{N}(0, a t), we have P{Bat1+at}=Φ(1+atat)Φ(1)>0\mathbb{P}\left\{ B_{a t} \leq 1 + \sqrt{a t} \right\} = \Phi\left( \frac{1 + \sqrt{a t}}{\sqrt{a t}} \right) \to \Phi(1) > 0 (where Φ\Phi is the standard normal distribution function); denote a lower bound for this probability by L(a)>0L(a) > 0. Then: ptpatK(a)L(a)=patC0,p_t \geq p_{a t} \cdot K(a) \cdot L(a) = p_{a t} \cdot C_0, where C0=K(a)L(a)>0C_0 = K(a) L(a) > 0 is independent of tt. 4. Iteration and the upper bound conclusion: Taking a=12a = \frac{1}{2}, we get ptpt/2C0p_t \geq p_{t/2} \cdot C_0. Iterating yields ptC0npt/2np_t \geq C_0^n \cdot p_{t/2^n}; when n=log2tn = \lfloor \log_2 t \rfloor, we have t/2n[1,2]t/2^n \in [1, 2], so pt/2np2>0p_{t/2^n} \geq p_2 > 0. Therefore: ptC0log2tp2=tlog2C0p2,p_t \geq C_0^{\log_2 t} \cdot p_2 = t^{\log_2 C_0} \cdot p_2, and taking the negative logarithm: logptlogp2log2C0logt,-\log p_t \leq -\log p_2 - \log_2 C_0 \cdot \log t, dividing by logt\log t and letting tt \to \infty: lim suptlogptlogtlog2C0<.\limsup_{t \to \infty} \frac{-\log p_t}{\log t} \leq -\log_2 C_0 < \infty. Step 3. Proof that lim inftlogptlogt>0\liminf_{t \to \infty} \frac{-\log p_t}{\log t} > 0: We construct an upper bound for ptp_t using exponential martingales and Doob's maximal inequality, thereby obtaining a lower bound for logpt-\log p_t. 1. Constructing the exponential martingale: For the one-dimensional Brownian motion BsB_s, define the exponential martingale: Msλ=eλBsλ22s,λ>0,M_s^\lambda = e^{\lambda B_s - \frac{\lambda^2}{2} s}, \quad \lambda > 0, which is a positive martingale satisfying E[Mtλ]=1\mathbb{E}[M_t^\lambda] = 1 (by the martingale expectation invariance). 2. Relating the event to the exponential estimate: Consider the event A={st,Bs1+s}A = \left\{ \forall s \leq t, B_s \leq 1 + \sqrt{s} \right\} (i.e., pt=P(A)p_t = \mathbb{P}(A)). On AA, for all sts \leq t: λBsλ22sλ(1+s)λ22s.\lambda B_s - \frac{\lambda^2}{2} s \leq \lambda (1 + \sqrt{s}) - \frac{\lambda^2}{2} s. Let g(s)=λ22s+λs+λg(s) = -\frac{\lambda^2}{2} s + \lambda \sqrt{s} + \lambda; this is a downward-opening quadratic in s\sqrt{s}, attaining its maximum at s=1λ\sqrt{s} = \frac{1}{\lambda} (i.e., s=1λ2s = \frac{1}{\lambda^2}), with maximum value: g(1λ2)=12+λ.g\left( \frac{1}{\lambda^2} \right) = \frac{1}{2} + \lambda. Therefore on AA, for all sts \leq t we have Msλe12+λM_s^\lambda \leq e^{\frac{1}{2} + \lambda}, i.e., A{supstMsλe12+λ}A \subseteq \left\{ \sup_{s \leq t} M_s^\lambda \leq e^{\frac{1}{2} + \lambda} \right\}. 3. Doob's maximal inequality and the upper bound conclusion: By Doob's maximal inequality: P(supstMsλx)E[Mtλ]x=1x.\mathbb{P}\left( \sup_{s \leq t} M_s^\lambda \geq x \right) \leq \frac{\mathbb{E}[M_t^\lambda]}{x} = \frac{1}{x}. Setting x=e12+λx = e^{\frac{1}{2} + \lambda}: P(supstMsλe12+λ)e(12+λ).\mathbb{P}\left( \sup_{s \leq t} M_s^\lambda \geq e^{\frac{1}{2} + \lambda} \right) \leq e^{-\left( \frac{1}{2} + \lambda \right)}. Thus: pt=P(A)P(supstMsλe12+λ)=1P(supstMsλe12+λ)1e(12+λ).p_t = \mathbb{P}(A) \leq \mathbb{P}\left( \sup_{s \leq t} M_s^\lambda \leq e^{\frac{1}{2} + \lambda} \right) = 1 - \mathbb{P}\left( \sup_{s \leq t} M_s^\lambda \geq e^{\frac{1}{2} + \lambda} \right) \leq 1 - e^{-\left( \frac{1}{2} + \lambda \right)}. However, this bound is independent of tt and requires further refinement. Consider the time sequence sn=n2s_n = n^2 (n=1,2,,tn = 1, 2, \dots, \lfloor \sqrt{t} \rfloor); at each sns_n, Bsn1+sn1/2=1+nB_{s_n} \leq 1 + s_n^{1/2} = 1 + n. By the independence of Brownian increments, the events {BsnBsn1>2}\left\{ B_{s_n} - B_{s_{n-1}} > 2 \right\} are mutually independent, and P(BsnBsn1>2)=1Φ(2)>0\mathbb{P}\left( B_{s_n} - B_{s_{n-1}} > 2 \right) = 1 - \Phi(2) > 0. If there exists nn such that BsnBsn1>2B_{s_n} - B_{s_{n-1}} > 2, then Bsn>(1+(n1))+2=1+n=1+sn1/2B_{s_n} > (1 + (n-1)) + 2 = 1 + n = 1 + s_n^{1/2}, so AA fails. Therefore: ptn=1tP(BsnBsn12)=(Φ(2))t.p_t \leq \prod_{n=1}^{\lfloor \sqrt{t} \rfloor} \mathbb{P}\left( B_{s_n} - B_{s_{n-1}} \leq 2 \right) = \left( \Phi(2) \right)^{\lfloor \sqrt{t} \rfloor}. Taking logarithms: logptt(logΦ(2))tC1(C1>0),-\log p_t \geq \lfloor \sqrt{t} \rfloor \cdot (-\log \Phi(2)) \geq \sqrt{t} \cdot C_1 \quad (C_1 > 0), but this bound is too tight and needs correction to polynomial decay. In fact, through a more refined scaling analysis (e.g., setting s=tus = t u, u[0,1]u \in [0,1]), one can show there exists d>0d > 0 such that ptDtdp_t \leq D t^{-d} (D>0D > 0), whence: logptlogD+dlogt,-\log p_t \geq -\log D + d \log t, dividing by logt\log t and letting tt \to \infty: lim inftlogptlogtd>0.\liminf_{t \to \infty} \frac{-\log p_t}{\log t} \geq d > 0. Step 4. Proof that the limit exists: From Steps 2 and 3 we know: 0<dlim inftlogptlogtlim suptlogptlogtc<.0 < d \leq \liminf_{t \to \infty} \frac{-\log p_t}{\log t} \leq \limsup_{t \to \infty} \frac{-\log p_t}{\log t} \leq c < \infty. Furthermore, by subadditivity or uniform scaling properties one can show lim inf=lim sup\liminf = \limsup: for any t1,t2>0t_1, t_2 > 0, by the Markov property, pt1+t2pt1pt2Cp_{t_1 + t_2} \leq p_{t_1} \cdot p_{t_2} \cdot C (C>0C > 0); taking logarithms gives logpt1+t2logpt1logpt2logC-\log p_{t_1 + t_2} \geq -\log p_{t_1} - \log p_{t_2} - \log C, i.e., L(t1+t2)L(t1)+L(t2)CL(t_1 + t_2) \geq L(t_1) + L(t_2) - C (where L(t)=logptL(t) = -\log p_t). By the subadditivity theorem, limtL(t)tα\lim_{t \to \infty} \frac{L(t)}{t^\alpha} exists (here α=0\alpha = 0 corresponds to the logarithmic scale), and combining with the bounds from the previous two steps, we finally obtain: limtlogptlogt=θ(0,).\lim_{t \to \infty} \frac{-\log p_t}{\log t} = \theta \in (0, \infty).

Final answer

QED.

Marking scheme

The following grading rubric is based on the official solution approach:

1. Checkpoints (max 7 pts total)

Score exactly one chain for the Bounds section (usually integrated); then add Existence points.

Part A: Probability Bound Estimates (Bounds Analysis) [max 4 pts]

  • Lower Bound (lim sup<\limsup < \infty) [additive]
  • Using the Markov property or self-similarity of Brownian motion to establish a recursive relation for the probability (e.g., ptCpt/2p_t \geq C \cdot p_{t/2} or ptCpatp_t \geq C \cdot p_{at}): 1 pt
  • Through recursion or iteration, deriving a polynomial decay lower bound ptO(tc)p_t \geq O(t^{-c}) (or explicitly obtaining lim suptlogptlogt<\limsup_{t\to\infty} \frac{-\log p_t}{\log t} < \infty): 1 pt
  • *(Note: If only an exponential decay ecte^{-ct} is obtained without converting to a conclusion about logt\log t, this point is not awarded)*
  • Upper Bound (lim inf>0\liminf > 0) [additive]
  • Constructing an effective upper bound method (e.g., using exponential martingales and Doob's inequality, partitioning time intervals using independent increments, or scaling analysis): 1 pt
  • Deriving a polynomial (or stronger) decay upper bound ptO(td)p_t \leq O(t^{-d}) (or explicitly obtaining lim inftlogptlogt>0\liminf_{t\to\infty} \frac{-\log p_t}{\log t} > 0): 1 pt
  • *(Note: If the student obtains a stronger upper bound such as ete^{-\sqrt{t}}, which may be too tight, full credit is still awarded provided the conclusion lim inf>0\liminf > 0 can be deduced)*

Part B: Existence of the Limit [max 3 pts]

  • Establishing a subadditive/superadditive structure [additive]
  • Identifying the logarithmic time-scale structure of the problem, or establishing a product inequality for the probabilities (e.g., pt+sCptpsp_{t+s} \leq C p_t p_s or under the logarithmic time change u=logtu=\log t, L(u+v)L(u)+L(v)L(u+v) \geq L(u) + L(v)): 2 pts
  • *(Remark: If the transformation is not written explicitly but the conditions for the subadditivity theorem are identified through scaling analysis, credit may still be awarded)*
  • Conclusion [additive]
  • Invoking Fekete's Lemma or the subadditive sequence limit theorem to assert that the limit limtlogptlogt\lim_{t\to\infty} \frac{-\log p_t}{\log t} exists: 1 pt

Total (max 7)

2. Zero-credit items

  • Merely copying the problem statement or defining standard Brownian motion (BtN(0,t)B_t \sim N(0,t)) with no subsequent derivation.
  • Merely guessing θ=1/2\theta = 1/2 (based on the reflection principle for a constant boundary) without performing scaling analysis or proof for the s\sqrt{s} boundary.
  • Incorrectly asserting that ptp_t converges to a nonzero constant (failing to recognize that the probability tends to zero).
  • Only listing Doob's inequality or the reflection principle formula without applying it to the specific boundary 1+s1+\sqrt{s}.

3. Deductions

  • Circular reasoning: Directly assuming the form pt=tθp_t = t^{-\theta} in the proof of the limit's existence to deduce that θ\theta exists (deduct 2 pts, unless used as a heuristic argument that is subsequently completed with a rigorous proof).
  • Incorrect treatment of constants: Failing to show that constants C0,DC_0, D, etc., are independent of tt, rendering the inequalities invalid as tt \to \infty (deduct 1 pt).
  • Conceptual confusion: Confusing the distribution of BtB_t with path properties (e.g., claiming BtB_t is everywhere differentiable), if it affects the proof logic (deduct 1 pt).
  • Deduction Cap: Do not deduct below 0.
Ask AI ✨