Abstract

This paper is devoted to the computation of the asymptotic boundary terms in entropy methods applied to a fast diffusion equation with weights associated with Caffarelli-Kohn-Nirenberg interpolation inequalities. So far, only elliptic equations have been considered and our goal is to justify, at least partially, an extension of the carre du champ / Bakry-Emery / Renyi entropy methods to parabolic equations. This makes sense because evolution equations are at the core of the heuristics of the method even when only elliptic equations are considered, but this also raises difficult questions on the regularity and on the growth of the solutions in presence of weights. We also investigate the relations between the optimal constant in the entropy–en- tropy production inequality, the optimal constant in the information–information production inequality, the asymptotic growth rate of generalized Renyi entropy powers under the action of the evolution equation and the optimal range of parameters for symmetry breaking issues in Caffarelli-Kohn-Nirenberg inequalities, under the assumption that the weights do not introduce singular boundary terms at x = 0. These considerations are new even in the case without weights. For instance, we establish the equivalence of carre du champ and Renyi entropy methods and explain why entropy methods produce optimal constants in entropy–entropy production and Gagliardo-Nirenberg inequalities in absence of weights, or optimal symmetry ranges when weights are present.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.