Question
Let be a one-dimensional (standard) Brownian motion with . Let and be a measurable set. Prove that
Step-by-step solution
Step 1. Let denote the first hitting time of by the Brownian motion. Assume the Brownian motion starts from , and the target set is . By the law of total probability, partitioning the event according to whether the path hits the origin before time , we obtain .
Step 2. For the first term on the right-hand side, apply the reflection principle of Brownian motion. The reflection principle states that for paths starting from that hit before time , the post- behavior is symmetric with that of a path starting from . Specifically, the probability of starting from , hitting , and eventually reaching equals the probability of starting from and eventually reaching . Since and , any path from reaching must pass through , so .
Step 3. For the second term , since the starting point and the path is continuous, if the first hitting time of is greater than , then the path never touches during , i.e., for all (hence ). Therefore this term equals the probability that the path remains non-negative on and lands in at time , i.e., .
Step 4. Substituting the results of Steps 2 and 3 into the decomposition from Step 1, we get . Rearranging this equation yields the desired conclusion.
Final answer
QED.
Marking scheme
This rubric strictly follows the official solution approach, with a total of 7 points. Please score according to the proof path used by the student, choosing Chain A or Chain B; do not mix chains.
1. Checkpoints (max 7 pts)
Select exactly one scoring path | If both are partially addressed, take the single-chain maximum; do not accumulate across chains.
Chain A: Event Decomposition and Reflection Principle (Official Approach)
- Total probability decomposition [additive]
- Use the first hitting time to decompose into two parts: (hit the origin) and (did not hit the origin).
- +1 pt: Write a decomposition similar to .
- Identify the target term (meaning of not hitting the origin) [additive]
- +1 pt: State that for , the event is equivalent to the path staying strictly positive (or non-negative) on , thereby confirming this term is the left-hand side of the identity to be proved.
- Apply the reflection principle (core step) [additive]
- +3 pts: Apply the reflection principle to establish symmetry, stating that the probability of starting from , hitting the origin, and eventually reaching equals the probability of starting from (hitting the origin) and reaching .
- *Note: If the student writes or directly writes , full 3 pts are awarded.*
- Argue "must pass through the origin" (geometric property) [additive]
- +1 pt: Explicitly explain that since and , a continuous path from to must pass through the origin, so the condition is redundant (has probability 1) for the event .
- *Note: If the student writes the result directly without mentioning this geometric intuition or implying this logic, this 1 pt is not awarded.*
- Algebraic rearrangement and conclusion [additive]
- +1 pt: Substitute all terms back into the decomposition and rearrange to obtain the final conclusion.
Chain B: Density Function Computation (Integral Method)
- Cite the reflection principle density formula [additive]
- +4 pts: Directly write (or derive) the transition probability density for starting from , not touching 0 on , and (i.e., the absorbing-barrier Brownian motion density):
.
- *Note: This step contains the core application of the reflection principle and carries higher weight.*
- Identify the first integral [additive]
- +1 pt: Identify and state that equals the unconditional probability .
- Identify the second integral [additive]
- +1 pt: Identify and state that equals (or ).
- Conclusion [additive]
- +1 pt: Combine the integral terms and explain that this equals the required probability difference, completing the proof.
Total (max 7)
2. Zero-credit items
- Merely copying the problem: Copying the identity to be proved verbatim with no intermediate steps.
- Circular reasoning: Starting from the identity to be proved, performing algebraic manipulations to arrive at or a tautology, without establishing the reversibility of the logic or with incorrect reasoning direction.
- Empty citation: Writing only "by the reflection principle" without any specific probability decomposition, density formula, or geometric correspondence.
- Incorrect premise: Assuming must be symmetric (e.g., ) or assuming contains a negative part (the problem specifies ), causing the argument to deviate entirely from the problem.
3. Deductions
Apply at most the single largest deduction (score cannot go below 0).
- Logical gap (missing geometric argument): [-1]
- In Chain A, the student correctly applies the reflection principle to obtain the term, but completely fails to explain why simplifies to (i.e., does not mention the fact that "from negative to positive one must cross zero").
- Notation confusion: [-1]
- Seriously confusing probability with probability density , or confusing the random variable with specific values , rendering expressions mathematically meaningless (but if the core idea is clear, deduct only 1 pt).
- Missing measure-theoretic details: [no deduction]
- If the student does not explicitly mention " is a measurable set" or use measure-theoretic language to extend from density integrals to general sets, no deduction; this is assumed understood at the undergraduate level.