Refinements and generalizations of some inequalities of Shafer-Fink's type for the inverse sine function.

In this paper, we give some sharper refinements and generalizations of inequalities related to Shafer-Fink's inequality for the inverse sine function stated in Theorems 1, 2, and 3 of Bercu (Math. Probl. Eng. 2017: Article ID 9237932, 2017).

Introduction

Inverse trigonometric functions, particularly the inverse sine function, have many applications in computer science and engineering. They are widely used in many fields, such as telecommunications, especially optical fiber telecommunications, signal processing, machine learning, and so on.

The main objective of the research presented in this paper is a refinement of Shafer-Fink’s inequality for ; see [2, 3].

Various improvements of Shafer-Fink’s inequality have been considered so far in [4] and [5-12]. Also, let us mention that one refinement of Shafer-Fink’s inequality was given in [13], and it had applications in [14, 15] (see also [16]).

In this paper, we focus on the results of Bercu [1] related to Shafer-Fink’s inequality and give generalizations and refinements of the inequalities stated in Theorems 1, 2, and 3 in that paper. For e convenience of the reader, we further cite them.

Statement 1

([1, Theorem 1])

For every real number , the following two-sided inequality holds:

Statement 2

([1, Theorem 3])

For every on the left-hand side and every on the right-hand side, the following inequalities hold:

Statement 3

([1, Theorem 2])

For every , we have: where .

Main results

The main results of this paper are generalizations and improvements of the inequalities related to Shafer-Fink’s inequalities given in Theorems 1, 2, and 3 by Bercu [1], here Statements 1, 2, and 3.

First, let us recall some well-known power series expansions.

For , where for .

Also, for , where for .

Refinements of the inequalities in Statements 1 and 2

Let us consider the function for and or .

Then, for , we have: where for and . Equality (11) is obtained by applying Cauchy’s product to the corresponding series.

It is easy to verify that the following recurrence relations hold: and for and or .

Next, let us consider the function for and or . Then, for , we have: where for .

Let us prove that for all , .

First, we note that for or , we have:

Now, let us assume that the statement holds for , that is, .

We will prove that the statement holds for , that is, .

Using the recurrence relations (12), (13), and (14), we get: Observing the above expression and using the induction hypothesis (), we conclude that . Hence, by the principle of mathematical induction it follows that for all , , that is,

Thus, we have proved the following theorem.

Theorem 1

For , , and or , we have the inequality

Remark 1

For and , we get the left-hand sides of the inequalities stated in Statements 1 and 2, respectively (Theorems 1 and 3 from Bercu [1]).

Example 1

For , the following statements are true for every . Also, for , the following statements are true for every .

If , then

If , then

If , then etc.

If , then

If , then

If , then etc.

Refinements of the inequality in Statement 3

In [1, Theorem 2], Bercu proved the following inequalities for every : where .

We propose the following improvement and generalization of (20).

Theorem 2

If and , then for every , where

Remark 2

Note that inequality (20) is a particular case of (21) for .

Example 2

For , inequality (21) refines inequality (20), and we have the following new results.

Taking in (21) gives

Taking in (21) gives

Taking in (21) gives etc.

Proof of Theorem 2

Based on Cauchy’s product of power series (5) and (7), the real analytical function has the power series where for  .

First, we prove relation (22). Consider the sequence where and Consider the function1 for and . It is not hard to verify that the functions and satisfy the following relation: If we sum both sides of (27) from to , then we get the relation Finally, as and we have the following recurrence for : An algorithm for finding solutions of linear recurrence equations with polynomial coefficients can be found, for example, in [17] and [18].

It is easy to verify that the function satisfies the recurrence relation (28). Hence, based on (25), (26), and (29), we have: for , .

Now we prove that for every  . It suffices to show that that is,

Statement (32) is true for , that is, . Observing that and using the induction hypothesis (i.e., for some positive integer ), we conclude, by the principle of mathematical induction, that . Therefore, inequalities (32) and (31) are true, and consequently for , . □

Conclusion

In this paper, we proposed and proved new inequalities, which present refinements and generalizations of inequalities stated in [1], related to Shafer-Fink’s inequality for the inverse sine function.

Also, our approach provides inequalities that allow new approximations of the functions Finally, let us note that proofs of inequalities (19) and (21) for any fixed and can be obtained by substituting for and using the methods and algorithms developed in [19] and [20].