Some notes on a method for proving inequalities by computer
Bojan D. Banjac, Milica D. Makragic, Branko J. Malesevic
Abstract
In this article we consider mathematical fundamentals of one method for proving inequalities by computer, based on the Remez algorithm. Using the well-known results of undecidability of the existence of zeros of real elementary functions, we demonstrate that the considered method generally in practice becomes one heuristic for the verification of inequalities. We give some improvements of the inequalities considered in the theorems for which the existing proofs have been based on the numerical verifications of Remez algorithm.
Create a lesson
Related papers
Poisson area and non-tangential maximal functions on manifolds with ends and applications
Peng Chen, Ji Li, Lixin Yan
Bounds for Orthogonal Expansion Coefficients via Weighted Primitives
Vladimir Sluchak
One-Sided Hardy--Littlewood Maximal Operators on Variable Lebesgue Spaces Beyond Log-Hölder Continuity
Lucas A. Vallejos
Lecture note on Fourier decoupling theory and its applications
Yudong Liang
Hyperplane Furstenberg Sets in Higher Dimensions
Peiqi Nie
Characterization of the group Fourier transform of Hilbert space Valued functions
Satyajyoti Achar, Md Hasan Ali Biswas, Ramesh Manna