Search arXivSearch

arXiv · 2606.02847

Sharp log-Sobolev inequalities and quartic stability on finite cyclic groups

Abstract

Let $\mathbb Z_n$ be the cyclic group equipped with the uniform probability measure $π$, and let $A_{ψ_n}$ be the Laplacian with word length $$ ψ_n(k) = \min(k,n-k). $$ For every $n\ge4$, we prove the sharp log-Sobolev inequality $$ \text{Ent}_π(|f|^2) \le 2π(\bar{f}A_{ψ_n} f), \qquad f:\mathbb Z_n \to \mathbb{C}, $$ where $\text{Ent}_π$ is the relative entropy with respect to $π$. Equivalently, the Poisson semigroup $P_t=e^{-tA_{ψ_n}}$ satisfies the optimal hypercontractivity. The proof is inspired by the recent work of Frank and Ivanisvili [FI26] on a sharp log-Sobolev inequality for the nearest-neighbor simple random walk. Similar arguments yield a simple proof of Weissler's sharp log-Sobolev inequality for the Poisson semigroup on the circle \cite{Weissler1980}. The same inequalities were independently obtained by Yao~\cite{Yao2026} using a different method. We also prove quantitative stability estimates. For $n\ge 4$ and $f:\mathbb Z_n\to[0,\infty)$ with $π(f^2)=1$, $$ 2π(fA_{ψ_n}f)-\operatorname{Ent}_π(f^2) \ge \frac1{12}\|f-1\|_{L^2(π)}^4, $$ with coefficient $1/(12d)$ on products $(\mathbb Z_n)^d$. The quartic order and the $d^{-1}$ dependence are optimal.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xinyuan Xie, Haonan Zhang. 2026-08-31. Sharp log-Sobolev inequalities and quartic stability on finite cyclic groups. https://arxiv.org/abs/2606.02847

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the prime field spherical restriction conjecture in four dimensions: breaking the Stein-Tomas exponent and applications

Let $p$ be an odd prime. We prove the extension estimate $R_{S_j}^*(2\to r)\lesssim_r 1$ for every nonzero-radius sphere $S_j\subseteq\mathbb{F}_p^4$ and every $r\geq \, 34/11$, uniformly in $p$ and $j$. This improves the Stein--Tomas exponent $10/3$ established by Iosevich and Koh (2008). We also formulate a localized spherical restriction/extension conjecture that predicts the sharp dependence of the restriction norm on the size of the physical support. This conjecture implies the spherical extension estimates $R_{S_j}^*(2\to r)\lesssim_r 1$ for every $r>3$, and yields almost-every-pin distance estimates at the conjectured Erdős--Falconer exponent in four dimensions, up to an arbitrarily small power loss in the set-size hypothesis. Using the same method, we improve the bounds supplied by Fourier decay and Plancherel at intermediate support scales and derive new almost-every-pin distance estimates in $\mathbb{F}_p^4$.

math.CA

Dimension-free estimates for discrete maximal functions over cubes in $\mathbb Z^d$

In this short note, we establish dimension-free $\ell^p(\mathbb Z^d)$ bounds, for all $p\in(1,\infty]$, for the discrete Hardy--Littlewood maximal functions associated with cubes in $\mathbb Z^d$, answering a question that had been open for a while. The key idea is to prove dimension-free bounds for the $\ell^p(\mathbb Z^d)$ norms of the differences of the corresponding averages. This follows from an ad hoc interpretation of the associated discrete multipliers as a special continuous family of multipliers to which basic fractional integration and complex interpolation can be applied. The same method also yields an elementary proof of Bourgain's dimension-free $L^p(\mathbb R^d)$ bounds for the Hardy--Littlewood maximal function associated with cubes in $\mathbb R^d$.

math.CA

Establishing the Polynomial Wolff Axioms for $δ$-Separated $δ$-Tubes With #o-minimality

We establish the full version of a conjecture of Guth and Zahl, giving a lower bound for the volume of a semialgebraic set that has a large intersection with a collection of $δ$-separated $δ$-tubes. Our proof uses o-minimal methods to simplify the proof of Katz and Rogers, who proved the conjecture up to a small factor. We also establish that the constants depend polynomially on the complexity of the semialgebraic set, and more generally in the #o-minimal setting.

math.CA