Question
Suppose is a standard Brownian motion, and suppose is a continuous function with . Prove that for any ,
Step-by-step solution
Step 1. Since is continuous on the closed interval , it is uniformly continuous. Given , there exists such that whenever with , we have . Choose a positive integer such that , and partition into equal subintervals with partition points . Then for each , we have .
Step 2. Define the event as the event that for all . Note that and , so the inequality at holds automatically. The finite-dimensional distributions of Brownian motion are multivariate normal, and such distributions have strictly positive joint density on all of . Therefore, the probability is strictly positive.
Step 3. For any point , there exists some such that lies in . By the triangle inequality: Since , the distance between and is at most , so by uniform continuity of , . Since event includes , combined with the continuity of Brownian motion paths and the boundedness of , we can deduce . Substituting into the inequality:
Step 4. From Step 3, whenever event occurs, necessarily holds, meaning is a subset of . By monotonicity of probability, since :
Final answer
QED.
Marking scheme
This rubric is designed for an undergraduate/graduate level mathematics grader, targeting the Support Theorem for Brownian motion. The rubric is based on the official discretization proof path while also accommodating the Girsanov transform approach from advanced probability theory.
1. Checkpoints (max 7 pts total)
Score exactly one chain; take the maximum subtotal among chains; do not add points across chains.
Chain A: Discretization and Uniform Continuity Method (Official Solution Approach)
- Uniform continuity and grid setup (2 pts)
- State that is continuous on the closed interval and hence uniformly continuous, or directly argue that a sufficiently fine partition can be chosen. [1 pt]
- Establish specific partition points (or choose ) so that the oscillation of on each subinterval is less than a specific threshold (such as or ). [1 pt]
- Positive probability of finite-dimensional distributions (2 pts)
- Define the skeleton event , requiring at partition points to fall within a neighborhood of (e.g., ). [1 pt]
- Cite that the finite-dimensional distributions of Brownian motion (multivariate normal) have strictly positive density on , thereby concluding . [1 pt]
- Path estimate and conclusion (3 pts)
- Use the triangle inequality to decompose the path error: for any , (or similar form). [1 pt]
- Use the path continuity of Brownian motion to control the interpolation term (i.e., show there exist paths making this term sufficiently small, or as in the official solution, derive the bound using continuity). [1 pt]
- Use the set inclusion relation and monotonicity of probability to conclude: . [1 pt]
Chain B: Girsanov Transform Method (Advanced Probability Approach)
- Approximation and space setup (2 pts)
- State that if is not smooth enough (not in the Cameron-Martin space), one needs to approximate by smooth functions (e.g., polynomials) , reducing the problem to proving has positive probability in a tubular neighborhood of . [1 pt]
- Define the transformed process (or if is assumed smooth) and prepare to use Girsanov's theorem. [1 pt]
- Measure change construction (2 pts)
- Correctly write the Radon-Nikodym derivative (likelihood ratio) . [1 pt]
- State that under the new measure , is a standard Brownian motion. [1 pt]
- Positivity of probability and conclusion (3 pts)
- State that almost surely (i.e., the two measures are equivalent). [1 pt]
- Cite that the tubular neighborhood probability of standard Brownian motion near is positive (). [1 pt]
- Combine to conclude the original probability is positive. [1 pt]
Total (max 7)
2. Zero-credit items
- Only copying the given conditions from the problem ( is Brownian motion, is continuous, etc.).
- Only asserting by intuition that "Brownian motion can reach any point in space, so the probability is positive" without any mathematical derivation or analysis of continuity/measures.
- Listing the definition of Brownian motion (e.g., independent increments, normality) without applying it to prove the probability near .
3. Deductions
- Logic gap (-2 pts): In Chain A, if the logical connection "discrete points close implies entire path close" is not established via the triangle inequality or other means, and only the finite-point probability is computed before directly claiming the proof is complete.
- Measure confusion (-1 pt): In Chain B, if the -measure and -measure expectation/probability symbols are confused, causing logical inconsistency.
- Constant handling imprecision (no deduction): If only the fitting of coefficients , etc., is imprecise but does not affect the core logic, no deduction.