Next Article in Journal
A Novel Consistency Index CI-G: Recruiting Compatibility Index G for Consistency Analysis
Previous Article in Journal
Revisiting Black–Scholes: A Smooth Wiener Approach to Derivation and a Self-Contained Solution
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Sufficient Conditions for Moment Determinacy via Probability Density Tails

by
Gwo Dong Lin
1,* and
Jordan M. Stoyanov
2,*
1
Institute of Statistical Science, Academia Sinica, Taipei 11529, Taiwan
2
Institute of Mathematics & Informatics, Bulgarian Academy of Sciences, 1113 Sofia, Bulgaria
*
Authors to whom correspondence should be addressed.
Mathematics 2025, 13(16), 2671; https://doi.org/10.3390/math13162671
Submission received: 8 July 2025 / Revised: 31 July 2025 / Accepted: 13 August 2025 / Published: 19 August 2025

Abstract

One of the ways to characterize a probability distribution is to show that it is moment-determinate, uniquely determined by knowing all its moments. The uniqueness, in the absolutely continuous case, depends entirely on the behaviour of the tails of the probability density function f. We find and exploit a condition, (D), in terms only of f which is of a ‘general’ form and easy to check. Condition (D), showing the ‘speed’ for f to tend to zero, is sufficient to conclude the moment determinacy. We establish a series of theorems and corollaries in both Stieltjes and Hamburger cases and provide an interesting illustrative example. The results in this paper are either new or extend some recently published results.

1. Introduction

In this paper, we address one of the aspects, namely, the uniqueness, in the classical moment problem ([1,2,3]). Thus, the interest is in conditions under which a measure, in particular, a probability distribution, is characterized uniquely by the sequence of all its moments.
We assume that ( Ω , F , P ) is an underlying probability space on which are defined all random variables considered in this paper. If X is a random variable with distribution F, we write X F and deal with the two possible cases:
(i)
(Hamburger case) X takes values in the real line R = ( , ) .
(ii)
(Stieltjes case) X takes values in the half-real line R + = [ 0 , ) .
For each range of values, R or R + , let us assume that X F has finite moments of any positive integer order. This means that any power | X | n of X is P -integrable for all n N : = { 1 , 2 , } , in which case we have finite moments and the moment sequence, denoted, respectively, as follows:
m n : = E [ X n ] , n N , and { m n } n = 1 .
For any random variable X F with finite moments, there are two possibilities: either F is uniquely determined by its moments, and we say that F is M-determinate (M-det), or F is non-unique, M-indeterminate (M-indet). In the latter case, there is at least one distribution G F with the same moments as F. These notions/properties are equally used in both cases, Hamburger and Stieltjes.
It is clear that if a distribution is M-det on R , then it is also M-det on R + . However, the converse is not true in general. It is possible that a distribution F is M-det on R + (Stieltjes case); however, it is M-indet on R (Hamburger case). The meaning of these is that there is no distribution G on R + such that G F and has the same moment sequence, but there does exist another distribution, say G ˜ on R , G ˜ F which has the same moment sequence as F . This may happen only for some discrete distributions; for details, see, e.g., [4].
Most famous and useful conditions which guarantee the M-determinacy were found 100 years ago by [5]. Here are the two statements:
(i)
(Hamburger case) For X F on R ,
( C H ) n = 1 ( E [ X 2 n ] ) 1 / ( 2 n ) = n = 1 m 2 n 1 / ( 2 n ) = X is   M-det   on R .
(ii)
(Stieltjes case) For X F on R + ,
( C S ) n = 1 ( E [ X n ] ) 1 / ( 2 n ) = n = 1 m n 1 / ( 2 n ) = X is   M-det   on R + .
Traditionally, ( C H ) and ( C S ) are each called Carleman’s condition and it is well-known that, in a sense, this condition is the ‘best’ sufficient condition for M-det; see Section 11 in [6] or [7]. Notice that Carleman’s condition is in the group of the so-called ‘checkable’ sufficient conditions for M-determinacy. It is useful to mention that several ‘checkable’ sufficient or ‘checkable’ necessary conditions for either M-det or M-indet can be found in the recent works by [8,9].
In this study, we focus on distributions which are arbitrary in a neighbourhood of zero, say, for x ( x 0 , x 0 ) for some x 0 > 0 ; however, they are absolutely continuous on a subset of R outside that interval, so for X F , there is a density f = F . For the M-det property, it is important to note the behaviour of the ‘probability density tail(s)’, f ( x ) as | x | . We have two tails on R and one tail on R + . Since f is a density, the rate of its decreasing to zero is related to the rate of growing to infinity of the moments m n as n , which in turn is decisive for the divergence of the Carleman’s series; see ( C H ) , ( C S ) above.
Recently, ref. [10] introduced an interesting condition. The idea, in our words, is to assume that f ( x ) > 0 on R , use a positive function ϕ , and for large | x | , compare the ‘small values’ f ( x ± ϕ ( | x | ) ) and f ( x ) . This is carried out in terms of the density ‘dropping speed’, as we call the behaviour of the ratio f ( x ± ϕ ( | x | ) ) / f ( x ) as x ± .
Specifically, these authors showed that if for some constants a > 0 , α [ 0 , 1 ] , with sign ( x ) = 1 if x 0 or 1 if x < 0 , the density f satisfies the inequality
lim sup | x | f ( x + a sign ( x ) ( log | x | ) α ) f ( x ) < 1 ,
then X F satisfies Carleman’s condition ( C H ) and is M-det. However, in their proof, the authors assume implicitly that the underlying distribution F is symmetric about zero and is absolutely continuous on the whole real line R (see, e.g., relation (3.8) in the proof of Theorem 2.1 in [10]).
In the present paper, we extend and/or slightly modify the findings of [10]. We suggest considering ‘more general’ functions ϕ and find precise conditions under which one single asymptotic property of the density f implies M-det. Symbolically:
Condition ( D ) lim sup | x | f ( x + sign ( x ) ϕ ( | x | ) ) f ( x ) < 1 X F is   M-det .
The structure of the paper is as follows. In Section 2, we state the main results, three theorems, and four corollaries. The needed lemmas for the proofs are given in Section 3. The complete proofs of the main results are provided in Section 4. Comments and comprehensive illustrative examples are given in Section 5.

