Next Article in Journal
Integral Comparison Criteria for Half-Linear Differential Equations Seen as a Perturbation
Next Article in Special Issue
Statistical Estimation of the Kullback–Leibler Divergence
Previous Article in Journal
Green Energy Efficient Routing with Deep Learning Based Anomaly Detection for Internet of Things (IoT) Communications
Previous Article in Special Issue
Asymptotically Normal Estimators for the Parameters of the Gamma-Exponential Distribution
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Asymptotically Exact Constants in Natural Convergence Rate Estimates in the Lindeberg Theorem

by
Ruslan Gabdullin
1,
Vladimir Makarenko
1 and
Irina Shevtsova
1,2,3,4,*
1
Department of Mathematical Statistics, Faculty of Computational Mathematics and Cybernetics, Lomonosov Moscow State University, 119991 Moscow, Russia
2
Department of Mathematics, School of Science, Hangzhou Dianzi University, Hangzhou 310018, China
3
Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 119333 Moscow, Russia
4
Moscow Center for Fundamental and Applied Mathematics, 119991 Moscow, Russia
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(5), 501; https://doi.org/10.3390/math9050501
Submission received: 6 February 2021 / Revised: 22 February 2021 / Accepted: 24 February 2021 / Published: 1 March 2021
(This article belongs to the Special Issue Analytical Methods and Convergence in Probability with Applications)

Abstract

:
Following (Shevtsova, 2013) we introduce detailed classification of the asymptotically exact constants in natural estimates of the rate of convergence in the Lindeberg central limit theorem, namely in Esseen’s, Rozovskii’s, and Wang–Ahmad’s inequalities and their structural improvements obtained in our previous works. The above inequalities involve algebraic truncated third-order moments and the classical Lindeberg fraction and assume finiteness only the second-order moments of random summands. We present lower bounds for the introduced asymptotically exact constants as well as for the universal and for the most optimistic constants which turn to be not far from the upper ones.

1. Introduction

In various applications of probability theory, one has to approximate an unknown distribution of a sum of independent random variables with some known law. Such problems arise, for example, in insurance, financial mathematics, reliability theory, queueing theory, and many other areas. The most common approximation is the normal one which is based on the central limit theorem. The adequacy of the normal approximation can be estimated with the help of convergence rate estimates in the central limit theorem such as the celebrated Berry–Esseen [1,2] inequality (in terms of full moments and under the additional moment-type assumptions), or Osipov–Petrov’s [3,4], Esseen’s [5], Rozovskii’s [6], Wang-Ahmad’s [7] inequalities and their generalizations [8,9,10,11] (in terms of truncated moments without any additional assumptions). However, the most natural estimates, such as Esseen’s, Rozovskii’s and Wang–Ahmad’s inequalities contained unknown constants, and their application in practice was made possible only by the results of [8,11], where in particular, the unknown constants in the above inequalities were evaluated. A detailed overview of the cited inequalities can be found in [11] and for brevity, we do not duplicate it here. Since the crucial role in estimation of the adequacy of the normal approximation is played by the values (upper bounds, in fact) of appearing absolute constants, it is very important to understand how accurate the existing upper bounds for the constants are, how much they might be lowered and if it is worth trying to improve the method of their evaluation. The problem becomes much deeper as soon as we observe that estimates of the accuracy of the normal approximation are usually used with large sample sizes or when the majorizing expressions are assumed to be small, so that, in fact, not only the absolute values of the appearing constants are of interest, but also their presumably more optimistic (smaller) values which may be used under the corresponding asymptotic assumptions. Every set of asymptotic assumptions generates the corresponding asymptotic constant. Hence, we can introduce a whole classification of asymptotic constants. The present study is devoted to investigation of the various asymptotic constants and the main purpose is to construct their lower bounds.
Let X 1 , X 2 , , X n be independent random variables (r.v.’) with distribution functions (d.f.’s) F k ( x ) = P ( X k < x ) , x R , expectations E X k = 0 , variances σ k 2 = Var X k , k = 1 , , n , and such that
B n 2 : = k = 1 n σ k 2 > 0 .
For n = 1 , 2 , denote
S n = X 1 + X 2 + + X n , S ˜ n = S n E S n Var S n = k = 1 n X k B n ,
Φ ( x ) = 1 2 π x e t 2 / 2 d t , x R , Δ n = Δ n ( F 1 , , F n ) = sup x R | P ( S ˜ n < x ) Φ ( x ) | ,
σ k 2 ( z ) = E X k 2 1 ( | X k | z ) , μ k ( z ) = E X k 3 1 ( | X k | < z ) , k = 1 , , n
M n ( z ) : = 1 B n 3 k = 1 n μ k ( z B n ) = 1 B n 3 k = 1 n E X k 3 1 ( | X k | < z B n ) ,
Λ n ( z ) : = 1 B n 3 k = 1 n E | X k | 3 1 ( | X k | < z B n ) ,
L n ( z ) = 1 B n 2 k = 1 n σ k 2 ( z B n ) = 1 B n 2 k = 1 n E X k 2 1 ( | X k | z B n ) , z > 0 .
The function L n ( · ) is called the Lindeberg fraction. It is easy to see that | M n ( z ) | Λ n ( z ) , z > 0 . In case of independent identically distributed (i.i.d.) r.v.’s X 1 , , X n we denote their common d.f. by F and write Δ n ( F ) : = Δ n ( F , , F ) .
In [8] it was proved that
Δ n A E ( ε , γ ) sup 0 < z < ε γ | M n ( z ) | + z L n ( z ) ,
Δ n A R ( ε , γ ) γ | M n ( ε ) | + sup 0 < z < ε z L n ( z ) , ε , γ > 0 , n N ,
where the functions A E ( ε , γ ) , A R ( ε , γ ) depend only on ε and γ (that is, they turn into absolute constants as soon as ε and γ are fixed), both are monotonically non-increasing with respect to γ > 0 , and A E ( ε , γ ) is also non-increasing with respect to ε > 0 . The question on the boundedness of A R ( ε , γ ) as ε is still open, while A E ( 0 + , γ ) = A R ( 0 + , γ ) = for every γ > 0 and A E ( ε , 0 + ) = A R ( ε , 0 + ) = for every ε > 0 . To avoid ambiguity, in what follows by constants appearing here in various inequalities we mean their exact values; in particular, in majorizing expressions—their least possible values. Upper bounds for the constants A E ( ε , γ ) and A R ( ε , γ ) for some ε and γ computed in [8] are presented in Table 1 and Table 2, respectively. Here the symbol γ * stands for the point of minimum of the upper bound for A R ( ε , γ ) , obtained within the framework of the method used in [8], i.e., the upper bound for A R ( ε , γ ) found in [8] remains constant as γ γ * grows for every fixed ε > 0 . More precisely, the quantity γ * is defined as follows:
γ * = 1 / 6 ϰ = ( 1 t 2 + t 4 ) 1 / 4 / ( t 3 ) = 0.5599 ,
where t ( π / 2 , π ) is the unique root of the equation tan t = t / ( 1 t 2 ) ,
ϰ = x 2 ( cos x 1 + x 2 / 2 ) 2 + ( sin x x ) 2 | x = x 0 = 0.5315 ,
x 0 = 5.487414 is the unique root of the equation
8 ( cos x 1 ) + 8 x sin x 4 x 2 cos x x 3 sin x = 0 , x ( π , 2 π ) .
In the same paper [8] there were found sharpened upper bounds for the constants A E ( ε , γ ) and A R ( ε , γ ) provided that the corresponding fractions
L E , n ( ε , γ ) : = sup 0 < z < ε γ | M n ( z ) | + z L n ( z ) , L R , n ( ε , γ ) : = γ | M n ( ε ) | + sup 0 < z < ε z L n ( z ) .
take small values. In particular, there were introduced asymptotically exact constants
A E AE ( ε , γ ) : = lim sup 0 sup n , F 1 , , F n Δ n ( F 1 , , F n ) : L E , n ( ε , γ ) = , ε , γ > 0 ,
A R AE ( ε , γ ) : = lim sup 0 sup n , F 1 , , F n Δ n ( F 1 , , F n ) : L R , n ( ε , γ ) = , ε , γ > 0 ,
and the following upper bounds were obtained for them:
A E AE ( ε , γ ) 4 2 π + 1 π ϰ ε Υ 1 , t γ 2 2 ε 2 + ε 12 Υ 2 , t γ 2 2 ε 2 + 2 ( 6 ϰ γ 2 + 1 ) 6 γ Γ 3 2 , t γ 2 2 ε 2 ,
A R AE ( ε , γ ) 4 2 π + 1 π [ ϰ ε Υ 1 , t 1 , γ 2 2 ε 2 + ε 12 Υ 2 , t 1 , γ 2 2 ε 2 + ε 6 Γ 2 , t 2 , γ 2 2 ε 2 + + 2 6 γ π 2 Υ 3 2 , t 1 , γ 2 2 ε 2 Γ 3 2 , t 2 , γ 2 2 ε 2 ] ,
where Γ ( r , x ) x t r 1 e t d t , Υ ( r , x ) 0 x t r 1 e t d t = Γ ( r ) Γ ( r , x ) , r , x > 0 , are the upper and the lower gamma-functions, respectively,
t γ : = 2 γ ( γ / γ * ) 2 + 1 1 , t 2 , γ = 2 max γ 1 , γ * 1 , t 1 , γ : = t 2 , γ 1 ( 1 ( γ / γ * ) 2 ) + ,
ϰ = 0.5315 , γ * = 0.5599 were defined above. The values of the upper bounds for the asymptotically exact constants A E AE ( ε , γ ) and A R AE ( ε , γ ) in (5) and (6) for some ε > 0 and γ > 0 are given in the third and the seventh columns of Table 3, respectively.
Moreover, in [8] it was shown that the asymptotically exact constants A AE { A E AE , A R AE } are unbounded as γ 0 :
A AE ( ε , γ ) sup F lim sup n Δ n ( F ) L , n ( ε , γ ) , γ 0 , ε > 0 .
Let us note that estimate (2) with ε = γ = 1 coincides with the Rozovskii inequality [6] ([Corollary 1]) and establishes an upper bound for the appearing absolute constant A R ( 1 , 1 ) A R ( 1 , γ * ) 2.73 . Estimate (1) with ε = γ = 1 and ε , γ = 1 improves both Esseen’s inequalities from [5], where the absolute value sign and the least upper bound with respect to z ( 0 , ε ) stand inside the sum in comparison with (1). In particular, estimate (1) yields upper bounds for the absolute constants in Esseen’s inequalities A E ( 1 , 1 ) A E ( 1 , 0.72 ) 2.73 and A E ( , 1 ) A E ( , 0.97 ) 2.66 which were remaining unknown for a long time. Esseen’s inequality where the least upper bound is taken over a bounded range (see (1) with ε = γ = 1 ) yields, in its turn, the Osipov inequality [3]:
Δ n A E ( 1 , 1 ) sup 0 < z < 1 | M n ( z ) | + z L n ( z ) A E ( 1 , 1 ) sup 0 < z < 1 Λ n ( z ) + z L n ( z ) = = A E ( 1 , 1 ) ( Λ n ( 1 ) + L n ( 1 ) ) = A E ( 1 , 1 ) inf ε > 0 ( Λ n ( ε ) + L n ( ε ) )
(for details see [8]). The latest bound obtained by Osipov [3] with some constant A E ( 1 , 1 ) (whose best known value 1.87 is published in [12]) yields, in its turn, the Lindeberg theorem: indeed, under the Lindeberg condition sup ε > 0 lim n L n ( ε ) = 0 and with the account of Λ n ( ε ) ε , from (7) we have
Δ n A E ( 1 , 1 ) inf ε > 0 ( ε + L n ( ε ) ) 0 , n .
Hence, by Feller’s theorem, in case of uniformly infinitesimal random summands (in particular, in the i.i.d. case) the right- and the left-hand sides of (7) are either both infinitesimal or both do not tend to zero. According to the terminology, introduced by Zolotarev [13], such convergence rate estimates are called natural. Together with (1), inequality (2) is a natural convergence rate estimate in the Lindeberg–Feller theorem certainly under the additional assumption of existence of such an ε 0 > 0 that M n ( ε 0 ) = 0 for all sufficiently large n (see, e.g., [11]), in particular, if the r.v.’s X 1 , , X n have symmetric distributions.
Let us also note that Esseen-type inequality (1) not only links the criteria of convergence with the rate of convergence, as Osipov’s inequality does, but also provides a numerical demonstration of the Ibragimov’s criteria [14] of the rate of convergence in the CLT to be of order order O ( n 1 / 2 ) . According to [14], in the i.i.d. case we have Δ n = O ( n 1 / 2 ) as n if and only if max { | μ 1 ( z ) | , z σ 1 2 ( z ) } = O ( 1 ) as z . Inequality (1) trivially yields the sufficiency of the Ibragimov condition to Δ n = O ( n 1 / 2 ) as n .
Let us denote by G a set of all non-decreasing functions g : [ 0 , ) [ 0 , ) such that g ( z ) > 0 for z > 0 and z / g ( z ) is also non-decreasing for z > 0 . The set G was initially introduced by Katz [15] and used later in the works [4,9,10,11,12,16]. In [9] it was proved that
(i)
For every function g G and a > 0
g 0 ( z , a ) : = min z a , 1 g ( z ) g ( a ) max z a , 1 : = g 1 ( z , a ) , z > 0 ,
with g 0 ( · , a ) , g 1 ( · , a ) G .
(ii)
Every function from G is continuous on ( 0 , ) .
Property (8) means that every function from G is asymptotically (as its argument goes to infinity) between a constant and a linear function. For example, besides g 0 , g 1 , the class G also includes the following functions:
g c ( z ) 1 , g * ( z ) = z , c · z δ , c · g ( z ) , z > 0 ,
for all c > 0 , δ [ 0 , 1 ] and g G .
For g G we set
L E , n ( g , ε , γ ) = 1 B n 2 g ( B n ) sup 0 < z < ε B n g ( z ) z γ | k = 1 n μ k ( z ) | + z k = 1 n σ k 2 ( z ) = sup 0 < z < ε g ( z B n ) z g ( B n ) γ | M n ( z ) | + z L n ( z ) ,
L R , n ( g , ε , γ ) = 1 B n 2 g ( B n ) γ g ( ε B n ) ε B n | k = 1 n μ k ( ε B n ) | + sup 0 < z < ε B n g ( z ) k = 1 n σ k 2 ( z ) = γ g ( ε B n ) ε g ( B n ) | M n ( ε ) | + sup 0 < z < ε g ( z B n ) g ( B n ) L n ( z ) .
Please note that the introduced fractions with g = g * coincide with the fractions in the Esseen- and Rozovskii-type inequalities (1), (2) considered above:
L E , n ( g * , ε , γ ) = L E , n ( ε , γ ) , L R , n ( g * , ε , γ ) = L R , n ( ε , γ ) , ε , γ > 0 .
Inequalities (1) and (2) were generalized in [11] in the following way:
Δ n C E ( ε , γ ) · L E , n ( g , ε , γ ) ,
Δ n C R ( ε , γ ) · L R , n ( g , ε , γ ) , ε , γ > 0 , g G ,
where
C E ( ε , · ) = A E ( ε , · ) , ε ( 0 , 1 ] , in particular , C E ( + 0 , · ) = , C E ( ε , · ) A E ( 1 , · ) , ε > 1 ; C R ( ε , · ) = A R ( ε , · ) , ε ( 0 , 1 ] , in particular , C R ( + 0 , · ) = , C R ( ε , · ) ε A R ( ε , · ) , ε > 1 , C R ( , · ) =
(recall that according to the above convention, all the equalities between the constants including C E ( 0 , · ) = C R ( 0 , · ) = C R ( , · ) = are exact with formal definitions of C E ( ε , γ ) and C R ( ε , γ ) being given in (19) below).
It is easy to see that the both fractions L , n { L E , n , L R , n } are invariant with respect to scale transformations of g G :
L , n ( c g , · , · ) = L , n ( g , · , · ) , c > 0 .
Moreover, in [11] ([Theorem 2]) it was proved that for all ε , γ > 0
1 L E , n ( g 1 , ε , γ ) max { ε , 1 } · max { γ , 1 } ,
1 L R , n ( g 1 , ε , γ ) max { ε , 1 } · ( γ + 1 ) .
Extreme properties of the functions
g 0 ( z ) : = B n g 0 ( z , B n ) = min { z , B n } , g 1 ( z ) : = B n g 1 ( z , B n ) = max { z , B n } , z > 0 ,
in (8) with a : = B n yield
L , n ( g 0 , · , · ) L , n ( g , · , · ) L , n ( g 1 , · , · ) , g G ,
for every fixed set of distributions of X 1 , , X n , so that the extreme values of the constants C E and C R in (11) and (12) with fixed n and F 1 , , F n are attained at g = g 0 . Moreover, with the extreme functions g the fraction L , n { L E , n , L R , n } satisfy the following relations for ε 1 :
L , n ( g 0 , ε , · ) = L , n ( g * , ε , · ) = L , n ( ε , · ) ,
L , n ( g 1 , ε , · ) = L , n ( g c , ε , · ) .
Inequality (11) also generalizes and improves up to the values of the appearing absolute constant the classical Katz–Petrov inequality [4,15] (which is equivalent to the Osipov inequality [3]) because of involving the algebraic truncated third order moments instead of the absolutes ones and also a recent result of Wang and Ahmad [7] at the expense of moving the modulus and the least upper bound signs outside of the sum sign. In particular, inequality (11) established an upper bound of the constant in the Wang–Ahmad inequality C E ( , 1 ) A E ( 1 , 1 ) 2.73 .
A detailed survey and analysis of the relationships between inequalities (1), (2), (11), (12) with inequalities of Katz [15], Petrov [4], Osipov [3], Esseen [5], Rozovskii [6], and Wang–Ahmad [7] can be found in papers [8,11].
The main goal of the present work is construction of the lower bounds of the absolute constants C E ( ε , γ ) , C R ( ε , γ ) in inequalities (11), (12), and also of the constants A E ( ε , γ ) , A R ( ε , γ ) in inequalities (1), (2), in particular, we show that even in the i.i.d. case
C E ( 1 , 1 ) = A E ( 1 , 1 ) > 0.5685 , C R ( 1 , 1 ) = A R ( 1 , 1 ) > 0.5685 ,
C E ( , 1 ) > 0.5685 , A E ( , 1 ) > 0.3703 .
We consider various statements of the problem of construction of the lower bounds, namely we introduce a detailed classification of the asymptotically exact constants and construct their lower bounds. As a corollary, we obtain two-sided bounds for the asymptotically exact constants A E AE ( ε , γ ) and A R AE ( ε , γ ) defined in (3) and (4), in particular, we show that
0.4097 = 10 + 3 6 2 π A E AE ( 1 , 1 ) 1.80 .
0.3989 = 1 2 π A R AE ( 1 , 1 ) 1.80 .
The paper is organized as follows. In Section 2 we introduce exact, asymptotically exact and asymptotically best constants defining the corresponding statements for the construction of the lower bounds. Section 4, Section 5 and Section 6 are devoted namely to the construction of the lower bounds for the introduced constants. Section 3 contains some auxiliary results which might represent an independent interest, in particular, the values of the fractions L E , n ( g , ε , γ ) and L E , n ( g , ε , γ ) are found for all n, ε , γ > 0 and some g G in the case where X 1 , , X n have identical two-point distribution.

