The natural algorithmic approach of mixed trigonometric-polynomial problems

The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities of the form ∑i=1nαixpicosqixsinrix>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sum_{i=1}^{n}\alpha _{i}x^{p_{i}} \cos ^{q_{i}} x\sin ^{r_{i}} x>0 $$\end{document} by reducing them to polynomial inequalities. Finally, we show the great applicability of this algorithm and, as an example, we use it to analyze some new rational (Padé) approximations of the function cos2x and to improve a class of inequalities by Yang. The results of our analysis could be implemented by means of an automated proof assistant, so our work is a contribution to the library of automatic support tools for proving various analytic inequalities.


Introduction and motivation
In this paper, we propose a general computational method for reducing some inequalities involving trigonometric functions to the corresponding polynomial inequalities. Our work has been motivated by many papers [-] recently published in this area. As an example, we mention the work of Mortici [] who extended Wilker-Cusa-Huygens inequalities using the method he called the natural approach method. This method consists in comparing and replacing sin x and cos x by their corresponding Taylor polynomials as follows: for every integer s, k ∈ N  and x ∈ (, π/).
In this way, complicated trigonometric expressions can be reduced to polynomial or rational expressions, which can be, at least theoretically, easier studied (this can be done using some software for symbolic computation, such as Maple).
For example, Mortici in [] (Theorem ) proved the following inequality: by intercalating the following Taylor polynomials: where R(t) = , -,t + t t  .
Let δ  ≤  ≤ δ  , with δ  < δ  . Recall that a function defined by the formula is named a mixed trigonometric-polynomial function, denoted in the sequel by an MTP function [, ]. Here, α i ∈ R \ {}, p i , q i , r i ∈ N  , n ∈ N. Moreover, an inequality of the form f (x) >  is called a mixed trigonometric-polynomial inequality (MTP inequality). MTP functions currently appear in the monographs on the theory of analytical inequalities [, ] and [], while concrete MTP inequalities are employed in numerous engineering problems (see, e.g., [, ]). A large class of inequalities arising from different branches of science can be reduced to MTP inequalities.
It is notable that many of the above-mentioned analyses and treatments of MTP inequalities are all rather sophisticated and involve complex transformations and estimations. Almost all approaches are designed for 'pen and paper analysis' and many of them are ripe for automation, being formally defined in precise detail, and yet somewhat overwhelming for humans.
Notwithstanding, the development of formal methods and procedures for automated generation of proofs of analytical inequalities remains a challenging and important task of artificial intelligence and automated reasoning [, ].
The aim of this paper is to develop a new algorithm, based on the natural approach method, for proving MTP inequalities by reducing to polynomial inequalities.
Although transformation based on the natural approach method has been made by several researchers in their isolated studies, a unified approach has not been given yet. Moreover, it is interesting to note that just trigonometric expressions involving odd powers of cos x were studied, as the natural approach method cannot be directly applicable for the function cos  x over the entire interval (, π/). Our aim is to extend and formalize the ideas of the natural approach method for a wider class of trigonometric inequalities, including also those containing even powers of cos x, with no further restrictions.
Notice the logical-hardness general problem under consideration. According to Wang [], for every function G defined by arithmetic operations and a composition over polynomials and sine functions of the form sin πx, there is a real number r such that the problem G(r) =  is undecidable (see []). In , Laczkovich [] proved that this result can be derived if the function G is defined in terms of the functions x, sin x and sin(x sin x n ), n = , , . . . (without involving π ). On the other hand, several algorithms [, ] and [] have been developed to determine the sign and the real zeroes of a given polynomial, so that such problems can be considered decidable (see also [, ]).
Let us denote by the Taylor polynomial of nth degree associated with the function φ at a point a. Here, T φ,a n (x) and T φ,a n (x) represent the Taylor polynomial of nth degree associated with the function φ at a point a, in the case T φ,a for every x ∈ (a, b). We will call T φ,a n (x) and T φ,a n (x) an upward and a downward approximation of φ on (a, b), respectively.
We present a new algorithm for approximating a given MTP function f (x) by a polynomial function P(x) such that using the upward and downward Taylor approximations

