The Faber polynomial expansion method and the Taylor-Maclaurin coefficient estimates of Bi-Close-to-Convex functions connected with the q-convolution

1.   Introduction

The limit theorem plays a pivotal role in the study of probability theory. Furthermore, the almost sure convergence is integral to the development of the limit theorem, a subject many scholars have studied. So far, a lot of excellent results have been obtained under the condition that the model holds with certainty. However, many uncertain phenomena of quantum mechanics and risk management cannot be explained by additive probability or expectation. To deal with this issue, many scholars have made great attempts and efforts. In particular, Peng ^[1,2] proposed the theory frame of the sub-linear expectations under a generic function space to solve this distributional uncertainty. In recent years, based on Peng, more and more scholars in the industry have done extensive research and obtained many related results; the study of the almost sure convergence has remained a hot-button issue. For example, Chen ^[3], Cheng ^[4], and Feng and Lan ^[5] obtained the SLLN (strong law of large numbers) of i.i.d.r.v. (independent identically distributed random variables), and Cheng ^[6] studied the SLLN of independent r.v. with $\sup_{i\ge 1} \hat{\mathbb{E}} \left [\left | X_{i} \right | l \left (\left | X_{i} \right | \right) \right] < \infty$. Through further research, Wu and Jiang ^[7] obtained the SLLN of the extended independent and identically distributed r.v.; Chen and Liu ^[8], Gao et al. ^[9], and Liang and Wu ^[10] proved the SLLN of ND (negatively dependent) r.v.; Zhang ^[11] built the exponential inequality and the law of logarithm of independent and ND r.v.; Wang and Wu ^[12] and Feng ^[13] offered the almost sure covergence for weighted sums of ND r.v.; Zhang ^[14] derived the SLLN of the extended independent and END (extended negatively dependent) r.v.; Wang and Wu ^[15] obtained the almost sure convergence of END r.v.; Lin ^[16] achieved the SLLN of WND (widely negative dependence) r.v.; and Hwang ^[17] investigated the almost sure convergence of WND r.v..

Anna ^[18] proposed the definition of WNOD r.v. for the first time and obtained the limiting conclusions for WNOD r.v. in Peng's theory frame. Based on Yan's results ^[19], this paper promotes them to the sub-linear expectation space. Compared to the previously mentioned ND and END r.v., dominating coefficients $g(n)$ have been added to the definition of WNOD r.v., leading to a broader range. Besides, the sub-additivity property of the sub-linear expectation and capacity is added, making the research more meaningful and complex. Finally, the conclusions of almost sure convergence for WNOD r.v. are achieved. This paper contributes to the relevant research results of limiting behavior of WNOD r.v. in Peng's theory frame.

Our essay is arranged as follows: Section 2 recommends interrelated definitions and properties as well as some important lemmas in the frame. Section 3 gives the conclusions including two theorems and two corollaries. Section 4 shows that the process of proving the conclusions is given in detail.

Running through this essay, we point out that $c$ will be a positive constant, its value is not important, and it may take different values according to the situation. $a_{x} \sim b_{x}$ means $\lim_{x \to \infty} \frac{a_{x} }{b_{x} } = 1$. $a_{n} \ll b_{n}$ means there must be a positive number $c$, satifying $a_{n }\le cb_{n}$ when $n$ is large enough. Denote $\mathrm{log} \left (y\right) = \mathrm{ln}\left ({\mathrm{max} \left \{ \mathrm{e}, y\right \} } \right)$.

2.   Preliminaries

This article uses the theory frame and concepts proposed by Peng ^[1,2]. Suppose $(\Omega, \mathcal{F})$ is a given measurable space and $\mathcal{H}$ is a linear space of real functions defined on $(\Omega, \mathcal{F})$ so that if $X_{1}, X_{2}, \ldots, X_{n} \in \mathcal{H}$, then $\varphi\left(X_{1}, X_{2}, \ldots, X_{n}\right) \in \mathcal{H}$ for every $\varphi \in C_{l, \text { Lip }}\left(\mathbb{R}_{n}\right)$, where $\varphi \in C_{l, \text { Lip }}\left(\mathbb{R}_{n}\right)$ shows the linear space of (local Lipschitz) functions $\varphi$ satisfying