2. Exact, Asymptotically Exact and Asymptotically Best Constants

Following [13,17,18,19,20,21,22,23,24,25], let us define exact, asymptotically exact and asymptotically best constants in inequalities (11), (12). Let F be a set of all d.f.’s with zero means and finite second order moments. Denote
C E ( g , ε , γ ) = sup F 1 , , F n F , n N : B n > 0 Δ n ( F 1 , , F n ) L E , n ( g , ε , γ ) , C R ( g , ε , γ ) = sup F 1 , , F n F , n N : B n > 0 Δ n ( F 1 , , F n ) L R , n ( g , ε , γ ) .
Please note that the fractions L E , n ( g , ε , γ ) , L R , n ( g , ε , γ ) also depend on d.f.’s F 1 , , F n , but we omit these arguments for the sake of brevity.
The constants C E ( g , ε , γ ) and C R ( g , ε , γ ) are the minimal possible (exact) values of the constants C E ( ε , γ ) and C R ( ε , γ ) in inequalities (11), (12) for the fixed function g G , while their universal values sup g G C E ( g , ε , γ ) , sup g G C R ( g , ε , γ ) , that provide the validity of the inequalities under consideration for all g G are called exact constants and namely they are the minimal possible (exact) values of the constants C E ( ε , γ ) and C R ( ε , γ ) in (11) and (12), respectively. In order not to introduce excess notation and following the above convention, we use namely these exact values for the definitions of C E ( ε , γ ) and C R ( ε , γ ) in the present work:
C E ( ε , γ ) = sup g G C E ( g , ε , γ ) , C R ( ε , γ ) = sup g G C R ( g , ε , γ ) ,
and call them the exact constants. Please note that
A E ( ε , γ ) = C E ( g * , ε , γ ) C E ( ε , γ ) , A R ( ε , γ ) = C R ( g * , ε , γ ) C R ( ε , γ ) , ε , γ > 0 ,
hence, every lower bound for the constants A E ( ε , γ ) , A R ( ε , γ ) serves as a lower bound for the constants C E ( ε , γ ) , C R ( ε , γ ) as well.
The least upper bounds in (18) are taken without any restrictions on the values of the fractions L E , n ( g , ε , γ ) , L R , n ( g , ε , γ ) , while inequalities (11), (12) represent the most interest with small values of these fractions, when the normal approximation is adequate and only the concrete estimates of its accuracy are needed. That is why it is interesting to study not only the absolute, but also the asymptotic constants in (11), (12), some of which were already introduced in (3), (4). Since we are interested in the lower bounds, we assume that X 1 , , X n have identical distributions. Generalization of the definitions introduced below to the non-i.id. case is not difficult (see, for example, definitions (3) and (4) of the asymptotically exact constants for the general case).
For each of the fractions L n = L n ( F , g , ε , γ ) { L E , n , L R , n } appearing in inequalities (11), (12) we define the asymptotically best constants
C AB ( g , ε , γ ) = sup F F lim sup n Δ n ( F ) / L n ( F , g , ε , γ ) ,
the upper asymptotically exact constants
C ¯ AE ( g , ε , γ ) = lim sup n sup F F Δ n ( F ) / L n ( F , g , ε , γ ) ,
the asymptotically exact constants
C AE ( g , ε , γ ) = lim sup 0 sup n N , F F : L n ( F , g , ε , γ ) = Δ n ( F ) / ,
the lower asymptotically exact constants
C AE ̲ ( g , ε , γ ) = lim sup 0 lim sup n sup F F : L n ( F , g , ε , γ ) = Δ n ( F ) / ,
the conditional upper asymptotically exact constants
C AE * ( g , ε , γ ) = sup > 0 lim sup n sup F F : L n ( F , g , ε , γ ) = Δ n ( F ) / .
In order not to introduce excess indexes, we use identical notation for the asymptotic constants in (11), (12), in what follows every time specifying the inequality in question. All the introduced constants aim to improve the structure of the simplest upper bounds of the form Δ n C ( g , ε , γ ) L n ( g , ε , γ ) with the help of introducing an additional term o ( L n ) which is allowed to be infinitesimal of a higher order than L n as L n 0 :
Δ n C * ( g , ε , γ ) L n ( F , g , ε , γ ) + o ( L n ( F , g , ε , γ ) ) , n ,
where the assumptions on o ( L n ) define the value of the corresponding minimal constant C * . For example, in (20) it is supposed that the distribution of the random summands does not depend on the number of summands n and, hence, L n 0 if and only if n , so that o ( L n ( F , g , ε , γ ) ) in (25) is not obliged to tend to zero uniformly for all d.f.’s F F as n . All the rest introduced constants allow a double array scheme. The values of L n are obliged to be infinitesimal in (20), (22), and (23). The distinction between (22) and (23) is in the upper bound and the limit with respect to n, so that C AE ( g , ε , γ ) C AE ̲ ( g , ε , γ ) , where the strict inequality may also take place, as it happens indeed, for example, with the similar constants in the classical Berry–Esseen inequality [19,20,21,22,23,24]. In terms of inequalities, this means that inequality (25) with C * = C AE assumes that o ( L n ( F , g , ε , γ ) ) tends to zero uniformly for all d.f.’s F F with fixed value of L n ( F , g , ε , γ ) = as 0 , while taking C * = C AE ̲ in (25) leads to separating of o ( L n ( F , g , ε , γ ) ) in (25) into two terms:
sup F F : L n ( F , g , ε , γ ) = Δ n = C AE ̲ ( g , ε , γ ) + r n ( , g , ε , γ ) ,
where lim sup 0   lim sup n | r n ( , g , ε , γ ) | = 0 . The constants in the classical Berry–Esseen inequality similar to those defined in (20)–(24) were first considered in [18] for (20), [17] for (22), [13,26] for (21), [23] for (23), and [25] for (24). The upper asymptotically exact (21) and the conditional upper asymptotically exact (24) constants are linked by the following relation C AE * C ¯ AE by definition, and we shall construct lower bounds namely for C AE * . As for the constants C ¯ AE , we introduce them here to pay tribute to the classical works [13,26]. The function g in (20), (21), (24) may be arbitrary from the class G , while the constants C AB ( g , ε , γ ) and C AE ̲ ( g , ε , γ ) (see (22) and (23)) are defined not for all g G . For example, C AB ( g 1 , ε , γ ) and C AE ̲ ( g 1 , ε , γ ) are not defined in any of the inequalities (11), (12), since the corresponding fractions L E , n ( g 1 , ε , γ ) , L R , n ( g 1 , ε , γ ) are bounded from below by one uniformly with respect to ε and γ (see (13) and (14)) and, hence, cannot be infinitesimal.
Finally, note that definitions (20)–(24) immediately yield the relations
max { C AE ̲ , C AB } min { C AE , C AE * } , max { C AE , C AE * } C ¯ AE
where we omitted the arguments g , ε , γ for clarity).

3. Two-Point Distributions

Most of the lower bounds will be obtained by the choice of a two-point distribution
P X k = q p = 1 P X k = p q = p , q = 1 p ( 0 , 1 ) , k = 1 , , n ,
for the random summands. The present section contains the corresponding required results. In particular, we will find values of the fractions L E , n ( g , ε , γ ) , L R , n ( g , ε , γ ) with g = g * , g c , g 0 , g 1 for all ε , γ > 0 (Theorem 1). We will also investigate the uniform distance between the d.f. of (27) and the standard normal d.f. Φ and find the corresponding extreme values of the argument of d.f.’s (see Theorem 2):
Δ 1 ( p ) : = sup x R | P ( X 1 < x ) Φ ( x ) | = Φ ( p / q ) p , 0 < p < 1 2 , Φ ( q / p ) q , 1 2 p < 1 .

