Different characterization of soft substructures in quantale modules dependent on soft relations and their approximations

1.   Introduction

Ostrowski's Inequality. Let $f:I\subset [0, +\infty)\to \mathbb{R}$ be a differentiable function on int(I), such that $f'\in L[a, b]$, where $a, b\in I$ with $a < b$. If $|f'(x)|\le M$ for all $x\in [a, b]$, then the inequality:

holds for all $x\in [a, b]$. This inequality was introduced by Alexander Ostrowski in ^[26], and with the passing of the years, generalizations on the same, involving derivatives of the function under study, have taken place. It is playing a very important role in all the fields of mathematics, especially in the theory approximations. Thus such inequalities were studied extensively by many researches and numerous generalizations, extensions and variants of them for various kind of functions like bounded variation, synchronous, Lipschitzian, monotonic, absolutely continuous and n-times differentiable mappings etc.

For recent results and generalizations concerning Ostrowski's inequality, we refer the reader to the recent papers ^{[1,3,4,31,32]}. The convex functions play a significant role in many fields, for example in biological system, economy, optimization and so on ^{[2,16,19,24,29,34,39]}. And many important inequalities are established for these class of functions. Also the evolution of the concept of convexity has had a great impact in the community of investigators. In recent years, for example, generalized concepts such as s-convexity (see^[10]), h-convexity (see ^[30,33]), m-convexity (see ^[7,15]), MT-convexity (see^[21]) and others, as well as combinations of these new concepts have been introduced.

The role of convex sets, convex functions and their generalizations are important in applied mathematics specially in nonlinear programming and optimization theory. For example in economics, convexity plays a fundamental role in equilibrium and duality theory. The convexity of sets and functions have been the object of many studies in recent years. But in many new problems encountered in applied mathematics the notion of convexity is not enough to reach favorite results and hence it is necessary to extend the notion of convexity to the new generalized notions. Recently, several extensions have been considered for the classical convex functions such that some of these new concepts are based on extension of the domain of a convex function (a convex set) to a generalized form and some of them are new definitions that there is no generalization on the domain but on the form of the definition. Some new generalized concepts in this point of view are pseudo-convex functions ^[22], quasi-convex functions ^[5], invex functions ^[17], preinvex functions ^[25], B-vex functions ^[20], B-preinvex functions ^[8], E-convex functions ^[38], Ostrowski Type inequalities for functions whose derivatives are $(m, h_1, h_2)$-convex ^[35], Féjer Type inequalities for $(s, m)$-convex functions in the second sense ^[36] and Hermite-Hadamard-Féjer Type inequalities for strongly $(s, m)$-convex functions with modulus C, in the second sense ^[9]. In numerical analysis many quadrature rules have been established to approximate the definite integrals. Ostrowski inequality provides the bounds of many numerical quadrature rules ^[13].

In this paper we have established new Ostrowski's inequality given by Badreddine Meftah in ^[23] for $s$-$\varphi$-convex functions with $f\in C^n([a, b])$ such that $f^{(n)}\in L([a, b])$ and we give some applications to some special means, the midpoint formula and some examples for the case $n = 2$.

2.   Preliminaries

Recall that a real-valued function $f$ defined in a real interval $J$ is said to be convex if for all $x, y \in J$ and for any $t\in [0, 1]$ the inequality

holds. If inequality 2.1 is strict when we say that $f$ is strictly convex, and if inequality 2.1 is reversed the function $f$ is said to be concave. In ^[37] we introduced the notion of $s$-$\varphi$-convex functions as a generalization of $s$-convex functions in first sense.

Definition 1. Let $0 < s \le 1$. A function $f:I\subset \mathbb{R}\to \mathbb{R}$ is called $s$-$\varphi$-convex with respect to bifunction $\varphi:\mathbb{R}\times \mathbb{R}\to \mathbb{R}$ (briefly $\varphi$-convex), if

for all $x, y\in I$ and $t\in [0, 1]$.

Example 1. Let $f(x) = x^2$, then $f$ is convex and $\frac{1}{2}$-$\varphi$- convex with $\varphi(u, v) = 2u+v$, indeed

On the other hand;

Hence,

Example 2. Let $f(x) = x^n$ and $0 < s\le 1$, then $f$ is convex and $s$-$\varphi$- convex with $\varphi(u, v) = \sum_{k = 1}^{n}\left(\begin{array}{cc} n\\ k \end{array}\right)v^{1-\frac{k}{n}}\left(u^{\frac{1}{n}}-v^{\frac{1}{n}}\right)^n$, indeed

