Some Notes on a Method for Proving Inequalities by Computer

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.Mathematics Subject Classification. 41A10, 26D05.

New Wilker-type and Huygens-type inequalities

“…Let us emphasize that previous theorem improves result of Theorem 2 from [31]. Inspired by [2,13,14,17,19,22,27], and [31], we obtain a conclusion more general than Theorem 2.1. The details are as follows.…”

A proof of an open problem of Yusuke Nishizawa for a power-exponential function

“…Our approach, based on the fact (4), allows new proofs of some powerexponential inequalities from papers [1], [5]− [12] and monographs [2], [3].…”

One method for proving some classes of exponential analytical inequalities

“…for x ∈ (0, π/2) and parameter b ∈ R + . For the right-hand side of inequality (7) it is enough to observe the real analytical function…”