3.1. Computation of the Fractions

For distribution (27) we have E X k = 0 , E X k 2 = 1 , k = 1 , , n , B n 2 = n ,
g 0 ( z ) = min { z , n } , g 1 ( z ) = max { z , n } , g * ( z ) = z , g c ( z ) = 1 , z 0 .
Recall that for ε 1
L E , n ( g 0 , ε , · ) = L E , n ( g * , ε , · ) = L E , n ( ε , · ) , L E , n ( g 1 , ε , · ) = L E , n ( g c , ε , · ) ,
L R , n ( g 0 , ε , · ) = L R , n ( g * , ε , · ) = L R , n ( ε , · ) , L R , n ( g 1 , ε , · ) = L R , n ( g c , ε , · ) .
That is why in the formulation of the next Theorem 1, we do not indicate values of L E , n ( g 0 , ε , · ) , L E , n ( g 1 , ε , · ) , L R , n ( g 0 , ε , · ) , L R , n ( g 1 , ε , · ) for ε 1 separately.
Theorem 1.
(i) For all n N , p [ 1 / 2 , 1 ) and ε , γ > 0 we have
L E , n ( g * , ε , γ ) = ε , n ε 2 q p , max q n p , γ q 3 n p + ε p , q p < n ε 2 p q , max q , ( γ q 2 + p 2 ) 1 ( p > 1 / 2 ) , γ ( p q ) / n p q , n ε 2 > p q ,
L E , n ( g 0 , ε , γ ) = L E , n ( g * , ε 1 , γ ) ,
L E , n ( g c , ε , γ ) = 1 , n ε 2 q p , max 1 , γ q + p , q p < n ε 2 p q , max 1 , ( γ q + p ) 1 ( p > 1 2 ) , γ ( p q ) p , n ε 2 > p q ,
L R , n ( g * , ε , γ ) = ε , n ε 2 q p , γ q 3 n p + max q n p , ε p , q p < n ε 2 p q , γ ( p q ) n p q + max q n p , p 3 n q , n ε 2 > p q ,
L R , n ( g c , ε , γ ) = 1 , n ε 2 q p , γ ε q 3 n p + 1 , q p < n ε 2 p q , γ ( p q ) ε n p q + 1 , n ε 2 > p q ,
(ii) For all ε > 1 , γ > 0 , n N
L E , n ( g 1 , ε , γ ) = 1 , i f p = 1 / 2 ,
L E , n ( g 1 , ε , γ ) = max 1 , γ q + p , γ q 3 / 2 n p + p ε , n ε 2 p q , max 1 , γ q + p , γ q 2 + p 2 n p q , γ ( p q ) n p q , n p q < n ε 2 , max 1 , γ q + p , γ ( p q ) p , n > p q , i f p > 1 / 2 .
(iii) For all ε > 1 , γ > 0 , n N , and p [ 1 / 2 , 1 )
L R , n ( g 0 , ε , γ ) = γ ε q 3 n p + 1 , n q p < n ε 2 p q , γ ( p q ) ε n p q + 1 , n q p p q < n ε 2 , γ ε q 3 n p + max q n p , p , q p < n < n ε 2 p q , γ ( p q ) ε n p q + max q n p , p , q p < n p q < n ε 2 , γ ( p q ) ε n p q + max q n p , p 3 n q , n > p q ,
L R , n ( g 1 , ε , γ ) = γ q 3 n p + max q n p , ε p , n q p < n ε 2 p q , γ ( p q ) n p q + max q n p , p 3 n q , n q p p q < n ε 2 , γ q 3 n p + max ε p , 1 , q p < n < n ε 2 p q , γ ( p q ) n p q + max p 3 n q , 1 , q p < n p q < n ε 2 , γ ( p q ) n p q + 1 , p q < n .
In particular,
L R , n ( g c , , · ) 1 , p 1 2 , 1 , n N ,
for p = 1 / 2 and all ε , γ > 0 , n N :
L E , n ( g * , ε , γ ) = L E , n ( g 0 , ε , γ ) = L R , n ( g * , ε , γ ) = L R , n ( g 0 , ε , γ ) = min ε , 1 n ,
L E , n ( g c , ε , γ ) = L E , n ( g 1 , ε , γ ) = L R , n ( g c , ε , γ ) = L R , n ( g 1 , ε , γ ) 1 ,
for p > 1 / 2 and all n N :
L E , n ( g * , 1 , 1 ) = L E , n ( g 0 , 1 , 1 ) = L E , n ( g 0 , , 1 ) = q 2 n p q + p , n p q , q 2 + p 2 n p q , n > p q ,
L E , n ( g * , , 1 ) = q 2 + p 2 n p q ,
L E , n ( g 0 , , 1 ) = max q n p , q 3 n p + p , p q p , n p q , q 2 + p 2 n p q , n > p q ,
L E , n ( g c , ε , γ ) = 1 , ε > 0 , γ 1 .
Proof. 
Observe that in the i.i.d. case under consideration we have B n 2 = n ,
L E , n ( g , ε , γ ) = 1 g ( n ) sup 0 < z < ε n g ( z ) z γ | μ 1 ( z ) | + z σ 1 2 ( z ) ,
L R , n ( g , ε , γ ) = 1 g ( n ) g ( ε n ) ε n γ | μ 1 ( ε n ) | + sup 0 < z < ε n g ( z ) σ 1 2 ( z ) .
Let us find μ 1 ( · ) , σ 1 2 ( · ) . For all z > 0 we have
| μ 1 ( z ) | = | E X 1 3 1 ( | X 1 | < z ) | = 0 , z q p , q 3 p , q p < z p q , p q p q , z > p q ,
σ 1 2 ( z ) = E X 1 2 1 ( | X 1 | z ) = 1 , z q p , p , q p < z p q , 0 , z > p q ,
γ | μ 1 ( z ) | + z σ 1 2 ( z ) = z , z q p , γ q 3 p + z p , q p < z p q , γ ( p q ) p q , z > p q .
(1) Compute L E , n ( g * , ε , γ ) and L E , n ( g 0 , ε , γ ) . For all n N , ε , γ > 0 we have
L E , n ( g * , ε , γ ) = 1 n sup 0 < z < ε n γ | μ 1 ( z ) | + z σ 1 2 ( z ) =
= ε , n ε 2 q p , max q n p , γ q 3 n p + p ε , q p < n ε 2 p q , max q n p , γ q 3 n p + p 3 n q 1 ( p > 1 2 ) , γ ( p q ) n p q , n ε 2 > p q ,
in particular, L E , n ( g * , ε , γ ) = min ε , 1 n for p = 1 2 . Now let us find L E , n ( g 0 , ε , γ ) for ε > 1 . We have
L E , n ( g 0 , ε , γ ) = sup 0 < z < ε n z n z n γ | μ 1 ( z ) | + z σ 1 2 ( z ) = = max 1 n sup 0 < z < n γ | μ 1 ( z ) | + z σ 1 2 ( z ) , sup n z < ε n 1 z γ | μ 1 ( z ) | + z σ 1 2 ( z ) = = max L E , n ( g * , 1 , γ ) , sup n z < ε n γ z | μ 1 ( z ) | + σ 1 2 ( z ) , γ > 0 .
If p = q = 1 / 2 , then L E , n ( g * , ε , γ ) = 1 / n ,
sup n z < ε n γ z | μ 1 ( z ) | + σ 1 2 ( z ) = sup n z < ε n 1 ( z 1 ) = 1 ( n = 1 )
and hence,
L E , n ( g 0 , ε , γ ) = max 1 n , 1 ( n = 1 ) = 1 n , ε > 1 ,
so that we may write for all ε > 0
L E , n ( g 0 , ε , · ) = min ε , 1 n = L E , n ( g * , ε , · ) = L E , n ( g * , ε 1 , · ) .
If p > 1 / 2 , then
sup n z < ε n γ z | μ 1 ( z ) | + σ 1 2 ( z ) = sup n z < ε n γ z q 3 p + p , z p q , γ ( p q ) z p q , z > p q , =
= γ q 3 n p + p , n ε 2 p q , max γ q 3 n p + p , γ ( p q ) p , n p q < n ε 2 , γ ( p q ) n p q , n > p q ,
and with the account of p p 3 n q , γ ( p q ) p γ ( p q ) n p q for n p q ,we finally obtain
L E , n ( g 0 , ε , γ ) = L E , n ( g * , 1 , γ ) = max q n p , γ q 3 n p + p , n ε 2 p q , max q n p , γ q 3 n p + p 3 n q , γ ( p q ) n p q , n ε 2 > p q ,
for all ε > 1 and γ > 0 , i.e., for all ε > 0 the identity
L E , n ( g 0 , ε , · ) = L E , n ( g * , ε 1 , · )
holds also for p > 1 2 . In particular, with γ = 1 and p > 1 2 for all ε > 0 we have
L E , n ( g * , ε , 1 ) = ε , n ε 2 q p , max q n p , q 3 n p + p ε = q 3 n p + p ε , q p < n ε 2 p q , max q , q 2 + p 2 , p q / n p q = q 2 + p 2 n p q , n ε 2 > p q ,
L E , n ( g * , , 1 ) = q 2 + p 2 n p q ,
L E , n ( g * , 1 , 1 ) = L E , n ( g 0 , 1 , 1 ) = L E , n ( g 0 , , 1 ) = q 3 n p + p , n p q , q 2 + p 2 n p q , n > p q .
(2) Let us find L E , n ( g c , ε , γ ) and L E , n ( g 1 , ε , γ ) . For all n N , ε , γ > 0 we have
L E , n ( g c , ε , γ ) = sup 0 < z < ε n γ z | μ 1 ( z ) | + σ 1 2 ( z ) = sup 0 < z < ε n 1 , z q p , γ z q 3 p + p , q p < z p q , γ ( p q ) z p q , z > p q , = = 1 , n ε 2 q p , max 1 , γ q + p , q p < n ε 2 p q , max 1 , ( γ q + p ) 1 ( p > 1 2 ) , γ ( p q ) p , n ε 2 > p q ,
in particular, L E , n ( g c , ε , γ ) 1 for p = 1 2 and all ε , γ > 0 , as well as for p > 1 2 , ε > 0 , γ 1 . For ε > 1 we have
n L E , n ( g 1 , ε , γ ) = sup 0 < z < ε n z n z γ | μ 1 ( z ) | + z σ 1 2 ( z ) = = max sup 0 < z < n n z γ | μ 1 ( z ) | + z σ 1 2 ( z ) , sup n z < ε n γ | μ 1 ( z ) | + z σ 1 2 ( z ) = = max n L E , n ( g c , 1 , γ ) , sup n z < ε n γ | μ 1 ( z ) | + z σ 1 2 ( z ) , γ > 0 .
If p = q = 1 / 2 , then
sup n z < ε n γ | μ 1 ( z ) | + z σ 1 2 ( z ) = sup n z < ε n z 1 ( z 1 ) = 1 ( n = 1 ) ,
and hence,
L E , n ( g 1 , ε , γ ) = max { 1 , 1 ( n = 1 ) / n } = 1 , ε > 1 , γ > 0 , n N ;
otherwise
sup n z < ε n γ | μ 1 ( z ) | + z σ 1 2 ( z ) =
= sup n z < ε n γ q 3 p + z p , z p q , γ ( p q ) p q , z > p q , = γ q 3 / 2 / p + p ε n , n ε 2 p q , max { γ q 2 + p 2 , γ ( p q ) } / p q , n p q < n ε 2 , γ ( p q ) / p q , n > p q ,
and hence,
L E , n ( g 1 , ε , γ ) = max 1 , γ q + p , γ q 3 / 2 n p + p ε , n ε 2 p q , max 1 , γ q + p , max { γ q 2 + p 2 , γ ( p q ) } / n p q , n p q < n ε 2 , max 1 , γ q + p , γ ( p q ) p , γ ( p q ) n p q = max 1 , γ q + p , γ ( p q ) p , n > p q ,
for all ε > 1 and γ > 0 . In particular,
L E , n ( g 1 , ε , 1 ) = max 1 , q 3 / 2 n p + p ε , n ε 2 p q , max 1 , q 2 + p 2 n p q , n p q < n ε 2 , 1 , n > p q , p > 1 2 , ε > 1 .
(3) Let us compute L R , n ( g * , ε , γ ) and L R , n ( g 0 , ε , γ ) . With the account of
sup 0 < z ε n z σ 1 2 ( z ) = sup 0 < z ε n z , z q p , p z , q p < z p q , 0 , z > p q , = ε n , n ε 2 q p , max q p , p ε n , q p < n ε 2 p q , max q p , p 3 q 1 ( p > 1 2 ) , n ε 2 > p q ,
and max q p , p 3 q 1 ( p > 1 2 ) = max q p , p 3 q , p [ 1 2 , 1 ) , for all n N , ε , γ > 0 we obtain
L R , n ( g * , ε , γ ) = 1 n γ | μ 1 ( ε n ) | + sup 0 < z < ε n z σ 1 2 ( z ) =
= ε , n ε 2 q p , γ q 3 n p + max q n p , p ε , q p < n ε 2 p q , γ ( p q ) n p q + max q n p , p 3 n q , n ε 2 > p q ,
in particular, L R , n ( g * , ε , γ ) = min { ε , 1 n } for p = 1 2 . Now let ε > 1 . Taking into account that σ 1 2 ( z ) does not increase with respect to z 0 , and using the just computed sup 0 < z ε n z σ 1 2 ( z ) , we obtain
L R , n ( g 0 , ε , γ ) = 1 n γ ε | μ 1 ( ε n ) | + sup 0 < z < ε n min { z , n } σ 1 2 ( z ) =
= 1 n γ ε | μ 1 ( ε n ) | + sup 0 < z n z σ 1 2 ( z ) =
= γ ε q 3 n p + 1 , n q p < n ε 2 p q , γ ( p q ) ε n p q + 1 , n q p p q < n ε 2 , γ ε q 3 n p + max q n p , p , q p < n < n ε 2 p q , γ ( p q ) ε n p q + max q n p , p , q p < n p q < n ε 2 , γ ( p q ) ε n p q + max q n p , p 3 n q , n > p q ,
in particular, for p = 1 2 we have L R , n ( g 0 , ε , · ) = 1 n = min { ε , 1 n } = L R , n ( g * , ε , · ) for all ε > 1 , and hence, for all ε > 0 .
(4) Let us compute L R , n ( g c , ε , γ ) and L R , n ( g 1 , ε , γ ) . Taking into account that σ 1 2 ( z ) does not increase with respect to z 0 and σ 1 2 ( 0 ) = σ 1 2 = 1 , for all n N , ε , γ > 0 and p [ 1 2 , 1 ) we obtain
L R , n ( g c , ε , γ ) = γ ε n | μ 1 ( ε n ) | + sup 0 < z < ε n σ 1 2 ( z ) = γ ε n | μ 1 ( ε n ) | + 1 =
= 1 , n ε 2 q p , γ ε q 3 n p + 1 , q p < n ε 2 p q , γ ( p q ) ε n p q + 1 , n ε 2 > p q ,
in particular, L R , n ( g c , · , · ) 1 for p = 1 2 and L R , n ( g c , , · ) 1 for all p [ 1 2 , 1 ) . Now let ε > 1 . With the account of
sup n z < ε n z σ 1 2 ( z ) = = sup n z < ε n z , z q p , p z , q p < z p q , 0 , z > p q , = max q p , p n ε 2 p q , n q p < n ε 2 , p n ε 2 p q , q p < n p q , 0 , n > p q ,
we have
n L R , n ( g 1 , ε , γ ) = γ | μ 1 ( ε n ) | + sup 0 < z < ε n ( z n ) σ 1 2 ( z ) =
= γ | μ 1 ( ε n ) | + max n , sup n z < ε n z σ 1 2 ( z ) =
= γ q 3 p + max q p , p ε n , n = γ q 3 p + max q p , p ε n , n q p < n ε 2 p q , γ ( p q ) p q + max q p , p 3 q , n = γ ( p q ) p q + max q p , p 3 q , n q p p q < n ε 2 , γ q 3 p + max p ε n , n , q p < n < n ε 2 p q , γ ( p q ) p q + max p 3 q , n , q p < n p q < n ε 2 , γ ( p q ) p q + n , n > p q ,
in particular, L R , n ( g 1 , ε , γ ) 1 for p = 1 2 . □