2. Main Theorems and Corollaries

Assumption 1. 
We start with a non-negative and differentiable function ϕ on [ x 0 , ) for some x 0 > 0 . Suppose that the function y = y ( x ) = x + ϕ ( x ) is strictly increasing in x and let x ( y ) be its inverse function on [ y 0 , ) with y 0 = y ( x 0 ) . Define the function φ ( y ) = y x ( y ) and assume that it satisfies the following conditions, (a) – (c):
(a) φ ( y ) [ 0 , 1 ] for y y ;
(b) φ ( y ) C + log y for y y ;
(c) y φ ( y ) C + for y y , where C + > 0 and y y 0 are two constants.
We are going to use below the following two notations:
R x 0 : = R ( x 0 , x 0 ) and R + , x 0 : = R + [ 0 , x 0 ) for   some x 0 > 0 .

2.1. Statement and a Corollary in the Hamburger Case

Theorem 1. 
Let X F on R have finite moments and F be absolutely continuous on the set R x 0 with F ( x ) = f ( x ) > 0 on R x 0 . Under these assumptions and Assumption 1 for the functions ϕ and φ, assume further that the following relation is satisfied:
γ 1 ( f , ϕ ) : = lim sup | x | f ( x + sign ( x ) ϕ ( | x | ) ) f ( x ) < 1 .
Then the moments of X satisfy Carleman’s condition ( C H ) and hence X is M-det on R . Moreover, both X 2 and | X | are also M-det on R and on R + .
Notice that in Theorem 1, X is on R , and the first claim is about M-det on R . The two other random quantities, X 2 and | X | , even being non-negative, can be considered also on R , not only on R + . See again the comment in the Introduction with a reference to [4]. Hence there is no reason to worry if there is a claim for a non-negative random variable and a property on the whole real line R .
Consider now specific functions ϕ as described in Assumption 1 and derive explicit corollaries. Let us introduce the following three functions, each being a possible choice for ϕ ( x ) with constants a > 0 and α [ 0 , 1 ] :
ϕ 1 ( x ) = a ( log x ) α , x > 1 ;
ϕ 2 ( x ) = a ( log x ) α + log log x , x > e ;
ϕ 3 ( x ) = a ( log x ) α / log log x , x > e .
Corollary 1. 
Let X F on R have all finite moments and F be absolutely continuous on R x 0 for some x 0 > e with F ( x ) = f ( x ) > 0 on R x 0 . Let a > 0 , α [ 0 , 1 ] . Suppose that for any choice of ϕ ( x ) from (2)–(4), the following relation is valid:
lim sup | x | f ( x + sign ( x ) ϕ ( | x | ) ) f ( x ) < 1 .
Then, the moments of X satisfy Carleman’s condition ( C H ) and hence X is M-det. Moreover, X 2 and | X | are also M-det on R and on R + .
We found that ϕ ( x ) = ϕ 1 ( x ) was the only function used in Wei and Zhang [10]. Here we suggest a slight extension, e.g., adding to ϕ 1 ( x ) , or dividing it by, another ‘slowly varying function’. Notice also that, for large x, we have
ϕ 3 ( x ) < ϕ 1 ( x ) < ϕ 2 ( x ) .

