Oral tranexamic acid for bleeding during spinal surgery: A randomized double-blind placebo clinical trial

1.   Introduction

Convex functions are of great importance in both formal and applied sciences due to their nice properties associated with solving optimization problems. Especially, advances in mathematics accompany the progress of new convexity types which are extensions or generalizations of convex functions such as quasiconvexity, $B$-convexity, $B^{-1}$-convexity, $p$-convexity etc ^{[1,5,10,17,19]}. $s$-convexity is among them, which attracts many researchers and has found application area in fractal sets ^[7,9,12]. The basics of $s$-convexity goes back to the studies on modular spaces and Orclicz spaces ^[4,13]. $s$-convexity is a generalization of classical convexity obtained by means of changing the powers of parameters. To clarify, let us recall the classical definitions of convexity.

Let $A\subset\mathbb{R}^{n}$. $A$ is said to be convex if

for all $x, y\in A$ and $\lambda, \mu\in\lbrack0, 1]$ such that $\lambda+\mu = 1$. A real valued function $f$ defined on a convex set $A$ is said to be convex if

for the same variables as before. In ^[4,13], $s$-convex functions are introduced by using $s$th power of $\lambda$ and $\mu,$ where $s$ is called generic class constant and $0 < s\leq1$. They give two kinds of $s$-convex functions, namely, in the first sense and in the second sense. These functions on nonnegative real numbers are defined as follows.

Let $f:[0, \infty)\rightarrow \mathbb{R}$. The function $f$ is said to be $s$-convex function in the first sense if

for all $x, y\in\lbrack0, \infty)$ and $\lambda, \mu\in\lbrack0, 1]$ such that $\lambda^{s}+\mu^{s} = 1.$

For the function $f$ defined on the same set as above, it is said to be $s$-convex in the second sense if

for all $x, y\in\lbrack0, \infty)$ and $\lambda, \mu\in\lbrack0, 1]$ such that $\lambda+\mu = 1.$ ^[11] introduces $s$-convexity in the third sense by changing the parameters in a similar manner and extending the domain into subsets of $\mathbb{R}^{n}$. In order to set this kind of $s$-convexity, the function is defined on $p$-convex sets which is a generalization of convex sets and already given in ^[3,8].

Let $A\subseteq\mathbb{R}^{n}$ and $p\in(0, 1]$. $A$ is said to be $p$-convex set if

for all $x, y\in A$ and $\lambda, \mu\in\lbrack0, 1]$ such that $\lambda^{p} +\mu^{p} = 1$. In ^[11], $p$-convex sets are called $s$-convex sets. For sake of convenience, we use the same. On this set, the third sense $s$-convex function is given as follows:

Let $A\subset\mathbb{R}^{n}$ be a $s$-convex set and $f:A\rightarrow \mathbb{R}$. The function $f$ is said to be $s$-convex in the third sense if

for all $x, y\in A$ and $\lambda, \mu\in\lbrack0, 1]$ such that $\lambda^{s} +\mu^{s} = 1.$

In the literature, most of the salient studies on $s$-convex functions involves the $s$-convex versions of the integral inequalities presented for classical convex functions such as Hermite-Hadamard, Fejer, Grüss inequalities and these versions are given mostly for the first and second senses ^{[2,6,15,16,18]}. The Ostrowski inequality is one of them, which puts a bound for the difference between function and its average value on an interval. The Ostrowski inequality is stated as follows ^[14].

Let $f:\mathbb{R}\rightarrow \mathbb{R}$ be a differentiable function. If $\left\vert f^{\prime}(x)\right\vert \leq M,$ $x\in\lbrack a, b],$ then the following inequality holds for all $x\in\lbrack a, b]$:

In this work, we state the Ostrowski inequality for functions $f$ having the property that $|f ^ {\prime }|$ is $s$-convex in the third sense. Also, we obtain some relations relevant to Hermite-Hadamard inequality type results for $s$-convex functions in the third sense as special case. Moreover, using the obtained results, we provide a bound for a quadrature formula and some relations between generalized logarithmic and arithmetic means.

Also, let us state the necessary inequalities and formulas to be used throughout the paper. The Beta function is defined as follows:

and $B(\alpha_1, \alpha_2)$ satisfies the properties below:

2.   Main results

With the help of the following lemma the Ostrowski inequality is stated for functions $f$ on an interval $[a, b]$ such that $|f ^ {\prime }|$ is $s$-convex in the third sense. Also, by applying Hölder and power mean integral inequalities, we have different bounds expressed in terms of first derivatives of the function. In addition, as a special case of the obtained inequalities, different upper bounds can be obtained for the right hand side of the Hermite-Hadamard inequality for functions $f$ such that $|f ^ {\prime }|$ is $s$-convex in the third sense. To illustrate, we present it only in Corollary 4.