3.2. Computation of the Uniform Distance

In the present section, we compute the uniform distance Δ 1 ( p ) between the d.f. of (27) and the standard normal d.f. Let us denote
Ψ ( x ) = 1 1 + x 2 Φ ( | x | ) = Φ ( | x | ) x 2 1 + x 2 , x R ,
Ψ ˜ ( p ) = Ψ 1 p p = Φ 1 p p ( 1 p ) , 0 < p < 1 .
Please note that Ψ ( x ) is an even function, therefore, it suffices to investigate it only for x 0 .
Lemma 1
(see [27]). The function Ψ ( x ) is positive for x 0 , increases for 0 < x < x Φ , decreases for x > x Φ and attains its maximal value C Φ = 0.54093 in the point x Φ = 0.213105 , where x Φ is the unique root of the equation
x e x 2 / 2 ( 1 + x 2 ) 2 = ( 8 π ) 1 / 2 .
Remark 1.
The statement about the interval of monotonicity is absent in the formulation of the corresponding lemma in [27], but these intervals were investigated in the proof.
The definition of Ψ ˜ and lemma 1 immediately imply that the function
Ψ ˜ ( p ) : = Φ 1 p p ( 1 p )
is positive for p ( 0 , 1 ) , increases for 0 < p < p Φ , decreases for p Φ < p < 1 and
max p ( 0 , 1 ) Ψ ˜ ( p ) = Ψ ˜ ( p Φ ) = C Φ , where p Φ = 1 x Φ 2 + 1 = 0.9565 .
Lemma 2.
On the interval p ( 0 , 1 ) the function
ϕ ( p ) : = Ψ ˜ ( 1 p ) + p = Φ p 1 p
monotonically increases, while its derivative
ϕ ( p ) = e p 2 ( 1 p ) 2 2 π p ( 1 p ) 3
monotonically decreases.
Proof. 
The function ϕ ( p ) monotonically increases as a superposition of monotonically increasing functions. Please note that the derivative ϕ ( p ) takes only positive values, hence, we may define its logarithm
ln ϕ ( p ) = p 2 ( 1 p ) ln ( 2 2 π ) 1 2 ln p 3 2 ln ( 1 p ) = : u ( p ) .
The derivative
u ( p ) = 1 2 ( 1 p ) 2 1 2 p + 3 2 ( 1 p ) = 0
changes its sign in the points p ( 0 , 1 ) that are the roots of the equation
p ( 1 p ) 2 + 3 p ( 1 p ) = 0 ,
which has a unique solution p = 1 / 2 on ( 0 , 1 ) . Since
d d p u ( p ) | p = 1 4 = 8 9 , d d p u ( p ) | p = 3 4 = 8 3 ,
then u ( p ) is strictly decreasing on ( 0 , 1 ) , and hence, ϕ ( p ) is also strictly decreasing on ( 0 , 1 ) .  □
Theorem 2.
Let X 1 have distribution (27), then
Δ 1 ( p ) : = sup x R | P ( X 1 < x ) Φ ( x ) | = Ψ ˜ ( p q ) = Φ ( p / q ) p , 0 < p < 1 2 , Φ ( q / p ) q , 1 2 p < 1 .
Proof. 
Please note that
Δ 1 ( p ) = max Φ ( p / q ) , | Φ ( p / q ) q | , | Φ ( q / p ) q | , 1 Φ ( q / p ) =
= max 1 ϕ ( p ) , Ψ ˜ ( q ) , Ψ ˜ ( p ) , 1 ϕ ( q ) = max f 1 ( p ) , f 2 ( p ) , f 3 ( p ) , f 4 ( p ) ,
where
f 1 ( p ) = 1 ϕ ( p ) , f 2 ( p ) = Ψ ˜ ( 1 p ) = ϕ ( p ) p , f 3 ( p ) = Ψ ˜ ( p ) = ϕ ( 1 p ) ( 1 p ) , f 4 ( p ) = 1 ϕ ( 1 p ) .
Let p q . Then f 1 ( p ) f 4 ( p ) , and it suffices to show that
max f 2 ( p ) , f 4 ( p ) f 3 ( p ) .
Let us prove that f 5 ( p ) : = f 3 ( p ) f 4 ( p ) 0 . Using lemma 2, we conclude that the derivative
f 5 ( p ) : = d d p ( 2 ϕ ( 1 p ) + p 2 ) = 2 d d p ϕ ( 1 p ) + 1 = 1 e ( 1 p ) 2 p 2 π ( 1 p ) p 3
decreases on ( 0 , 1 ) with
f 5 1 2 = 1 4 2 π e = 0.0321 , lim p 1 0 f 5 ( p ) = ,
hence, f 5 ( p ) has a unique stationary point on ( 0 , 1 ) , which is a point of maximum, so that
inf 1 2 p < 1 f 5 ( p ) = min f 5 1 2 , lim p 1 f 5 ( p ) = min 2 Φ ( 1 ) 3 2 , 0 = min 0.1826 , 0 = 0 .
The inequality f 2 ( p ) f 3 ( p ) follows from the properties of the function Ψ ˜ with the account of
Ψ ˜ 1 2 Ψ ˜ ( 1 0 ) = Ψ ˜ 1 2 .
Thus, the theorem has been proved in the case p q . The validity of the statement of the theorem for p < q follows from that f 1 ( p ) = f 4 ( q ) and f 2 ( p ) = f 3 ( q ) . □
Lemma 3
(see [27,28]). For an arbitrary d.f. F with zero mean and unit variance we have
sup x R | F ( x ) Φ ( x ) | sup x R Ψ ( x ) = Ψ ( x Φ ) = Ψ ˜ ( p Φ ) = Δ 1 ( p Φ ) = : C Φ = 0.54093 .
Remark 2.
In [28] [(2.32), (2.33)] it is proved that
| F ( x ) Φ ( x ) | Ψ ( x ) , x R .
In [27] it is proved that in the inequality
sup x R | F ( x ) Φ ( x ) | sup x R Ψ ( x ) = C Φ
the equality is attained at a two-point distribution.

4. Lower Bounds for the Exact Constants