2.2. Statements and Corollaries in the Stieltjes Case

Theorem 2. 
Let Y G on R + have all finite moments and G be absolutely continuous on R + , x 0 with G ( x ) = g ( x ) > 0 on R + , x 0 . Under these conditions and Assumption 1 for the functions ϕ and φ, let us further assume that
lim x ϕ ( x ) x = 0 , γ 2 ( g , ϕ ) : = lim sup x g ( ( x + ϕ ( x ) ) 2 ) g ( x 2 ) < 1 .
Then, the moments of Y satisfy Carleman’s condition ( C S ) and hence Y is M-det on R + .
Corollary 2. 
Let Y G on R + have all finite moments and G be absolutely continuous on R + , x 0 with x 0 > e , G ( x ) = g ( x ) > 0 on R + , x 0 . Suppose that ϕ ( x ) is any one of the functions (2)–(4), with a > 0 , α [ 0 , 1 ] , and that the following relation is satisfied:
lim sup x g ( ( x + ϕ ( x ) ) 2 ) g ( x 2 ) < 1 .
Then, the moments of Y satisfy Carleman’s condition ( C S ) and hence Y is M-det on R + .
Theorem 3. 
Let Y G on R + have all finite moments and G be absolutely continuous on R + , x 0 with G ( x ) = g ( x ) > 0 on R + , x 0 . Involve the functions ϕ and φ as described in Assumption 1, and assume further that
γ 3 ( g , ϕ ) : = lim sup x g ( x + ϕ ( x ) ) g ( x ) < 1 .
Then, both Y and Y 2 satisfy Carleman’s condition ( C S ) and are M-det on R + .
We provide now a corollary which extends Theorem 2.2 in Wei and Zhang [10]. Our conclusion is about both Y and Y 2 , not only for Y.
Corollary 3. 
Let Y G on R + have all finite moments and G be absolutely continuous on R + , x 0 = [ x 0 , ) for some x 0 > 1 with G ( x ) = g ( x ) > 0 on R + , x 0 . Consider the function ϕ 1 with a > 0 , α [ 0 , 1 ] , see ( 2 ) , and assume that
lim sup x g ( x + a ( log x ) α ) g ( x ) < 1 .
Then, Y and Y 2 each satisfy Carleman’s condition ( C S ) ; hence, they both are M-det on R + .
By using the two other choices, (3) and (4), namely
ϕ 2 ( x ) = a ( log x ) α + log log x or ϕ 3 ( x ) = a ( log x ) α / log log x , x > e ,
we arrive at two corollaries formulated separately. In both, a > 0 , α [ 0 , 1 ] .
Corollary 4. 
Let Y G on R + have finite moments and G be absolutely continuous on R + , x 0 = [ x 0 , ) for some x 0 > e with G ( x ) = g ( x ) > 0 on R + , x 0 . Then
lim sup x g ( x + a ( log x ) α + log log x ) g ( x ) < 1 b o t h Y a n d Y 2 a r e   M - d e t   o n   R + .
Corollary 5. 
Let Y G on R + have all finite moments and G be absolutely continuous on R + , x 0 = [ x 0 , ) for some x 0 > e with G ( x ) = g ( x ) > 0 on R + , x 0 . Then
lim sup x g ( x + a ( log x ) α / log log x ) g ( x ) < 1 b o t h Y a n d Y 2 a r e   M - d e t   o n   R + .

