Backend
An exact computer-assisted lower bound for Fisher-information convexity along the two-dimensional heat flow
arXiv math.IT0 views
arXiv:2610.20653v1 Announce Type: new Abstract: We study the sharp constant in the differential inequality \[ I(t)I''(t)\geq c\,[I'(t)]^2 \] for Fisher information along the probability-normalized heat flow on $\mathbb R^2$. The unrestricted log-convexity value $c=1$ is false in two dimensions, whereas the known square-root convexity theorem gives the universal value $c=1/2$. We construct an exact, machine-verifiable sum-of-squares certificate proving the stronger universal bound \[ c\geq \frac{231691}{250000}=0.926764. \] Together with an independent exact Fourier/Gaussian-envelope construction, this gives \[ 0.926764\leq c_*<0.94176665012062, \] where $c_*$ is the sharp constant for positive-time Gaussian convolutions of arbitrary probability measures on $\mathbb R^2$. We formulate the proof in explicit two-dimensional index notation. The lower bound follows from an exact rational polynomial identity involving a strictly positive denominator, a weighted total derivative, and eleven positive rational Gram matrices. All $491$ recorded leading principal minors are strictly positive and the complete polynomial identity has zero residual. No symmetry, log-concavity, finite-variance, or finite-entropy assumption is imposed on the initial measure. The sharp value remains open.
Source:https://arxiv.org/abs/2610.20653PreviousBrain-to-Language Decoding: Tasks, Signals, Methods, Evaluation, Practical Use and BeyondNextAnalog RF Computing for Integrated Data and AI Flows Over Wireless Networks
Related posts
DeepSeek's Open-Source "Super-Agent" Codes Without Being Asked
0dev.to GitHub
All-in-one platform or a stack you assemble? Where do coaches and educators land?
0dev.to Discuss
I Wanted to Live on Coruscant. PAT Scared Me. Now My Alexa Lives on Mute.
0dev.to Discuss
Detect What You Can Name: PaliGemma 2 Object Detection with Transformers
0dev.to Machine Learning
When Should an LLM Router Stop Being Sticky? llm-d 1.0 Cache-Affinity Routing, Break-Even Math, and a Simulation
0dev.to Machine Learning

Understanding HackerTube: Karpathy’s Two-Hour Experiment in Better Recommendations
0dev.to Machine Learning