In the present section, we construct lower bounds for the quantities
inf g G C E ( g , ε , γ ) , inf g G C R ( g , ε , γ ) ,
C E ( ε , γ ) = sup g G C E ( g , ε , γ ) , C R ( g , ε , γ ) = sup g G C R ( ε , γ )
and
A E ( ε , γ ) = C E ( g * , ε , γ ) , A R ( ε , γ ) = C R ( g * , ε , γ )
for all ε , γ > 0 . Recall that
g 0 ( z ) = min { z , B n } , g 1 ( z ) = max { z , B n } , g * ( z ) = z , g c ( z ) = 1 , z 0 .
By virtue of invariance of the fractions L E , n ( g , ε , γ ) , L R , n ( g , ε , γ ) with respect to scale transform of g and extreme property of g 1 (see (15)) we have
inf g G C E ( g , ε , γ ) = inf g G sup F 1 , , F n F , n N : B n > 0 Δ n ( F 1 , , F n ) L E , n ( g , ε , γ ) = inf g G sup F 1 , , F n F , n N : B n = 1 Δ n ( F 1 , , F n ) L E , n ( g , ε , γ )
sup F 1 , , F n F , n N : B n = 1 Δ n ( F 1 , , F n ) L E , n ( g 1 , ε , γ ) = sup F 1 , , F n F , n N : B n > 0 Δ n ( F 1 , , F n ) L E , n ( g 1 , ε , γ ) = C E ( g 1 , ε , γ )
on one hand, and inf g G C E ( g , ε , γ ) C E ( g 1 , ε , γ ) by definition of the lower bound, on the other hand. Therefore
inf g G C E ( g , ε , γ ) = C E ( g 1 , ε , γ ) , inf g G C R ( g , ε , γ ) = C R ( g 1 , ε , γ ) ,
where the second equality is proved similar to the first one.
Let us show that
C E ( ε , γ ) = C E ( g 0 , ε , γ ) , C R ( ε , γ ) = C R ( g 0 , ε , γ ) .
Indeed, for arbitrary n N , F 1 , , F n F and g G due to the extremality of g 0 (see (15)) we have
Δ n C E ( g 0 , ε , γ ) L E , n ( g 0 , ε , γ ) C E ( g 0 , ε , γ ) L E , n ( g , ε , γ ) ,
hence, C E ( ε , γ ) C E ( g 0 , ε , γ ) , on one hand. On the other hand, this inequality may hold true only with the equality sign, since C E ( ε , γ ) = sup g G C E ( g , ε , γ ) by definition. The same reasoning holds also true for C R ( ε , γ ) .
Thus, C E ( g 1 , ε , γ ) , C R ( g 1 , ε , γ ) are the most optimistic constants, while C E ( g 0 , ε , γ ) , C R ( g 0 , ε , γ ) are the most pessimistic, but universal (exact) ones. The next theorem establishes lower bounds for the exact constants C E ( ε , γ ) = C E ( g 0 , ε , γ ) , C E ( ε , γ ) = C R ( g 0 , ε , γ ) , and also for the constants A E ( ε , γ ) and A R ( ε , γ ) appearing in inequalities (1) and (2).
Theorem 3.
(i) For all ε , γ > 0 we have
min { C E ( ε , γ ) , C R ( ε , γ ) , A E ( ε , γ ) , A R ( ε , γ ) } Φ ( 1 ) 0.5 min { 1 , ε } > 0.3413 min { 1 , ε } .
(ii) For 1 2 < p < 1 , q = 1 p set
Δ 1 ( p ) : = Φ ( q / p ) q .
Take any γ > 0 . Let us denote for ε 1 :
K E , 0 ( p , ε , γ ) = Δ 1 ( p ) / ε , 1 2 < p 1 ε 2 + 1 , Δ 1 ( p ) / max q / p , γ q 3 / p + ε p , 1 ε 2 + 1 < p < 1 ,
K R , 0 ( p , ε , γ ) = Δ 1 ( p ) / ε , 1 2 < p 1 ε 2 + 1 , Δ 1 ( p ) / γ q 3 / p + max q / p , ε p , 1 ε 2 + 1 < p < 1 ,
and for ε > 1 :
K E , 0 ( p , ε , γ ) = Δ 1 ( p ) / max q / p , γ q 3 / p + p , 1 2 < p < 1 ,
K E , * ( p , ε , γ ) = Δ 1 ( p ) / max q p , γ q 3 p + ε p , ε 2 ε 2 + 1 p < 1 , Δ 1 ( p ) p q / max q , γ q 2 + p 2 , γ ( p q ) , 1 2 < p < ε 2 ε 2 + 1 ,
K R , 0 ( p , ε , γ ) = Δ 1 ( p ) / γ ε q 3 p + max q p , p , ε 2 ε 2 + 1 p < 1 , Δ 1 ( p ) / γ ( p q ) ε p q + max q p , p , 1 2 < p < ε 2 ε 2 + 1 ,
K R , * ( p , ε , γ ) = Δ 1 ( p ) / γ q 3 p + max q p , ε p , ε 2 ε 2 + 1 p < 1 , Δ 1 ( p ) / γ ( p q ) p q + max q p , p 3 q , 1 2 < p < ε 2 ε 2 + 1 .
Then for all ε , γ > 0 we have
C E ( ε , γ ) sup 1 2 < p < 1 K E , 0 ( p , ε , γ ) , C R ( ε , γ ) sup 1 2 < p < 1 K R , 0 ( p , ε , γ ) ,
and for ε > 1 also
A E ( ε , γ ) sup 1 2 < p < 1 K E , * ( p , ε , γ ) , A R ( ε , γ ) sup 1 2 < p < 1 K R , * ( p , ε , γ ) .
In particular,
A E ( , 1 ) sup 1 2 < p < 1 Φ ( q / p ) q p q q 2 + p 2 > 0.3703 ,
and for the both constants C { C E , C R } with ε = 1 , γ = 1 the following lower bound holds:
min { C ( 1 , 1 ) , C E ( , 1 ) } sup 1 2 < p < 1 Φ ( q / p ) q q 3 / p + p > 0.5685 ( p = 0.9058 ) .
Values of the greatest lower bounds of K E , * ( p , ε , γ ) and K R , * ( p , ε , γ ) for some ε 1 and γ > 0 are given in Table 1 and Table 2, respectively. Values of the greatest lower bounds of K E , 0 ( p , ε , γ ) and K R , 0 ( p , ε , γ ) with the corresponding extremal values of p are given in Table 4 for some ε > 0 and γ > 0 .
Proof. 
Let n = 1 and the r.v. X 1 have the two-point distribution (27) with p [ 1 2 , 1 ) . Then, by Theorem 2, we have Δ 1 ( F 1 ) = Δ 1 ( p ) , and all the constants C { C E , C E } , A { A E , A R } can be bounded from below as
C ( ε , γ ) sup 1 2 p < 1 Δ 1 ( p ) L , 1 ( g 0 , ε , γ ) , A ( ε , γ ) sup 1 2 p < 1 Δ 1 ( p ) L , 1 ( g * , ε , γ ) .
In particular, for p = 1 2 we have Δ 1 ( 1 2 ) = Φ ( 1 ) 0.5 = 0.3413 , and by Theorem 1
L E , n ( g 0 , ε , γ ) = L R , n ( g 0 , ε , γ ) = L E , n ( g * , ε , γ ) = L R , n ( g * , ε , γ ) = min { 1 , ε } , ε , γ > 0 ,
whence the statement of point (i) follows immediately.
To prove point (ii) it suffices to make sure that for all p ( 1 2 , 1 ) and ε , γ > 0
K , 0 ( p , ε , γ ) = Δ 1 ( p ) L , 1 ( g 0 , ε , γ ) , K , * ( p , ε , γ ) = Δ 1 ( p ) L , 1 ( g * , ε , γ ) , { E , R } .
Theorem 1 (i) with n = 1 implies that for p > 1 2 , ε , γ > 0
L E , 1 ( g * , ε , γ ) = ε , ε 2 q p , max q p , γ q 3 p + ε p , q p < ε 2 p q , max q , γ q 2 + p 2 , γ ( p q ) / p q , ε 2 > p q .
L R , 1 ( g * , ε , γ ) = ε , ε 2 q p , γ q 3 p + max q p , ε p , q p < ε 2 p q , γ ( p q ) p q + max q p , p 3 q , ε 2 > p q ,
L E , 1 ( g 0 , ε , γ ) = L E , 1 ( g * , ε 1 , γ ) , while for ε > 1 , by the same Theorem 1 (iii), we have
L R , 1 ( g 0 , ε , γ ) = γ ε q 3 p + max q p , p , 1 < ε 2 p q , γ ( p q ) ε p q + max q p , p , 1 p q < ε 2 ,
(recall that L R , n ( g 0 , ε , γ ) = L R , n ( g * , ε , γ ) for ε 1 ). Please note that for all ε > 0 and p ( 1 2 , 1 )
ε 2 q p p 1 2 , 1 ε 2 + 1 = , ε > 1 , q p < ε 2 p q p > 1 ε 2 + 1 , p ε 2 ε 2 + 1 , p ε 2 ε 2 + 1 , ε > 1 , p > 1 ε 2 + 1 , ε 1 , ε 2 > p q p 1 2 , ε 2 ε 2 + 1 = , ε 1 ,
so that from the three conditions in (35) under the additional condition p ( 1 2 , 1 ) there remain only two:
1 2 < p 1 ε 2 + 1 1 ε 2 + 1 < p < 1 for ε 1 , ε 2 ε 2 + 1 p < 1 1 2 < p < ε 2 ε 2 + 1 for ε > 1 .
In particular, for ε 1
L E , 1 ( g 0 , ε , γ ) = L E , 1 ( g * , ε , γ ) = ε , 1 2 < p 1 ε 2 + 1 , max q p , γ q 3 p + ε p , 1 ε 2 + 1 < p < 1 ,
L R , 1 ( g 0 , ε , γ ) = L R , 1 ( g * , ε , γ ) = ε , 1 2 < p 1 ε 2 + 1 , γ q 3 p + max q p , ε p , 1 ε 2 + 1 < p < 1 ,
and for ε > 1
L E , 1 ( g * , ε , γ ) = max q p , γ q 3 p + ε p , ε 2 ε 2 + 1 p < 1 , max q , γ q 2 + p 2 , γ ( p q ) / p q , 1 2 < p ε 2 ε 2 + 1 .
L E , 1 ( g 0 , ε , γ ) = L E , 1 ( g * , 1 , γ ) = max q p , γ q 3 p + p , 1 2 < p < 1 ,
L R , 1 ( g * , ε , γ ) = γ q 3 p + max q p , ε p , ε 2 ε 2 + 1 p < 1 , γ ( p q ) p q + max q p , p 3 q , 1 2 < p < ε 2 ε 2 + 1 ,
L R , 1 ( g 0 , ε , γ ) = γ ε q 3 p + max q p , p , ε 2 ε 2 + 1 p < 1 , γ ( p q ) ε p q + max q p , p , 1 2 < p < ε 2 ε 2 + 1 ,
whence we obtain the above expressions for K , 0 , K , * .
Now let us consider the particular cases. The coinciding lower bounds for C E ( , 1 ) , C E ( 1 , 1 ) and C R ( 1 , 1 ) follow from that L E , 1 ( g 0 , , 1 ) = q 3 / p + p for all p ( 1 2 , 1 ) , and also from, as it can easily be made sure,
L E , 1 ( g 0 , 1 , 1 ) = L E , 1 ( g 0 , , 1 ) = q 3 / p + p = L R , 1 ( g 0 , 1 , 1 )
for p p 0 , where p 0 = 0.6823 is the unique root of the equation p 3 + p 1 = 0 on the segment [ 0.5 , 1 ] . The lower bound for A E ( , 1 ) follows from that L E , 1 ( g * , , 1 ) = ( q 2 + p 2 ) / p q . □
Now let us find lower bouds for the most optimistic constants C E ( g 1 , ε , γ ) and C R ( g 1 , ε , γ ) .
Theorem 4.
(i) For all ε , γ > 0 we have
min { C E ( g 1 , ε , γ ) , C R ( g 1 , ε , γ ) } Φ ( 1 ) 0.5 > 0.3413 .
(ii) For 1 2 < p < 1 , q = 1 p set
Δ 1 ( p ) : = Φ ( q / p ) q .
Take any γ > 0 . Let us denote for ε 1 :
K E , 1 ( p , ε , γ ) = Δ 1 ( p ) , 1 2 < p 1 ε 2 + 1 , Δ 1 ( p ) / max { 1 , γ q + p } , 1 ε 2 + 1 < p < 1 ,
K R , 1 ( p , ε , γ ) = Δ 1 ( p ) , 1 2 < p 1 ε 2 + 1 , Δ 1 ( p ) / 1 + γ ε q 3 p , 1 ε 2 + 1 < p < 1 ,
and for ε > 1 :
K E , 1 ( p , ε , γ ) = Δ 1 ( p ) / max 1 , γ q + p , γ q 2 + p 2 p q , γ ( p q ) p q , 1 2 < p < ε 2 ε 2 + 1 , Δ 1 ( p ) / max 1 , γ q + p , γ q 3 / 2 p + p ε , ε 2 ε 2 + 1 p < 1 ,
K R , 1 ( p , ε , γ ) = Δ 1 ( p ) / γ ( p q ) p q + max p 3 q , 1 , 1 2 < p < ε 2 ε 2 + 1 , Δ 1 ( p ) / γ q 3 p + max ε p , 1 , ε 2 ε 2 + 1 p < 1 .
Then for all ε , γ > 0 we have
C E ( g 1 , ε , γ ) sup 1 2 < p < 1 K E , 1 ( p , ε , γ ) , C R ( g 1 , ε , γ ) sup 1 2 < p < 1 K R , 1 ( p , ε , γ ) .
In particular,
C E ( g 1 , ε , γ ) sup 1 2 < p < 1 Δ 1 ( p ) = Δ 1 ( p Φ ) = : C Φ = 0.5409 ,
if γ 1 , ε 1 or ε x Φ , where x Φ = 0.213105 is defined in Lemma 1, p Φ = ( x Φ 2 + 1 ) 1 = 0.9565 ,
C E ( g 1 , , 1 ) sup 1 2 < p < 1 Φ ( q / p ) q p q q 2 + p 2 > 0.3703 ,
C R ( g 1 , ε , γ ) C Φ f o r ε x Φ ,
C R ( g 1 , 1 , 1 ) sup 1 2 < p < 1 K R , 1 ( p , 1 , 1 ) = Δ 1 ( p ) 1 + ( 1 p ) 3 / p | p = 0.9678 > 0.5370 .
Values of the greatest lower bounds of K E , 1 ( p , ε , γ ) and K R , 1 ( p , ε , γ ) with the corresponding extremal values of p are given in Table 5 for some ε > 0 and γ > 0 .
Remark 3.
Theorem 4 yields the following lower bound for the exact constant A E ( , 1 ) in the Esseen-type inequality (1):
A E ( , 1 ) C E ( g 1 , , 1 ) sup 1 2 < p < 1 Φ ( q / p ) q p q q 2 + p 2 > 0.3703 ,
which coincides with the one obtained directly in Theorem 3.
Proof. 
Let n = 1 and the r.v. X 1 have the two-point distribution (27) with p [ 1 2 , 1 ) . Then, by Theorem 2 we have Δ 1 ( F 1 ) = Δ 1 ( p ) , and all the constants C { C E , C E } are bounded from below as
C ( g 1 , ε , γ ) sup 1 2 p < 1 Δ 1 ( p ) L , 1 ( g 1 , ε , γ ) .
In particular, for p = 1 2 we have Δ 1 ( 1 2 ) = Φ ( 1 ) 0.5 = 0.3413 , while by Theorem 1
L E , n ( g 1 , ε , γ ) = L R , n ( g 1 , ε , γ ) 1 , ε , γ > 0 ,
whence the statement of point (i) follows immediately.
To prove point (ii), it suffices to make sure that for all p ( 1 2 , 1 ) , ε , γ > 0 we have
K , 1 ( p , ε , γ ) = Δ 1 ( p ) L , 1 ( g 1 , ε , γ ) , { E , R } .
Theorem 1 (i) (see (30) and (32)) with n = 1 implies that for p > 1 2 , γ > 0 and ε 1 we have
L E , 1 ( g 1 , ε , γ ) = L E , 1 ( g c , ε , γ ) = 1 , ε 2 q p p 1 ε 2 + 1 , max 1 , γ q + p , ε 2 > q p p > 1 ε 2 + 1 , = Δ 1 ( p ) K E , 1 ( p , ε , γ ) ,
L R , 1 ( g 1 , ε , γ ) = L R , 1 ( g c , ε , γ ) = 1 , ε 2 q p , γ ε q 3 p + 1 , ε 2 > q p , = Δ 1 ( p ) K R , 1 ( p , ε , γ ) ,
while for ε > 1 , by Theorem 1 (ii) and (iii), respectively, we have
L E , 1 ( g 1 , ε , γ ) = max 1 , γ q + p , γ q 3 / 2 p + p ε , ε 2 p q p ε 2 ε 2 + 1 , max 1 , γ q + p , γ q 2 + p 2 p q , γ ( p q ) p q , ε 2 > p q p < ε 2 ε 2 + 1 , = Δ 1 ( p ) K E , 1 ( p , ε , γ ) ,
L R , 1 ( g 1 , ε , γ ) = γ q 3 p + max ε p , 1 , ε 2 p q , γ ( p q ) p q + max p 3 q , 1 , ε 2 > p q , = Δ 1 ( p ) K R , 1 ( p , ε , γ ) ,
which coincides with the statement of point (ii).
Now let us consider the particular cases. The lower bound for C E ( g 1 , ε , γ ) with γ 1 follows from that, for the specified γ and ε 1 , we have K E , 1 ( p , ε , γ ) = Δ 1 ( p ) , 1 2 < p 1 . For ε x Φ we have 1 ε 2 + 1 1 x Φ 2 + 1 = p Φ and, hence,
C E ( g 1 , ε , γ ) sup 1 2 < p 1 ε 2 + 1 K E , 1 ( p , ε , γ ) = sup 1 2 < p 1 ε 2 + 1 Δ 1 ( p ) = Δ 1 ( p Φ ) = C Φ .
The lower bound for C R ( g 1 , ε , γ ) C Φ with ε x Φ is obtained similarly. The given values of the constants C E ( g 1 , , 1 ) , C R ( g 1 , 1 , 1 ) are computed trivially. □

