Let be a rectangular random matrix with i.i.d. entries (we assume ), and denote by its smallest singular value. When entries have mean zero and unit second moment, the celebrated work of Bai-Yin and Tikhomirov show that converges almost surely to However, little is known when the second moment is infinite. In this work we consider symmetric entry distributions satisfying for some , and prove that can be determined up to a log factor with high probability: for any , with probability at least we have for some constants . The upper bound was derived in a recent work of Bao, Lee and Xu \cite{bao2024phase2} but the lower bound is new and answers a problem posed in that paper in a weaker form. This appears to be the first determination of in the -stable case with a correct leading order of , as previous anti-concentration arguments only yield lower bound . The same lower bound holds for for any fixed rectangular matrix with no assumption on its operator norm. The case of diverging aspect ratio is also computed.

生成讲解博客的中文版本

生成AI智能校验的中文版本