Question
Let be a one-dimensional standard Brownian motion. Define
Prove that exists and . (If one assumes the limit exists and proves , half credit may be awarded.)
Step-by-step solution
Step 1. Let be a one-dimensional standard Brownian motion with and increments for . Define i.e., is the probability that the Brownian motion remains below the curve on the time interval . We need to analyze the decay rate of as , namely to prove that the limit of exists and is a positive finite number. Step 2. Proof that : We construct a lower bound for via the Markov property, thereby obtaining an upper bound for . Key observation: For any , split the time interval into and . By the Markov property of Brownian motion: 1. Estimating the first probability: Let ; clearly (the probability that Brownian motion stays below a continuous curve on a finite interval is positive). 2. Estimating the conditional probability: For fixed , set (), so , where is a standard Brownian motion independent of . The conditional probability then becomes: Since , substituting yields: so it suffices to show , i.e., 3. Rescaling and a constant lower bound: Set (), so ( is a standard Brownian motion, by the scaling property). Substituting into the inequality gives: and dividing both sides by : where is a constant independent of . Let ; then (the probability that Brownian motion on stays below a linear function is positive). Hence the conditional probability is at least , and therefore: Since , we have (where is the standard normal distribution function); denote a lower bound for this probability by . Then: where is independent of . 4. Iteration and the upper bound conclusion: Taking , we get . Iterating yields ; when , we have , so . Therefore: and taking the negative logarithm: dividing by and letting : Step 3. Proof that : We construct an upper bound for using exponential martingales and Doob's maximal inequality, thereby obtaining a lower bound for . 1. Constructing the exponential martingale: For the one-dimensional Brownian motion , define the exponential martingale: which is a positive martingale satisfying (by the martingale expectation invariance). 2. Relating the event to the exponential estimate: Consider the event (i.e., ). On , for all : Let ; this is a downward-opening quadratic in , attaining its maximum at (i.e., ), with maximum value: Therefore on , for all we have , i.e., . 3. Doob's maximal inequality and the upper bound conclusion: By Doob's maximal inequality: Setting : Thus: However, this bound is independent of and requires further refinement. Consider the time sequence (); at each , . By the independence of Brownian increments, the events are mutually independent, and . If there exists such that , then , so fails. Therefore: Taking logarithms: but this bound is too tight and needs correction to polynomial decay. In fact, through a more refined scaling analysis (e.g., setting , ), one can show there exists such that (), whence: dividing by and letting : Step 4. Proof that the limit exists: From Steps 2 and 3 we know: Furthermore, by subadditivity or uniform scaling properties one can show : for any , by the Markov property, (); taking logarithms gives , i.e., (where ). By the subadditivity theorem, exists (here corresponds to the logarithmic scale), and combining with the bounds from the previous two steps, we finally obtain:
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 () [additive]
- Using the Markov property or self-similarity of Brownian motion to establish a recursive relation for the probability (e.g., or ): 1 pt
- Through recursion or iteration, deriving a polynomial decay lower bound (or explicitly obtaining ): 1 pt
- *(Note: If only an exponential decay is obtained without converting to a conclusion about , this point is not awarded)*
- Upper Bound () [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 (or explicitly obtaining ): 1 pt
- *(Note: If the student obtains a stronger upper bound such as , which may be too tight, full credit is still awarded provided the conclusion 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., or under the logarithmic time change , ): 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 exists: 1 pt
Total (max 7)
2. Zero-credit items
- Merely copying the problem statement or defining standard Brownian motion () with no subsequent derivation.
- Merely guessing (based on the reflection principle for a constant boundary) without performing scaling analysis or proof for the boundary.
- Incorrectly asserting that 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 .
3. Deductions
- Circular reasoning: Directly assuming the form in the proof of the limit's existence to deduce that 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 , etc., are independent of , rendering the inequalities invalid as (deduct 1 pt).
- Conceptual confusion: Confusing the distribution of with path properties (e.g., claiming is everywhere differentiable), if it affects the proof logic (deduct 1 pt).
- Deduction Cap: Do not deduct below 0.