5. Lower Bounds for the Asymptotically Best Constants

Let us investigate the constants C AB ( g , ε , γ ) in (11) and (12) and construct their lower bounds. Due to the extremity of the functions g 0 ( z ) = min { z , B n } and g 1 ( z ) = max { z , B n } (see (15)) we have
sup g G C AB ( g , ε , γ ) = C AB ( g 0 , ε , γ ) , inf g G C AB ( g , ε , γ ) = C AB ( g 1 , ε , γ ) .
in both inequalities (11) and (12).
Theorem 5.
For all ε , γ > 0 :
(i) in inequality (11)
inf ε > 0 C AB ( g 0 , ε , γ ) 1 3 2 π sup 1 2 < p < 1 p + 1 max { 1 p , γ ( 1 p ) 2 + p 2 , γ ( 2 p 1 ) } = : C AB ̲ ( γ ) ,
in particular, inf ε > 0 C AB ( g 0 , ε , 1 ) 10 + 3 6 2 π = 0.4097 ;
(ii) in inequality (12)
C AB ( g 0 , ε , γ ) 1 + 5 3 2 π 2 γ ( ε 1 1 ) ( 5 2 ) + 3 5 , γ ε 1 < 2 3 , 1 2 π = 0.3989 , γ ε 1 2 3 ;
(iii) in both inequalities (11) and (12)
C AB ( g 1 , ε , γ ) = 0 .
Values of C AB ̲ ( γ ) for some γ and the corresponding extreme values of p are given in Table 6.
Proof. 
Let us show that C AB ( g 1 , ε , γ ) = 0 . According to (13) and (14), L E , n ( g 1 , ε , γ ) 1 , L R , n ( g 1 , ε , γ ) 1 for all ε , γ > 0 , so that for the both inequalities (11) and (12) we have C AB ( g 1 , ε , γ ) sup F lim sup n Δ n ( F ) = 0 , whence, with the account of non-negativity of C AB ( g 1 , ε , γ ) , the statement of point (iii) follows.
Now let us estimate from below the constants C AB ( g 0 , ε , γ ) . Take i.i.d. r.v.’s X 1 , , X n with distribution (27), where p > 1 / 2 . Then, by virtue of Theorem 1, for n ( ε 2 1 ) > p q we have
L E , n ( g 0 , ε , γ ) = max { q , γ q 2 + p 2 , γ ( p q ) } n p q .
The r.v. X 1 is lattice with a span h = 1 / p q . The Esseen asymptotic expansion [18] for lattice distributions with the span h implies that
lim sup n Δ n n = | E X 1 3 | + 3 h σ 1 2 6 2 π σ 1 3 .
For the chosen distribution of X 1 we have σ 1 2 = 1 , E X 1 3 = ( p q ) / p q , therefore
lim n + Δ n n = p q + 3 6 2 π p q = p + 1 3 2 π p q ,
and, hence, in inequality (11) we have
C AB ( g 0 , ε , γ ) lim n Δ n L E , n ( g 0 , ε , γ ) = lim n Δ n n p q max { q , γ q 2 + p 2 , γ ( p q ) } =
= p + 1 3 2 π · max { q , γ q 2 + p 2 , γ ( p q ) }
for all p ( 1 / 2 , 1 ) , ε , γ > 0 , whence, with the account of arbitrariness of the choice of p, the statement of point (ii) follows. In particular, for γ = 1 we obtain
C AB ( g 0 , ε , 1 ) sup 1 2 < p < 1 p + 1 3 2 π ( p 2 + q 2 ) = 1 6 2 π sup 1 2 < p < 1 | E X 1 3 | + 3 h σ 1 2 E | X 1 | 3 = 10 + 3 6 2 π = 0.4097
for p = 5 / 2 1 = 0.5811 (extremality of the specified p was proved in [18]).
Now let us consider inequality (12). Taking into account that for n ( ε 2 1 ) > p q we have
L R , n ( g 0 , ε , γ ) = γ ( p q ) ( ε 1 1 ) + max { q , p 2 } n p q , max { q , p 2 } = q , p ( 1 2 , 5 1 2 ] , p 2 p ( 5 1 2 , 1 ) ,
and denoting
a = γ ( ε 1 1 ) = γ ε 1 ,
we obtain
f ( p ) : = 3 2 π lim n Δ n L R , n ( g 0 , ε , γ ) = p + 1 a ( 2 p 1 ) + 1 p , p 1 2 , 5 1 2 , p + 1 a ( 2 p 1 ) + p 2 , p 5 1 2 , 1 .
Let us investigate the behaviour of f ( p ) in dependence of a > 0 . For p 1 2 , 5 1 2 the numerator of f ( p ) takes the form
a ( 2 p 1 ) + 1 p ( p + 1 ) ( 2 a 1 ) = 2 3 a ,
so that f ( p ) is monotonically decreasing, if a > 2 3 , and monotonically increasing, if a < 2 3 , while for p 5 1 2 , 1 the numerator of f ( p ) has the form
a ( 2 p 1 ) + p 2 2 ( p + 1 ) ( a + p ) = p 2 2 p 3 a < 0 , 1 / 2 < p < 1 ,
and hence, f ( p ) decreases strictly monotonically. Therefore,
3 2 π · C AB ( g 0 , ε , γ ) sup 1 / 2 < p < 1 f ( p ) = f 5 1 2 = 1 + 5 2 a ( 5 2 ) + 3 5 , a < 2 3 , f 1 2 + = 3 , a 2 3 ,
whence the statement of point (ii) follows immediately. □

6. Lower Bounds for the Asymptotically Exact Constants

First of all, please note that asymptotically exact constants C AE ( g 1 , ε , γ ) and the lower asymptotically exact constants C AE ̲ ( g 1 , ε , γ ) are defined for none of the inequalities (11), (12), since the corresponding fractions L E , n ( g 1 , ε , γ ) , L R , n ( g 1 , ε , γ ) are bounded from below by one uniformly with respect to ε and γ (see (13) and (14)) and, hence, cannot be infinitesimal.
Theorem 6.
In the both inequalities (11), (12) for all ε , γ > 0 we have
C AE ̲ ( g 0 , ε , γ ) 1 2 2 π ,
sup g G C ¯ AE ( g , ε , γ ) = C ¯ AE ( g 0 , ε , γ ) C AE * ( g 0 , ε , γ ) 1 2 ( ε 1 ) ,
inf g G C ¯ AE ( g , ε , γ ) = C ¯ AE ( g 1 , ε , γ ) C AE * ( g 1 , ε , γ ) 0.5 , ε 1 , exp { ε 2 } I 0 ( ε 2 ) / 2 , 1 < ε 1.1251 , 0.2344 , ε 1.1251 .
where I 0 ( z ) = k = 0 ( z / 2 ) 2 k / ( k ! ) 2 is the modified Bessel function of the zero order.
As a lower bound to the asymptotically exact constant C AE ( g 0 , ε , γ ) , due to (26), both the asymptotically best C AB ( g 0 , ε , γ ) and the lower asymptotically exact C AE ̲ ( g 0 , ε , γ ) constants may serve. However, the lower bound of the lower asymptotically exact constant ( 2 2 π ) 1 = 0.1994 stated in (38) turns to be less accurate in Rozovskii-type inequality, than the lower bound of the asymptotically best constant in (37), since the minorant in (37) is monotone with respect to γ for ε 1 and with respect to γ / ε for ε > 1 varying within the range from ( 2 π ) 1 as γ / ( ε 1 ) 2 3 to
1 + 5 3 2 π 3 5 = 0.5633 as γ ε 1 0
and thus staying always greater than ( 2 2 π ) 1 . The minorant to the asymptotically best constant in (36) monotonically decreases with respect to γ and does not depend on ε . Hence, there exists a unique value γ 0 > 0 such that C AB ̲ ( γ 0 ) = ( 2 2 π ) 1 (and even γ 0 > 1 due to that for γ = 1 we have C AB ̲ ( 1 ) = ( 10 + 3 ) / ( 6 2 π ) = 0.4097 > ( 2 2 π ) 1 ), so that for all γ < γ 0 we have C AB ̲ ( γ ) > ( 2 2 π ) 1 . It is easy to make sure that γ 0 = 4.7010 Therefore, as a lower bound for the constant C AE ( g 0 , ε , γ ) in Esseen-type inequality (11) it is reasonable to choose the lower bound in (38) for γ γ 0 and the lower bound in (36) for γ > γ 0 . Let us formulate this as a corollary.
Corollary 1.
For the asymptotically exact constant in inequality (11) the lower bound
inf ε > 0 C AE ( g 0 , ε , γ ) C AB ̲ ( γ γ 0 ) ,
holds, where C AB ̲ ( γ ) is defined in (36), and γ 0 = 4.7010 is the unique root of the equation C AB ̲ ( γ ) = ( 2 2 π ) 1 for γ > 0 . In particular, with the account of Table 3 the following two-sided bounds hold:
0.4097 = 10 + 3 6 2 π C AE ( g 0 , 1 , 1 ) 1.80 .
For the asymptotically exact constant in (12) we have
C AE ( g 0 , ε , γ ) 1 + 5 3 2 π 2 γ ( ε 1 1 ) ( 5 2 ) + 3 5 , γ ε 1 < 2 3 , 1 2 π , γ ε 1 2 3 .
In particular, with the account of Table 3 the following two-sided bounds hold:
0.3989 = 1 2 π C AE ( g 0 , 1 , 1 ) 1.80 .
Proof of Theorem 6.
The relations between the constants follow from their definitions (see also (26)). Therefore, it remains to prove the lower bounds for C AE ̲ ( g 0 , ε , γ ) , C AE * ( g 0 , ε , γ ) , and C AE * ( g 1 , ε , γ ) .
Following [29] ([§ 2.3.2]), consider i.i.d. r.v.’s X 1 , , X n with a symmetric tree-point distribution
P ( | X 1 | = 1 ) = p = 1 P ( X 1 = 0 ) ( 0 , 1 ) ,
whose d.f. will be denoted by F p ( x ) = P ( X 1 < x ) , x R . Then
E X 1 = 0 , E X 1 2 = p , σ 1 2 ( z ) = E X 1 2 1 ( | X 1 | z ) = p , z 1 , 0 , z > 1 , μ 1 ( · ) 0 ,
B n 2 = n p , g 0 ( z ) = min { z , n p } , g 1 ( z ) = max { z , n p } ,
and the fractions L E , n , L R , n coincide, do not depend on γ and take the form
L n ( g , ε ) L E , n ( g , ε , · ) = L R , n ( g , ε , · ) = sup 0 < z < ε B n g ( z ) B n 2 g ( B n ) k = 1 n σ k 2 ( z ) = sup 0 < z < ε n p g ( z ) σ 1 2 ( z ) p g ( n p ) .
Due to the monotonicity of g G , we have
sup 0 < z < ε n p g ( z ) σ 1 2 ( z ) = p g ( ε n p 1 ) = p min { g ( 1 ) , g ( ε n p ) } ,
and hence,
L n ( g , ε ) = min g ( 1 ) , g ( ε n p ) g ( n p ) , ε > 0 , n N , p ( 0 , 1 ) ,
in particular,
L n ( g 0 , ε ) = min 1 n p , ε , 1 , L n ( g 1 , ε ) = min 1 n p 1 , ε 1 , ε > 0 ,
and L n ( g 1 , ε ) = 1 for ε 1 . Moreover, for all n > 2 ε 2 1 we have
p ( 0 , 1 ) : L n ( g 0 , ε ) = = p ( 0 , 1 ) : min 1 n p , ε , 1 = =
= 2 / n = : p ( ) , < ε 1 , 0 , ( ε 2 1 ) / n , = ε 1 , , > ε 1 , for all ε > 0 ,
p ( 0 , 1 ) : L n ( g 1 , ε ) = = p : = 1 = ( 0 , 1 ) , = 1 , , otherwise , ε 1 , p : min ε , 1 n p 1 = = p ( ) , [ 1 , ε ] , , otherwise , ε > 1 .
As a result, the fractions do not depend on γ , we obtain the lower bounds
inf γ > 0 C AE ̲ ( g 0 , ε , γ ) lim sup 0 lim sup n sup p ( 0 , 1 ) : L n ( g 0 , ε ) = Δ n ( F p ) / = lim sup 0 lim sup n Δ n ( F p ( ) ) / ,
inf γ > 0 C AE * ( g , ε , γ ) sup > 0 lim sup n sup p ( 0 , 1 ) : L n ( g , ε ) = Δ n ( F p ) / , ε > 0 ,
in particular, for all γ > 0 we have
C AE * ( g 0 , ε , γ ) max sup 0 < < ε 1 lim sup n Δ n ( F p ( ) ) / , lim sup n sup 0 < p ( ε 2 1 ) / n Δ n ( F p ) / ( ε 1 ) ,
C AE * ( g 1 , ε , γ ) lim sup n sup 0 < p < 1 Δ n ( F p ) , ε 1 , sup 1 < < ε lim sup n Δ n ( F p ( ) ) / , ε > 1 .
Let us find the lower bound for the uniform distance Δ n ( F p ) . Due to the symmetry, we have 2 P ( S n < 0 ) + P ( S n = 0 ) = 1 , i.e., P ( S n < 0 ) = ( 1 P ( S n = 0 ) ) / 2 , whence for even n we obtain
Δ n ( F p ) Φ ( 0 ) P ( S n < 0 ) = P ( S n = 0 ) 2 = ( 1 p ) n 2 k = 0 n / 2 n ! ( n 2 k ) ! ( k ! ) 2 p / 2 1 p 2 k .
Please note that lim sup p 0 Δ n ( F p ) 1 2 , while with p = α / n , α ( 0 , n ) we have
Δ n ( F α / n ) 1 2 1 α n n k = 0 n / 2 n ! ( n 2 k ) ! ( k ! ) 2 1 / 2 n / α 1 2 k = e α + δ n ( α ) 2 k = 0 n / 2 u k , n ( α ) ,
where
u k , n ( α ) = n ! ( n 2 k ) ! ( k ! ) 2 1 / 2 n / α 1 2 k , lim n δ n ( α ) = 0 , α > 0 .
In [29] ([pp. 268–269]) it was shown that for every α > 0
lim sup n k = 0 n / 2 u k , n ( α ) k = 0 ( α / 2 ) 2 k ( k ! ) 2 = I 0 ( α ) .
Therefore,
lim sup n Δ n ( F α / n ) 1 2 e α I 0 ( α ) , > 0 .
Let us bound from below expressions such as sup p Δ n ( F p ) as
sup p ( 0 , · ) Δ n ( F p ) lim sup p 0 Δ n ( F p ) 1 2 .
From (39) with α = 2 we obtain
C AE ̲ ( g 0 , ε , γ ) lim sup 0 lim sup n Δ n ( F p ( ) ) / 1 2 lim α α e α I 0 ( α ) = 1 2 2 π , ε , γ > 0 .
Inequalities (39) and (40) imply that
C AE * ( g 0 , ε , γ ) max sup 0 < < ε 1 lim sup n Δ n ( F p ( ) ) / , lim sup n sup 0 < p ( ε 2 1 ) / n Δ n ( F p ) / ( ε 1 )
max sup α > ε 2 1 1 2 α e α I 0 ( α ) , 1 2 ( ε 1 1 ) ,
C AE * ( g 1 , ε , γ ) lim sup n sup 0 < p < 1 Δ n ( F p ) 1 2 , ε 1 , sup 1 < < ε lim sup n Δ n ( F p ( ) ) / sup ε 2 < α < 1 1 2 α e α I 0 ( α ) , ε > 1 .
The plot of the function f ( α ) = α e α I 0 ( α ) looks monotonically increasing for α 0.78 and monotonically decreasing for α 0.79 = : α * with f ( α * ) > 0.4688 , therefore it is reasonable to estimate upper bounds sup α f ( α ) from below as
sup α > ε 2 1 f ( α ) f ( 1 ) = e 1 I 0 ( 1 ) = 0.4657 ,
sup ε 2 < α < 1 f ( α ) f ( α * ) > 0.4688 , ε 2 < α * , ε > 1 / α * = 1.1250 , f ( ε 2 ) = exp { ε 2 } I 0 ( ε 2 ) , ε 2 α * , ε 1 / α * .
Hence, we finally obtain
C AE * ( g 0 , ε , γ ) 1 2 max { 0.4657 , ε 1 , 1 } = 1 2 ( ε 1 1 ) ,
C AE * ( g 1 , ε , γ ) 1 2 exp { ε 2 } I 0 ( ε 2 ) , 1 < ε 1.1251 , 1 2 · 0.4688 = 0.2344 , ε 1.1251 .
 □

