Search arXivSearch

arXiv · 2605.18081

A Hexagonal Counterexample to Log-Convexity of Fisher Information Along the Heat Flow

Abstract

We construct a smooth, strictly positive, Gaussian-decaying density on $\mathbb{R}^2$ for which Fisher information along the heat flow is not log-convex. This disproves the Cheng--Geng log-convexity conjecture in dimension two and, by tensorization, in every dimension $d\ge2$. Consequently, the multidimensional forms of the Gaussian completely monotone conjecture, McKean's conjecture, and Toscani's entropy power conjecture also fail, complementing the one-dimensional counterexample of Gu and Sellke. Our construction is a small hexagonal perturbation on the triangular torus, transferred to $\mathbb{R}^2$ by a Gaussian envelope and supported by explicit two-dimensional numerics. We also initiate the study of the sharp constants $θ_d^*$ by proving $θ_1^*=1$, establishing monotonicity in the dimension, and identifying a dichotomy for the asymptotic constant $θ_\infty^*$ governed by the sign of $\mathcal{D}$. The explicit two-dimensional counterexample was found by GPT-5.5 Pro.

Explore related subjects

Keep this discovery

BibTeXRIS

Jiayang Zou, Luyao Fan, Jiayang Gao, Jia Wang. 2026-08-31. A Hexagonal Counterexample to Log-Convexity of Fisher Information Along the Heat Flow. https://arxiv.org/abs/2605.18081

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

Turing complete Navier-Stokes steady states via cosymplectic geometry

In this article, we construct stationary solutions to the Navier-Stokes equations on certain Riemannian $3$-manifolds that exhibit Turing completeness, in the sense that they are capable of performing universal computation. This universality arises on manifolds admitting nonvanishing harmonic 1-forms, thus showing that computational universality is not obstructed by viscosity, provided the underlying geometry satisfies a mild cohomological condition. The proof makes use of a correspondence between nonvanishing harmonic $1$-forms and cosymplectic geometry, which extends the classical correspondence between Beltrami fields and Reeb flows on contact manifolds.

math.DG

Geometric mean and Lebesgue-type decomposition of completely positive maps

We introduce the geometric mean and the parallel sum of completely positive (CP) maps between von Neumann algebras, based on the Pusz--Woronowicz theory of positive sesquilinear forms. We provide a concrete characterization via a block matrix positivity condition and establish their fundamental properties, including the AM--GM--HM inequality with respect to the CP order. In finite-dimensional settings, our construction is compatible with the Choi--Jamiolkowski correspondence, under which the geometric mean of CP maps corresponds to the Kubo--Ando geometric mean of their Choi matrices. This yields a natural operator-theoretic framework for interpolating quantum channels. As an application, we obtain index-type inequalities for conditional expectations in subfactor theory. Finally, we establish a Lebesgue-type decomposition of CP maps via a parallel sum construction, thereby providing a unified framework that simultaneously generalizes Ando's decomposition of bounded positive operators and Kosaki's decomposition of normal positive functionals on von Neumann algebras.

math.OA

Two Adjoint Perspectives on Fokker-Planck Optimization: A Microscopic-Macroscopic Correspondence

The Fokker-Planck equation admits both a macroscopic Eulerian description through probability densities and a microscopic Lagrangian description through stochastic trajectories. Consequently, optimization problems constrained by the Fokker-Planck equation can be formulated from either perspective. Surprisingly, the corresponding adjoint equations appear to be fundamentally different: the macroscopic adjoint is governed by the backward Kolmogorov equation, whereas the microscopic adjoint evolves pathwise along stochastic trajectories. In this note, we reconcile these two formulations by establishing their correspondence in the continuum setting. We further show that, although their discrete gradients no longer coincide after discretization, both provide consistent numerical approximations of the continuum gradient. Explicit convergence rates are established for both discretization strategies.

math.NA