3. Auxiliary Lemmas

To prove the main results stated in Section 2, we need two crucial lemmas which are slight modifications of, e.g., Lemma 3.2 (pages 163 and 166), in [10].
Lemma 1. 
For n N and real ε > 0 , define the function g ( y ) = n log y ε y , y > 0 . Then, for any integer n ( ε e ) 1 , we have two claims:
(i)
sup y > 0 g ( y ) = n log n n log ( ε e ) 2 n log n .
(ii)
If X F on R has a finite moment of order n, then for each y + > 0 ,
n y + y n 1 ( log y ) d F ( y ) 2 n log n y + y n 1 d F ( y ) + ε y + y n d F ( y ) .
Proof. 
Note that the function g is twice differentiable on ( 0 , ) and
g ( y ) = n / y ε , y > 0 , g ( y ) = n / y 2 < 0 , y > 0 .
So, g is a concave function on ( 0 , ) . Moreover, g ( n / ε ) = 0 ; hence, g has a maximum value at y ¯ = n / ε . This proves Claim (i) from which Claim (ii) follows immediately.  □
Lemma 2. 
Let { a n } n = 1 be a positive sequence. If for some constants b , c > 0 ,
a n c ( n log n ) a n 1 + b n , n = 2 , 3 , ,
then
a n d 0 c n ( n log n ) n , n = 2 , 3 , , w h e r e d 0 = a 1 / c + exp ( b / c ) .
Proof. 
For simplicity, we use the symbol ‘!’ as a ‘generalized factorial’ and denote
( n log n ) ! = ( n log n ) ( ( n 1 ) log ( n 1 ) ) ( 2 log 2 ) .
Then by iteration, we obtain the following for n 2 :
a n c ( n log n ) a n 1 + b n c ( n log n ) [ c ( ( n 1 ) log ( n 1 ) ) a n 2 + b n 1 ] + b n = c 2 ( n log n ) ( ( n 1 ) log ( n 1 ) ) a n 2 + c ( n log n ) b n 1 + b n c n 1 ( n log n ) ! a 1 + c 1 b 2 ( 2 log 2 ) ! + c 2 b 3 ( 3 log 3 ) ! + + c ( n 1 ) b n ( n log n ) ! c n ( n log n ) n a 1 c + ( b / c ) 2 2 ! + ( b / c ) 3 3 ! + + ( b / c ) n n ! c n ( n log n ) n [ a 1 / c + exp ( b / c ) ] = d 0 c n ( n log n ) n .
The proof is complete.  □

4. Proofs of the Main Results