7. Conclusions

In the present work, we introduced a detailed classification of the exact and asymptotically exact constants in natural convergence rate estimates in the Lindeberg’s theorem such as Esseen’s and Rozovskii’s inequalities. We found the lower bounds for the exact (universal) constants and the most optimistic absolute constants. Also we constructed the lower bounds for the asymptotically best, the lower asymptotically exact and the conditional upper asymptotically exact constants. With the account of the previously known upper estimates for the asymptotically exact constants, this allowed to obtain two-sided bounds for all of the introduced asymptotic constants. The values of the constructed bounds were computed for some ε , γ > 0 and the results of the calculations were presented in Table 1, Table 2, Table 3, Table 4 and Table 5. As we can see, the obtained lower bounds are note far from the upper ones, so that, from the point of practical use, there is no high motivation to improve the method of construction of the upper bounds.
As regards the historical values ε = γ = 1 in both inequalities (11) and (12), ε = , γ = 1 in (11), we obtained the following results for the absolute constants:
min { C E ( 1 , 1 ) , C R ( 1 , 1 ) , C E ( , 1 ) } Φ ( ( 1 p ) / p ) 1 + p ( 1 p ) 3 / p + p | p = 0.9058 > 0.5685 .
Recall that
C E ( , 1 ) C E ( 1 , 1 ) = A E ( 1 , 1 ) 2.73 , C R ( 1 , 1 ) = A R ( 1 , 1 ) 2.73
(see Table 1 and Table 2), and, as it follows from the presented results, these upper bounds cannot be lowered more than by 5 times. As regards the most optimistic constants, i.e., the values of the constants under the “best” choice of the function g G , we have shown that they cannot nevertheless be less than
C R ( g 1 , 1 , 1 ) Φ ( ( 1 p ) / p ) 1 + p 1 + ( 1 p ) 3 / p | p = 0.9678 > 0.5370 .
C E ( g 1 , 1 , 1 ) C Φ = 0.5409 ,
C E ( g 1 , , 1 ) Φ ( ( 1 p ) / p ) 1 + p p ( 1 p ) ( 1 p ) 2 + p 2 | p = 0.6090 > 0.3703 .
Since A E ( , 1 ) C E ( g 1 , , 1 ) , the latest inequality immediately yields the lower bound A E ( , 1 ) > 0.3703 that was also obtained directly in Theorem 3. Recall that A E ( , 1 ) 2.66 (see Table 1).
Asymptotic lower bounds for C E and C R for infinitely large sample sizes n may be constructed in terms of the upper asymptotically exact C ¯ AE and the conditional upper asymptotically exact C AE * constants which are linked as C AE * C ¯ AE . We constructed the lower bounds for C AE * ( g , ε , γ ) with g = g 0 , g 1 which turned out to coincide for ε = γ = 1 :
C AE * ( g 0 , 1 , 1 ) C AE * ( g 1 , 1 , 1 ) 0.5
in both inequalities (11) and (12) (the same lower bound 0.5 was obtained directly for C AE * ( g 0 , 1 , 1 ) in Theorem 6).
The next series of the lower bounds for C E , C R was obtained under the additional assumptions on the smallness of the fractions L E , n , L R , n , which allow constructing more optimistic upper bounds, for example, in terms of the asymptotically exact constants, i.e., to consider estimates such as (25) with C * = C AE . Recall that in this situation the following upper bounds are known from [11]: A E AE ( 1 , 1 ) 1.80 , A E AE ( 1 , 1 ) 1.80 . Observation that the constants A E AE ( 1 , 1 ) , A R AE ( 1 , 1 ) coincide with C AE ( g 0 , 1 , 1 ) in (22) with L n = L E , n , L R , n , respectively, allows taking as a lower bound to A E AE ( 1 , 1 ) , A E AE ( 1 , 1 ) (or, more generally, to C AE ( g 0 , 1 , 1 ) ) any of C AB ( g 0 , 1 , 1 ) and C AE ̲ ( g 0 , 1 , 1 ) : C AE ( g 0 , 1 , 1 ) max { C AB ( g 0 , 1 , 1 ) , C AE ̲ ( g 0 , 1 , 1 ) } . However, the lower bound C AE ̲ ( g 0 , 1 , 1 ) ( 2 2 π ) 1 = 0.1994 in the both inequalities (11) and (12) is less than each of the lower bounds C AB ( g 0 , 1 , 1 ) 10 + 3 6 2 π = 0.4097 in (11) and C AB ( g 0 , 1 , 1 ) 1 / 2 π = 0.3989 in (12), so that the best choice of the lower bound for C AE ( g 0 , 1 , 1 ) is C AB ( g 0 , 1 , 1 ) in both inequalities (11) and (12). Hence, the following two-sided bounds hold true:
0.4097 < A E AE ( 1 , 1 ) 1.80 , 0.3989 < A E AE ( 1 , 1 ) 1.80 .
Therefore, the asymptotic values A E AE ( 1 , 1 ) , A R AE ( 1 , 1 ) of the constants C E ( 1 , 1 ) and C R ( 1 , 1 ) in (11), (12), valid for small L E , n , L R , n , can neither be improved more than by 4.5 times.
Further research might include construction of the estimates of the rate of convergence in non-classical Lindeberg’s theorem whose conditions were obtained in a recent paper [30] or some extensions to the case of dependent random summands (see [31]).

Author Contributions

Conceptualization, I.S.; methodology, I.S.; formal analysis, I.S., R.G., V.M.; investigation, I.S., R.G., V.M.; writing—original draft preparation, V.M.; writing—review and editing, I.S.; supervision, I.S.; funding acquisition, I.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the Russian Foundation for Basic Research (projects Nos. 19-07-01220-a, 20-31-70054) and by the Ministry for Education and Science of Russia (grant No. MD–5748.2021.1.1).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank an anonymous referee for pointing out the reference to [31].

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
r.v.random variable
i.i.d.independent identically distributed
d.f.distribution function
w.r.t.with respect to

References

  1. Berry, A.C. The accuracy of the Gaussian approximation to the sum of independent variates. Trans. Amer. Math. Soc. 1941, 49, 122–136. [Google Scholar] [CrossRef]
  2. Esseen, C.G. On the Liapounoff limit of error in the theory of probability. Ark. Mat. Astron. Fys. 1942, A28, 1–19. [Google Scholar]
  3. Osipov, L.V. Refinement of Lindeberg’s theorem. Theory Probab. Appl. 1966, 11, 299–302. [Google Scholar] [CrossRef]
  4. Petrov, V.V. An estimate of the deviation of the distribution function of a sum of independent random variables from the normal law. Sov. Math. Dokl. 1965, 6, 242–244. [Google Scholar]
  5. Esseen, C.G. On the remainder term in the central limit theorem. Arkiv för Matematik 1969, 8, 7–15. [Google Scholar] [CrossRef]
  6. Rozovskii, L.V. On the rate of convergence in the Lindeberg–Feller theorem. Bull. Leningr. Univ. 1974, 1, 70–75. (In Russian) [Google Scholar]
  7. Wang, N.; Ahmad, I.A. A Berry–Esseen inequality without higher order moments. Sankhya A Indian J. Stat. 2016, 78, 180–187. [Google Scholar] [CrossRef]
  8. Gabdullin, R.; Makarenko, V.; Shevtsova, I. Esseen–Rozovskii type estimates for the rate of convergence in the Lindeberg theorem. J. Math. Sci. 2018, 234, 847–885. [Google Scholar] [CrossRef] [Green Version]
  9. Gabdullin, R.; Makarenko, V.; Shevtsova, I. A generalization of the Wang–Ahmad inequality. J. Math. Sci. 2019, 237, 646–651. [Google Scholar] [CrossRef]
  10. Gabdullin, R.; Makarenko, V.; Shevtsova, I. A generalization of the Rozovskii inequality. J. Math. Sci. 2019, 237, 775–781. [Google Scholar] [CrossRef]
  11. Gabdullin, R.; Makarenko, V.; Shevtsova, I. On natural convergence rate estimates in the Lindeberg theorem. Indian J. Statis. Sankhya A 2020. [Google Scholar] [CrossRef]
  12. Korolev, V.; Dorofeyeva, A. Bounds of the accuracy of the normal approximation to the distributions of random sums under relaxed moment conditions. Lith. Math. J. 2017, 57, 38–58. [Google Scholar] [CrossRef] [Green Version]
  13. Zolotarev, V.M. Modern Theory of Summation of Random Variables; VSP: Utrecht, The Netherlands, 1997. [Google Scholar]
  14. Ibragimov, I.A. On the accuracy of the approximation of distribution functions of sums of independent variables by the normal distribution. Theory Probab. Appl. 1966, 11, 559–579. [Google Scholar] [CrossRef]
  15. Katz, M.L. Note on the Berry–Esseen theorem. Ann. Math. Stat. 1963, 34, 1107–1108. [Google Scholar] [CrossRef]
  16. Korolev, V.Y.; Popov, S.V. Improvement of convergence rate estimates in the central limit theorem under weakened moment conditions. Dokl. Math. 2012, 86, 506–511. [Google Scholar] [CrossRef]
  17. Kolmogorov, A.N. Some recent works in the field of limit theorems of probability theory. Bull. Mosc. Univ. 1953, 10, 29–38. (In Russian) [Google Scholar]
  18. Esseen, C.G. A moment inequality with an application to the central limit theorem. Skand. Aktuarietidskr. 1956, 39, 160–170. [Google Scholar] [CrossRef]
  19. Chistyakov, G.P. Asymptotically proper constants in the Lyapunov theorem. J. Math. Sci. 1999, 93, 480–483. [Google Scholar] [CrossRef]
  20. Chistyakov, G.P. A new asymptotic expansion and asymptotically best constants in Lyapunov’s theorem. I. Theory Probab. Appl. 2002, 46, 226–242, Original Russian text: Teor. Veroyatn. Primen. 2001, 46, 326–344. [Google Scholar] [CrossRef]
  21. Chistyakov, G.P. A new asymptotic expansion and asymptotically best constants in Lyapunov’s theorem. II. Theory Probab. Appl. 2002, 46, 516–522, Original Russian text: Teor. Veroyatn. Primen. 2001, 46, 573–579. [Google Scholar] [CrossRef]
  22. Chistyakov, G.P. A new asymptotic expansion and asymptotically best constants in Lyapunov’s theorem. III. Theory Probab. Appl. 2003, 47, 395–414, Original Russian text: Teor. Veroyatn. Primen. 2002, 46, 475–497. [Google Scholar] [CrossRef]
  23. Shevtsova, I.G. The lower asymptotically exact constant in the central limit theorem. Dokl. Math. 2010, 81, 83–86. [Google Scholar] [CrossRef]
  24. Shevtsova, I.G. On the asymptotically exact constants in the Berry–Esseen–Katz inequality. Theory Probab. Appl. 2011, 55, 225–252, Original Russian text: Teor. Veroyatn. Primen. 2010, 55, 271–304. [Google Scholar] [CrossRef]
  25. Shevtsova, I.G. On the absolute constants in the Berry–Esseen-type inequalities. Dokl. Math. 2014, 89, 378–381. [Google Scholar] [CrossRef]
  26. Ibragimov, I.A.; Linnik, Y.V. Independent and Stationary Sequences of Random Variables; Wolters–Noordhoff Publishing: Groningen, The Netherlands, 1971. [Google Scholar]
  27. Chebotarev, V.I.; Kondrik, A.S.; Mikhailov, K.V. On an Extreme Two-Point Distribution. arXiv 2007, arXiv:0710.3456. [Google Scholar]
  28. Agnew, R.P. Estimates for global central limit theorems. Ann. Math. Stat. 1957, 28, 26–42. [Google Scholar] [CrossRef]
  29. Shevtsova, I.G. Accuracy of the Normal Approximation: Methods of Estimation and New Results; Argamak–Media: Moscow, Russia, 2016. (In Russian) [Google Scholar]
  30. Ibragimov, I.A.; Presman, E.L.; Formanov, S.K. On modifications of the Lindeberg and Rotar’ conditions in the central limit theorem. Theory Probab. Appl. 2020, 65, 648–651. [Google Scholar] [CrossRef]
  31. Gómez-García, J.G.; Chesneau, C. A dependent Lindeberg central limit theorem for cluster functionals on stationary random fields. Mathematics 2021, 9, 212. [Google Scholar] [CrossRef]
