I am not familiar with random matrices but I need to confirm the correctness of the inequality below.
Let $\xi_i\in\{\pm 1\}$ be independent random signs, and let $A_1,\ldots, A_n$ be $m\times m$ Hermitian matrices. Let $\sigma^2 = \|\sum_{i=1}^n Var[\xi_i]A_i^2\|$. Then $$Pr\bigg(\bigg\|\sum_{i=1}^n\mathbb{E}[\xi_i]A_i-\sum_{i=1}^n\xi_iA_i\bigg\|\geq t\sigma\bigg)\leq2m\exp(-t^2/2).$$
It is said to be cited from the paper "User-Friendly Tail Bounds for Sums of Random Matrices ". But I cannot find which results in that paper can imply the inequality. Is the inequality correct?
It's not correct.
Take random variable $\xi_i$ as $\mathbb{P}(\xi_i=1)=1$ for each $i$. Then $Var[\xi_i]=0$ for each $i$ and thus $\sigma = 0$. l.h.s. hold with probability $1$ while r.h.s is smaller than $1$ is take $t$ sufficiently large.