for some $c > 0, m \in \mathbb{N}$ depending on $\varphi$. $\mathcal{H}$ is considered as a space of random variable. In this circumstance, we denote $X \in \mathcal{H}$.

Definition 2.1. (Peng ^[1]). A sub-linear expectation $\hat{\mathbb{E}}$ on $\mathcal{H}$ is a function $\hat{\mathbb{E}}: \mathcal{H} \rightarrow [-\infty, \infty]$ satisfying the following properties: for all $X, Y \in \mathcal{H}$, we have

(a) Monotonicity: if $X \geq Y$, then $\hat{\mathbb{E}}(X) \geq \hat{\mathbb{E}}(Y)$;

(b) Constant preserving: $\hat{\mathbb{E}}(c) = c$;

(c) Sub-additivity: $\hat{\mathbb{E}}(X+Y) \leq \hat{\mathbb{E}}(X)+\hat{\mathbb{E}}(Y)$;

(d) Positive homogeneity: $\hat{\mathbb{E}}(\lambda X) = \lambda \hat{\mathbb{E}}(X), \lambda \geq 0$.

The triple $(\Omega, \mathcal{H}, \hat{\mathbb{E}})$ is known as a sub-linear expectation space.

Next, give the definition of the conjugate expectation $\hat{\mathcal{E}}$ of $\hat{\mathbb{E}}$ by

By the above definitions of $\hat{\mathbb{E}}$ and $\hat{\mathcal{E}}$, the following inequality is feasible for all $X, Y \in \mathcal{H}$,

When we are talking about $\hat{\mathbb{E}}$ and $\hat{\mathcal{E}}$ in the course of the proof, we often use the above formula.

Definition 2.2. (Peng ^[1]). Make $\mathcal{G} \subset \mathcal{F}$, a function $V: \mathcal{G} \rightarrow [0, 1]$ is described to be a capacity, when

Similar to sub-linear expectations, it is known as sub-additive when $V(A \cup B) \leq V(A)+V(B)$ for every $A, B \in \mathcal{G}$. Now, represent $\mathbb{V}$ and $\mathcal{V}$, respectively corresponing to $\hat{\mathbb{E}}$ and $\hat{\mathcal{E}}$, using

where $A^{c}$ denotes the complement set of $A$.

From the definion and sub-additivity property of ($\mathbb{V}$, $\mathcal{V}$), the following formulas are true

And now we have Markov inequality:

Definition 2.3. (Peng ^[1]). The Choquet integrals $\left(C_{{V}}\right)$ is defined as follows

where $\mathbb{V}$ and $\mathcal{V}$ can replace $V$ when required.

Definition 2.4. (Zhang ^[11]). (ⅰ) $\hat{\mathbb{E}}$ is referred to be countably sub-additive, when

(ⅱ)$V$ is referred to be countably sub-additive when

Definition 2.5. $\left \{ X_{n}, n\ge 1 \right \}$ is a sequence of r.v. and it is known to be stochastically dominated by a random variable $X$ if for a positive number $c$, there has

Definition 2.6. (Anna ^[18]. Widely negative orthant dependent (WNOD)) $\left \{ X_{n}, n\ge 1 \right \}$ is called to be widely negative orthant dependent if there is a finite positive array $\left \{ g\left (n \right), n\ge 1 \right \}$ satisfying for every $n\ge 1$,

where $\varphi _{i} \in \mathrm{C} _{b, Lip}\left (\mathbb{R} \right), \varphi _{i} \ge 0, 1\le i\le n$ and all functions $\varphi _{i}$ are uniformly monotonous. Where the coefficients $g\left (n \right)$ ($n\ge1$) are known as dominating coefficients.