Table 1. Two-sided bounds for the constants A E ( ε , γ ) from inequality (1), γ * = 0.5599 Upper bounds were obtained in [8], and the lower ones in Theorem 3 below.
Table 1. Two-sided bounds for the constants A E ( ε , γ ) from inequality (1), γ * = 0.5599 Upper bounds were obtained in [8], and the lower ones in Theorem 3 below.
ε γ A E ( ε , γ ) A E ( ε , γ ) ε γ A E ( ε , γ ) A E ( ε , γ )
1.21 0.2 2.8904 0.5006 1 2.6588 0.3703
1.24 0.2 2.8900 0.4889 0.97 2.6599 0.3736
0.2 2.8846 0.4876 2.56 2.6500 0
1.76 0.4 2.7360 0.4606 2.62 5 2.6500 0.2126
5.94 0.4 2.7300 0.4606 2.65 4 2.6500 0.2117
0.4 2.7299 0.4606 2.74 3 2.6500 0.2458
1 γ * 2.7367 0.5795 3.13 2 2.6500 0.3018
1.87 γ * 2.6999 0.4359 4 1.62 2.6500 0.3222
γ * 2.6919 0.4359 5.37 1.5 2.6500 0.3294
1 0.72 2.7298 0.5746 1.43 2.6500 0.3339
1 2.7286 0 2.6409 0
4.35 1 2.6600 0.3703 0 +
Table 2. Two-sided bounds for the constants A R ( ε , γ ) from inequality (2), γ * = 0.5599 Upper bounds were obtained in [8], and the lower ones in Theorem 3 below.
Table 2. Two-sided bounds for the constants A R ( ε , γ ) from inequality (2), γ * = 0.5599 Upper bounds were obtained in [8], and the lower ones in Theorem 3 below.
ε γ A R ( ε , γ ) A R ( ε , γ ) ε γ A R ( ε , γ ) A R ( ε , γ )
1.21 0.2 2.8700 0.5048 1.99 γ * 2.6600 0.4357
5.39 0.2 2.8635 0.5000 2.12 γ * 2.6593 0.4397
1.76 0.4 2.6999 0.4485 3 γ * 2.6769 0.4586
2.63 0.4 2.6933 0.4675 5 γ * 2.7562 0.4784
0.5 γ * 3.0396 1.1329 0 +
1 γ * 2.7286 0.5795
Table 3. Values of the two-sided bounds of the asymptotically exact constants A E AE ( ε , γ ) and A R AE ( ε , γ ) in (5) and (6) for some ε > 0 and γ > 0 . Recall that γ * = 0.5599 . Upper bounds were obtained in [8], and the lower ones in Corollary 1 below.
Table 3. Values of the two-sided bounds of the asymptotically exact constants A E AE ( ε , γ ) and A R AE ( ε , γ ) in (5) and (6) for some ε > 0 and γ > 0 . Recall that γ * = 0.5599 . Upper bounds were obtained in [8], and the lower ones in Corollary 1 below.
ε γ 1 2 A E AE ( ε , γ ) A E AE ( ε , γ ) ε γ A R AE ( ε , γ ) A R AE ( ε , γ )
0.6 0.3 1.9225 0.5251 1.21 0.2 1.9348 0.5013
1.21 0.2 1.9546 0.5384 1.89 0.2 1.9300 0.5013
2.06 0.2 1.9500 0.5384 2.77 0.2 1.9289 0.5013
0.2 1.9488 0.5384 5.39 0.2 1.9584 0.5013
1.48 0.4 1.8100 0.5111 1.41 0.4 1.7798 0.4516
0.4 1.8001 0.5111 1.76 0.4 1.7725 0.4516
1.89 γ * 1.7714 0.4868 1.99 0.4 1.7713 0.4516
2.03 γ * 1.7700 0.4868 2.63 0.4 1.7785 0.4516
γ * 1.7638 0.4868 0.5 γ * 1.9475 0.3329
1 γ * 1.8060 0.4868 1 γ * 1.7916 0.4184
1 0.67 1.7997 0.4685 1.52 γ * 1.7500 0.4184
1 1.7915 0.1994 1.89 γ * 1.7439 0.4184
2.24 1 1.7400 0.4097 1.99 γ * 1.7442 0.4184
1 1.7319 0.4097 2.12 γ * 1.7455 0.4184
3.07 1.7200 0.1994 3 γ * 1.7710 0.4184
3.2 5 1.7200 0.1994 5 γ * 1.8650 0.4184
3.28 4 1.7200 0.2240
4 2.4 1.7200 0.3059
5 2.06 1.7200 0.3284
5.37 2 1.7200 0.3324
1.83 1.7200 0.3435
1.7146 0.1994
Table 4. Values of the lower bounds for the constants C E ( ε , γ ) and C R ( ε , γ ) obtained in Theorem 3 for some ε > 0 and γ > 0 .
Table 4. Values of the lower bounds for the constants C E ( ε , γ ) and C R ( ε , γ ) obtained in Theorem 3 for some ε > 0 and γ > 0 .
ε γ C E ( ε , γ ) p ε γ C R ( ε , γ ) p
0.2 0.2 2.78472 0.96368 0.2 0.2 2.78355 0.96415
0.5 0.2 1.17226 0.84124 0.5 0.2 1.17196 0.84770
⩾1 0.2 0.60108 0.74349 1 0.2 0.60108 0.74349
0.2 0.4 2.76543 0.96318 1.21 0.2 0.60572 0.70768
0.5 0.4 1.14539 0.89145 2 0.2 0.60674 0.80000
⩾1 0.4 0.58619 0.83356 3 0.2 0.59194 0.68233
0.2 γ * 2.74959 0.96276 4 0.2 0.60265 0.68233
0.5 γ * 1.13293 0.91254 5.39 0.2 0.61121 0.68233
⩾1 γ * 0.57952 0.86446 8 0.2 0.61947 0.68232
0.2 0.72 2.73337 0.96233 0.2 0.4 2.76388 0.96415
0.5 0.72 1.12389 0.92595 0.5 0.4 1.14539 0.89145
⩾1 0.72 0.57469 0.88402 1 0.4 0.58619 0.83356
0.2 0.97 2.71102 0.96906 1.76 0.4 0.59815 0.76397
0.5 0.97 1.11352 0.93958 2 0.4 0.59934 0.80000
⩾1 0.97 0.56910 0.90399 2.63 0.4 0.59228 0.87369
⩾11 0.56854 0.90586 4 0.4 0.57272 0.94118
⩾1 1.43 0.56207 0.92560 0.2 γ * 2.74835 0.96415
⩾1 1.5 0.56122 0.92795 0.5 γ * 1.13293 0.91254
⩾1 1.62 0.55987 0.93161 1 γ * 0.57952 0.86446
⩾12 0.55624 0.94085 1.5 γ * 0.58759 0.82642
⩾13 0.54955 0.95569 1.99 γ * 0.59346 0.79839
⩾14 0.54507 0.96419 2.12 γ * 0.59407 0.81800
⩾15 0.54176 0.96978 3 γ * 0.58546 0.90000
⩾10 5 γ * 0.56465 0.68232
Table 5. Values of the lower bounds for the most optimistic constants C E ( g 1 , ε , γ ) and C R ( g 1 , ε , γ ) obtained in Theorem 3 for some ε > 0 and γ > 0 .
Table 5. Values of the lower bounds for the most optimistic constants C E ( g 1 , ε , γ ) and C R ( g 1 , ε , γ ) obtained in Theorem 3 for some ε > 0 and γ > 0 .
ε γ C E ( g 1 , ε , γ ) p ε γ C R ( g 1 , ε , γ ) p
0.2 0.2 0.54093 0.95655 0.2 0.2 2.78355 0.96415
0.5 0.2 0.54093 0.95655 0.5 0.2 1.17196 0.84770
⩾1 0.2 0.54093 0.95655 1 0.2 0.60108 0.74349
0.2 0.4 0.54093 0.95655 1.21 0.2 0.60572 0.70768
0.5 0.4 0.54093 0.95655 2 0.2 0.60674 0.80000
⩾1 0.4 0.54093 0.95655 3 0.2 0.59194 0.68233
0.2 γ * 0.54093 0.95655 4 0.2 0.60265 0.68233
0.5 γ * 0.54093 0.95655 5.39 0.2 0.61121 0.68233
⩾1 γ * 0.54093 0.95655 8 0.2 0.61947 0.68232
0.2 0.72 0.54093 0.95655 0.2 0.4 2.76388 0.96415
0.5 0.72 0.54093 0.95655 0.5 0.4 1.14539 0.89145
⩾1 0.72 0.54093 0.95655 1 0.4 0.58619 0.83356
0.2 0.97 0.54093 0.95655 1.76 0.4 0.59815 0.76397
0.5 0.97 0.54093 0.95655 2 0.4 0.59934 0.80000
⩾1 0.97 0.54093 0.95655 2.63 0.4 0.59228 0.87369
⩾11 0.54093 0.95655 4 0.4 0.57272 0.94118
⩾1 1.43 0.53297 0.97214 0.2 γ * 2.74835 0.96415
⩾1 1.5 0.53197 0.97383 0.5 γ * 1.13293 0.91254
⩾1 1.62 0.53041 0.97637 1 γ * 0.57952 0.86446
⩾12 0.52637 0.98230 1.5 γ * 0.58759 0.82642
⩾13 0.51963 0.99024 1.99 γ * 0.59346 0.79839
⩾14 0.51568 0.99379 2.12 γ * 0.59407 0.81800
⩾15 0.51307 0.99569 3 γ * 0.58546 0.90000
⩾10 5 γ * 0.56465 0.68232
Table 6. Values ofthe lower bound C AB ̲ ( γ ) (see (36)), rounded down, for the asymptotically best constant C AB ( g 0 , ε , γ ) from inequality (11) for some γ . The second line contains rounded extreme values of p in (36).
Table 6. Values ofthe lower bound C AB ̲ ( γ ) (see (36)), rounded down, for the asymptotically best constant C AB ( g 0 , ε , γ ) from inequality (11) for some γ . The second line contains rounded extreme values of p in (36).
γ 0.1 0.2 0.4 0.56 1 1.5 2345
p 0.6112 0.6039 0.5871 0.5710 0.5812 0.6733 0.6666 0.6340 0.6202 0.6126
C AB ̲ ( γ ) 0.5511 0.5384 0.5111 0.4868 0.4097 0.3627 0.3324 0.2703 0.2240 0.1904
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Gabdullin, R.; Makarenko, V.; Shevtsova, I. Asymptotically Exact Constants in Natural Convergence Rate Estimates in the Lindeberg Theorem. Mathematics 2021, 9, 501. https://doi.org/10.3390/math9050501

AMA Style

Gabdullin R, Makarenko V, Shevtsova I. Asymptotically Exact Constants in Natural Convergence Rate Estimates in the Lindeberg Theorem. Mathematics. 2021; 9(5):501. https://doi.org/10.3390/math9050501

Chicago/Turabian Style

Gabdullin, Ruslan, Vladimir Makarenko, and Irina Shevtsova. 2021. "Asymptotically Exact Constants in Natural Convergence Rate Estimates in the Lindeberg Theorem" Mathematics 9, no. 5: 501. https://doi.org/10.3390/math9050501

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop