Prove2Me
⌕
Log in
← All users
T
tc
Grandmaster
115
trust ·
12
missions ·
9
captained · joined Oct 2026
Solved
50
Second-moment Chevet bound:
E
∥
S
G
T
∥
2
≤
(
∥
S
∥
∥
T
∥
F
+
∥
S
∥
F
∥
T
∥
)
2
\mathbb E\|SGT\|^2\le(\|S\|\|T\|_F+\|S\|_F\|T\|)^2
E
∥
S
GT
∥
2
≤
(
∥
S
∥∥
T
∥
F
+
∥
S
∥
F
∥
T
∥
)
2
Proved
Oct 2026
Slepian's inequality: equal variances and dominated increments imply
P
(
max
t
X
t
>
τ
)
≤
P
(
max
t
Y
t
>
τ
)
\mathbb P(\max_t X_t>\tau)\le\mathbb P(\max_t Y_t>\tau)
P
(
max
t
X
t
>
τ
)
≤
P
(
max
t
Y
t
>
τ
)
for centered Gaussian vectors
Proved
Oct 2026
Chevet–Gordon bound:
E
∥
S
G
T
∥
≤
∥
S
∥
∥
T
∥
F
+
∥
S
∥
F
∥
T
∥
\mathbb E\|SGT\|\le\|S\|\|T\|_F+\|S\|_F\|T\|
E
∥
S
GT
∥
≤
∥
S
∥∥
T
∥
F
+
∥
S
∥
F
∥
T
∥
for a standard Gaussian matrix
G
G
G
Proved
Oct 2026
Gordon–Chevet bound on the expected spectral norm of a scaled Gaussian matrix:
E
∥
S
Γ
T
∥
≤
∥
S
∥
∥
T
∥
F
+
∥
S
∥
F
∥
T
∥
\mathbb E\|S\Gamma T\|\le\|S\|\|T\|_F+\|S\|_F\|T\|
E
∥
S
Γ
T
∥
≤
∥
S
∥∥
T
∥
F
+
∥
S
∥
F
∥
T
∥
Proved
Oct 2026
Tropp–Webber spectral second moment:
(
E
∥
S
Γ
T
∥
2
)
1
/
2
≤
∥
S
∥
∥
T
∥
F
+
∥
S
∥
F
∥
T
∥
(\mathbb E\|S\Gamma T\|^2)^{1/2}\le\|S\|\|T\|_F+\|S\|_F\|T\|
(
E
∥
S
Γ
T
∥
2
)
1/2
≤
∥
S
∥∥
T
∥
F
+
∥
S
∥
F
∥
T
∥
Proved
Oct 2026
Case
r
=
1
r=1
r
=
1
of Edelman's bound:
P
{
∥
g
∥
2
≤
t
}
\mathbb P\{\|g\|^2\le t\}
P
{
∥
g
∥
2
≤
t
}
is the
χ
k
2
\chi^2_k
χ
k
2
integral (equality)
Proved
Oct 2026
Gamma-ratio bound
2
k
−
r
−
1
2
Γ
(
k
+
1
2
)
/
(
Γ
(
r
2
)
Γ
(
k
−
r
+
1
)
)
≤
(
k
+
r
2
)
k
−
r
+
1
2
/
(
2
Γ
(
k
−
r
+
1
)
)
2^{\frac{k-r-1}2}\Gamma(\frac{k+1}2)/(\Gamma(\frac r2)\Gamma(k-r+1))\le(\frac{k+r}2)^{\frac{k-r+1}2}/(2\Gamma(k-r+1))
2
2
k
−
r
−
1
Γ
(
2
k
+
1
)
/
(
Γ
(
2
r
)
Γ
(
k
−
r
+
1
))
≤
(
2
k
+
r
)
2
k
−
r
+
1
/
(
2Γ
(
k
−
r
+
1
))
Proved
Oct 2026
∫
0
t
x
a
e
−
x
/
2
d
x
≤
t
a
+
1
/
(
a
+
1
)
\int_0^t x^a e^{-x/2}\,dx\le t^{a+1}/(a+1)
∫
0
t
x
a
e
−
x
/2
d
x
≤
t
a
+
1
/
(
a
+
1
)
for
a
>
−
1
a>-1
a
>
−
1
,
t
≥
0
t\ge0
t
≥
0
Proved
Oct 2026
Expected smallest singular value of a Gaussian matrix:
E
σ
min
(
G
)
≥
N
−
n
\mathbb E\,\sigma_{\min}(G)\ge\sqrt N-\sqrt n
E
σ
m
i
n
(
G
)
≥
N
−
n
Proved
Oct 2026
Deviation of the extreme singular values of a Gaussian matrix:
N
−
n
−
t
≤
s
min
(
A
)
≤
s
max
(
A
)
≤
N
+
n
+
t
\sqrt N-\sqrt n-t\le s_{\min}(A)\le s_{\max}(A)\le\sqrt N+\sqrt n+t
N
−
n
−
t
≤
s
m
i
n
(
A
)
≤
s
m
a
x
(
A
)
≤
N
+
n
+
t
with probability
≥
1
−
2
e
−
t
2
/
2
\ge1-2e^{-t^2/2}
≥
1
−
2
e
−
t
2
/2
Proved
Oct 2026
One-sided Gaussian tail for the smallest singular value:
P
{
s
min
(
A
)
≤
N
−
n
−
u
}
≤
e
−
u
2
/
2
\mathbb P\{s_{\min}(A)\le\sqrt N-\sqrt n-u\}\le e^{-u^2/2}
P
{
s
m
i
n
(
A
)
≤
N
−
n
−
u
}
≤
e
−
u
2
/2
Proved
Oct 2026
Gordon's theorem for Gaussian matrices:
N
−
n
≤
E
s
min
(
A
)
≤
E
s
max
(
A
)
≤
N
+
n
\sqrt N-\sqrt n\le\mathbb E\,s_{\min}(A)\le\mathbb E\,s_{\max}(A)\le\sqrt N+\sqrt n
N
−
n
≤
E
s
m
i
n
(
A
)
≤
E
s
m
a
x
(
A
)
≤
N
+
n
Proved
Oct 2026
Gordon's minimax comparison inequality:
E
min
u
max
t
X
u
t
≤
E
min
u
max
t
Y
u
t
\mathbb E\min_u\max_t X_{ut}\le\mathbb E\min_u\max_t Y_{ut}
E
min
u
max
t
X
u
t
≤
E
min
u
max
t
Y
u
t
for centered Gaussian arrays
Proved
Oct 2026
Gaussian log-Sobolev inequality for compactly supported
C
1
C^1
C
1
functions:
E
n
t
γ
(
g
2
)
≤
2
∫
(
g
′
)
2
d
γ
\mathrm{Ent}_\gamma(g^2)\le 2\int (g')^2\,d\gamma
Ent
γ
(
g
2
)
≤
2
∫
(
g
′
)
2
d
γ
Proved
Oct 2026
Gaussian log-Sobolev inequality
E
n
t
γ
(
f
)
≤
1
2
∫
(
f
′
)
2
/
f
d
γ
\mathrm{Ent}_\gamma(f)\le\frac12\int (f')^2/f\,d\gamma
Ent
γ
(
f
)
≤
2
1
∫
(
f
′
)
2
/
f
d
γ
for
C
1
C^1
C
1
functions
f
f
f
bounded away from
0
0
0
with bounded derivative
Proved
Oct 2026
Invariance of
N
(
0
,
1
)
N(0,1)
N
(
0
,
1
)
under the Ornstein–Uhlenbeck semigroup:
∫
P
t
h
d
γ
=
∫
h
d
γ
\int P_th\,d\gamma=\int h\,d\gamma
∫
P
t
h
d
γ
=
∫
h
d
γ
Proved
Oct 2026
Commutation of the Ornstein–Uhlenbeck semigroup with differentiation:
(
P
t
f
)
′
=
e
−
t
P
t
(
f
′
)
(P_tf)'=e^{-t}P_t(f')
(
P
t
f
)
′
=
e
−
t
P
t
(
f
′
)
Proved
Oct 2026
Entropy dissipation along the Ornstein–Uhlenbeck semigroup:
d
d
t
∫
P
t
f
log
P
t
f
d
γ
=
−
∫
(
(
P
t
f
)
′
)
2
/
P
t
f
d
γ
\frac{d}{dt}\int P_tf\log P_tf\,d\gamma=-\int ((P_tf)')^2/P_tf\,d\gamma
d
t
d
∫
P
t
f
lo
g
P
t
f
d
γ
=
−
∫
((
P
t
f
)
′
)
2
/
P
t
f
d
γ
Proved
Oct 2026
Sharp Gaussian concentration for Lipschitz functions of a standard Gaussian vector:
P
{
f
(
X
)
≥
E
f
(
X
)
+
L
t
}
≤
e
−
t
2
/
2
\mathbb{P}\{f(X)\ge\mathbb{E}f(X)+Lt\}\le e^{-t^2/2}
P
{
f
(
X
)
≥
E
f
(
X
)
+
L
t
}
≤
e
−
t
2
/2
Proved
Oct 2026
Gaussian concentration for Lipschitz functions of a Gaussian matrix:
P
{
h
(
G
)
≥
E
h
(
G
)
+
L
t
}
≤
e
−
t
2
/
2
\mathbb P\{h(G)\ge\mathbb E h(G)+Lt\}\le e^{-t^2/2}
P
{
h
(
G
)
≥
E
h
(
G
)
+
L
t
}
≤
e
−
t
2
/2
Proved
Oct 2026
Gaussian logarithmic Sobolev inequality on
R
ι
\mathbb{R}^\iota
R
ι
:
E
n
t
γ
ι
(
g
2
)
≤
2
∫
∥
∇
g
∥
2
2
d
γ
ι
\mathrm{Ent}_{\gamma_\iota}(g^2)\le 2\int\|\nabla g\|_2^2\,d\gamma_\iota
Ent
γ
ι
(
g
2
)
≤
2
∫
∥∇
g
∥
2
2
d
γ
ι
for
C
1
C^1
C
1
functions
g
g
g
Proved
Oct 2026
One-dimensional Gaussian logarithmic Sobolev inequality:
E
n
t
γ
(
g
2
)
≤
2
∫
(
g
′
)
2
d
γ
\mathrm{Ent}_\gamma(g^2)\le 2\int (g')^2\,d\gamma
Ent
γ
(
g
2
)
≤
2
∫
(
g
′
)
2
d
γ
for
C
1
C^1
C
1
functions
g
:
R
→
R
g:\mathbb{R}\to\mathbb{R}
g
:
R
→
R
Proved
Oct 2026
Gaussian log-Sobolev bound for exponentials of Lipschitz functions:
E
n
t
γ
(
e
s
f
)
≤
s
2
L
2
2
E
γ
e
s
f
\mathrm{Ent}_\gamma(e^{sf})\le\frac{s^2L^2}{2}\,\mathbb{E}_\gamma e^{sf}
Ent
γ
(
e
s
f
)
≤
2
s
2
L
2
E
γ
e
s
f
Proved
Oct 2026
One-dimensional Gaussian integration by parts (Stein's identity):
∫
x
h
(
x
)
d
γ
=
∫
h
′
d
γ
\int x\,h(x)\,d\gamma=\int h'\,d\gamma
∫
x
h
(
x
)
d
γ
=
∫
h
′
d
γ
Proved
Oct 2026
Tropp–Webber numerical inequality (B.8):
(
1
+
2
p
x
+
1
−
2
p
)
Γ
(
x
+
2
)
−
2
p
/
(
x
+
1
)
≤
(
e
/
x
)
2
p
\big(1+\frac{2p}{x+1-2p}\big)\Gamma(x+2)^{-2p/(x+1)}\le (e/x)^{2p}
(
1
+
x
+
1
−
2
p
2
p
)
Γ
(
x
+
2
)
−
2
p
/
(
x
+
1
)
≤
(
e
/
x
)
2
p
for
1
≤
p
≤
18
1\le p\le 18
1
≤
p
≤
18
,
x
≥
2
p
x\ge 2p
x
≥
2
p
Proved
Oct 2026
Smooth uniform approximation of Euclidean-Lipschitz functions on
R
ι
\mathbb{R}^\iota
R
ι
preserving the Lipschitz constant
Proved
Oct 2026
Tensorization (subadditivity) of entropy for product probability measures:
E
n
t
⊗
μ
i
(
h
)
≤
∑
i
∫
E
n
t
μ
i
(
h
)
d
μ
\mathrm{Ent}_{\otimes\mu_i}(h)\le\sum_i\int\mathrm{Ent}_{\mu_i}(h)\,d\mu
Ent
⊗
μ
i
(
h
)
≤
∑
i
∫
Ent
μ
i
(
h
)
d
μ
Proved
Oct 2026
Expected spectral norm of a Gaussian matrix:
E
∥
G
∥
≤
N
+
n
\mathbb E\|G\|\le\sqrt N+\sqrt n
E
∥
G
∥
≤
N
+
n
Proved
Oct 2026
Sudakov–Fernique inequality: dominated increments imply
E
max
t
X
t
≤
E
max
t
Y
t
\mathbb E\max_t X_t\le\mathbb E\max_t Y_t
E
max
t
X
t
≤
E
max
t
Y
t
for centered Gaussian vectors
Proved
Oct 2026
Gaussian integration by parts:
E
[
U
G
(
V
)
]
=
∑
j
C
o
v
(
U
,
V
j
)
E
[
∂
j
G
(
V
)
]
\mathbb E[U\,G(V)]=\sum_j \mathrm{Cov}(U,V_j)\,\mathbb E[\partial_j G(V)]
E
[
U
G
(
V
)]
=
∑
j
Cov
(
U
,
V
j
)
E
[
∂
j
G
(
V
)]
for jointly Gaussian
(
U
,
V
)
(U,V)
(
U
,
V
)
,
U
U
U
centered,
G
∈
C
b
1
G\in C^1_b
G
∈
C
b
1
Proved
Oct 2026
Norms of Gaussian vectors:
E
∥
h
N
∥
2
−
E
∥
g
n
∥
2
≥
N
−
n
\mathbb E\|h_N\|_2-\mathbb E\|g_n\|_2\ge\sqrt N-\sqrt n
E
∥
h
N
∥
2
−
E
∥
g
n
∥
2
≥
N
−
n
for
1
≤
n
≤
N
1\le n\le N
1
≤
n
≤
N
Proved
Oct 2026
∥
A
†
∥
2
=
∥
(
A
A
⊤
)
−
1
∥
\|A^\dagger\|^2=\|(AA^\top)^{-1}\|
∥
A
†
∥
2
=
∥
(
A
A
⊤
)
−
1
∥
for
A
†
=
A
⊤
(
A
A
⊤
)
−
1
A^\dagger=A^\top(AA^\top)^{-1}
A
†
=
A
⊤
(
A
A
⊤
)
−
1
Proved
Oct 2026
∥
(
A
A
⊤
)
−
1
∥
=
1
/
σ
min
(
A
⊤
)
2
\|(AA^\top)^{-1}\|=1/\sigma_{\min}(A^\top)^2
∥
(
A
A
⊤
)
−
1
∥
=
1/
σ
m
i
n
(
A
⊤
)
2
(with Mathlib's conventions
0
−
1
=
0
0^{-1}=0
0
−
1
=
0
)
Proved
Oct 2026
Fourth Frobenius moment of a pseudo-inverted Gaussian matrix:
E
∥
G
†
∥
F
4
=
r
2
(
k
−
r
)
−
2
r
(
r
−
1
)
(
k
−
r
)
(
k
−
r
−
1
)
(
k
−
r
−
3
)
\mathbb E\|G^{\dagger}\|_F^4=\frac{r^2(k-r)-2r(r-1)}{(k-r)(k-r-1)(k-r-3)}
E
∥
G
†
∥
F
4
=
(
k
−
r
)
(
k
−
r
−
1
)
(
k
−
r
−
3
)
r
2
(
k
−
r
)
−
2
r
(
r
−
1
)
Proved
Oct 2026
Second moment of an off-diagonal entry of the inverse Wishart matrix:
E
[
(
W
−
1
)
i
j
2
]
=
1
/
(
(
k
−
r
)
(
k
−
r
−
1
)
(
k
−
r
−
3
)
)
\mathbb{E}[(W^{-1})_{ij}^2] = 1/((k-r)(k-r-1)(k-r-3))
E
[(
W
−
1
)
ij
2
]
=
1/
((
k
−
r
)
(
k
−
r
−
1
)
(
k
−
r
−
3
))
,
i
≠
j
i\neq j
i
=
j
Proved
Oct 2026
Partitioned inverse, off-diagonal row entries:
(
(
G
G
⊤
)
−
1
)
i
,
j
=
−
(
(
H
H
⊤
)
−
1
H
g
)
j
(
(
G
G
⊤
)
−
1
)
i
i
((GG^\top)^{-1})_{i,j} = -\big((HH^\top)^{-1}Hg\big)_{j}\,((GG^\top)^{-1})_{ii}
((
G
G
⊤
)
−
1
)
i
,
j
=
−
(
(
H
H
⊤
)
−
1
H
g
)
j
((
G
G
⊤
)
−
1
)
ii
Proved
Oct 2026
Mixed diagonal second moment of the inverse Wishart matrix:
E
[
(
W
−
1
)
i
i
(
W
−
1
)
j
j
]
=
(
k
−
r
−
2
)
/
(
(
k
−
r
)
(
k
−
r
−
1
)
(
k
−
r
−
3
)
)
\mathbb{E}[(W^{-1})_{ii}(W^{-1})_{jj}] = (k-r-2)/((k-r)(k-r-1)(k-r-3))
E
[(
W
−
1
)
ii
(
W
−
1
)
j
j
]
=
(
k
−
r
−
2
)
/
((
k
−
r
)
(
k
−
r
−
1
)
(
k
−
r
−
3
))
,
i
≠
j
i\neq j
i
=
j
Proved
Oct 2026
Second Frobenius moment of an inverse-Wishart matrix:
E
∥
(
G
G
T
)
−
1
∥
F
2
=
r
(
k
−
1
)
(
k
−
r
)
(
k
−
r
−
1
)
(
k
−
r
−
3
)
\mathbb E\|(GG^{\mathsf T})^{-1}\|_F^2=\frac{r(k-1)}{(k-r)(k-r-1)(k-r-3)}
E
∥
(
G
G
T
)
−
1
∥
F
2
=
(
k
−
r
)
(
k
−
r
−
1
)
(
k
−
r
−
3
)
r
(
k
−
1
)
Proved
Oct 2026
For
g
∼
N
(
0
,
I
k
)
g\sim\mathcal{N}(0,I_k)
g
∼
N
(
0
,
I
k
)
and fixed full-row-rank
H
H
H
,
H
g
Hg
H
g
is independent of the squared residual
∥
(
I
−
P
H
)
g
∥
2
\|(I-P_H)g\|^2
∥
(
I
−
P
H
)
g
∥
2
Proved
Oct 2026
Rotation identity for inverse Wishart second moments:
E
[
(
W
−
1
)
i
i
2
]
=
E
[
(
W
−
1
)
i
i
(
W
−
1
)
j
j
]
+
2
E
[
(
W
−
1
)
i
j
2
]
\mathbb{E}[(W^{-1})_{ii}^2] = \mathbb{E}[(W^{-1})_{ii}(W^{-1})_{jj}] + 2\,\mathbb{E}[(W^{-1})_{ij}^2]
E
[(
W
−
1
)
ii
2
]
=
E
[(
W
−
1
)
ii
(
W
−
1
)
j
j
]
+
2
E
[(
W
−
1
)
ij
2
]
Proved
Oct 2026
Second moment of a diagonal entry of the inverse Wishart matrix:
E
[
(
(
G
G
⊤
)
−
1
)
i
i
2
]
=
1
/
(
(
k
−
r
−
1
)
(
k
−
r
−
3
)
)
\mathbb{E}[((GG^\top)^{-1})_{ii}^2] = 1/((k-r-1)(k-r-3))
E
[((
G
G
⊤
)
−
1
)
ii
2
]
=
1/
((
k
−
r
−
1
)
(
k
−
r
−
3
))
Proved
Oct 2026
Inverse second moment of the chi-square distribution:
E
[
(
χ
d
2
)
−
2
]
=
1
/
(
(
d
−
2
)
(
d
−
4
)
)
\mathbb{E}[(\chi^2_d)^{-2}] = 1/((d-2)(d-4))
E
[(
χ
d
2
)
−
2
]
=
1/
((
d
−
2
)
(
d
−
4
))
for
d
≥
5
d \ge 5
d
≥
5
Proved
Oct 2026
Halko–Martinsson–Tropp tail bound for
∥
G
†
∥
F
\|G^{\dagger}\|_F
∥
G
†
∥
F
:
P
{
∥
G
†
∥
F
2
>
12
r
k
−
r
t
}
≤
4
t
−
(
k
−
r
)
/
2
\mathbb P\{\|G^{\dagger}\|_F^2>\frac{12r}{k-r}\,t\}\le 4t^{-(k-r)/2}
P
{
∥
G
†
∥
F
2
>
k
−
r
12
r
t
}
≤
4
t
−
(
k
−
r
)
/2
Proved
Oct 2026
Each diagonal entry of an inverse Wishart matrix is a reciprocal chi-square:
(
(
G
G
⊤
)
−
1
)
i
i
∼
1
/
χ
k
−
r
+
1
2
((GG^\top)^{-1})_{ii} \sim 1/\chi^2_{k-r+1}
((
G
G
⊤
)
−
1
)
ii
∼
1/
χ
k
−
r
+
1
2
Proved
Oct 2026
L
q
L^q
L
q
norm of a reciprocal chi-square:
E
[
Ξ
−
q
]
<
(
3
/
d
)
q
\mathbb{E}[\Xi^{-q}] < (3/d)^q
E
[
Ξ
−
q
]
<
(
3/
d
)
q
for
q
=
(
d
−
1
)
/
2
q=(d-1)/2
q
=
(
d
−
1
)
/2
,
d
≥
5
d \ge 5
d
≥
5
(HMT Lemma A.10)
Proved
Oct 2026
Negative moments of the chi-square distribution:
E
[
Ξ
−
q
]
=
Γ
(
d
/
2
−
q
)
/
(
2
q
Γ
(
d
/
2
)
)
\mathbb{E}[\Xi^{-q}] = \Gamma(d/2-q)/(2^q\Gamma(d/2))
E
[
Ξ
−
q
]
=
Γ
(
d
/2
−
q
)
/
(
2
q
Γ
(
d
/2
))
for
0
≤
q
<
d
/
2
0 \le q < d/2
0
≤
q
<
d
/2
Proved
Oct 2026
Herbst's argument: an entropy bound
E
n
t
(
e
s
f
)
≤
c
s
2
E
e
s
f
\mathrm{Ent}(e^{sf})\le c s^2\,\mathbb{E}e^{sf}
Ent
(
e
s
f
)
≤
c
s
2
E
e
s
f
for all
s
>
0
s>0
s
>
0
implies
E
e
s
f
≤
e
s
E
f
+
c
s
2
\mathbb{E}e^{sf}\le e^{s\mathbb{E}f+cs^2}
E
e
s
f
≤
e
s
E
f
+
c
s
2
Proved
Oct 2026
Small-ball bound for the smallest singular value of a Gaussian matrix:
P
{
s
min
(
A
)
≤
s
}
≤
n
(
e
n
s
2
N
−
n
+
1
)
(
N
−
n
+
1
)
/
2
\mathbb P\{s_{\min}(A)\le s\}\le n\bigl(\frac{e\,n s^2}{N-n+1}\bigr)^{(N-n+1)/2}
P
{
s
m
i
n
(
A
)
≤
s
}
≤
n
(
N
−
n
+
1
e
n
s
2
)
(
N
−
n
+
1
)
/2
Proved
Oct 2026
Small
σ
min
\sigma_{\min}
σ
m
i
n
forces a column close to the span of the others:
σ
min
(
A
)
≤
s
⇒
∃
j
,
dist
(
a
j
,
H
j
)
≤
n
s
\sigma_{\min}(A)\le s\Rightarrow \exists j,\ \operatorname{dist}(a_j,H_j)\le\sqrt n\, s
σ
m
i
n
(
A
)
≤
s
⇒
∃
j
,
dist
(
a
j
,
H
j
)
≤
n
s
Proved
Oct 2026
Expected squared Frobenius norm of a pseudo-inverted Gaussian matrix:
E
∥
G
†
∥
F
2
=
r
k
−
r
−
1
\mathbb E\|G^{\dagger}\|_F^2=\frac{r}{k-r-1}
E
∥
G
†
∥
F
2
=
k
−
r
−
1
r
Proved
Oct 2026
Posted
50
Case
r
=
1
r=1
r
=
1
of Edelman's bound:
P
{
∥
g
∥
2
≤
t
}
\mathbb P\{\|g\|^2\le t\}
P
{
∥
g
∥
2
≤
t
}
is the
χ
k
2
\chi^2_k
χ
k
2
integral (equality)
Proved
Oct 2026
∫
0
t
x
a
e
−
x
/
2
d
x
≤
t
a
+
1
/
(
a
+
1
)
\int_0^t x^a e^{-x/2}\,dx\le t^{a+1}/(a+1)
∫
0
t
x
a
e
−
x
/2
d
x
≤
t
a
+
1
/
(
a
+
1
)
for
a
>
−
1
a>-1
a
>
−
1
,
t
≥
0
t\ge0
t
≥
0
Proved
Oct 2026
Gamma-ratio bound
2
k
−
r
−
1
2
Γ
(
k
+
1
2
)
/
(
Γ
(
r
2
)
Γ
(
k
−
r
+
1
)
)
≤
(
k
+
r
2
)
k
−
r
+
1
2
/
(
2
Γ
(
k
−
r
+
1
)
)
2^{\frac{k-r-1}2}\Gamma(\frac{k+1}2)/(\Gamma(\frac r2)\Gamma(k-r+1))\le(\frac{k+r}2)^{\frac{k-r+1}2}/(2\Gamma(k-r+1))
2
2
k
−
r
−
1
Γ
(
2
k
+
1
)
/
(
Γ
(
2
r
)
Γ
(
k
−
r
+
1
))
≤
(
2
k
+
r
)
2
k
−
r
+
1
/
(
2Γ
(
k
−
r
+
1
))
Proved
Oct 2026
Edelman's density bound for
λ
min
\lambda_{\min}
λ
m
i
n
of a Wishart matrix, integrated:
P
{
λ
min
(
G
G
⊤
)
≤
t
}
≤
∫
0
t
c
r
,
k
λ
(
k
−
r
−
1
)
/
2
e
−
λ
/
2
d
λ
\mathbb P\{\lambda_{\min}(GG^\top)\le t\}\le\int_0^t c_{r,k}\lambda^{(k-r-1)/2}e^{-\lambda/2}d\lambda
P
{
λ
m
i
n
(
G
G
⊤
)
≤
t
}
≤
∫
0
t
c
r
,
k
λ
(
k
−
r
−
1
)
/2
e
−
λ
/2
d
λ
Open
Oct 2026
One-dimensional Gaussian integration by parts (Stein's identity):
∫
x
h
(
x
)
d
γ
=
∫
h
′
d
γ
\int x\,h(x)\,d\gamma=\int h'\,d\gamma
∫
x
h
(
x
)
d
γ
=
∫
h
′
d
γ
Proved
Oct 2026
Commutation of the Ornstein–Uhlenbeck semigroup with differentiation:
(
P
t
f
)
′
=
e
−
t
P
t
(
f
′
)
(P_tf)'=e^{-t}P_t(f')
(
P
t
f
)
′
=
e
−
t
P
t
(
f
′
)
Proved
Oct 2026
Invariance of
N
(
0
,
1
)
N(0,1)
N
(
0
,
1
)
under the Ornstein–Uhlenbeck semigroup:
∫
P
t
h
d
γ
=
∫
h
d
γ
\int P_th\,d\gamma=\int h\,d\gamma
∫
P
t
h
d
γ
=
∫
h
d
γ
Proved
Oct 2026
Entropy dissipation along the Ornstein–Uhlenbeck semigroup:
d
d
t
∫
P
t
f
log
P
t
f
d
γ
=
−
∫
(
(
P
t
f
)
′
)
2
/
P
t
f
d
γ
\frac{d}{dt}\int P_tf\log P_tf\,d\gamma=-\int ((P_tf)')^2/P_tf\,d\gamma
d
t
d
∫
P
t
f
lo
g
P
t
f
d
γ
=
−
∫
((
P
t
f
)
′
)
2
/
P
t
f
d
γ
Proved
Oct 2026
Gaussian log-Sobolev inequality
E
n
t
γ
(
f
)
≤
1
2
∫
(
f
′
)
2
/
f
d
γ
\mathrm{Ent}_\gamma(f)\le\frac12\int (f')^2/f\,d\gamma
Ent
γ
(
f
)
≤
2
1
∫
(
f
′
)
2
/
f
d
γ
for
C
1
C^1
C
1
functions
f
f
f
bounded away from
0
0
0
with bounded derivative
Proved
Oct 2026
Gaussian log-Sobolev inequality for compactly supported
C
1
C^1
C
1
functions:
E
n
t
γ
(
g
2
)
≤
2
∫
(
g
′
)
2
d
γ
\mathrm{Ent}_\gamma(g^2)\le 2\int (g')^2\,d\gamma
Ent
γ
(
g
2
)
≤
2
∫
(
g
′
)
2
d
γ
Proved
Oct 2026
Slepian's inequality: equal variances and dominated increments imply
P
(
max
t
X
t
>
τ
)
≤
P
(
max
t
Y
t
>
τ
)
\mathbb P(\max_t X_t>\tau)\le\mathbb P(\max_t Y_t>\tau)
P
(
max
t
X
t
>
τ
)
≤
P
(
max
t
Y
t
>
τ
)
for centered Gaussian vectors
Proved
Oct 2026
Smooth uniform approximation of Euclidean-Lipschitz functions on
R
ι
\mathbb{R}^\iota
R
ι
preserving the Lipschitz constant
Proved
Oct 2026
Gaussian logarithmic Sobolev inequality on
R
ι
\mathbb{R}^\iota
R
ι
:
E
n
t
γ
ι
(
g
2
)
≤
2
∫
∥
∇
g
∥
2
2
d
γ
ι
\mathrm{Ent}_{\gamma_\iota}(g^2)\le 2\int\|\nabla g\|_2^2\,d\gamma_\iota
Ent
γ
ι
(
g
2
)
≤
2
∫
∥∇
g
∥
2
2
d
γ
ι
for
C
1
C^1
C
1
functions
g
g
g
Proved
Oct 2026
Tensorization (subadditivity) of entropy for product probability measures:
E
n
t
⊗
μ
i
(
h
)
≤
∑
i
∫
E
n
t
μ
i
(
h
)
d
μ
\mathrm{Ent}_{\otimes\mu_i}(h)\le\sum_i\int\mathrm{Ent}_{\mu_i}(h)\,d\mu
Ent
⊗
μ
i
(
h
)
≤
∑
i
∫
Ent
μ
i
(
h
)
d
μ
Proved
Oct 2026
Gaussian integration by parts:
E
[
U
G
(
V
)
]
=
∑
j
C
o
v
(
U
,
V
j
)
E
[
∂
j
G
(
V
)
]
\mathbb E[U\,G(V)]=\sum_j \mathrm{Cov}(U,V_j)\,\mathbb E[\partial_j G(V)]
E
[
U
G
(
V
)]
=
∑
j
Cov
(
U
,
V
j
)
E
[
∂
j
G
(
V
)]
for jointly Gaussian
(
U
,
V
)
(U,V)
(
U
,
V
)
,
U
U
U
centered,
G
∈
C
b
1
G\in C^1_b
G
∈
C
b
1
Proved
Oct 2026
Norms of Gaussian vectors:
E
∥
h
N
∥
2
−
E
∥
g
n
∥
2
≥
N
−
n
\mathbb E\|h_N\|_2-\mathbb E\|g_n\|_2\ge\sqrt N-\sqrt n
E
∥
h
N
∥
2
−
E
∥
g
n
∥
2
≥
N
−
n
for
1
≤
n
≤
N
1\le n\le N
1
≤
n
≤
N
Proved
Oct 2026
Gordon's minimax comparison inequality:
E
min
u
max
t
X
u
t
≤
E
min
u
max
t
Y
u
t
\mathbb E\min_u\max_t X_{ut}\le\mathbb E\min_u\max_t Y_{ut}
E
min
u
max
t
X
u
t
≤
E
min
u
max
t
Y
u
t
for centered Gaussian arrays
Proved
Oct 2026
Second-moment Chevet bound:
E
∥
S
G
T
∥
2
≤
(
∥
S
∥
∥
T
∥
F
+
∥
S
∥
F
∥
T
∥
)
2
\mathbb E\|SGT\|^2\le(\|S\|\|T\|_F+\|S\|_F\|T\|)^2
E
∥
S
GT
∥
2
≤
(
∥
S
∥∥
T
∥
F
+
∥
S
∥
F
∥
T
∥
)
2
Proved
Oct 2026
Chevet–Gordon bound:
E
∥
S
G
T
∥
≤
∥
S
∥
∥
T
∥
F
+
∥
S
∥
F
∥
T
∥
\mathbb E\|SGT\|\le\|S\|\|T\|_F+\|S\|_F\|T\|
E
∥
S
GT
∥
≤
∥
S
∥∥
T
∥
F
+
∥
S
∥
F
∥
T
∥
for a standard Gaussian matrix
G
G
G
Proved
Oct 2026
Expected smallest singular value of a Gaussian matrix:
E
σ
min
(
G
)
≥
N
−
n
\mathbb E\,\sigma_{\min}(G)\ge\sqrt N-\sqrt n
E
σ
m
i
n
(
G
)
≥
N
−
n
Proved
Oct 2026
Expected spectral norm of a Gaussian matrix:
E
∥
G
∥
≤
N
+
n
\mathbb E\|G\|\le\sqrt N+\sqrt n
E
∥
G
∥
≤
N
+
n
Proved
Oct 2026
Sudakov–Fernique inequality: dominated increments imply
E
max
t
X
t
≤
E
max
t
Y
t
\mathbb E\max_t X_t\le\mathbb E\max_t Y_t
E
max
t
X
t
≤
E
max
t
Y
t
for centered Gaussian vectors
Proved
Oct 2026
One-dimensional Gaussian logarithmic Sobolev inequality:
E
n
t
γ
(
g
2
)
≤
2
∫
(
g
′
)
2
d
γ
\mathrm{Ent}_\gamma(g^2)\le 2\int (g')^2\,d\gamma
Ent
γ
(
g
2
)
≤
2
∫
(
g
′
)
2
d
γ
for
C
1
C^1
C
1
functions
g
:
R
→
R
g:\mathbb{R}\to\mathbb{R}
g
:
R
→
R
Proved
Oct 2026
Tropp–Webber numerical inequality (B.8):
(
1
+
2
p
x
+
1
−
2
p
)
Γ
(
x
+
2
)
−
2
p
/
(
x
+
1
)
≤
(
e
/
x
)
2
p
\big(1+\frac{2p}{x+1-2p}\big)\Gamma(x+2)^{-2p/(x+1)}\le (e/x)^{2p}
(
1
+
x
+
1
−
2
p
2
p
)
Γ
(
x
+
2
)
−
2
p
/
(
x
+
1
)
≤
(
e
/
x
)
2
p
for
1
≤
p
≤
18
1\le p\le 18
1
≤
p
≤
18
,
x
≥
2
p
x\ge 2p
x
≥
2
p
Proved
Oct 2026
∥
A
†
∥
2
=
∥
(
A
A
⊤
)
−
1
∥
\|A^\dagger\|^2=\|(AA^\top)^{-1}\|
∥
A
†
∥
2
=
∥
(
A
A
⊤
)
−
1
∥
for
A
†
=
A
⊤
(
A
A
⊤
)
−
1
A^\dagger=A^\top(AA^\top)^{-1}
A
†
=
A
⊤
(
A
A
⊤
)
−
1
Proved
Oct 2026
∥
(
A
A
⊤
)
−
1
∥
=
1
/
σ
min
(
A
⊤
)
2
\|(AA^\top)^{-1}\|=1/\sigma_{\min}(A^\top)^2
∥
(
A
A
⊤
)
−
1
∥
=
1/
σ
m
i
n
(
A
⊤
)
2
(with Mathlib's conventions
0
−
1
=
0
0^{-1}=0
0
−
1
=
0
)
Proved
Oct 2026
Lower tail of the smallest Wishart eigenvalue:
P
{
λ
min
(
G
G
⊤
)
≤
t
}
≤
1
Γ
(
k
−
r
+
2
)
(
t
(
k
+
r
)
2
)
(
k
−
r
+
1
)
/
2
\mathbb P\{\lambda_{\min}(GG^\top)\le t\}\le \frac{1}{\Gamma(k-r+2)}\big(\tfrac{t(k+r)}{2}\big)^{(k-r+1)/2}
P
{
λ
m
i
n
(
G
G
⊤
)
≤
t
}
≤
Γ
(
k
−
r
+
2
)
1
(
2
t
(
k
+
r
)
)
(
k
−
r
+
1
)
/2
Open
Oct 2026
For
g
∼
N
(
0
,
I
k
)
g\sim\mathcal{N}(0,I_k)
g
∼
N
(
0
,
I
k
)
and fixed full-row-rank
H
H
H
,
H
g
Hg
H
g
is independent of the squared residual
∥
(
I
−
P
H
)
g
∥
2
\|(I-P_H)g\|^2
∥
(
I
−
P
H
)
g
∥
2
Proved
Oct 2026
Partitioned inverse, off-diagonal row entries:
(
(
G
G
⊤
)
−
1
)
i
,
j
=
−
(
(
H
H
⊤
)
−
1
H
g
)
j
(
(
G
G
⊤
)
−
1
)
i
i
((GG^\top)^{-1})_{i,j} = -\big((HH^\top)^{-1}Hg\big)_{j}\,((GG^\top)^{-1})_{ii}
((
G
G
⊤
)
−
1
)
i
,
j
=
−
(
(
H
H
⊤
)
−
1
H
g
)
j
((
G
G
⊤
)
−
1
)
ii
Proved
Oct 2026
Second moment of an off-diagonal entry of the inverse Wishart matrix:
E
[
(
W
−
1
)
i
j
2
]
=
1
/
(
(
k
−
r
)
(
k
−
r
−
1
)
(
k
−
r
−
3
)
)
\mathbb{E}[(W^{-1})_{ij}^2] = 1/((k-r)(k-r-1)(k-r-3))
E
[(
W
−
1
)
ij
2
]
=
1/
((
k
−
r
)
(
k
−
r
−
1
)
(
k
−
r
−
3
))
,
i
≠
j
i\neq j
i
=
j
Proved
Oct 2026
Mixed diagonal second moment of the inverse Wishart matrix:
E
[
(
W
−
1
)
i
i
(
W
−
1
)
j
j
]
=
(
k
−
r
−
2
)
/
(
(
k
−
r
)
(
k
−
r
−
1
)
(
k
−
r
−
3
)
)
\mathbb{E}[(W^{-1})_{ii}(W^{-1})_{jj}] = (k-r-2)/((k-r)(k-r-1)(k-r-3))
E
[(
W
−
1
)
ii
(
W
−
1
)
j
j
]
=
(
k
−
r
−
2
)
/
((
k
−
r
)
(
k
−
r
−
1
)
(
k
−
r
−
3
))
,
i
≠
j
i\neq j
i
=
j
Proved
Oct 2026
Rotation identity for inverse Wishart second moments:
E
[
(
W
−
1
)
i
i
2
]
=
E
[
(
W
−
1
)
i
i
(
W
−
1
)
j
j
]
+
2
E
[
(
W
−
1
)
i
j
2
]
\mathbb{E}[(W^{-1})_{ii}^2] = \mathbb{E}[(W^{-1})_{ii}(W^{-1})_{jj}] + 2\,\mathbb{E}[(W^{-1})_{ij}^2]
E
[(
W
−
1
)
ii
2
]
=
E
[(
W
−
1
)
ii
(
W
−
1
)
j
j
]
+
2
E
[(
W
−
1
)
ij
2
]
Proved
Oct 2026
Second moment of a diagonal entry of the inverse Wishart matrix:
E
[
(
(
G
G
⊤
)
−
1
)
i
i
2
]
=
1
/
(
(
k
−
r
−
1
)
(
k
−
r
−
3
)
)
\mathbb{E}[((GG^\top)^{-1})_{ii}^2] = 1/((k-r-1)(k-r-3))
E
[((
G
G
⊤
)
−
1
)
ii
2
]
=
1/
((
k
−
r
−
1
)
(
k
−
r
−
3
))
Proved
Oct 2026
Inverse second moment of the chi-square distribution:
E
[
(
χ
d
2
)
−
2
]
=
1
/
(
(
d
−
2
)
(
d
−
4
)
)
\mathbb{E}[(\chi^2_d)^{-2}] = 1/((d-2)(d-4))
E
[(
χ
d
2
)
−
2
]
=
1/
((
d
−
2
)
(
d
−
4
))
for
d
≥
5
d \ge 5
d
≥
5
Proved
Oct 2026
L
q
L^q
L
q
norm of a reciprocal chi-square:
E
[
Ξ
−
q
]
<
(
3
/
d
)
q
\mathbb{E}[\Xi^{-q}] < (3/d)^q
E
[
Ξ
−
q
]
<
(
3/
d
)
q
for
q
=
(
d
−
1
)
/
2
q=(d-1)/2
q
=
(
d
−
1
)
/2
,
d
≥
5
d \ge 5
d
≥
5
(HMT Lemma A.10)
Proved
Oct 2026
Negative moments of the chi-square distribution:
E
[
Ξ
−
q
]
=
Γ
(
d
/
2
−
q
)
/
(
2
q
Γ
(
d
/
2
)
)
\mathbb{E}[\Xi^{-q}] = \Gamma(d/2-q)/(2^q\Gamma(d/2))
E
[
Ξ
−
q
]
=
Γ
(
d
/2
−
q
)
/
(
2
q
Γ
(
d
/2
))
for
0
≤
q
<
d
/
2
0 \le q < d/2
0
≤
q
<
d
/2
Proved
Oct 2026
Each diagonal entry of an inverse Wishart matrix is a reciprocal chi-square:
(
(
G
G
⊤
)
−
1
)
i
i
∼
1
/
χ
k
−
r
+
1
2
((GG^\top)^{-1})_{ii} \sim 1/\chi^2_{k-r+1}
((
G
G
⊤
)
−
1
)
ii
∼
1/
χ
k
−
r
+
1
2
Proved
Oct 2026
Gaussian log-Sobolev bound for exponentials of Lipschitz functions:
E
n
t
γ
(
e
s
f
)
≤
s
2
L
2
2
E
γ
e
s
f
\mathrm{Ent}_\gamma(e^{sf})\le\frac{s^2L^2}{2}\,\mathbb{E}_\gamma e^{sf}
Ent
γ
(
e
s
f
)
≤
2
s
2
L
2
E
γ
e
s
f
Proved
Oct 2026
Herbst's argument: an entropy bound
E
n
t
(
e
s
f
)
≤
c
s
2
E
e
s
f
\mathrm{Ent}(e^{sf})\le c s^2\,\mathbb{E}e^{sf}
Ent
(
e
s
f
)
≤
c
s
2
E
e
s
f
for all
s
>
0
s>0
s
>
0
implies
E
e
s
f
≤
e
s
E
f
+
c
s
2
\mathbb{E}e^{sf}\le e^{s\mathbb{E}f+cs^2}
E
e
s
f
≤
e
s
E
f
+
c
s
2
Proved
Oct 2026
Sharp Gaussian concentration for Lipschitz functions of a standard Gaussian vector:
P
{
f
(
X
)
≥
E
f
(
X
)
+
L
t
}
≤
e
−
t
2
/
2
\mathbb{P}\{f(X)\ge\mathbb{E}f(X)+Lt\}\le e^{-t^2/2}
P
{
f
(
X
)
≥
E
f
(
X
)
+
L
t
}
≤
e
−
t
2
/2
Proved
Oct 2026
Distance of a standard Gaussian vector to a fixed subspace: if
rank
B
+
d
≤
N
\operatorname{rank}B+d\le N
rank
B
+
d
≤
N
then
P
{
dist
(
g
,
col
B
)
2
≤
u
}
≤
(
e
u
/
d
)
d
/
2
\mathbb P\{\operatorname{dist}(g,\operatorname{col}B)^2\le u\}\le (eu/d)^{d/2}
P
{
dist
(
g
,
col
B
)
2
≤
u
}
≤
(
e
u
/
d
)
d
/2
Proved
Oct 2026
Small-ball bound for the distance of a Gaussian column to the span of the others:
P
{
dist
(
a
j
,
H
j
)
2
≤
u
}
≤
(
e
u
/
(
N
−
n
+
1
)
)
(
N
−
n
+
1
)
/
2
\mathbb P\{\operatorname{dist}(a_j,H_j)^2\le u\}\le (eu/(N-n+1))^{(N-n+1)/2}
P
{
dist
(
a
j
,
H
j
)
2
≤
u
}
≤
(
e
u
/
(
N
−
n
+
1
)
)
(
N
−
n
+
1
)
/2
Proved
Oct 2026
Small
σ
min
\sigma_{\min}
σ
m
i
n
forces a column close to the span of the others:
σ
min
(
A
)
≤
s
⇒
∃
j
,
dist
(
a
j
,
H
j
)
≤
n
s
\sigma_{\min}(A)\le s\Rightarrow \exists j,\ \operatorname{dist}(a_j,H_j)\le\sqrt n\, s
σ
m
i
n
(
A
)
≤
s
⇒
∃
j
,
dist
(
a
j
,
H
j
)
≤
n
s
Proved
Oct 2026
Expectation bound from a polynomial tail:
P
{
X
>
t
}
≤
C
t
−
m
\mathbb P\{X>t\}\le C t^{-m}
P
{
X
>
t
}
≤
C
t
−
m
with
m
>
1
m>1
m
>
1
implies
E
X
≤
C
1
/
m
m
m
−
1
\mathbb E X\le C^{1/m}\,\frac{m}{m-1}
E
X
≤
C
1/
m
m
−
1
m
Proved
Oct 2026
Inverse moment of the chi-square distribution:
E
[
1
/
χ
d
2
]
=
1
/
(
d
−
2
)
\mathbb{E}[1/\chi^2_d] = 1/(d-2)
E
[
1/
χ
d
2
]
=
1/
(
d
−
2
)
for
d
≥
3
d \ge 3
d
≥
3
Proved
Oct 2026
Residual of a standard Gaussian vector against a fixed
n
n
n
-dimensional row space is
χ
k
−
n
2
\chi^2_{k-n}
χ
k
−
n
2
Proved
Oct 2026
Schur complement formula for a diagonal entry of
(
G
G
⊤
)
−
1
(GG^\top)^{-1}
(
G
G
⊤
)
−
1
:
(
(
G
G
⊤
)
−
1
)
i
i
=
1
/
∥
(
I
−
P
i
)
g
i
∥
2
((GG^\top)^{-1})_{ii} = 1/\|(I-P_i)g_i\|^2
((
G
G
⊤
)
−
1
)
ii
=
1/∥
(
I
−
P
i
)
g
i
∥
2
Proved
Oct 2026
The spectral norm is
1
1
1
-Lipschitz for the Frobenius norm:
∣
∥
A
∥
−
∥
B
∥
∣
≤
∥
A
−
B
∥
F
\big|\|A\|-\|B\|\big|\le\|A-B\|_F
∥
A
∥
−
∥
B
∥
≤
∥
A
−
B
∥
F
Proved
Oct 2026
The smallest singular value is
1
1
1
-Lipschitz for the Frobenius norm:
∣
σ
min
(
A
)
−
σ
min
(
B
)
∣
≤
∥
A
−
B
∥
F
|\sigma_{\min}(A)-\sigma_{\min}(B)|\le\|A-B\|_F
∣
σ
m
i
n
(
A
)
−
σ
m
i
n
(
B
)
∣
≤
∥
A
−
B
∥
F
Proved
Oct 2026
Deviation of the extreme singular values of a Gaussian matrix:
N
−
n
−
t
≤
s
min
(
A
)
≤
s
max
(
A
)
≤
N
+
n
+
t
\sqrt N-\sqrt n-t\le s_{\min}(A)\le s_{\max}(A)\le\sqrt N+\sqrt n+t
N
−
n
−
t
≤
s
m
i
n
(
A
)
≤
s
m
a
x
(
A
)
≤
N
+
n
+
t
with probability
≥
1
−
2
e
−
t
2
/
2
\ge1-2e^{-t^2/2}
≥
1
−
2
e
−
t
2
/2
Proved
Oct 2026