I'm trying to prove $f(n) = \mathbb{E} \|g_n\|_2 -\sqrt{n}$ is an increasing function in $n$, where $g_n \backsim N(0, I_n)$, i.e. $g_n$ is a standard normal random vector in $\mathbb{R}^n$.
This is the final step in proving $\mathbb{E}s_n(A) \geq \sqrt{m}-\sqrt{n}$ for an $m \times n$ random matrix with $N(0, 1)$ entries, which is known as the consequence of Gordon's comparison inequality. And, this is taken from Exercise 7.3.4 of Roman Vershynin's "High-Dimensional Probability." The author states that you can prove that $f(n)$ is an increasing function by a tedious calculation. This fact is also stated in Martin J. Wainwright's "High-Dimensional Statistics" that it can be derived by direct computation. But neither of them describes it further.
I figured
\begin{equation} \mathbb{E} \|g_n\|_2 = \sqrt{2} \frac{\Gamma(\frac{n+1}{2})}{\Gamma (\frac{n}{2})} \end{equation}
is the explicit form of the expectation. But, I'm not sure how I can go further from here. Any help is appreciated very much!
After working for a while, I've solved this problem with elementary calculation, which I would describe as indeed "tedious" as Vershynin described.
We use Kershaw's inequality for Gamma functions, whose proof is purely elementary and elegant.
Other than this inequality, the rest of the work is done through simple, direct calculation.
It suffices to prove:
$$\, f(n+1) - f(n) = \sqrt{2}\left(\frac{\Gamma(\frac{n+2}{2})}{\Gamma(\frac{n+1}{2})}-\frac{\Gamma(\frac{n+1}{2})}{\Gamma(\frac{n+1}{2})}\right) -(\sqrt{n+1}-\sqrt{n}) \geq 0 \\ \iff \sqrt{2}\left(\frac{\Gamma(\frac{n+2}{2})}{\Gamma(\frac{n+1}{2})}-\frac{\Gamma(\frac{n+1}{2})}{\Gamma(\frac{n}{2})}\right) \geq \sqrt{n+1}-\sqrt{n} $$
Use $\Gamma(x+1) = x\Gamma(x)$ a few times to the left-hand side, we get $$ LHS = \sqrt{2}\left(\frac{n+1}{n+2}\frac{\Gamma(\frac{n+4}{2})}{\Gamma(\frac{n+3}{2})}-\frac{n}{2}\frac{n+2}{n+1}\frac{\Gamma(\frac{n+3}{2})}{\Gamma(\frac{n+4}{2})}\right) $$
Here's the Kershaw's inequality we shall use $$ \frac{\Gamma(x+1)}{\Gamma(x+s)} > \left(x+\frac{s}{2}\right)^{1-s}\quad \text{for } x>0 \text{ and } 0<s<1. $$
Apply the inequality with $x=\frac{n+3}{2}$ and $s=1/2$, we get $$ \frac{\Gamma(\frac{n+4}{2})}{\Gamma(\frac{n+3}{2})} > \sqrt{\frac{n+5/2}{2}} $$
From this, we can lower bound LHS as: \begin{array} \, LHS &> \sqrt{2}\left(\frac{n+1}{n+2}\sqrt{\frac{n+5/2}{2}}-\frac{n}{2}\frac{n+2}{n+1}\sqrt{\frac{2}{n+5/2}}\right) \\ &= \frac{n^2+4n+5}{2(n+1)(n+2)\sqrt{n+5/2}} \end{array}
So, it suffices to prove $$ \frac{n^2+4n+5}{2(n+1)(n+2)\sqrt{n+5/2}} > \sqrt{n+1} - \sqrt{n} $$
Squaring both sides, simplifying, and squaring both sides again to remove the root, we can simplify it to $$ 31n^8+392n^7+2112n^6+6272n^5+11042n^4+11416n^3+6224n^2+1120n-225>0, $$ which is valid for any integers $n\geq 1$. The last calculation was indeed tedious.
At this point, I would just brute-force the inequality. Define $$ f(x)=\frac{\Gamma(x+1/2)}{\Gamma(x)}. $$ To establish the result, it suffices to prove that for $x\ge 1$, $$ f'(x)\ge \frac{1}{2\sqrt{x}}. $$ In fact, if we denote $\psi(x)=\Gamma'(x)/\Gamma(x)$, we have $$ f'(x)=f(x)\left(\psi\left(x+\frac{1}{2}\right)-\psi(x)\right). $$ Now we can use various inequalities ([1], [2]) to get $$ \psi\left(x+\frac{1}{2}\right)-\psi(x)\ge \frac{1-e^{-\gamma}}{x}+O(x^{-2}) $$ and $$ f(x)\ge \sqrt{x}+O(x^{-1/2}), $$ which establishes the claim, at least for $x$ large enough (to get it in general, we either check the remaining cases by hand or try to be more precise in our estimates).