Let $\{X_{n}\}$ be a sequence of r.v. such that $$ X_{n} \stackrel{a.s.}{\to} X $$ According to wikipedia https://en.wikipedia.org/wiki/Convergence_of_random_variables $$ P[\omega\in\Omega: X_{n}(\omega) \to X(\omega)] = 1 $$ is equivalent to $$ P[\underset{n\to\infty}{\liminf} \{\omega\in\Omega:|X_{n}(\omega) - X(\omega)|<\varepsilon \}] = 1 $$ for any $\varepsilon$. Could someone prove it?
2026-03-30 17:01:54.1774890114
equivalence of definitions a.s.
62 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in PROBABILITY
- How to prove $\lim_{n \rightarrow\infty} e^{-n}\sum_{k=0}^{n}\frac{n^k}{k!} = \frac{1}{2}$?
- Is this a commonly known paradox?
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- Prove or disprove the following inequality
- Another application of the Central Limit Theorem
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- A random point $(a,b)$ is uniformly distributed in a unit square $K=[(u,v):0<u<1,0<v<1]$
- proving Kochen-Stone lemma...
- Solution Check. (Probability)
- Interpreting stationary distribution $P_{\infty}(X,V)$ of a random process
Related Questions in MEASURE-THEORY
- On sufficient condition for pre-compactness "in measure"(i.e. in Young measure space)
- Absolutely continuous functions are dense in $L^1$
- I can't undestand why $ \{x \in X : f(x) > g(x) \} = \bigcup_{r \in \mathbb{Q}}{\{x\in X : f(x) > r\}\cap\{x\in X:g(x) < r\}} $
- Trace $\sigma$-algebra of a product $\sigma$-algebra is product $\sigma$-algebra of the trace $\sigma$-algebras
- Meaning of a double integral
- Random variables coincide
- Convergence in measure preserves measurability
- Convergence in distribution of a discretized random variable and generated sigma-algebras
- A sequence of absolutely continuous functions whose derivatives converge to $0$ a.e
- $f\in L_{p_1}\cap L_{p_2}$ implies $f\in L_{p}$ for all $p\in (p_1,p_2)$
Related Questions in CONVERGENCE-DIVERGENCE
- Finding radius of convergence $\sum _{n=0}^{}(2+(-1)^n)^nz^n$
- Conditions for the convergence of :$\cos\left( \sum_{n\geq0}{a_n}x^n\right)$
- Proving whether function-series $f_n(x) = \frac{(-1)^nx}n$
- Pointwise and uniform convergence of function series $f_n = x^n$
- studying the convergence of a series:
- Convergence in measure preserves measurability
- If $a_{1}>2$and $a_{n+1}=a_{n}^{2}-2$ then Find $\sum_{n=1}^{\infty}$ $\frac{1}{a_{1}a_{2}......a_{n}}$
- Convergence radius of power series can be derived from root and ratio test.
- Does this sequence converge? And if so to what?
- Seeking an example of Schwartz function $f$ such that $ \int_{\bf R}\left|\frac{f(x-y)}{y}\right|\ dy=\infty$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
There is indeed something to prove here.
Claim 1:
If $\{B_k\}_{k=1}^{\infty}$ is an infinite sequence of events such that $P[B_k]=1$ for all $k \in \{1, 2, 3,...\}$, then $$P[\cap_{k=1}^{\infty} B_k] = 1$$
Proof: Computing the probability of the complement of $\cap_{k=1}^{\infty} B_k$ gives:
$$ P[(\cap_{k=1}^{\infty} B_k)^c] = P[\cup_{k=1}^{\infty} B_k^c] \leq \sum_{k=1}^{\infty} P[B_k^c] = \sum_{k=1}^{\infty} 0 = 0 $$ where we have used the union bound. $\Box$
The definition of $\liminf$ of a sequence of sets $\{A_n\}_{n=1}^{\infty}$ is: $$ \liminf_{n\rightarrow\infty} A_n = \cup_{M=1}^{\infty} \cap_{n=M}^{\infty} A_n$$ For each $\epsilon>0$ and each $n \in \{1, 2, 3, ...\}$, define $A_n(\epsilon)$ as the following event: $$ A_n(\epsilon) = \{|X-X_n|< \epsilon\}$$ Define events $B(\epsilon)$ by $$ B(\epsilon) =\liminf_{n\rightarrow\infty} A_n(\epsilon) = \cup_{M=1}^{\infty} \cap_{n=M}^{\infty} \{|X-X_n|<\epsilon \} $$ The event $B(\epsilon)$ is equivalent to the event that there exists an integer $M>0$ such that $|X-X_n|<\epsilon$ for all $n \geq M$.
We want to prove that: $$\boxed{P[X_n\rightarrow X]=1 \quad \mbox{ if and only if } \quad P[B(\epsilon)]=1 \quad \forall \epsilon>0} $$
Claim 2:
$\{X_n\rightarrow X\} = \cap_{k=1}^{\infty} B(1/k)$.
Proof: This claim says that $X_n\rightarrow X$ if and only if for each integer $k$ there is an integer $M>0$ such that $|X_n-X|<1/k$ for all $n \geq M$. This is true by definition of a limit. $\Box$
Claim 3
a) $P[X_n\rightarrow X] = P[\cap_{k=1}^{\infty} B(1/k)] \leq P[B(1/i)]$ for all $i \in \{1, 2, 3, ...\}$.
b) $P[X_n\rightarrow X] = 1$ if and only if $P[B(1/i)]=1$ for all $i \in \{1, 2, 3, ...\}$.
c) $P[X_n\rightarrow X] = 1$ if and only if $P[B(\epsilon)]=1$ for all $\epsilon>0$.
Proof: Part (a) follows immediately from Claim 2 and the fact that for every $i \in \{1, 2, 3, ...\}$ we have $\cap_{k=1}^{\infty} B(1/k) \subseteq B(1/i)$.
Part (b) follows from (a) together with Claim 1, specifically, if $P[B(1/i)]=1$ for all $i \in \{1, 2, 3, ...\}$ then $P[\cap_{i=1}^{\infty} B(1/i)]=1$.
To prove part (c), assume $P[B(\epsilon)]=1$ for all $\epsilon>0$. Then $P[B(1/i)]=1$ for all positive integers $i$, and by part (b) we conclude $P[X_n\rightarrow X]=1$. Now supose $P[X_n\rightarrow X] = 1$. Then from part (b) we know $P[B(1/i)]=1$ for all $i \in \{1, 2, 3, ...\}$. Fix $\epsilon>0$. Choose $i \in \{1, 2, 3, ...\}$ such that $1/i\leq \epsilon$. Then $$ B(1/i)\subseteq B(\epsilon) \implies \underbrace{P[B(1/i)]}_{1} \leq P[B(\epsilon)]$$ and so $P[B(\epsilon)]=1$. $\Box$