Question
Let be a martingale with , where is a constant. Prove that can be expressed as the difference of two nonnegative martingales.
Step-by-step solution
Step 1. Define where is the limit of as (by the -bounded martingale convergence theorem, the martingale converges to some ).
Step 2. Since , by Doob's martingale convergence theorem, there exists a random variable such that a.s. and in . Moreover, .
Step 3. Let Clearly are nonnegative martingales. Furthermore,
Step 4. Verification: are martingales since they are sequences of conditional expectations. Nonnegativity follows from and , giving and . Their difference equals .
Thus is the difference of two nonnegative martingales.
Final answer
QED.
Marking scheme
This rubric is designed strictly according to the official solution (assuming the closed martingale/UI property) and provides a parallel grading chain for the general Krickeberg decomposition method that does not rely on the UI assumption.
1. Checkpoints (max 7 pts total)
Score exactly one chain; take the maximum subtotal among chains; do not add points across chains.
Chain A: Official Solution Path (Based on the closed martingale property of )
- Existence of the limit: Cite Doob's martingale convergence theorem or use the -bounded condition () to state that converges to a random variable (a.s. or ). [1 pt]
- Closed martingale representation (core step): Write or assert that can be represented as the conditional expectation of , i.e., . [2 pts]
- Construction of nonnegative components: Using the positive and negative parts of , define and . [2 pts]
- Verification and conclusion: Verify the following properties and draw the conclusion: (1) are martingales (by properties of conditional expectation); (2) (from ); (3) . [2 pts, additive]
Chain B: General Krickeberg Decomposition (Based on the limit construction from )
- Submartingale property: State that is a submartingale. [1 pt]
- Construction of the dominating martingale (core step): Define (or take ), and state that this limit exists due to boundedness. [3 pts]
- Verification of : Show that the constructed is a martingale. [1 pt]
- Construction of and nonnegativity: Define , use (or the submartingale property) to prove and that it is a martingale, thereby completing the decomposition. [2 pts]
Total (max 7)
2. Zero-credit items
- Simple algebraic decomposition: Only writing and claiming are martingales (in fact they are typically submartingales), receives 0 pts.
- Unsupported assertion: Only restating the problem conditions or claiming "by the Krickeberg decomposition theorem the conclusion holds" without any concrete construction process, receives 0 pts.
- Symbol accumulation: Listing general properties of without applying them to the specific or construction process in this problem, receives 0 pts.
3. Deductions
- Logic gap (Limit Gap): If using Chain A but not mentioning the convergence of or Doob's theorem before using , deduct 1 pt.
- Notational error: Confusing conditional expectation with full expectation , or omitting the -algebra , deduct 1 pt.
- Incomplete process: Completing the definition of but entirely failing to mention/verify either their "nonnegativity" or "martingale property," deduct 1 pt.