The natural approach method and the associated algorithm
The following two lemmas [] related to the Taylor polynomials associated with sine and cosine functions will be of great help in our study. and for every -(n + )(n + ) ≤ x ≤ (n + )(n + ). () According to Lemmas -, the upper bounds of the approximation intervals of the functions sin x and cos x are ε  = √ (n  + )(n  + ) and ε  = √ (n  + )(n  + ), respectively. As ε  > π  and ε  > π  , the results of these lemmas are valid, in particular, in the entire interval (, π  ). Then In contrast to the function sin x and its downward Taylor approximations, in the interval (, π  ) the function cos x and the downward Taylor approximations T cos, (i)! , k ∈ N  , require special attention as there is no downward Taylor approximation T cos, k+ (x) such that cos  x ≥ (T cos, k+ (x))  for every x ∈ (, π  ). We present the following results related to the problem with downward Taylor approximations of the cosine function.
The existence of c k follows from the fact that T cos, k+ () =  >  and T cos, k+ ( π  ) < cos ( π  ) = . () The monotonicity of the sequence (c k ) k∈N  is a result of the monotonicity of T cos, k+ (x) and Lemma (ii).
The convergence of the sequence (T cos, n (x)) n∈N implies the convergence of the sequence (c k ) k∈N  to π  .
() The function |T cos, k+ (x)| is decreasing on (, c k ) and increasing on (c k , π  ). Based on Lemma (ii), it follows that there exists d k ∈ (c k , π  ) such that cos d k = |T cos, k+ (d k )|. () This statement is a consequence of the monotonicity of the sequence (c k ) k∈N  and the increasing monotonicity of the function |T cos, k+ (x)| on (c k , π  ).
Corollary  Let k ∈ N  and p ∈ N. Then Based on the above results, we have the following.
In order to ensure the correctness of the algorithm [, ] we will develop next in the sequel, the following problem needs to be considered.

Remark
If cos x appears in odd powers only in the given MTP function f (x), we take k = .
One of the methods to solve the problem of downward approximation of the function cos p x, p ∈ N is the method of multiple angles developed in []. All degrees of the functions sin x and cos x are eliminated from the given MTP function f (x) through conversion into multiple-angle expressions. This removes all even degrees of the function cos x, but then sine and cosine functions appear in the form sin κx or cos κx, where κx ∈ (, κ π  ) and κ ∈ N. In this case, in order to use the results of Lemmas -, we are forced to choose large Note that a higher value of k implies a higher degree of the downward Taylor approximations and of the polynomial

see [] and []).
Several more ideas to solve the above problem are proposed and considered below under the names of Methods A-D. In the following, the numbers c k and d k are those defined in Proposition .
Method A If δ < π  , find the smallest k ∈ N  such that d k ∈ (δ, π  ). Then k = k.
Note that Method A assumes solving a transcendental equation of the form cos x = T cos, k+ (x) that requires numerical methods.

Method B
If δ < π  , find the smallest k ∈ N  such that c k ∈ (δ, π  ). Then k = k.
Method C If δ < π  , find the smallest k ∈ N  such that T cos, k+ (δ) ≥ . Then k = k.
Note that Method B and Method C return the same output as for given δ and for every k ∈ N  the following equivalence holds true: As Method B assumes determining the root c k of the downward Taylor approximation T cos, k+ (x) and Method C assumes checking the sign of the downward Taylor approximation at point x = δ, it is notable that Method C presents a faster and simpler procedure.
Method D Eliminate all even degrees of the function cos x using the transformation Then k = .
Note that Method D can be applied for any  < δ ≤ π/. Hence, if an MTP function f (x) is considered in the whole interval (, π  ), then Method D is applicable only (apart from the multiple-angle method). However, Method D implies an increase in the number of terms needed to be estimated. Let us represent a given MTP function f in the following form: where there are no terms of the form cos j x, j ∈ N, in f  (x). The elimination of all terms of the form cos k i x from () using transformation () will increase the number of addends in (), in the general case with k  + k  + · · · + k m ; consequently, it will increase the number of terms of the form sin x, ∈ N, in () needed to be estimated.

An algorithm based on the natural approach method
Let f be an MTP function and I ⊆ (, π/). We concentrate on finding a polynomial T P f (x) such that for every x ∈ I, In this case, the associated MTP inequality f (x) >  can be proved if we show that for every x ∈ I, which is a decidable problem according to Tarski [, ]. The following algorithm describes the method for finding such a polynomial T P f (x).
Comment on step II of the Procedure Estimation: in the general case, the addend a i (x) = -β i x p i (sin x) q i (cos x) r i can be estimated in one of the following three ways: Note that for fixed s i , k i , q i and r i , the method (iii) generates polynomials of the smallest degree.
We present the following characteristic [, ] for the Natural Approach algorithm.

Theorem  The Natural Approach algorithm is correct.
Proof Every step in the algorithm is based on the results obtained from Lemmas - and Proposition . Hence, for every input instance (i.e., for any MTP function f (x) over a given interval I ⊆ (, π/)), the algorithm halts with the correct output (i.e., the algorithm returns the corresponding polynomial).

Some applications of the algorithm
We present an application of the Natural Approach algorithm in the proof (Application  -Theorem ) of certain new rational (Padé) approximations of the function cos  x, as well as in the improvement of a class of inequalities () by Yang (Application , Theorem ). In this example we introduce a constraint of the function cos  x by the following Padé approximations:

