Question
Prove that a random variable is independent of itself if and only if is almost surely constant.
Step-by-step solution
Proof: Step 1. Suppose is almost surely constant. Let . We wish to show that is independent of itself, i.e., that for all Borel sets , Case 1: . Then , so . The identity holds. Case 2: but . Then . The identity holds. Case 3: but . Analogous to Case 2. Case 4: and . Then . The identity holds. Therefore, "almost surely constant" implies that is independent of itself. Step 2. Suppose is independent of itself. Independence means that for all Borel sets : In particular, taking , we obtain Hence, for every Borel set , Step 3. We show that implies is almost surely constant. Define the distribution function . By the previous step, . Moreover, is monotone nondecreasing and right-continuous, with and . Therefore there exists a unique such that: For : , so , hence . For : . Taking , we get , and by countable intersection . At the same time, taking gives . Therefore . Note that , so Step 4. In summary, independent of itself implies the distribution function takes only the values 0 and 1, which in turn implies the existence of with ; conversely, if then is clearly independent of itself. QED.
Final answer
QED.
Marking scheme
The following is an undergraduate mathematics grading rubric based on the official solution (total: 7 points):
1. Checkpoints (max 7 pts)
Part I: Sufficiency Proof [2 pts total]
*Prove that " is almost surely constant is independent of itself."*
- [1 pt] State that if , then for every Borel set , the probability takes only the values or (depending on whether ).
- [1 pt] Verify the independence identity: show that holds for all combinations (i.e., , etc.).
Part II: Necessity Proof [5 pts total]
*Prove that " is independent of itself is almost surely constant."*
Grade whichever of the following logical paths the student uses (if multiple paths appear, take the highest score; do not combine scores across paths):
> Path A: Via the 0–1 property and the distribution function (official solution approach)
> - [2 pts] Derive the 0–1 property: Using the definition of independence (setting or an analogous argument), deduce , and conclude .
> - [2 pts] Locate the constant value : Using the monotonicity, right-continuity, and limiting behavior of the distribution function (which takes only values and ), show there exists a unique jump point (or use the supremum principle ).
> - [1 pt] Confirm probability concentrates at : Rigorously argue the jump has magnitude 1, i.e., (or an equivalent set-theoretic argument).
> Path B: Via variance/moment properties (alternative approach)
> - [1 pt] Construct a bounded variable / justify moment existence: Introduce a bounded function (e.g., ) or a truncation, or explicitly address moment existence at this point. *(If the student directly assumes without justifying generality, see the deductions below.)*
> - [2 pts] Derive zero variance: Use independence to show or .
> - [1 pt] Conclude almost sure constancy: From zero variance, deduce that is almost surely constant.
> - [1 pt] Transfer the conclusion: Use properties of the transformation (e.g., injectivity) to show the original variable is almost surely constant.
Total (max 7)
2. Zero-Credit Items
- Merely copying the definitions of "independent" or "almost surely constant" from the problem statement without any substantive derivation.
- Simply asserting "a constant random variable is obviously independent" or "an independent-of-itself variable is obviously constant" without providing mathematical justification.
- Confusing independence of with itself and independence of and , rendering the derivation invalid.
3. Deductions
*Apply the most severe applicable item below (minimum score is 0):*
- [Cap at 3/7] Restrictive distributional assumption: In the necessity proof, assuming without justification that is discrete (enumerating probability masses) or continuous (assuming a probability density function exists), thereby losing generality.
- [Cap at 5/7] Failure to justify moment existence: If using Path B, directly computing without verifying that has a finite second moment (or without using a bounded transformation); this constitutes a gap in rigor.
- [-1 pt] Logical gap: In Path A, after obtaining , directly asserting "therefore is a step function" without invoking properties of the distribution function (such as monotonicity or limiting behavior).