Proof of Theorem 1. 
In parallel with the (usual) nth moment of F, m n = x n d F ( x ) , we now need its nth absolute moment denoted by μ n = | x | n d F ( x ) . Furthermore, we split μ n into two parts and write μ n = μ n + + μ n , where
μ n + = [ 0 , ) | x | n d F ( x ) = 0 x n d F ( x ) , μ n = ( , 0 ) | x | n d F ( x ) = 0 ( x ) n d F ( x ) .
On the other hand, from condition (1), we have two inequalities:
γ 1 , + ( f , ϕ ) : = lim sup x f ( x + ϕ ( x ) ) f ( x ) γ 1 ( f , ϕ ) < 1 ,
γ 1 , ( f , ϕ ) : = lim sup x f ( x ϕ ( x ) ) f ( x ) γ 1 ( f , ϕ ) < 1 .
We first sketch our proof as follows. The plan is to show, by condition (7), that
μ n + c + ( n log n ) μ n 1 + + b + n , n = 2 , 3 , ,
where c + and b + are positive constants independent of n. Similarly, by (8), we have
μ n c ( n log n ) μ n 1 + b n , n = 2 , 3 , ,
where c and b are positive constants independent of n.
Once this is down, combining (9) and (10) yields
μ n = μ n + + μ n c ( n log n ) μ n 1 + b n , n = 2 , 3 , ,
where c = max { c + , c } and b = b + + b . Then, applying Lemma 2 to (11), we find that
μ n d 0 c n ( n log n ) n , n = 2 , 3 , ,
where d 0 = μ 1 / c + exp ( b / c ) . Consequently, from (12), it follows that
n = 1 μ n 1 / ( 2 n ) n = 2 μ n 1 / ( 2 n ) n = 2 d 0 1 / ( 2 n ) c 1 / 2 ( n log n ) 1 / 2 = ,
and also that
n = 1 m 2 n 1 / ( 2 n ) = n = 1 μ 2 n 1 / ( 2 n ) n = 1 d 0 1 / ( 2 n ) c 1 ( 2 n log ( 2 n ) ) 1 = .
From (13), we see that the random variable | X | satisfies Carleman’s condition ( C S ) and is M-det on R + . Similarly, from (14), we conclude that the random variable X satisfies Carleman’s condition ( C H ) and is M-det on R , and | X | 2 = X 2 satisfies Carleman’s condition ( C S ) and is M-det on R + .
Recall that F is not a discrete distribution; neither are | X | and X 2 . Therefore, both | X | and X 2 are also M-det on R . This concludes the proof of the theorem.
Inequality (9) remains to be proven. By condition (7), we take β = 1 2 ( 1 + γ 1 , + ( f , ϕ ) ) , and see that there exists a number x ^ 0 x 0 such that two inequalities hold:
y ^ 0 = x ^ 0 + ϕ ( x ^ 0 ) y
(see the three conditions (a)–(c) in Assumption 1 for the point y ), and
f ( x + ϕ ( x ) ) f ( x ) β < 1 , x x ^ 0 .
Therefore,
f ( x ) f ( x + ϕ ( x ) ) ( 1 β ) f ( x ) , x x ^ 0 .
This implies that for n 2 , we obtain a lower bound for the integral I ( x ^ 0 ) , where
I ( x ^ 0 ) : = x ^ 0 x n ( f ( x ) f ( x + ϕ ( x ) ) ) d x ( 1 β ) x ^ 0 x n f ( x ) d x = ( 1 β ) μ n + ( 1 β ) 0 x ^ 0 x n d F ( x )
( 1 β ) μ n + x ^ 0 n .
On the other hand, to estimate the upper bound of (15), we consider the integral J n ( y ^ 0 ) , where
J n ( y ^ 0 ) : = y ^ 0 [ y n ( y φ ( y ) ) n ] ( 1 φ ( y ) ) f ( y ) d y
y ^ 0 n y n 1 φ ( y ) f ( y ) d y
C + n y ^ 0 y n 1 ( log y ) f ( y ) d y .
Here, inequality (17) follows from condition (a) and the Mean-Value Theorem, because
y n ( y φ ( y ) ) n = φ ( y ) n y ˜ n 1 φ ( y ) · n y n 1 ,
where y ˜ [ y φ ( y ) , y ] , while the second inequality (18) follows from condition (b).
Now, we are ready to estimate the upper bound of the integral (15). By changing variables, we rewrite I ( x ^ 0 ) as follows:
I ( x ^ 0 ) = x ^ 0 x n f ( x ) d x x ^ 0 x n f ( x + ϕ ( x ) ) d x = x ^ 0 y n f ( y ) d y y ^ 0 ( y φ ( y ) ) n ( 1 φ ( y ) ) f ( y ) d y = J n ( y ^ 0 ) + y ^ 0 y n φ ( y ) f ( y ) d y + x ^ 0 y ^ 0 y n f ( y ) d y C + n y ^ 0 y n 1 ( log y ) f ( y ) d y + C + y ^ 0 y n 1 f ( y ) d y + y ^ 0 n C + n y ^ 0 y n 1 ( log y ) f ( y ) d y + C + μ n 1 + + y ^ 0 n ,
where we applied inequality (18) and condition (c). Finally, applying Lemma 1(ii) to inequality (19), we find that for real ε > 0 and integer n ( ε e ) 1 2 ,
I ( x ^ 0 ) 2 C + ( n log n ) y ^ 0 y n 1 f ( y ) d y + C + ε y ^ 0 y n f ( y ) d y + C + μ n 1 + + y ^ 0 n 2 C + ( n log n ) μ n 1 + + C + ε μ n + + C + μ n 1 + + y ^ 0 n 3 C + ( n log n ) μ n 1 + + C + ε μ n + + y ^ 0 n .
Combining inequalities (16) and (20), we find that for the previously chosen β , x ^ 0 , y ^ 0 , and 0 < ε < min { ( 1 β ) / C + , 1 / ( 2 e ) } , the following inequality holds:
( 1 β C + ε ) μ n + 3 C + ( n log n ) μ n 1 + + ( x ^ 0 n + y ^ 0 n ) , n ( ε e ) 1 2 .
Therefore,
μ n + c ¯ ( n log n ) μ n 1 + + b ¯ n , n ( ε e ) 1 2 ,
where c ¯ = 3 C + / ( 1 β C + ε ) and b ¯ = ( x ^ 0 + y ^ 0 ) / ( 1 β C + ε ) . This means that there exists an integer n 0 , 2 n 0 N , and two positive constants b ¯ , c ¯ such that
μ n + c ¯ ( n log n ) μ n 1 + + b ¯ n , n n 0 .
Putting the previous n 0 1 terms { μ 1 + , μ 2 + , , μ n 0 1 + } together, we can choose (if necessary) two larger positive constants b + , c + such that for all n 2 , we have
μ n + c + ( n log n ) μ n 1 + + b + n .
This proves inequality (9) and completes the proof of Theorem 1.  □
Proof of Corollary 1. 
For a > 0 , α [ 0 , 1 ] , consider the function ϕ ( x ) = ϕ 1 ( x ) = a ( log x ) α on [ x 0 , ) . Then ϕ ( x ) 0 is differentiable and y ( x ) = x + ϕ ( x ) is strictly increasing in x. Notice that the inverse function x ( y ) exists. The functions y ( x ) and φ ( y ) = y x ( y ) together obey the following properties:
lim x y ( x ) x = 1 , lim x log ( y ( x ) ) log x = 1 , lim x ( log y ( x ) ) α ( log x ) α = 1 ,
φ ( y ) = d φ ( y ) d y = d ϕ ( x ) d x · d y d x 1 = ϕ ( x ) 1 + ϕ ( x ) [ 0 , 1 ] , y y 0 = y ( x 0 ) ,
lim y φ ( y ) ( log y ) α = a > 0 , lim y y φ ( y ) ( log y ) α 1 = a α > 0 .
Consequently,
lim y φ ( y ) log y = a for α = 1 , and 0 , if α < 1
and
lim y y φ ( y ) = a for α = 1 , and 0 , if α < 1 .
Therefore, the function φ satisfies conditions (a)–(c). This proves Corollary 1 for the choice ϕ = ϕ 1 ; see (2). Similar arguments are used for the two other choices, (3) and (4).  □
Proof of Theorem 2. 
We start with the distribution G on R + and define the symmetric distribution H on R as follows:
H ( x ) = 1 2 ( G ( x 2 ) + 1 ) , x 0 1 2 ( G ( x 2 ) 1 ) , x < 0 .
Then, H is absolutely continuous on the set R x 0 = R ( x 0 , x 0 ) and its density is
h ( x ) = H ( x ) = g ( x 2 ) x , x x 0 g ( x 2 ) x , x x 0 .
Clearly, of H and G, each determines the other one. Consider a random variable Z H . Then, recalling that Y G , we find that for each n N ,
E [ Z 2 n 1 ] = 0 and E [ Z 2 n ] = E [ Y n ] .
It follows from condition (5) that
lim sup | x | h ( x + sign ( x ) ϕ ( | x | ) ) h ( x ) = lim sup x h ( x + ϕ ( x ) ) h ( x ) = lim sup x g ( ( x + ϕ ( x ) ) 2 ) g ( x 2 ) · x + ϕ ( x ) x = lim sup x g ( ( x + ϕ ( x ) ) 2 ) g ( x 2 ) = γ 2 ( g , ϕ ) < 1 .
By Theorem 1, Z H satisfies Carleman’s condition ( C H ) , namely,
n = 1 ( E [ Z 2 n ] ) 1 / ( 2 n ) = .
Equivalently,
n = 1 ( E [ Y n ] ) 1 / ( 2 n ) = n = 1 ( E [ Z 2 n ] ) 1 / ( 2 n ) = .
Therefore, Y G satisfies Carleman’s condition ( C S ) and is M-det on R + . The proof is complete.  □
Proof of Corollary 2. 
The proof follows the same steps as those in Corollary 1 and is omitted.  □
Proof of Theorem 3. 
In this Stieltjes case, denote ν n : = E [ Y n ] for n N . In view of the proof of Theorem 1 (e.g., that condition (7) implies inequality (9)), we know that condition (6) also implies the following inequality:
ν n c ( n log n ) ν n 1 + b n , n = 2 , 3 , ,
where c and b are positive constants independent of n. Then applying Lemma 2 to (21), we conclude that
ν n d 0 c n ( n log n ) n , n = 2 , 3 , ,
where d 0 = ν 1 / c + exp ( b / c ) . Consequently, it follows from (22), as before, that
n = 1 ν n 1 / ( 2 n ) = and n = 1 ν 2 n 1 / ( 2 n ) = .
Thus, both Y and Y 2 satisfy Carleman’s condition ( C S ) and are M-det on R + . The proof is complete.  □
Proofs of Corollaries 3–5. 
The proofs are based on the steps similar to those in Corollary 1 and are omitted.  □