Lemma 1. Let $s\in (0, 1]$, $a, b\in \mathbb{R}$ with $a < b$, $f:[a, b]\rightarrow \mathbb{R}$ be a differentiable function and $f^{\prime }\in L[a, b],$ thenthe following holds:

Proof. The substitutions $y = t^{\frac{1}{s}}x+(1-t)^{\frac{1}{s}}a$ and $y = t^{\frac{1 }{s}}b+(1-t)^{\frac{1}{s}}x$ in the integrals at the right hand side yield

respectively. Letting $u = y-a$ and $u = y-b$, $f^{\prime }(y)dy = dv$ in common for the partial integration on integrals above, respectively. Then integration by parts yields the conclusion.

Before presenting the results, we give some auxiliary arguments, which are used in the proofs of the results.

Lemma 2. Let $s\in (0, 1]$, $t\in \lbrack 0, 1]$, $a, b\in \mathbb{R}$ with $a < b$, $x\in [a, b]$,

Then, the following inequalities hold:

Proof. (ⅰ) Using triangle inequality with $t^{\frac{1}{s}}\leq 1$ and $1-(1-t)^{ \frac{1}{s}}\geq 0,$ we have

Similarly, it can be easily seen that $\ \left\vert h_{1}(t)\right\vert \leq \left\vert x\right\vert +\left\vert b\right\vert.$

(ⅱ) Using triangle inequality with $t^{\frac{1}{s}-1}\leq 1$ and $(1-t)^{ \frac{1}{s}}\leq 1$, we get

$\left\vert g_{2}(t)\right\vert = \left\vert t^{\frac{1}{s}-1}x-(1-t)^{\frac{1 }{s}-1}a\right\vert \leq \left\vert t^{\frac{1}{s}-1}x\right\vert +\left\vert a(1-t)^{\frac{1}{s}-1}\right\vert \leq \left\vert x\right\vert +\left\vert a\right\vert.$

In the same way, it can be shown that $\left\vert h_{2}(t)\right\vert \leq\left\vert x\right\vert +\left\vert b\right\vert$.

(ⅲ) From triangle inequality, we have

(ⅳ) It can be easily seen by using the same method in the proof of (ⅲ).

Theorem 3. Let $a, b\in \mathbb{R}$ with $a < b$, $f:\mathbb{R}\rightarrow \mathbb{R}$ be adifferentiable function such that $\left\vert f^{ \prime}\right\vert$ is integrable on $[a, b]$ and $s$-convex in thethird sense on $\mathbb{R}$. Then the following inequality holds for all $x\in [a, b]$:

Proof. Using Lemma 1, triangle inequality, Lemma 2 (ⅰ)–(ⅱ), and the $s$-convexity of $\left\vert f^{\rm{ }\prime }\right\vert,$ we have

Applying Theorem 3 for $x = \frac{a+b}{2},$ we can get a bound for the left side of the Hermite-Hadamard inequality for functions $f$ such that $|f^{\prime}|$ is $s$-convex in the third sense. This result is similar to but different from the result given in ^[17].

Corollary 4. Let $f:\mathbb{R}\rightarrow \mathbb{R}$ be a differentiablefunction and $\left\vert f^{\prime }\right\vert$ be an integrable on $[a, b]$and $s$-convex in the third sense on $\mathbb{R}$. Then

Corollary 5. Let $f:\mathbb{R}\rightarrow \mathbb{R}$ be a differentiable function and $\left\vert f^{\prime }\right\vert$ be an integrable on $[a, b]$ and $s$-convex in the third sense on $\mathbb{R}$. If $\left\vert f^{\prime}(x)\right\vert \leq M,$ $x\in \lbrack a, b],$ then the following inequality holds:

Theorem 6. Let $a, b\in \mathbb{R}$ with $a < b$, $f:\mathbb{R}\rightarrow \mathbb{R}$ be a differentiable function such that $\left\vert f^{ \prime}\right\vert$ is integrable on $[a, b]$ and $s$-convex in thethird sense on $\mathbb{R}$. Then the following inequality holds for all $x\in [a, b]$:

Proof. Let $g_{1}(t), g_{2}(t), h_{1}(t)$ and $h_{2}(t)$ functions as in Lemma 2. Using Lemma 1, triange inequality, Lemma 2 (ⅲ)–(ⅳ), the $s$-convexity of $\left\vert f^{\rm{ }\prime }\right\vert$ and properties of the Beta function, we can write the following:

Theorem 7. Let $a, b\in \mathbb{R}$ with $a < b$, $p\in(1, \infty)$, $f:\mathbb{R}\rightarrow \mathbb{R}$ be a differentiable function such that $\left\vert f^{ \prime}\right\vert ^{p}$ is integrable on $[a, b]$ and $s$-convex in the third sense on $\mathbb{R}$. Then the following inequality holds for all $x\in [a, b]$:

Proof. By making use of Lemma 1, triangle inequality, Lemma 2 (ⅰ)–(ⅱ), Hölder inequality and the $s$-convexity of $\left\vert f^{\rm{ } \prime }\right\vert^p,$ we can write the following:

Corollary 8. Under the condition of theorem above with $\left\vert f^{\prime}(x)\right\vert \leq M$ for $x\in \lbrack a, b]$, the following inequalityis obtained:

Theorem 9. Let $a, b\in \mathbb{R}$ with $a < b$, $q\in[1, \infty)$, $f:\mathbb{R}\rightarrow \mathbb{R}$ be a differentiable function such that $\left\vert f^{\prime}\right\vert ^{q}$ is integrable on $[a, b]$ and $s$-convex in the third sense on $\mathbb{R}$. Then

where

Proof. By making use of Lemma 1, triangle inequality, power mean inequality, Lemma 2 (ⅰ)–(ⅱ), the $s$-convexity of $\left\vert f^{ \rm{ }\prime }\right\vert ^{q}$ and properties of the Beta function, we have

Corollary 10. Under the conditions of Theorem 9 above with $\left\vert f^{\prime}(x)\right\vert\leq M$ for $x\in\lbrack a, b]$, the following inequality is obtained:

3.   Applications

It is stated in ^[11] that $f(x) = -x^{\frac{1}{s}}$ is an $s$-convex function in the third sense on $[0, \infty)$. Using this fact and the results, we obtain some mean inequalities. Let us recall some special means, namely, arithmetic, geometric, Heronian, generalized logarithmic means given, respectively, as follows:

Proposition 11. Let $s\in(0, 1]$ and $a, b\in\mathbb{R}_{+}$ with $a < b$ then the followinginequality holds:

Proof. Let us take $f(x) = -\frac{s}{s+1}x^{\frac{1}{s}+1}$ on $[a, b]$ and $x = \frac{a+b}{2}$ in Theorem 3. Since $|f^{\prime }(x)|\leq b^{\frac{1}{s}}$, we can write

Making some algebraic manipulations and using the definitions of means, we obtain the required inequality.

Moreover, we can find an upper bound for the error of a quadrature formula involving Riemann sums of functions $f$ for which $|f^{\prime}|$ is $s$-convex in the third sense.

Let $f$ be an integrable function on $[a, b]$ and $P$ be a partition of the interval $[a, b]$, i.e., $P:a = x_{0} < x_{1} < \cdots < x_{n-1} < x_{n} = b$, $\Delta x_{i+1} = x_{i+1}-x_{i}$ and for $i = 0, 1, ..., n-1,$ $c_{i}\in\lbrack x_{i}, x_{i+1}].$ We denote the Riemann sums as follows:

Then we have the following theorem stating an upper bound for a quadrature formula:

Theorem 12. Let $M\in(0, \infty)$ and $f:\mathbb{R}\rightarrow \mathbb{R}$ be differentiablefunction such that $\left\vert f^{\prime}\right\vert$ is integrable on $[a, b]$ with$\left\vert f^{\prime}(x)\right\vert \leq M$ for $x\in\lbrack a, b]$ and $\left\vert f^{\prime}\right\vert$ is a$s$-convex function in the third sense. Suppose that $P, c_{i}$ for $i = 0, ..., n-1$ isas above. Then

where $Q_{n}(f, P_{n}, c)$ is the remainder and

Proof. We apply Theorem 3 to the interval $[x_{i}, x_{i+1}]$ and to the point $x = c_i$ and get

By using triangle inequality and summing up the previous estimate for $i = 0, ..., n-1$ we obtain

If we use midpoints as the points $c_{i},$ we have the following inequality:

Corollary 13. Under the conditions of the theorem above and $c_{i} = \dfrac{x_{i}+x_{i+1}}{2}$, the following holds:

Acknowledgments

The authors are very grateful to the referees for their valuable comments and contributions.

Conflict of interest

The authors declare no conflict of interest.