Application 
Theorem  The following inequalities hold true for every x ∈ (, π  ): Proof We first prove the left-hand side inequality (). Using the computer software for symbolic computations, we can conclude that the function G  (x) = (cos  x) [/] has exactly one zero δ = . . . . in the interval (, π  ). As G  () =  >  and G  ( π  ) = -. . . . < , we deduce that and Moreover, G  (x) < cos  x for every x ∈ (δ, π  ). We prove now that We search a downward Taylor polynomial T cos, k+ (x) such that for every x ∈ (, δ], We apply the Natural Approach algorithm to the function f (x) = cos  x, x ∈ (, δ], to determine the downward Taylor polynomial T cos, k+ (x) such that We can use Method C or Method D from the Natural Approach algorithm since δ < π  . In this proof, we choose Method C.
The smallest k for which T cos, k+ (δ) >  is k = . Therefore k = . In the Estimation procedure only step I can be applied to the (single) addend cos  x. In this step, s  ≥  and k  ≥ k =  should be selected. Let us select s  =  and k  = . a As a result of this selection, the output of the Natural Approach algorithm is the polynomial We prove that This is true since where Q(x) = x  + x  , -x  + ,x  , -,x  + , ,, -,,x  > .
Finally, we have G  (x) < cos  x for every x ∈ (, δ]. According to (), we have Now we prove the right-hand side inequality (). For G  (x) = (cos  x) [/] , we prove the following inequalities for every x ∈ (, π  ): Based on Proposition , it is enough to prove that for every x ∈ (, π  ), This is true as where R(x) = x  , -x  + x  ,, -,x  +  , -,x  > .
Since cos  x ≤ (T cos, k (x))  , for every k ∈ N  and all x ∈ (, π  ), we have Note Using Padé approximations, Bercu [, ] recently refined certain trigonometric inequalities over various intervals I = (, δ) ⊆ (, π  ). All such inequalities can be proved in a similar way and using the Natural Approach algorithm as in the proof of Theorem .
In this example we propose the following improvement of ().
Theorem  The following inequalities hold true for every x ∈ (, π) and a ∈ (,   ): Proof As a >  and  < sin x x < , we have We prove now the following inequality: for every x ∈ (, π) and a ∈ (,   ). It suffices to show that the following mixed logarithmictrigonometric-polynomial function [] is positive for every x ∈ (, π) and a ∈ (,   ). Given that based on the ideas from [], we connect the function F(x) to the analysis of its derivative where f (t) = t(a -) cos  t -a sin t cos t -t(a -).
Let us note that F (x) is the quotient of two MTP functions.
Hence, for every fixed t ∈ (, π  ), the value of () is greater than the value of the same expression for a =   : But so inequality () is true; and consequently, F (x) >  on (, π) for every a ∈ (,   ). But lim x→ F(x) = , so F(x) >  on (, π) for every a ∈ (,   ).
Remark on Theorem  Let us consider possible refinements of inequality () by a real analytical function ϕ a (x) = ( sin x x ) a for x ∈ (, δ) and a ∈ R. The function ϕ a (x) is real analytical as it is related to the analytical function x ∈ (, π). The restriction i.e., is a necessary and sufficient condition for f  (x) >  to hold on an interval (, δ (a)  ) (for some δ (a)  > ). Also, the restriction is a necessary and sufficient condition for f  (x) <  to hold on an interval (, δ (a)  ) (for some δ (a)  > ). The following equivalences hold true for every x ∈ (, π): The refinement in Theorem  is given based on the possible values of the parameter a in () and (). A similar analysis shows us that only the following refinements of inequality () are possible.

Conclusions and future work
The results of our analysis could be implemented by means of an automated proof assistant [], so our work is a contribution to the library of automatic support tools [] for proving various analytic inequalities.
Our general algorithm associated with the natural approach method can be successfully applied to prove a wide category of classical MTP inequalities. For example, the Natural Approach algorithm has recently been used to prove several open problems that involve MTP inequalities (see, e.g., [-]).
It is our contention that the Natural Approach algorithm can be used to introduce and solve other new similar results. Chen [] used a similar method to prove the following inequalities, for every x ∈ (, ): then he proposed the following inequalities as a conjecture: Very recently, Malešević et al. [] solved this open problem using the same procedure, i.e., the natural approach method, associated with upwards and downwards approximations of the inverse trigonometric functions. Finally, we present other ways for approximating the function cos n x, n ∈ N. It is well known that the power series of the function cos n x converges to the function everywhere on R. The power series of the function cos n x is an alternating sign series. For example, for n =  and x ∈ R, we have Therefore, for the above power (Taylor) series, it is not hard to determine (depending on m) which partial sums (i.e., Taylor polynomials) T cos  x, m (x) become good downward or upward approximations of the function cos  x in a given interval I. Assuming the following representation of the function cos n x in power (Taylor) series with a (n) j >  (j = , , , , . . .), the power (Taylor) series of function cos n+ x will be an alternating sign series as follows: cos n+ x = cos  x · cos n x = a (n) with a (n+) j >  (j = , , , , . . .). Therefore, in general, for the function cos n x, it is possible to determine, depending on the form of the real natural number m, the upward (downward) Taylor approximations T cos n x, m (x) (T cos n x, m (x)) that are all above (below) the considered function in a given interval I. Such estimation of the function cos n x and the use of corresponding Taylor approximations will be the object of future research.