Remark 1. If $f$ is increasing monotone in $[a, b]$, then $f$ is $s$-$\varphi$- convex for $\varphi(x, y) = K$, where $K\in [0, +\infty)$ and $s\in (0, 1]$.

3.   Main results

In this section, we give some integral approximation of $f\in C^n([a, b])$ such that $f^{(n)}\in L([a, b])$, for $n\ge 1$ using the following lemma as the main tool (see ^[11]).

Lemma 1. Let $f:[a, b]\to \mathbb{R}$ be a differentiable mapping such that $f^{(n-1)}$ is absolutely continuous on $[a, b]$. Then for all $x\in [a, b]$ we have the identity

where the kernel $K_n:[a, b]^2\to \mathbb{R}$ is given by

with $x\in [a, b]$ and $n$ is natural number, $n\ge 1$.

Theorem 1. Let $f:I\to \mathbb{R}$ be n-times differentiable on $[a, b]$ such that $f^{(n)}\in L([a, b])$ with $n\ge 1$ and $0 < s \le 1$. If $|f^{(n)}|$ is s-$\varphi$-convex, then the following inequality

holds for all $x\in [a, b]$.

Proof. From Lemma 1, properties of modulus, making the changes of variables $u = (1-t)a+tx$ in the first integral and $u = (1-t)x+tb$ in the second integral we have that,

Since $|f^{(n)}|$ is s-$\varphi$- convex (2.2) gives

which is the desired result. The proof is completed.

Remark 2. If we take $s = 1$ then obtain a result of Meftah B. (see Theorem 2.1 in ^[23]).

Corollary 1. Let $f:I\to \mathbb{R}$ be n-times differentiable on $[a, b]$ such that $f^{(n)}\in L([a, b])$ with $n\ge 1$ and $0 < s \le 1$. If $|f^{(n)}|$ is s-convex in the first sense, we have the following estimate

Proof. Taking $\varphi(u, v) = v-u$ in Theorem 1.

Remark 3. It is important to notice that if $s = 1$ we have that $|f^{(n)}|$ is convex and then obtain the corollary 2.2 of Meftah see ^[23].

Theorem 2. Let $f:I\to \mathbb{R}$ be n-times differentiable on $[a, b]$ such that $f^{(n)}\in L([a, b])$ with $n\ge 1$, $0 < s \le 1$ and let $q > 1$ with $\frac{1}{p}+\frac{1}{q} = 1$. If $|f^{(n)}|^q$ is s-$\varphi$-convex, then the following inequality holds

Proof. From Lemma 1, properties of modulus, and Holder's inequality, we have

Since $|f^{(n)}|^q$ is s-$\varphi$-convex, we deduce

Corollary 2. Let $f:I\to \mathbb{R}$ be n-times differentiable on $[a, b]$ such that $f^{(n)}\in L([a, b])$ with $n\ge 1$, $0 < s \le 1$ and let $q > 1$ with $\frac{1}{p}+\frac{1}{q} = 1$. If $|f^{(n)}|^q$ is s-convex in the first sense, then the following inequality holds

Proof. Taking $\varphi(u, v) = v-u$ in Theorem 1.

Corollary 3. Let $f:I\to \mathbb{R}$ be n-times differentiable on $[a, b]$ such that $f^{(n)}\in L([a, b])$ with $n\ge 1$, $0 < s \le 1$ and let $q > 1$ with $\frac{1}{p}+\frac{1}{q} = 1$. If $|f^{(n)}|^q$ is s-convex in the first sense, then the following inequality holds

Proof. Taking $\varphi(u, v) = v-u$ in Theorem 1, we obtain 3.1. Then using the following algebraic inequality for all $a, b\ge 0$, and $0\le \alpha \le 1$ we have $(a+b)^{\alpha}\le a^{\alpha}+ b^{\alpha}$, we get the desired result.

Theorem 3. Let $q > 1$ and $f:I\to \mathbb{R}$ be n-times differentiable on $[a, b]$ such that $f^{(n)}\in L([a, b])$ with $n\ge 1$, $0 < s \le 1$. If $|f^{(n)}|^q$ is s-$\varphi-$convex, then the following inequality

holds for all $x\in [a, b]$.