5. Comments and Illustrative Example

Whether or not a distribution with all finite moments is M-det (uniquely determined) has been a profound question in mathematics for more than a century. However, the M-det property is not less important from the applied point of view, in which case the so-called ‘checkable conditions’ are most useful. There are a variety of sufficient or necessary conditions available in the literature for either M-det or for M-indet. The conditions are given in terms of the moments, of the densities, if they exist, of the distribution tails, or an appropriate combination of these. Classical results and/or modern developments can be found in several sources. Among them are the papers by Lin [8] and Stoyanov, Lin and Kopanov [9] and the book by Stoyanov [6]; see also the references therein.
For completeness of the general picture, it must be mentioned that there are deep fundamental mathematical results of the sort ‘if and only if’; however, due to their complexity, they fall into the group of ‘uncheckable conditions’. Readers interested in these aspects can consult the books by Akhiezer [1], Shohat and Tamarkin [2] and Schmüdgen [3].
The contribution of this paper is as follows: We present precise checkable conditions in terms of the probability density tails under which a distribution is M-det. The proofs are based on the classical Carleman’s condition. In general, also seen in the example below, in order to claim the M-det property of a distribution, we do not need to calculate the moments, etc. Our results allow for concluding the M-det property of a distribution to check just one single asymptotic relation in terms of the density ‘dropping speed’.
Example 1. 
(a) Consider a random variable X obeying the Gumbel distribution, X F , where
F ( x ) = Λ ( x ) = exp { e x } , x R .
Then, X , X 2 and | X | are all M-det on R .
(b) For a real number c > 0 , let us define the truncated random variable X c = X · 1 [ X c ] . Then each of X c and X c 2 is M-det on R + and also on R .
Case (a) is a Hamburger case and it can be easily shown that X has finite moments of all orders n N . In fact, the moment-generating function of X exists and in terms of Euler’s gamma function, we have
M ( t ) : = E [ e tX ] = Γ ( 1 t ) ,   so   M ( t ) <   for   all   t < 1 .
Hence, X F is M-det on R . However, by using our Corollary 1, we can conclude ’more’, namely that all random variables X , X 2 and | X | are M-det on R . To see this, we need the density function f = F = Λ :
f ( x ) = e x exp { e x } , x R .
We claim that f satisfies Condition (D), i.e., the relation
lim sup | x | f ( x + sign ( x ) ϕ ( | x | ) ) f ( x ) = 0 < 1 ,
for any choice of the function ϕ : ϕ ( x ) = log x , or log x + log log x , or ( log x ) / log log x .
The above relation can be easily checked for each choice of ϕ . For example, if taking the simplest one, ϕ ( x ) = log x , we have, on the right tail, that
lim sup x f ( x + log x ) f ( x ) = lim sup x e ( x + log x ) exp { e ( x + log x ) } e x exp { e x } = lim sup x e log x exp e x x 1 1 = 0 .
Similarly, on the left tail,
lim sup x f ( x log ( x ) ) f ( x ) = lim sup x e ( x log ( x ) ) exp { e ( x log ( x ) ) } e x exp { e x } = lim sup x e log ( x ) exp { e x ( x + 1 ) } = 0 .
Case (b) is a Stieltjes case. Define first the number p ¯ c , the mass on the right tail of X as follows:
p ¯ c = P { X c } = c d Λ ( x ) .
Then the ‘new’ random variable X c = X · 1 [ X c ] has a distribution, F c , with density function
f c ( x ) = 1 p ¯ c e x exp { e x } , x c ; f c ( x ) = 0 , x < c .
Again, X c has finite moments of all orders n N . Using our Corollary 3, we conclude that both random variables X c and X c 2 satisfy Carleman’s condition ( C S ) and hence are M-det on R + , because the density function f c of X c satisfies the relation:
γ ( f c ) : = lim sup x f c ( x + log x ) f c ( x ) = lim sup x f ( x + log x ) f ( x ) = 0 < 1 .
The same holds for the two other choices of ϕ .
Notice that here we do not need to carry out all moments of X c and X c 2 in order to check Carleman’s condition ( C S ) . We make a definite conclusion about the M-det property of X c and X c 2 simply by referring to the inequality γ ( f c ) < 1 which requires standard analysis.

