Intereting Posts

Question about normal subgroup and relatively prime index
Can Legendre's theorem really help solve this equation: $ax^2+by^2=cz^2$?
The identity cannot be a commutator in a Banach algebra?
The preimage of continuous function on a closed set is closed.
Zorn's Lemma and Injective Modules
Quaternions and spatial translations
On the smooth structure of $\mathbb{R}P^n$ in Milnor's book on characteristic classes.
Kings on a chessboard
The narrow class group of an order of a quadratic field and the genera of binary quadratic forms
Is number rational?
Are there broad or powerful theorems of rings that do not involve the familiar numerical operations (+) and (*) in some fundamental way?
Prove $(n + 1)I(n) = (n + 2)I(n + 2)$ by integration by parts.
First uncountable ordinal
Lemma vs. Theorem
Ring with spectrum homeomorphic to a given topological space

Lets $(X_n)_{n\in\mathbb{N}}$ be an iid sequence of standard normal random variables. Define $$M_n=\max_{1\leq i\leq n} X_i.$$

Prove that $$\lim_{n\rightarrow\infty} \frac{M_n}{\sqrt{2\log n}}=1\quad\text{a.s.}$$

I used the fact that $$\left(\frac{1}{x}-\frac{1}{x^3}\right)e^{-\frac{x^2}{2}}\leq\mathbb P(X_n>x)\leq \frac{1}{x}e^{-\frac{x^2}{2}},$$

and the Borel Cantelli lemmas to prove that

$$\limsup_{n\rightarrow\infty} \frac{X_n}{\sqrt{2\log n}}=1\quad\text{a.s.}$$

- Finding the probability that red ball is among the $10$ balls
- Prove complements of independent events are independent.
- No two identical ranks together in a standard deck of cards
- How to solve probability when sample space is infinite?
- The limiting case of a discrete probability problem
- What is the probability of rolling $n$ dice until each side appears at least once?

I used Davide Giraudo’s comment to show $$\limsup_n \frac{M_n}{\sqrt{2\log n}}=1\quad \text{a.s.}$$

I have no idea how to compute the $\liminf$. Borel-Cantelli give us tools to compute the $\limsup$ of sets, I am unsure of how to argue almost sure convergence. Any help would be appreciated.

- Random determinant problem
- Who has the upper hand in a generalized game of Risk?
- What's wrong with my solution for the birthday problem?
- Rate of convergence in the central limit theorem (Lindeberg–Lévy)
- Why is a random variable called so despite being a function?
- Polynomial Interpolation and Security
- The probability that each delegate sits next to at least one delegate from another country
- Sums of two probability density functions
- Deducing a probability distribution from its moment-generating function
- Let. $X \sim \mathcal{U}(0,1)$. Given $X = x$, let $Y \sim \mathcal{U}(0,x)$. How can I calculate $\mathbb{E}(X|Y = y)$?

Your estimate gives that for each positive $\varepsilon$, we have

$$\sum_i\mathbb P(M_{2^{i}}>(1+\varepsilon)\sqrt 2\sqrt{i+1})<\infty$$

(we use the fact that $\mathbb P(M_n>x)\leqslant n\mathbb P(X_1\gt x)$).

We thus deduce that $\limsup_iM_{2^{i}}/(\sqrt{2(i+1)})\leqslant 1+\varepsilon$ almost surely. Taking $\varepsilon:=1/k$, we get $\limsup_iM_{2^{i}}/(\sqrt{2(i+1)})\leqslant 1$ almost surely. To conclude, notice that if $2^i\leqslant n\lt 2^{i+1}$,

$$\frac{M_n}{\sqrt{2\log n}}\leqslant \frac{M_{2^{i+1}}}{\sqrt{2i}}.$$

For the $\liminf$, define for a fixed positive $\varepsilon$, $$A_n:=\left\{\frac{M_n}{\sqrt{2\log n}}\lt 1-\varepsilon\right\}.$$

A use of the estimate on the tail of the normal distribution show that the series $\sum_n \mathbb P(A_n)$ is convergent, hence by the Borel-Cantelli lemma, we have $\mathbb P\left(\limsup_n A_n\right)=0$. This means that for almost every $\omega$, we can find $N=N(\omega)$ such that if $n\geqslant N(\omega)$, then $$\frac{M_n(\omega)}{\sqrt{2\log n}}\geqslant 1-\varepsilon.$$

This implies that $$\liminf_{n\to \infty}\frac{M_n(\omega)}{\sqrt{2\log n}}\geqslant 1-\varepsilon \quad \mbox{a.e.}$$

Here again, taking $\varepsilon:=1/k$, we obtain that

$$\liminf_{n\to \infty}\frac{M_n(\omega)}{\sqrt{2\log n}}\geqslant 1\quad \mbox{a.e.}$$

Not an answer, but a related comment that is too long for a comment box …

This question made me curious to compare:

- the pdf of the sample maximum (given a sample of size $n$ drawn on a N(0,1) parent), say $f(x;n):$

$$f(x) = \frac{2^{\frac{1}{2}-n} n e^{-\frac{x^2}{2}} \left(1+\text{erf}\left(\frac{x}{\sqrt{2}}\right)\right)^{n-1}}{\sqrt{\pi }}$$

where erf(.) denotes the error function, to

- the asymptote proposed by the question $\sqrt{2 \log n}$

… when $n$ is very large (say $n$ = 1 million).

The diagram compares:

The distribution does not converge to the asymptote in any meaningful manner, even when $n$ is very large, such as $n$ = 1 million or 100 million or even a billion.

- Evaluate $A_0=\dfrac{3}{4}$, and $A_{n+1}=\dfrac{1+\sqrt{A_n}}{2}$
- Proof by Cases involving divisibility
- $f(x) = |\cos x|$ prove that f is differentiable at these points and not differentiable at all other points.
- Examples of problems that are easier in the infinite case than in the finite case.
- Diagonalization and eigenvalues
- Show that $R/I\otimes_R R/J\cong R/(I+J)$
- How to prove that a topological space is connected iff it has exactly two clopen subsets?
- UK 1998, Show that $hxyz$ is a perfect square.
- Derivating in respect of a function that's a derivative of another function
- Rings of integers are noetherian (question about a specific proof)
- What is wrong in this proof: That $\mathbb{R}$ has measure zero
- How to determine $\Omega(T)$?
- No radical in the denominator — why?
- Prove that this function is bounded
- Example of non-Noetherian non-UFD Krull domain?