Proof. From Lemma 1, properties of modulus, and power mean inequality, we have

Since $|f^{(n)}|^q$ is s-$\varphi$-convex, we deduce

The proof is completed.

Remark 4. If we take $s = 1$ then obtain a result of Meftah B. (see Theorem 2.6 in ^[23]).

Corollary 4. Let $f:I\to \mathbb{R}$ be n-times differentiable on $[a, b]$ such that $f^{(n)}\in L([a, b])$ with $n\ge 1$, $0 < s \le 1$ and let $q > 1$. If $|f^{(n)}|^q$ is $s$-convex in the first sense, then the following inequality

holds for all $x\in [a, b]$.

Proof. Taking $\varphi(u, v) = v-u$ in Theorem 3.

Theorem 4. Let $f:I\to \mathbb{R}$ be n-times differentiable on $[a, b]$ such that $f^{(n)}\in L([a, b])$ with $n\ge 1$, $0 < s \le 1$ and let $q > 1$. If $|f^{(n)}|^q$ is s-$\varphi$-convex, then the following inequality

holds for all $x\in [a, b]$.

Proof. From Lemma 1, properties of modulus, and power mean inequality, we have

Since $|f^{(n)}|^q$ is s-$\varphi$-convex, we deduce

which in the desired result.

Remark 5. If we take $s = 1$ then obtain a result of Meftah B. (see Theorem 2.9 in ^[23]).

Corollary 5. Let $f:I\to \mathbb{R}$ be n-times differentiable on $[a, b]$ such that $f^{(n)}\in L([a, b])$ with $n\ge 1$, $0 < s \le 1$ and let $q > 1$. If $|f^{(n)}|^q$ is $s$-convex in the first sense, then the following inequality

holds for all $x\in [a, b]$.

Proof. Taking $\varphi(u, v) = v-u$ in Theorem 4.

4.   $s$-$\varphi_b$-convex function

In this section, using ^[12] we define $s$-$\varphi_b$-convex function as generalized form of $s$-$\varphi$ convex functions ^[37] and give some results.

Definition 2. Let $\mathbb{R}^+$ be the set of nonnegative real numbers and $b:\mathbb{R}\times \mathbb{R}\times [0, 1]\to \mathbb{R}^+$ be a function with $t^sb(x, y, t)\in [0, 1]$ for all $x, y \in \mathbb{R}$, $t \in [0, 1]$ and $s \in (0, 1]$. A function $f:I\to \mathbb{R}$ is called $s$-$\varphi_b$-convex if

for all $x, y\in \mathbb{R}$ and $t\in [0, 1]$.

Remark 6. If $b(x, y, z) = 1$ then the definition of $s$-$\varphi_b$-convex function matches the definition of $s$-$\varphi$-convex function.

Theorem 5. Consider a function $f:I\to \mathbb{R}$ and $b:\mathbb{R}\times \mathbb{R}\times [0, 1]\to \mathbb{R}^+$ be a function with $t^sb(x, y, t)\in [0, 1]$ for all $x, y \in \mathbb{R}$ and $s, t \in [0, 1]$. Then the following assertions are equivalent:

(i) $f$ is $s$-$\varphi_b$-convex for some $b$ and $s\in [0, 1]$.

(ii) $f$ is $\varphi$-quasiconvex.

Proof. $(i)\to (ii)$ For any $x, y \in I$ and $t\in [0, 1]$,

$(ii)\to (i)$ For $x, y\in I$ and $t\in [0, 1]$, define

Notice that $t^sb(x, y, t)\in [0, 1]$. For a such function $b$ we have

Remark 7. Let $f:I\to \mathbb{R}$ be a $s$-$\varphi$-convex function. For $x_1, x_2 \in I$ and $\alpha_1+\alpha_2 = 1$, we have $f(\alpha_1x_1+\alpha_2x_2)\le f(x_2)+\alpha_1^s\varphi(f(x_1), f(x_2))$. Aso when $n > 2$, for $x_1, x_2, ..., x_n\in I$, $\sum_{i = 1}^{n}\alpha_i = 1$ and $T_i = \sum_{j = 1}^{i}\alpha_j$, we have

Theorem 6. Let $f:I\to \mathbb{R}$ be a $s$-$\varphi$-convex function and $\varphi$ be nondecreasing nonnegatively sublinear in first variable. If $T_i = \sum_{j = 1}^{i}\alpha_j$ for $i = 1, 2, ..., n$ such that $T_n = 1$, then