Author Contributions

Formal Analysis, G.D.L. and J.M.S.; Investigation, G.D.L. and J.M.S.; Writing—Original Draft Preparation, G.D.L.; Writing—Review and Editing, G.D.L. and J.M.S.; Final text—J.M.S. The authors have equal contribution at all stages of this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

The authors thank the three anonymous Referees for their positive feedback and especially for giving a couple of relevant suggestions for clearness. All suggestions have been properly carried out. In particular, we added a comprehensive example showing how to use the results in this paper. The scientific editors and the technical staff also deserve our thanks.

Conflicts of Interest

The authors declare that there are no competing interests.

References

  1. Akhiezer, N.I. The Classical Problem of Moments and Some Related Questions of Analysis; Oliver & Boyd: Edinburgh, Scotland, 1965. [Google Scholar]
  2. Shohat, J.A.; Tamarkin, J.D. The Problem of Moments; American Mathematical Society: Providence, RI, USA, 1943. [Google Scholar]
  3. Schmüdgen, K. The Moment Problem; Graduate Texts in Mathematics 277; Springer: Cham, Switzerland, 2017. [Google Scholar]
  4. Chihara, T.S. On indeterminate Hamburger moment problems. Pacific J. Math. 1968, 27, 475–484. [Google Scholar] [CrossRef]
  5. Carleman, T. Les Fonctions Quasi-Analytiques; Gauthier-Villars: Paris, France, 1926. [Google Scholar]
  6. Stoyanov, J.M. Counterexamples in Probability, 3rd ed.; Dover: New York, NY, USA, 2013. [Google Scholar]
  7. Sodin, S. The Classical Moment Problem; Lecture Notes; School of Mathematical Sciences: Queen Mary, UK; University of London: London, UK, 2019; 45p, Available online: https://webspace.maths.qmul.ac.uk/a.sodin/teaching/moment/clmp.pdf (accessed on 30 July 2025).
  8. Lin, G.D. Recent developments on the moment problem. J. Stat. Distrib. Appl. 2017, 4, 17. [Google Scholar] [CrossRef]
  9. Stoyanov, J.M.; Lin, G.D.; Kopanov, P. New checkable conditions for moment determinacy of probability distributions. Theory Probab. Appl. 2020, 65, 634–648. [Google Scholar] [CrossRef]
  10. Wei, Y.; Zhang, R. A new moment determinacy condition for probability distributions. Theory Probab. Appl. 2025, 70, 155–168. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Lin, G.D.; Stoyanov, J.M. New Sufficient Conditions for Moment Determinacy via Probability Density Tails. Mathematics 2025, 13, 2671. https://doi.org/10.3390/math13162671

AMA Style

Lin GD, Stoyanov JM. New Sufficient Conditions for Moment Determinacy via Probability Density Tails. Mathematics. 2025; 13(16):2671. https://doi.org/10.3390/math13162671

Chicago/Turabian Style

Lin, Gwo Dong, and Jordan M. Stoyanov. 2025. "New Sufficient Conditions for Moment Determinacy via Probability Density Tails" Mathematics 13, no. 16: 2671. https://doi.org/10.3390/math13162671

APA Style

Lin, G. D., & Stoyanov, J. M. (2025). New Sufficient Conditions for Moment Determinacy via Probability Density Tails. Mathematics, 13(16), 2671. https://doi.org/10.3390/math13162671

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