It is visible that, when $\left \{ X_{n}, n\ge 1 \right \}$ is widely negative orthant dependent and all functions $f_{k} \left (x \right)\in C_{l, Lip } \left (\mathbb{R} \right)$ (where $k = 1, 2, \cdots, n$) are uniformly monotonous, then $\left \{ f_{n} \left (X_{n} \right), n\ge 1 \right \}$ is also widely negative orthant dependent.

Definition 2.7. (Seneta ^[20]). (ⅰ) A positive function $l\left (x \right)$ defined on $\left [a, \infty \right), a > 0$ is known to be a slowly varying function, satisfying

(ⅱ) Each slowly varying function $l\left (x \right)$ can be expressed as

whenever $\lim_{x \to \infty} C\left (x \right) = c > 0$, as well as $\lim_{y\to \infty} f\left (y \right) = 0$.

In this article, we want to research the almost sure convergence of WNOD sequence under sub-linear expectations. Since $\mathbb{V}$ is only sub-addictive, the definition of almost sure convergence is a little different and is described in detail in Wu and Jiang ^[7].

Next, we give some lemmas before reaching our conclusions.

Lemma 2.1. (Seneta ^[20]). For $\forall \alpha > 0$, there is a non-decreasing function $\varphi \left (x \right)$ and a non-increasing function $\xi \left (x \right)$ such that

where $l\left (x \right)$ is a slowly varying function.

In the following section, we assume $l\left (x \right), x > 0$ is a non-decreasing slowly varying function that can be expressed as $l\left (x \right) = c\mathrm{exp}\left \{ \int_{1}^{x} \frac{f\left (y \right) }{y} \mathrm{d}y \right \}$, where $c > 0$, $\lim_{x \to \infty} f\left (x \right) = 0$.

Let

Lemma 2.2. Assume $X\in \mathcal{H}, 0 < p < 2, \tau _{n}$ defined by Eq (2.1).

(ⅰ) For every $c > 0$,

(ⅱ) When $C_{\mathbb{V} } \left (\left | X \right |^{p} \right) < \infty$, and now for every $c > 0$,

Proof. (ⅰ) Obviously,

So

(ⅱ) For every positive $c$, using the conclusion of (ⅰ), because of the monotonically increasing property of $l\left (x \right)$,

As such, we have completed the proof of (ⅱ). □

Lemma 2.3. $\left \{ X_{n}, n\ge 1\right \}$ is a sequence of random variables, as well as stochastically dominated by a r.v. $X$ and $C_{\mathbb{V} } \left (\left | X \right |^{p} \right) < \infty, 1\le p < 2,$ $\hat{\mathbb{E} }$ has countable sub-additivity, then

moreover, when $1 < p < 2$,

Where $X_{n}^{\prime }, X_{n}^{\prime \prime }$ are respectively defined by Eqs (2.2) and (2.3).

Proof. For $0 < \mu < 1$, assume an even function $h\left (x \right) \in C_{l, Lip} \left (\mathbb{R} \right)$ and $h\left (x \right)\downarrow$ when $x > 0$, so that the value of $h\left (x \right)$ is $\left [0, 1 \right]$, for $\forall x\in \mathbb{R}$ and $h\left (x \right) \equiv 1$ when $\left | x \right | \le \mu$, $h\left (x \right) \equiv 0$ when $\left | x \right | > 1$. We have

For $\alpha = 1, 2,$

So, by (2.8) and Definition 2.7,

Assume that $h_{j} \left (x \right) \in C_{l, Lip} \left (\mathbb{R} \right), j\ge 1$, consider that the value of $h_{j}\left (x \right)$ is $\left [0, 1 \right]$ for $\forall x\in \mathbb{R}$. $h_{j} \left (x \right) \equiv 1$ when $\tau _{2^{j-1} }^{1/p} < \left | x \right | \le \tau _{2^{j} }^{1/p}$; $h_{j} \left (x \right) \equiv 0$ when $\left | x \right |\le \mu \tau _{2^{j-1} }^{1/p}$ or $\left | x \right | > \left (1+\mu \right) \tau _{2^{j} }^{1/p}$. The following formulas can be derived,

First, prove (2.6). For $1\le p < 2$, by (2.11) and (2.4),

Then, because $h\left (x \right)$ is decreasing in $\left (0, \infty \right)$, according to Lemma 2.1, $\tau _{n}^{-2/p} l^{-1} \left (n \right)$ is decreasing in $\left (0, \infty \right)$. So,

Last by (2.14), (2.13), and (2.5),

Therefore, (2.6) holds.

Next, our proof of (2.7) is similar to (2.6). For $1 < p < 2$, by (2.12) and the monotonically decreasing propety of $h\left (x \right)$ in $\left (0, \infty \right)$, according to Lemma 2.1, $\tau _{n}^{-1/p} l^{-1} \left (n \right)$ is decreasing in $\left (0, \infty \right)$, we have,

Then, from (2.15), (2.13), and (2.5), countable sub-additivity of $\hat{\mathbb{E} }$,

Therefore, (2.7) holds.□

Lemma 2.4. (Zhang ^[11] Borel-Cantelli Lemma) Suppose $\left \{ B_{n}; n\ge 1 \right \}$ is an array of matters in $\mathcal{F}$. Suppose $\mathbb{V}$ has countable sub-additivity. We can obtain $\mathbb{V} \left (B_{n}; \mathrm{i.o.} \right) = 0$ provided that $\sum_{n = 1}^{\infty } \mathbb{V} \left (B_{n} \right) < \infty$, where $\left (B_{n}; \mathrm{i.o.} \right) = \bigcap_{n = 1}^{\infty } \bigcup_{m = n}^{\infty } B_{m}$.

3.   Main conclusions

Theorem 3.1. Suppose $\left\{X_{n}, n \geq 1\right\}$ is a sequence of WNOD r.v., and its dominating coefficients are $g\left (n \right)$. The sequence is stochastically dominated by a r.v. $X$. $\hat{\mathbb{E}}$ and $\mathbb{V}$ both have countable sub-additivity, and satisfying

Make $\left \{ a_{nk}, 1\le k\le n, n\ge 1 \right \}$ be a positive sequence according to

where $\tau _{n}$ is defined by (2.1).

If for some $0 < \delta < 1$,

then,

in particular, when $\hat{\mathbb{E}} X_{k} = \hat{\mathcal{E}} X_{k}$, then

Remark 3.1. Theorem 3.1 under sub-linear expectations space is an extension of Theorem 2.1 of Yan ^[19] of the classical probability space.

Remark 3.2. If $g\left (n \right) = M$, for each $n\ge 1$, then the sequence is simplified to END. When let $l\left (n \right) = \mathrm{log}n, n\ge 1$, for $0 < \delta < 1$,

condition (3.3) is satisfied. By Theorem 3.1, Eqs (3.4)–(3.6) hold.

Remark 3.3. We can obtain different conclusions by taking different forms of slowly varying function $l\left (x \right)$. By taking $l\left (n\right) = \mathrm{log}n$ and $l\left (n\right) = \mathrm{exp} \left \{ \left (\mathrm{log}n \right)^{\nu } \right \} (0 < \nu < 1)$, we will get the following two corollaries.

Corollary 3.1. Suppose $\left\{X_{n}, n \geq 1\right\}$ is a sequence of WNOD r.v., and its dominating coefficients are $g\left (n \right)$. The sequence is stochastically dominated by a r.v. $X$. Besides, the sequence is satisfied (3.1). $\hat{\mathbb{E}}$ and $\mathbb{V}$ both have countable sub-additivity. Make sure $\left \{ a_{nk}, 1\le k\le n, n\ge 1 \right \}$ is a positive sequence according to

For some $0 < b < 1-\delta$,

then (3.4)–(3.6) hold.

Corollary 3.2. Suppose $\left\{X_{n}, n \geq 1\right\}$ is a sequence of WNOD random variables, and its dominating coefficients are $g\left (n \right)$. The sequence is stochastically dominated by a r.v. $X$. Besides, the sequence is satisfied (3.1). $\hat{\mathbb{E}}$ and $\mathbb{V}$ both have countable sub-additivity. Make sure $\left \{ a_{nk}, 1\le k\le n, n\ge 1 \right \}$ is a positive sequence according to

where $0 < \nu < 1$.

For some $m > 0$,

then (3.4)–(3.6) hold.

Then, we will think about the situation of $p = 1$.

Theorem 3.2. Suppose $\left\{X_{n}, n \geq 1\right\}$ is a sequence of WNOD r.v., and its dominating coefficients are $g\left (n \right)$ and are satisfied (3.3). The sequence is stochastically dominated by a r.v. $X$. $\hat{\mathbb{E}}$ and $\mathbb{V}$ both have countable sub-additivity, and satisfying

Suppose $\left \{ a_{nk}, 1\le k\le n, n\ge 1 \right \}$ is a positive sequence according to

then (3.4)–(3.6) hold.

4.   Proofs of the main conclusions

4.1.   Proof of Theorem 3.1

Because the sequence $\left \{ -X_{k}, k\ge 1\right \}$ fulfills the criterion of Theorem 3.1, making $\left \{ -X_{k}, k\ge 1\right \}$ as a substitute for $\left \{ X_{k}, k\ge 1\right \}$ in formula (3.4), by $\hat{\mathcal{E}} X = -\hat{\mathbb{E}} \left (- X\right)$, there is

Therefore, (3.5) holds. Then, by $\hat{\mathbb{E}}X_{k} = \hat{\mathcal{E}}X_{k}$, (3.4) and (3.5), we can get (3.6). So we just need to prove (3.4).

We denote $X_{n}^{\prime }$, $X_{n}^{\prime \prime }$ respectively by equations (2.2) and (2.3). By Definition 2.6, $\left \{ X_{k}^{\prime } -\hat{\mathbb{E}} X_{k}^{\prime }, k\ge 1\right \}$ is also WNOD. Denote $\widetilde{X } _{k}^{\prime } : = X_{k}^{\prime } -\hat{\mathbb{E}} X_{k}^{\prime }$.

Therefore,

So, if we want to prove (3.4), just prove

By (3.2) and the formula $\mathrm{e} ^{x} \le 1+x+\frac{x^{2} }{2}\mathrm{e}^{\left | x \right | }, x\in[-\infty, \infty]$, for all $t > 0, 1\le k\le n$ as well as large enough $n$,

By Definition 2.6, let $\varphi _{i} \left (x \right) = \mathrm{e} ^{tX_{i} }, i\ge 1$, we can get for WNOD r.v.,

By (4.2), (4.3), and the inequality $1+x\le \mathrm{e} ^{x}, \forall x\in \mathbb{R}$, for all $t > 0$ as well as large enough $n$,

For $\varepsilon > 0$, let $t = 2\varepsilon ^{-1} l\left (n \right)$. According to Markov inequality, we can get

Combining $\hat{\mathbb{E} } \left (\widetilde{X} _{k}^{\prime } \right) ^{2} \le 4\hat{\mathbb{E} } \left (X _{k}^{\prime } \right) ^{2}$, (2.6), and Kronecker's Lemma,

So, for $\forall 0 < \delta < 1$, and large enough $n$, $l\left (n \right)$ is non-decreasing in $\left (0, \infty \right)$, we can get

Therefore, by (3.3),

Because $\mathbb{V}$ has countable sub-additivity, and for every $\varepsilon > 0$, we obtain from Lemma 2.4,

For each $n$, there must be a $m$ such that $2^{m-1} \le n < 2^{m}$, by (2.12) and (3.2), $h\left (x \right)$ is decreasing in $\left (0, \infty \right)$, according to Lemma 2.1, $\tau _{n}^{-1/p} l^{-1} \left (n \right)$ is decreasing in $\left (0, \infty \right)$,

Then, by (2.15) and (2.13), $\hat{\mathbb{E} }$ is countably sub-additive,

Combining (2.5), we get

If we want to prove (3.4), just prove

Using (3.2) as well as the Lemma 2.1,

for $\forall \varepsilon > 0$, by (2.7) and Markov inequality,

By Lemma 2.4, for $\forall \varepsilon > 0$,

Combining $\left | \sum_{k = 1}^{n} a_{nk} X^{\prime \prime } \right | \le \max_{2^{m}\le n < 2^{m+1} } \left | \sum_{k = 1}^{n} a_{nk} X_{k}^{\prime \prime } \right |$ and the arbitrariness of $\varepsilon$, (4.6) holds. So far, Theorem 3.1 has been proved.

4.2.   Proof of Corollary 3.1

Let $l\left (n \right) = \mathrm{log}\left (n \right)$, for $0 < b < 1-\delta$, by (3.8), we have

Then, (3.4) holds. From Theorem 3.1, Eqs (3.4)–(3.6) hold.

4.3.   Proof of Corollary 3.2

Let $l\left (n \right) = \mathrm{exp} \left \{ \left (\mathrm{log}n \right)^{\nu } \right \}, 0 < \nu < 1.$ For $\forall q > 0$, we have

so,

By (3.10), $0 < \delta < 1$, when $q > \frac{m+1}{2-\delta }$, we have

Then, (3.4) holds. From Theorem 3.1, Eqs (3.4)–(3.6) hold.

4.4.   Proof of Theorem 3.2

When $p = 1$, $C_{\mathbb{V} } \left (\left | X \right | \right) \le C_{\mathbb{V} } \left (\left | X \right |\mathrm{log}\left | X \right | \right) < \infty$, thus (4.4) and (4.5) are still valid, we just need to prove (4.6). Imitating the proof of Lemma 2.2, from $C_{\mathbb{V} } \left (\left | X \right |\mathrm{log}\left | X \right | \right) < \infty$, we can obtain

Combining (2.12) and the monotonically decreasing property of $h\left (x \right)$ in $\left (0, \infty \right)$,

Then, by (2.15) and (4.7),

For $\forall \varepsilon > 0$, by (3.12) and Markov inequality,

By Lemma 2.4, for $\forall \varepsilon > 0$,

Combining $\left | \sum_{k = 1}^{n} a_{nk} X^{\prime \prime } \right | \le \max_{2^{m}\le n < 2^{m+1} } \left | \sum_{k = 1}^{n} a_{nk} X_{k}^{\prime \prime } \right |$ and the arbitrariness of $\varepsilon$, (4.6) holds. So far, Theorem 3.2 has been proved.

5.   Conclusions

Almost sure convergence of WNOD r.v. in Peng's theory frame is built through this essay. It is based on the corresponding definition of stochastic domination in the sub-linear expectation space, as well as the properties of WNOD r.v. and the related proving methods. Compared with the previous research of ND, END, and so on, the research in this paper is suitable for a wider range of r.v.. So, broader conclusions are reached. In future research work, we will further consider investigating more meaningful conclusions.

Author contributions

Baozhen Wang: Conceptualization, Formal analysis, Investigation, Methodology, Writing-original draft, Writing-review & editing; Qunying Wu: Funding acquisition, Formal analysis, Writing-review & editing. All authors have read and approved the final version of the manuscript for publication.

Use of AI tools declaration

The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

Acknowledgments

This paper was supported by the National Natural Science Foundation of China (12061028) and Guangxi Colleges and Universities Key Laboratory of Applied Statistics.

Conflict of interest

In this article, all authors disclaim any conflict of interest.