where $\varphi_f(x_i, x_{i+1}, ..., x_n) = \varphi(\varphi_f(x_i, x_{i+1}, ..., x_{n-1}), f(x_n))$ and $\varphi_f(x) = f(x)$ for all $x\in I$.

Proof. Since $\varphi$ is nondecreasing nonnegatively sublinear on first variable, so from (4.1) it follows that:

Example 3. Consider $f(x) = x^2$ and $\varphi(x, y) = 2x+y$ for $x, y\in \mathbb{R}^+ = [0, +\infty)$. The function $\varphi$ is nondecreasing nonnegatively sublinear in first variable and $f$ is $\frac{1}{2}$-$\varphi$-convex (see Example 1). Now for $x_1, x_2, ..., x_n\in \mathbb{R}^+$ and $\alpha_1, \alpha_2, ..., \alpha_n$ with $\sum_{i = 1}^{n}\alpha_i = 1$ according to Theorem 6 we have

5.   Applications for some particular mappings

In this section we give some applications for the special case where $n = 2$ and the function $\varphi(f(x), f(y)) = f(y)-f(x)$, in this case we have that $f$ is $s$-convex in the first sense.

Example 4. Let $s\in (0, 1)$ and $p, q, r \in \mathbb{R}$, we define the function $f:[0, +\infty)\to \mathbb{R}$ as

we have that if $q\ge 0$ and $r\le p$, then $f$ is s-convex in the first sense (see ^[18]). If we do $\varphi(f(x), f(y)) = f(x)-f(y)$, then $f$ is s-$\varphi$-convex, but is not $\varphi$-convex because $f$ is not convex.

Example 5. In the previous example if $s = \frac{1}{2}$, $p = 1$, $q = 2$ and $r = 1$ we have that $f:[0, +\infty)\to \mathbb{R}, f(t) = 2t^{\frac{1}{2}}+1$ is $\frac{1}{2}$-$\varphi$-convex. Then if we define $g:[0, +\infty)\to \mathbb{R}$, $g(t) = \frac{8}{15}t^{\frac{5}{2}}+\frac{t^2}{2}$, we have to $g''(t) = 2t^{\frac{1}{2}}+1$ is $\frac{1}{2}$-$\varphi$-convex in $[0, +\infty)$ with $\varphi(f(x), f(y)) = f(x)-f(y)$. Using Theorem 1, for $a, b\in [0, +\infty)$ with $a < b$ and $x\in [a, b]$, we get

Remark 6. In particular if we choose $a = 0$ and $b = 1$, we have for $x\in [0, 1]$, we get a graphic representation of the Example 5.

Example 6. If we define $g(t) = \frac{t^4}{12}$ we have that $g''(t)$ is $\frac{1}{2}$-$\varphi$- convex with $\varphi(u, v) = 2u+v$ (see example 1) and by Theorem 1, for $a, b\in \mathbb{R}$ with $a < b$ and $x\in [a, b]$, we have that

Moreover, if choose $x = \frac{a+b}{2}$, we obtain that

Then

Therefore

Example 7. If we define $g(t) = \frac{36}{91}\sqrt[3]{2} \ t^{\frac{13}{6}}$ we have that $|g''(t)|^3$ is $\frac{1}{2}$-$\varphi$-convex with $\varphi(u, v) = 2u+v$ (see example 1) and by Theorem 4, for $a, b\in \mathbb{R}$ with $a < b$ and $x\in [a, b]$, we have

6.   Conclusions

In this paper we have established new Ostrowski's inequality given by Badreddine Meftah in ^[23] for $s-\varphi-$convex functions with $f\in C^n([a, b])$ such that $f^{(n)}\in L([a, b])$ with $n\ge 1$ and we give some applications to some special means, the midpoint formula and some examples for the case $n = 2$. We expect that the ideas and techniques used in this paper may inspire interested readers to explore some new applications of these newly introduced explore some new applications of these newly introduced functions in various fields of pure and applied sciences.

Acknowledgments

The authors want to give thanks to the Dirección de investigación from Pontificia Universidad Católica del Ecuador for technical support to our research project entitled: "Algunas desigualdades integrales para funciones convexas generalizadas y aplicaciones".

Conflict of interest

The authors declare that they have no conflicts of interest.