Let be the cyclic group equipped with the uniform probability measure , and let be the Laplacian with word length We prove the sharp log-Sobolev inequality for every . The proof is inspired by the recent work of Frank and Ivanisvili~\cite{FrankIvanisvili2026} on a sharp log-Sobolev inequality for nearest-neighbor simple random walk. We use their cubic-majorant reduction, which turns the problem into a 3rd moment estimate; the new point is a blockwise 3rd moment estimate adapted to the word-length multiplier. The same 3rd moment argument also recovers the log-Sobolev inequality for Poisson-semigroup on the circle, first proved by Weissler~\cite{Weissler1980}. The same sharp inequalities were also obtained recently by Yao~\cite{Yao2026} by a different method.

生成讲解博客的中文版本

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