Next Article in Journal
Quantifying Decoherence via Increases in Classicality
Previous Article in Journal
A Quaternary Code Correcting a Burst of at Most Two Deletion or Insertion Errors in DNA Storage
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Generalization of the Concavity of Rényi Entropy Power

1
Laboratory of Mathematics and Complex Systems (Ministry of Education), School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China
2
KLMM, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China
3
University of Chinese Academy of Sciences, Beijing 100049, China
*
Author to whom correspondence should be addressed.
Entropy 2021, 23(12), 1593; https://doi.org/10.3390/e23121593
Submission received: 3 November 2021 / Revised: 20 November 2021 / Accepted: 26 November 2021 / Published: 27 November 2021

Abstract

:
Recently, Savaré-Toscani proved that the Rényi entropy power of general probability densities solving the p-nonlinear heat equation in R n is a concave function of time under certain conditions of three parameters n , p , μ , which extends Costa’s concavity inequality for Shannon’s entropy power to the Rényi entropy power. In this paper, we give a condition Φ ( n , p , μ ) of n , p , μ under which the concavity of the Rényi entropy power is valid. The condition Φ ( n , p , μ ) contains Savaré-Toscani’s condition as a special case and much more cases. Precisely, the points ( n , p , μ ) satisfying Savaré-Toscani’s condition consist of a two-dimensional subset of R 3 , and the points satisfying the condition Φ ( n , p , μ ) consist a three-dimensional subset of R 3 . Furthermore, Φ ( n , p , μ ) gives the necessary and sufficient condition in a certain sense. Finally, the conditions are obtained with a systematic approach.

1. Introduction

In 1948, Claude Elwood Shannon [1] first introduced his mathematical theory of information. In particular, he presented the concept of entropy as a measure for information. On this foundation, Alfréd Rényi [2] then built one of his contributions in 1961. At the center, he introduced a new notion of entropy that included that of Shannon as a special case, and this is called Rényi entropy.
The p-th Rényi entropy [3,4] of a probability density function f : R n R is defined as
H p ( f ) : = 1 1 p log R n f p ( x ) d x ,
for 0 < p < + , p 1 . The p-th Rényi entropy power is given by
N p ( f ) : = exp ( μ n H p ( f ) ) ,
where μ is a real-valued parameter. The Rényi entropy for p = 1 is defined as the limit of H p ( f ) as p 1 . It follows from definition (1) that
H 1 ( f ) = lim p 1 H p ( f ) = R n f ( x ) log f ( x ) d x ,
which is Shannon’s entropy. Thus, the Rényi entropy power of index p = 1 , μ = 2 , given by (2). coincides with Shannon’s entropy power
N 1 ( f ) : = exp ( 2 n H 1 ( f ) ) .
Shannon’s entropy power inequality (EPI) is one of the most important information inequalities [1], which has many proofs, generalizations, and applications [5,6,7,8,9,10,11,12,13]. In particular, Costa presented a stronger version of the EPI in his seminal paper [14].
Let X t X + N n ( 0 , t I ) be the n-dimensional random vector introduced by Costa [14,15,16,17] and u ( x t ) the probability density of X t , which solves the heat equation in the whole space R n ,
t u ( x t ) = Δ u ( x t ) .
Costa’s differential entropy is defined to be
H ( u ( x t ) ) = R n u ( x t ) log u ( x t ) d x t .
Related to EPI, Costa [14] proved that the Shannon entropy power  N ( u ) = 1 2 π e e ( 2 / n ) H ( u ) is a concave function in t; that is, ( d / d t ) N ( u ) 0 and ( d 2 / d 2 t ) N ( u ) 0 . Several new proofs and generalizations for Costa’s EPI were given in [18,19,20,21].
Savaré-Toscani [22] proved that the concavity of entropy power is a property which is not restricted to the Shannon entropy power (3) in connection with the heat Equation (4), but it holds for the p-th Rényi entropy power (2). They put it in connection with the solution to the nonlinear heat equation
t u ( x t ) = Δ u ( x t ) p
posed in the whole space R n and p R > 0 and show that d d t N p ( u ) 0 and d 2 d 2 t N p ( u ) 0 hold if n , p , μ satisfy certain conditions.
In this paper, we give a generalization for the concavity of the p-th Rényi entropy power (CREP). Precisely, we give a propositional logic formula Φ ( n , p , μ ) such that if n N , p , μ R satisfy this formula, then the CREP holds. The condition Φ ( n , p , μ ) extends the parameter range of the CREP given by Savaré-Toscani [22] and contains many more cases. Precisely, the points ( n , p , μ ) satisfying the condition given in [22] consist of a two-dimensional subset of R 3 and the points satisfying the condition Φ ( n , p , μ ) consist of a three-dimensional subset of R 3 . Furthermore, Φ ( n , p , μ ) gives the necessary and sufficient condition for CREP to be valid in a certain sense.
The formula Φ is obtained using a systematic procedure which can be considered as a parametric version of that given in [15,16,17,23], where parameters n , p , μ exist in the formulas. The procedure reduces the proof of the CREP to check the semi-positiveness of a quadratic form whose coefficients are polynomials in the parameters n , p , μ . In principle, a necessary and sufficient condition for the parameters to satisfy this property can be computed with the quantifier elimination [24]. In this paper, the problem is in a special form and an explicit proof is given.
The rest of this paper is organized as follows. In Section 2, we give the proof procedure and prove the concavity of entropy powers in the parametric case. In Section 3, we present the generalized version of CREP using the proof procedure. In Section 4, conclusions are presented.

2. Proof Procedure

In this section, we present a procedure to prove the CREP. To make the paper concise, we only give those steps that are needed in this paper.

2.1. Notations

Let x t = [ x 1 , t , x 2 , t , , x n , t ] be a set of variables depending on t and
d ( i ) x t = d x 1 , t d x 2 , t d x i 1 , t d x i + 1 , t d x n , t , i = 1 , 2 , n .
Let [ n ] 0 = { 0 , 1 , , n } and [ n ] = { 1 , , n } . To simplify the notations, we use u to denote u ( x t ) in the rest of the paper. Denote
P n = h = 0 P h , n , P h , n = { h u h 1 x 1 , t h n x n , t : h = i = 1 n h i , h i N }
as the set of all derivatives of u with respect to the differential operators x i , t , i = 1 , , n , R [ n , p , μ ] as the set of polynomials in parameters n , p , μ , and
R = R [ n , p , μ ] [ P n ]
as the set of polynomials in P n with coefficients in R [ n , p , μ ] . For v P h , n , we say v has order ord ( v ) = h . For a monomial i = 1 r v i d i with v i P n , its degree, order, and total order are defined to be i = 1 r d i , max i = 1 r ord ( v i ) , and i = 1 r d i · ord ( v i ) , respectively.
A polynomial in R is called a kth-order differentially homogenous polynomial or simply a kth-order differential form, if all its monomials have degree k and total order k. Let M k , n be the set of all monomials which have degree k and total order k. Then, the set of kth-order differential forms is an R -linear vector space generated by M k , n , which is denoted as Span R ( M k , n ) . We use Gaussian elimination in Span R ( M k , n ) by treating the monomials as variables. We always use the lexicographic order for the monomials defined in [15,16,17].

2.2. Sketch of the Proof

In this section, we give the procedure to prove the CREP. The property d d t N p ( u ) 0 can be easily proved [22]. We focus on proving d 2 d 2 t N p ( u ) 0 . The procedure consists of four steps.
In step 1, we reduce the proof of CREP into the proof of an integral inequality, as shown by the following lemma, the proof of which is given in Section 2.4.
Lemma 1.
The proof of d 2 d 2 t N p ( u ) 0 can be reduced to show
R n u 3 p 6 E 2 , n d x t 0 ,
under the condition p 1 μ n , where E 2 , n = a = 1 n b = 1 n E 2 , n , a , b is a fourth-order differential form in R [ n , p , μ ] [ V a , b ] and
V a , b = { h u h 1 x a , t h 2 x b , t : h [ 3 ] 0 ; a , b [ n ] } .
In step 2, we compute the constraints, which are relations satisfied by the probability density u of X t . Since E 2 , n in (7) is a fourth-order differential form, we need only the constraints which are fourth-order differential forms. A fourth-order differential form R is called an equational or inequality constraint if
R n u 3 p 6 R d x t = 0 or R n u 3 p 6 R d x t 0 .
The method to compute the constraints is given in Section 2.3. Suppose that the equational and inequality constraints are respectively
C E = { R i , | i = 1 , , N 1 } ,
C I = { I i , | i = 1 , , N 2 } .
In step 3, we find a propositional formula Φ ( n , p , μ ) such that when n N and p , μ R satisfy Φ ,
c j , e i R , s . t . E 2 , n i = 1 N 1 e i R i j = 1 N 2 c j I j = S 0 and c j 0 , j = 1 , , N 2
where S is a sum of squares (SOS). Details of this step and the formula Φ ( n , p , μ ) are given in Section 3.
To summarize the proof procedure, we have
Theorem 1.
The CREP is true if Φ ( n , p , μ ) is valid.
Proof. 
By Lemma 1, we have the following proof for CREP:
R u 3 p 6 E 2 , n d x t = ( 12 ) R u 3 p 6 ( i = 1 N 1 e i R i + j = 1 N 2 c j I j + S ) d x t = S 1 R u 3 p 6 ( j = 1 N 2 c j I j + S ) d x t S 2 R u 3 p 6 S d x t S 3 0 .
Equality S1 is true, because R i are equational constraints. Inequality S2 is true, because I j are inequality constraints. Inequality S3 is true, because S is an SOS and hence S 0 under the condition Φ ( n , p , μ ) . □

2.3. The Equational Constraints

In this section, we show how to find the second-order equational constraints. A second-order equational constraint is a fourth-order differential form in R [ n , p , μ ] [ P 2 , n ] such that R n u 3 p 6 R d x t = 0 . We need the following property.
Property 1.
Let a , r , m i , k i N > 0 and u ( m i ) be an m i th-order derivative of u. If u ( x t ) is a smooth, strictly positive and rapidly decaying probability density, then
u 3 p 2 i = 1 r [ u ( m i ) ] k i u k i | x a , t = d ( a ) x t = 0 ,
with i = 1 r k i m i = 4 , i = 1 r k i = 4 .
When p 2 , Property 1 follows from [25]. While 0 < p < 2 , p 1 , we make the assumption that u ( x t ) also satisfies Property 1.
Using Property 1, we can compute 28 second-order equational constraints using the method given in [15,16,17]:
C 2 , n = { R i , a , b : i = 1 , , 28 } R [ n , p , μ ] [ V a , b ] ,
where R i , a , b can be found in the Appendix A. Note that a , b are variables taking values in [ n ] .
We use an example to show how to obtain these constraints. Starting from a monomial u 2 u 2 x a , t ( u x a , t ) 2 with degree 4 and total order 4, using integral by parts, we have
u 3 p 6 u 2 u 2 x a , t ( u x a , t ) 2 d x t = [ u 3 p 5 u x a , t ( u x a , t ) 2 ] | x a , t = d ( a ) x t u x a , t [ x a , t ( u 3 p 5 ( u x a , t ) 2 ) ] d x t = ( 14 ) u x a , t [ x a , t ( u 3 p 5 ( u x a , t ) 2 ) ] d x t .
Then,
u 3 p 6 u 2 u 2 x a , t ( u x a , t ) 2 + u x a , t [ x a , t ( u 3 p 5 ( u x a , t ) 2 ) ] d x t = u 3 p 6 [ 3 p ( u x a , t ) 4 + 3 u 2 u 2 x a , t ( u x a , t ) 2 5 ( u x a , t ) 4 ] d x t = 0 .
We then obtain a 2th-order constraint: R 1 , a , b = 3 p ( u x a , t ) 4 + 3 u 2 u 2 x a , t ( u x a , t ) 2 5 ( u x a , t ) 4 . The other 27 constraints in C 2 , n are obtained in the same way.

2.4. Proof of Lemma 1

We first prove several lemmas.
Lemma 2.
d H p ( u ) d t = p 1 p u p 1 Δ u p d x t u p d x t ,
d 2 H p ( u ) d 2 t = p 1 p t ( u p 1 u t d x t ) u p d x t p ( u p 1 u t d x t ) 2 ( u p d x t ) 2 .
Proof. 
By the definition of p-Rényi entropy (1), we have
d H p ( u ) d t = p 1 p u p 1 u t d x t u p d x t = p 1 p u p 1 Δ u p d x u p d x , d 2 H p ( u ) d 2 t = p 1 p t ( u p 1 u t d x t ) u p d x t u p 1 u t d x t t ( u p d x t ) ( u p d x t ) 2 = p 1 p t ( u p 1 u t d x t ) u p d x t u p 1 u t d x t p u p 1 u t d x t ( u p d x t ) 2 = p 1 p t ( u p 1 u t d x t ) u p d x t p ( u p 1 u t d x t ) 2 ( u p d x t ) 2 .
Lemma 3.
We have
u p 1 Δ u p d x t = Δ u p 1 u p d x t .
Proof. 
Integrating by parts [22], we have
u p 1 Δ u p d x t = u p 1 u p d x t = Δ u p 1 u p d x t .
By Cauchy–Schwarz inequality, we have
Lemma 4. 
( Δ u p 1 u p d x t ) 2 u p d x t ( Δ u p 1 ) 2 u p d x t .
Then, we obtain
d 2 d 2 t N p ( u ) = μ n d 2 H p ( u ) d 2 t e μ n H p ( u ) + μ n d H p ( u ) d t 2 e μ n H p ( u ) = μ n e μ n H p ( u ) I 2 , n ,
where I 2 , n = d 2 H p ( u ) d 2 t + μ n d H p ( u ) d t 2 . So, by (18), (19), we have
I 2 , n = p 1 p t ( u p 1 u t d x t ) u p d x t p ( u p 1 u t d x t ) 2 ( u p d x t ) 2 + μ n ( p 1 p u p 1 Δ u p d x t u p d x t ) 2 = μ p 2 n ( 1 p ) 2 ( u p 1 Δ u p d x t ) 2 ( u p d x t ) 2 + p 1 p t ( u p 1 u t d x t ) u p d x t ( u p d x t ) 2 p 2 1 p ( u p 1 Δ u p d x t ) 2 ( u p d x t ) 2 = ( μ p 2 n ( 1 p ) 2 p 2 1 p ) ( u p 1 Δ u p d x t ) 2 ( u p d x t ) 2 + p 1 p t ( u p 1 u t d x t ) u p d x t ( u p d x t ) 2 = ( 20 ) ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 ( Δ u p 1 u p d x t ) 2 ( u p d x t ) 2 + p 1 p t ( u p 1 u t d x t ) u p d x t ( u p d x t ) 2 ( i ) ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 u p d x t ( Δ u p 1 ) 2 u p d x t ( u p d x t ) 2 + p 1 p t ( u p 1 u t d x t ) u p d x t ( u p d x t ) 2 = 1 u p d x t ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 ( Δ u p 1 ) 2 u p d x t + p 1 p t ( u p 1 u t d x t ) = 1 u p d x t ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 ( Δ u p 1 ) 2 u p + p 1 p t ( u p 1 u t ) d x t = 1 u p d x t F 2 , n d x t ,
where F 2 , n = ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 ( Δ u p 1 ) 2 u p + p 1 p t ( u p 1 u t ) .
Remark 1.
In (23), the step ( i ) is according to (21), and ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 0 should be satisfied, which is true under condition p 1 μ n . When μ : = 2 + n ( p 1 ) , ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 0 yields p 1 1 n . Savaré-Toscani [22] also used the inequality (21), but ignore the nonnegativity of the coefficient ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 ; thus, the parameter’s range p > 1 2 n in [22] should be corrected to p 1 1 n .
Furthermore, we have
F 2 , n = ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 u p a = 1 n b = 1 n [ ( 2 2 x a , t u p 1 ) ( 2 2 x b , t u p 1 ) ] + p 1 p t [ u p 1 a = 1 n ( 2 2 x a , t u p ) ] = ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 u p a = 1 n b = 1 n [ ( 2 2 x a , t u p 1 ) ( 2 2 x b , t u p 1 ) ] + p 1 p a = 1 n [ ( p 1 ) u p 2 ( 2 2 x a , t u p ) u t + p u p 1 2 2 x a , t ( u p 1 u t ) ] = ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 u p a = 1 n b = 1 n [ ( 2 2 x a , t u p 1 ) ( 2 2 x b , t u p 1 ) ] + p 1 p a = 1 n ( p 1 ) u p 2 ( 2 2 x a , t u p ) b = 1 n ( 2 2 x b , t u p ) + p u p 1 2 2 x a , t ( u p 1 b = 1 n ( 2 2 x b , t u p ) ) = ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 u p a = 1 n b = 1 n [ ( 2 2 x a , t u p 1 ) ( 2 2 x b , t u p 1 ) ] + p 1 p a = 1 n b = 1 n ( p 1 ) u p 2 ( 2 2 x a , t u p ) ( 2 2 x b , t u p ) + p u p 1 2 2 x a , t u p 1 ( 2 2 x b , t u p ) = a = 1 n b = 1 n T a , b ,
where
T a , b = ( μ n ( 1 p ) ) p 2 n ( 1 p ) 2 u p [ ( 2 2 x a , t u p 1 ) ( 2 2 x b , t u p 1 ) ] + p 1 p ( p 1 ) u p 2 ( 2 2 x a , t u p ) ( 2 2 x b , t u p ) + p u p 1 2 2 x a , t u p 1 ( 2 2 x b , t u p ) .
For convenience, introduce the notation u i , j : = i + j u i x a , t j x b , t . Then, by calculating the differentiation formulas in (25) and substituting i + j u i x a , t j x b , t = u i , j , we have T a , b = u 3 p 6 p 2 ( p 1 ) n T a , b , where
T a , b = 4 n p 4 u 0 , 1 2 u 1 , 0 2 + 2 n p 3 u u 0 , 1 2 u 2 , 0 + 8 n p 3 u u 0 , 1 u 1 , 0 u 1 , 1 + 4 n p 3 u u 0 , 2 u 1 , 0 2 15 n p 3 u 0 , 1 2 u 1 , 0 2 μ p 3 u 0 , 1 2 u 1 , 0 2 + 2 n p 2 u 2 u 0 , 1 u 2 , 1 + 2 n p 2 u 2 u 0 , 2 u 2 , 0 + 4 n p 2 u 2 u 1 , 0 u 1 , 2 + 2 n p 2 u 2 u 1 , 1 2 3 n p 2 u u 0 , 1 2 u 2 , 0 20 n p 2 u u 0 , 1 u 1 , 0 u 1 , 1 8 n p 2 u u 0 , 2 u 1 , 0 2 μ p 2 u u 0 , 1 2 u 2 , 0 μ p 2 u u 0 , 2 u 1 , 0 2 + 16 n p 2 u 0 , 1 2 u 1 , 0 2 + 5 μ p 2 u 0 , 1 2 u 1 , 0 2 + n p u 3 u 2 , 2 2 n p u 2 u 0 , 1 u 2 , 1 n p u 2 u 0 , 2 u 2 , 0 4 n p u 2 u 1 , 0 u 1 , 2 2 n p u 2 u 1 , 1 2 μ p u 2 u 0 , 2 u 2 , 0 n p u u 0 , 1 2 u 2 , 0 + 12 n p u u 0 , 1 u 1 , 0 u 1 , 1 + 2 n p u u 0 , 2 u 1 , 0 2 + 3 μ p u u 0 , 1 2 u 2 , 0 + 3 μ p u u 0 , 2 u 1 , 0 2 n p u 0 , 1 2 u 1 , 0 2 8 μ p u 0 , 1 2 u 1 , 0 2 n u 2 u 0 , 2 u 2 , 0 + μ u 2 u 0 , 2 u 2 , 0 + 2 n u u 0 , 1 2 u 2 , 0 + 2 n u u 0 , 2 u 1 , 0 2 2 μ u u 0 , 1 2 u 2 , 0 2 μ u u 0 , 2 u 1 , 0 2 4 n u 0 , 1 2 u 1 , 0 2 + 4 μ u 0 , 1 2 u 1 , 0 2 ,
which is a fourth-order differential form.
From (22)–(25), we have
d 2 d 2 t N p ( u ) p 2 μ n 2 e μ n H p ( u ) 1 u p d x t u 3 p 6 E 2 , n d x t ,
where E 2 , n = a = 1 n b = 1 n T a , b p 1 and T a , b is defined in (26). Then, the problem d 2 d 2 t N p ( u ) 0 can be transformed to u 3 p 6 E 2 , n d x t 0 . Thus, Lemma 1 is proved.

3. A Generalized Version of CREP

In this section, we prove a generalized CREP using the procedure given in Section 2.
Theorem 2.
Let u ( x t ) be a probability density in R n solving (6) and satisfying (14). Then, we give a propositional formula Φ ( n , p , μ ) such that the p-th Rényi entropy power defined in (2) satisfies
d 2 d 2 t N p ( x t ) 0 ,
under the condition Φ ( n , p , μ ) , that is N p ( x t ) is concave under Φ ( n , p , μ ) .
The proof of the above theorem consists of three steps, which are given in the following three subsections.

3.1. Reduce to a Finite Problem

We first give an inequality constraint. Denote | 2 f | 2 = i , j ( 2 f x i x j ) 2 . Then, based on the trace inequality | 2 f | 2 1 n ( Δ f ) 2 , we give an inequality constraint:
I 1 = u p u 3 p 6 | 2 u p 1 | 2 1 n ( Δ u p 1 ) 2 = a = 1 n b = 1 n I 1 , a , b 0 ,
where I 1 , a , b = u 6 2 p ( 2 u p 1 x a , t x b , t ) 2 1 n 2 u p 1 2 x a , t 2 u p 1 2 x b , t .
From (27) and (29), in order for (28) to be true, it suffices to solve
Problem 1.
Find a formula Φ ( n , p , μ ) such that
E 2 , n E ˜ 2 , n = E 2 , n + c 1 I 1 = a = 1 n b = 1 n ( 1 p 1 T a , b + c 1 I 1 , a , b ) 0 ,
under the conditions c 1 0 , p 1 μ n , R i , a , b = 0 , i = 1 , , 28 given in (15).
Since a = 1 n b = 1 n T a , b = a = 1 n b = 1 n T b , a and I 1 , a , b = R 1 , b , a ( I ) , we have
E ˜ 2 , n = 1 2 a = 1 n b = 1 n [ 1 p 1 ( T a , b + T b , a ) + c 1 ( I 1 , a , b + I 1 , b , a ) ] = 1 2 a = 1 n b = 1 n L a , b ,
where L a , b = 1 p 1 ( T a , b + T b , a ) + c 1 ( I 1 , a , b + I 1 , b , a ) .
From (30), in order to solve Problem 1, it suffices to solve
Problem 2.
Find a formula Φ ( n , p , μ ) such that L a , b 0 under the conditions c 1 0 , p 1 μ n , and R i , a , b = 0 , i = 1 , , 28 .

3.2. Simplify the Problem with the Equational Constraints

In this section, we simplify L a , b in Problem 2 with the equational constraints C 2 , n in (15). Note that the subscripts a and b are fixed and are treated as symbols.
Our goal is to reduce L a , b into a quadratic form in certain new variables. The new variables are all the monomials in R [ V a , b ] with degree 2 and total order 2:
m 1 = u u 0 , 2 , m 2 = u u 1 , 1 , m 3 = u u 2 , 0 , m 4 = u 0 , 1 2 , m 5 = u 1 , 0 u 0 , 1 , m 6 = u 1 , 0 2 ,
where V a , b is defined in (8).
We simplify the constraints in (15) as follows. A quadratic monomial in m i is called a quadratic monomial. Write monomials in C 2 , n = { R i , i = 1 , , N 1 } as quadratic monomials if possible. Performing Gaussian elimination to C 2 , n by treating the monomials as variables, and according to a monomial order such that a quadratic monomial is less than a non-quadratic monomial, we obtain
C ˜ 2 , n = C 2 , n , 1 C 2 , n , 2 ,
where C 2 , n , 1 is the set of quadratic forms in m i , C 2 , n , 2 is the set of non-quadratic forms, and Span R ( C 2 , n ) = Span R ( C ˜ 2 , n ) . We obtain C 2 , n , 1 = { R ^ i , i = 1 , , 9 } and C 2 , n , 2 = { R ˜ i , i = 1 , , 13 } , where
R ^ 1 = 2 m 1 m 5 + 2 ( 3 p 5 ) 3 m 4 m 5 , R ^ 2 = m 2 m 6 + 3 p 5 3 m 5 m 6 , R ^ 3 = 6 m 3 m 5 + 2 ( 5 3 p ) m 5 m 6 , R ^ 4 = ( 3 p 5 ) m 4 2 + 3 m 1 m 4 , R ^ 5 = ( 3 p 5 ) m 6 2 + 3 m 3 m 6 , R ^ 6 = ( 3 p 5 ) m 4 m 5 + 3 m 2 m 4 , R ^ 7 = ( 3 p 5 ) m 5 2 + 2 m 2 m 5 + m 3 m 4 , R ^ 8 = m 1 m 3 m 2 2 + 9 p 12 2 m 3 m 4 + 9 p 2 27 p + 20 2 m 5 2 , R ^ 9 = m 1 m 6 m 3 m 4 . *
R ˜ 1 = u 3 u 0 , 4 + ( 3 3 p ) m 1 2 + ( 9 p 3 36 p 2 + 47 p 20 ) m 4 2 , R ˜ 2 = u 3 u 1 , 3 + ( 3 3 p ) m 1 m 2 + ( 9 p 3 36 p 2 + 47 p 20 ) m 4 m 5 , R ˜ 3 = u 3 u 3 , 1 + ( 3 3 p ) m 2 m 3 + ( 9 p 2 + 21 p 12 ) m 3 m 5 , R ˜ 4 = u 3 u 4 , 0 + ( 3 3 p ) m 3 2 + ( 9 p 3 36 p 2 + 47 p 20 ) m 6 2 , R ˜ 5 = u 2 u 0 , 1 u 0 , 3 + m 1 2 + 9 p 2 + 27 p 20 3 m 4 2 , R ˜ 6 = u 2 u 0 , 1 u 1 , 2 + m 1 m 2 + 9 p 2 + 27 p 20 3 m 4 m 5 , R ˜ 7 = u 2 u 0 , 1 u 3 , 0 + m 2 m 3 + 9 p 2 + 27 p 20 3 m 5 m 6 , R ˜ 8 = u 2 u 1 , 0 u 0 , 3 + m 1 m 2 + 9 p 2 + 27 p 20 3 m 4 m 5 , R ˜ 9 = u 2 u 1 , 0 u 2 , 1 + m 2 m 3 + 9 p 2 + 27 p 20 3 m 5 m 6 , R ˜ 10 = u 2 u 1 , 0 u 3 , 0 + m 3 2 + 9 p 2 + 27 p 20 3 m 6 2 , R ˜ 11 = u 3 u 2 , 2 + ( 3 3 p ) m 2 2 + 9 p 2 21 p + 12 2 m 3 m 4 + 27 p 3 108 p 2 + 141 p 60 2 m 5 2 , R ˜ 12 = u 2 u 0 , 1 u 2 , 1 + m 2 2 + 4 3 p 2 m 3 m 4 + 9 p 2 + 27 p 20 2 m 5 2 , R ˜ 13 = u 2 u 1 , 0 u 1 , 2 + m 2 2 + 4 3 p 2 m 3 m 4 + 9 p 2 + 27 p 20 2 m 5 2 .
We now simplify L a , b using C 2 , n , 1 and C 2 , n , 2 . Eliminating the non-quadratic monomials in L a , b using C 2 , n , 2 , and performing further reduction by C 2 , n , 1 , we have
L ^ a , b = L a , b 2 ( p 3 c 1 + 4 n p 2 4 p 2 c 1 6 n p + 5 p c 1 2 c 1 ) R ^ 7 2 n ( 2 n 2 p p 2 c 1 + n 2 n μ + 2 p c 1 c 1 ) R ^ 8 1 n ( 6 n 2 p 2 2 p 3 c 1 5 n 2 p 2 n p μ + 8 p 2 c 1 4 n 2 + 4 n μ 10 p c 1 + 4 c 1 ) R ^ 9 2 n p p 1 R ˜ 11 6 n p R ˜ 12 6 n p R ˜ 13 = ( 2 n p + 2 n 2 μ ) m 2 2 + ( 5 n p 5 n p 2 + 5 p μ + 4 n 4 μ ) m 3 m 4 + ( 18 n p 2 7 n p 3 + 7 p 2 μ 3 n p 19 p μ 12 n + 12 μ ) m 5 2 + c 1 n [ ( 2 n 2 ) ( p 2 2 p + 1 ) m 2 2 + ( 4 n 2 n p + 5 p 4 ) ( p 2 2 p + 1 ) m 3 m 4 + ( 14 n p 4 n p 2 + 7 p 2 12 n 19 p + 12 ) ( p 2 2 p + 1 ) m 5 2 ] .
In order for L ^ a , b 0 to be true, we need to eliminate the monomial m 3 m 4 from L ^ a , b , which can be done with R ^ 7 as follows.
L ^ a , b + p 7 R ^ 7 = A 1 m 2 2 + A 2 m 2 m 5 + A 3 m 5 2 ,
where
p 7 = ( 2 n p 3 c 1 + 5 n 2 p 2 8 n p 2 c 1 5 p 3 c 1 5 n 2 p 5 n p μ + 10 n p c 1 + 14 p 2 c 1 4 n 2 + 4 n μ 4 n c 1 13 p c 1 + 4 c 1 ) / n , A 1 = 2 c 1 p 2 / n + 4 c 1 p / n + 2 n p + 2 c 1 + 2 c 1 p 2 4 c 1 p 2 c 1 / n 2 μ + 2 n , A 2 = 4 c 1 p 3 16 c 1 p 2 10 c 1 p 3 / n 10 p μ + 20 c 1 p + 28 c 1 p 2 / n 26 c 1 p / n + 10 n p 2 10 n p + 8 μ 8 c 1 + 8 c 1 / n 8 n , A 3 = 8 μ + 8 n + 26 c 1 p 2 24 c 1 p 8 c 1 / n 12 c 1 p 3 + 2 c 1 p 4 + 8 c 1 52 c 1 p 2 / n + 34 c 1 p / n + 34 c 1 p 3 / n 8 c 1 p 4 / n + 18 p μ + 8 n p 3 22 n p 2 8 p 2 μ + 10 n p .

3.3. Compute Φ ( n , p , μ )

From (32), in order to solve Problem 2, it suffices to solve
Problem 3.
Find a propositional formula Φ ( n , p , μ ) such that
Φ ( n , p , μ ) c 1 ( c 1 0 p 1 μ n A 1 m 2 2 + A 2 m 2 m 5 + A 3 m 5 2 0 ) .
In principle, Problem 3 can be solved with the quantifier elimination [24]. In this paper, the problem is special, and an explicit proof is given.
By the knowledge of linear algebra, A 1 m 2 2 + A 2 m 2 m 5 + A 3 m 5 2 0 is equivalent to Δ 1 = A 1 = 2 n s 1 0 , Δ 2 = A 3 = 2 n s 2 0 , Δ 3 = A 1 A 3 1 4 A 2 2 = p n 2 s 3 0 , where
s 1 = ( p 1 ) 2 ( n 1 ) c 1 + n 2 ( p + 1 ) n μ , s 2 = ( p 1 ) 2 ( n ( p 2 ) 2 4 p 2 + 9 p 4 ) c 1 + n 2 ( 4 p 3 11 p 2 + 5 p + 4 ) ( 4 p 2 9 p + 4 ) n μ , s 3 = ( 4 9 p ) n 2 ( μ μ 3 ) ( μ μ 4 ) ,
and μ 3 and μ 4 are defined in (37). Furthermore, p 4 9 is assumed in μ 4 . Thus, the following lemma is proved.
Lemma 5.
We have
Φ ( n , p , μ ) c 1 ( c 1 0 , s 1 0 , s 2 0 , s 3 0 , p 1 μ / n ) .
We present an explicit formula for Φ in (34). First, we introduce the following parameters.
n 1 = 9 17 8 , n 2 = 9 + 17 8 , n 3 = ( 17 + 1 ) / 2 , θ 1 = 2 n ( p 1 ) 2 , θ 2 = 2 n 2 p ( 9 p 13 ) ( p 1 ) 2 ( 4 n + 9 p 4 ) , θ 3 = ( 17 9 ) n , θ 4 = n 2 p n 2 n μ ( p 1 ) 2 , θ 5 = n 2 ( 9 p 2 13 p 4 ) n ( 9 p 4 ) μ ( p 1 ) 2 ( 4 n + 9 p 4 ) , θ 6 = 4 n ( 17 1 ) μ + 8 n 2 17 + 1 , θ 7 = n ( 1 p ) , θ 8 = 5 n / 9 , θ 9 = 162 n 25 , θ 10 = 64 n 17 9 , θ 11 = 8 ( 9 17 + 23 ) n 2 32 n 49 + 9 17 , θ 12 = 16 ( 11 17 + 47 ) n μ + 152 n 2 26 17 n + 73 17 + 118 n + 305 , θ 13 = 4 n ( μ 17 + 2 n + μ ) 17 1 , θ 14 = 8 n ( 22 μ 17 19 n 94 μ ) 26 17 n + 73 17 118 n 305 , θ 15 = 9 5 n 2 81 25 μ n , θ 16 = ( 17 1 ) n / 8 , ϕ 1 p 1 1 n , ϕ 2 μ = 2 + n ( p 1 ) , ϕ 3 p > 1 1 n .
We define Φ in (34) using Table 1, where * means . Define T ( i , j ) to be the formula in the i-th row and the j-th column in Table 1. Then, we denote
T ( i , j ) T ( i , 1 ) T ( i , j ) for i = 1 , , 8 , j = 2 , 3 , 4 .
For example, T ( 1 , 2 ) is p > n 2 θ 4 > θ 1 θ 5 0 , which means that if p , n , μ satisfy T ( 1 , 2 ) , then there exists a c 1 0 such that (33) is true and the CREP is valid. T ( 1 , 3 ) = , which means that there exist no values for p , n , μ such that (33), and the CREP is true in this case.
We now give the main result of the paper, which implies Theorem 2. The proof for the theorem can be found in Section 3.5.
Theorem 3.
The sufficient and necessary condition for Problem 3— that is, (33) must be true—is
Φ ( n , p , μ ) = i = 1 8 j = 2 4 T ( i , j ) ,
where T ( i , j ) is defined in (36) and ∨ means disjunction.

3.4. Compare with Existing Results

We show that our result includes the result proved in [22] and more essential results.
In [22], the CREP was proved under the conditions μ = 2 + n ( p 1 ) and p 1 1 n . Obviously, the result proved in [22] is a special case of T ( i , 4 ) , i = 1 , , 8 in Table 1.
We can also prove the result in [22] directly as follows. Set μ = 2 + n ( p 1 ) and c 1 = 2 n ( p 1 ) 2 0 in (31), we obtain L ^ a , b = 0 . In addition, the condition p 1 μ n implies p 1 1 n . So, when μ = 2 + n ( p 1 ) and p 1 1 n , the CREP is proved based on our proof procedure.
We can use the SDP code in ([15], Appendix B) to verify the result in Table 1 for given values of μ , p , n . For instance, for μ = 2 , p = 11 5 , n = 2 , the condition p 1 μ n is satisfied naturally. With the SDP code in [15], we obtain L ^ a , b + 172 25 R ^ 7 = ( 2 2 m 2 + 344 100 2 m 5 ) 2 + 22 625 m 5 2 0 with c 1 = 5 9 . Thus, the CREP is proved when μ = 2 , p = 11 5 , n = 2 . This case [ μ = 2 , p = 11 5 , n = 2 , c 1 = 5 9 ] is included in T ( 1 , 2 ) in Table 1. Note that μ = 2 + n ( p 1 ) is not satisfied for these parameters, and thus our condition Φ ( n , p , μ ) is strictly larger than those given in [22]. More precisely, the points ( n , p , μ ) satisfying the conditions μ = 2 + n ( p 1 ) , p 1 1 n given in [22] consist of a two-dimensional subset of R 3 , while the points satisfying the condition Φ ( n , p , μ ) consist of a three-dimensional subset of R 3 , as shown by the following result.
Property 2.
The points satisfying the condition Φ ( n , p , μ ) consist of a three-dimensional subset of R 3 .
Proof. 
We show that the points satisfying T ( 1 , 2 ) consist of a three-dimensional subset of R 3 .
From Table 1, we have T ( 1 , 2 ) = [ F 1 > 0 F 2 > 0 F 3 0 ] , where F 1 = p 9 + 17 8 , F 2 = n 2 p n 2 n μ ( p 1 ) 2 + 2 n ( p 1 ) 2 , F 3 = n 2 ( 9 p 2 13 p 4 ) n ( 9 p 4 ) μ ( p 1 ) 2 ( 4 n + 9 p 4 ) . Under the condition F 1 > 0 , we can reduce the inequality F 2 > 0 to the form μ < 2 + n ( p 1 ) and reduce the inequality F 3 0 to the form μ n ( 9 p 2 13 p 4 ) 9 p 4 . Thus, T ( 1 , 2 ) = [ p > 9 + 17 8 n ( 9 p 2 13 p 4 ) 9 p 4 μ < n ( p 1 ) + 2 ] . Since n ( p 1 ) + 2 n ( 9 p 2 13 p 4 ) 9 p 4 = 8 n + 2 ( 9 p 4 ) 9 p 4 > 0 under the condition p > 9 + 17 8 , T ( 1 , 2 ) defines a three-dimensional subset of R 3 . □

3.5. Proof of Theorem 3

In order to make the proof precise, we introduce the following parameters:
μ 1 = ( ( p 1 ) 2 ( n 1 ) c 1 + n 2 ( p + 1 ) ) / n , μ 2 = ( ( p 1 ) 2 ( n ( p 2 ) 2 4 p 2 + 9 p 4 ) c 1 + n 2 ( 4 p 3 11 p 2 + 5 p + 4 ) ) / ( n ( 4 p 2 9 p + 4 ) ) μ 3 = ( n 2 p p 2 c 1 n 2 + 2 p c 1 c 1 ) / n , μ 4 = ( 9 n 2 p 2 4 n p 2 c 1 9 p 3 c 1 13 n 2 p + 8 n p c 1 + 22 p 2 c 1 4 n 2 4 n c 1 17 p c 1 + 4 c 1 ) / ( n ( 9 p 4 ) ) , μ 5 = ( n c 1 17 c 1 17 + 136 n 2 + 17 n c 1 17 c 1 ) / ( 4 n ( 17 17 ) ) , μ 6 = ( c 1 17 8 n 2 + c 1 ) / ( 4 n ( 17 1 ) ) , μ 7 = ( 26 n c 1 17 + 73 c 1 17 + 152 n 2 + 118 n c 1 + 305 c 1 ) / ( 16 n ( 11 17 + 47 ) ) , μ 8 = ( n c 1 17 c 1 17 136 n 2 17 n c 1 + 17 c 1 ) / ( 4 n ( 17 + 17 ) ) , μ 9 = ( c 1 17 + 8 n 2 c 1 ) / ( 4 n ( 17 + 1 ) ) , μ 10 = ( 26 n c 1 17 + 73 c 1 17 152 n 2 118 n c 1 305 c 1 ) / ( 16 n ( 11 17 47 ) ) , μ 11 = ( 117 n 2 + 25 n c 1 25 c 1 ) / ( 81 n ) , μ 12 = ( 7218 n 2 + 1225 n c 1 400 c 1 ) / ( 1296 n ) , μ 13 = ( 5 ( 9 n 2 + 5 c 1 ) ) / ( 81 n ) , η 1 = 2 n 2 p 1 , η 2 = 16 n 2 17 1 , η 3 = 18 5 n 2 .
We first treat the three inequalities s 1 0 , s 2 0 , s 3 0 . Firstly, s 1 0 is equivalent to μ μ 1 . Secondly, since the roots of 4 p 2 9 p + 4 = 0 are n 1 and n 2 , we have s 2 0 μ μ 2 if p < n 1 or p > n 2 ; and s 2 0 μ μ 2 if n 1 < p < n 2 . In order to analyze s 3 0 , we first compute
μ 3 μ 4 = 4 ( ( p 1 ) 2 c 1 + 2 n ) 9 p 4 .
Therefore, s 3 0 can be divided into four cases: s 3 0 μ 4 μ μ 3 if p > 4 9 and θ 1 < c 1 ; s 3 0 μ 3 μ μ 4 if p > 4 9 and c 1 < θ 1 ; s 3 0 μ μ 3 or μ μ 4 if p < 4 9 and c 1 < θ 1 ; s 3 0 μ μ 4 or μ μ 3 if p < 4 9 and θ 1 < c 1 . Finally, p 1 μ n is equivalent to μ θ 7 .
Based on the above analysis and (34), Φ ( n , p , μ ) can be divided into six cases:
Φ ( n , p , μ ) max ( μ 4 , θ 7 ) μ min ( μ 1 , μ 2 , μ 3 ) , if ( p ( 4 9 , n 1 ) or p > n 2 ) and θ 1 < c 1 0 ; Φ ( n , p , μ ) max ( μ 2 , μ 4 , θ 7 ) μ min ( μ 1 , μ 3 ) , if p ( n 1 , n 2 ) or θ 1 < c 1 0 ; Φ ( n , p , μ ) max ( μ 3 , θ 7 ) μ min ( μ 1 , μ 2 , μ 4 ) , if ( p ( 4 9 , n 1 ) or p > n 2 ) or c 1 < θ 1 ; Φ ( n , p , μ ) max ( μ 2 , μ 3 , θ 7 ) μ min ( μ 1 , μ 4 ) , if p ( n 1 , n 2 ) or c 1 < θ 1 ; Φ ( n , p , μ ) θ 7 μ min ( μ 1 , μ 2 , μ 4 ) or max ( μ 3 , θ 7 ) μ min ( μ 1 , μ 2 ) , if p < 4 9 or c 1 < θ 1 ; Φ ( n , p , μ ) θ 7 μ min ( μ 1 , μ 2 , μ 3 ) or max ( μ 4 , θ 7 ) μ min ( μ 1 , μ 2 ) , if p < 4 9   or   θ 1 < c 1 0 .
The special cases p = 4 9 , n 1 , n 2 , and c = θ 1 need to be considered differently.
Below, we give a detailed analysis of the above six cases, which leads to the results in Table 1. We first have the following formulas:
μ 1 μ 3 = ( p 1 ) 2 c 1 + 2 n ,
μ 1 μ 4 = 9 p ( ( p 1 ) 2 c 1 + 2 n ) 9 p 4 ,
μ 2 μ 3 = 2 ( p 2 ) 2 ( ( 1 / 2 ) ( p 1 ) 2 c 1 + n ) ( 4 p 2 9 p + 4 ) ,
μ 2 μ 4 = p ( 3 p 4 ) 2 ( ( p 1 ) 2 c 1 + 2 n ) ( 4 p 2 9 p + 4 ) ( 9 p 4 ) ,
μ 4 θ 7 = ( p 1 ) 2 ( 4 n + 9 p 4 ) c 1 + 2 n 2 p ( 9 p 13 ) n ( 9 p 4 ) ,
μ 3 θ 7 = ( p 1 ) ( 2 n 2 p c 1 + c 1 ) n ,
θ 2 θ 1 = 18 n ( n p n + 1 ) ( p 4 9 ) ( p 1 ) 2 ( 4 n + 9 p 4 ) ,
θ 1 η 1 = 2 n ( n p n + 1 ) ( p 1 ) 2 ,
η 1 θ 2 = 8 n 2 ( n p n + 1 ) ( p 1 ) 2 ( 4 n + 9 p 4 ) .
Firstly, we have the following formulas which eliminate c 1 .
μ μ 3 c 1 θ 4 , μ μ 4 c 1 θ 5 , if p > 4 9 , μ μ 4 c 1 θ 5 , if p < 4 9 , μ μ 4 c 1 θ 5 , if p > 4 9 , μ μ 4 c 1 θ 5 , if p < 4 9 , μ μ 6 c 1 θ 6 , μ μ 7 c 1 θ 12 , μ μ 9 c 1 θ 13 , μ μ 10 c 1 θ 14 , μ μ 13 c 1 θ 15 .
We divide the proof into several cases, first according to the values of c 1 and then according to the values of n.
Case 1: θ 1 < c 1 0 . From (40), we have μ 1 > μ 3 in this case and from (39), Φ ( n , p , μ ) simplifies to three cases:
Φ ( n , p , μ ) max ( μ 4 , θ 7 ) μ min ( μ 2 , μ 3 ) , if p ( 4 9 , n 1 ) or p > n 2 ;
Φ ( n , p , μ ) max ( μ 2 , μ 4 , θ 7 ) μ μ 3 , if p ( n 1 , n 2 ) ;
Φ ( n , p , μ ) θ 7 μ min ( μ 2 , μ 3 ) or max ( μ 4 , θ 7 ) μ min ( μ 1 , μ 2 ) , if p < 4 9 .
According to the vales of p, we consider seven cases below.
Case 1.1: θ 1 < c 1 0 and p > n 2 . In this case, from (42) and (44), we have μ 2 μ 3 and μ 4 > θ 7 . Hence, Φ ( n , p , μ ) μ 4 μ μ 3 .
We now eliminate c 1 from Φ ( n , p , μ ) ( p > n 2 θ 1 < c 1 0 μ 4 μ μ 3 ) . By (49), μ 4 μ μ 3 is equivalent to θ 5 c 1 θ 4 . c 1 ( θ 5 c 1 θ 4 θ 1 < c 1 0 ) is equivalent to ( θ 4 > θ 1 θ 5 0 ). Therefore, in this case, Φ ( n , p , μ ) ( p > n 2 θ 4 > θ 1 θ 5 0 ) , and T ( 1 , 2 ) is proved.
Case 1.2: θ 1 < c 1 0 and p = n 2 . When p = n 2 , we have θ 1 = θ 3 , s 2 = 1 1024 ( 7 17 33 ) ( c 1 17 + 64 n + 9 c 1 ) n . Then, s 2 0 c 1 θ 3 . Because θ 1 < c 1 0 and p = n 2 > 4 9 , we have s 3 0 μ 4 μ μ 3 . By (44), we have μ 4 > θ 7 . When p = n 2 , we have μ 3 = μ 6 and μ 4 = μ 7 . Thus Φ ( n , p , μ ) ( θ 3 < c 1 0 , μ 7 μ μ 6 ) .
We now eliminate c 1 from Φ ( n , p , μ ) ( p = n 2 θ 3 < c 1 0 μ 7 μ μ 6 ) . By (49), μ 7 μ μ 6 is equivalent to θ 12 c 1 θ 6 . c 1 ( θ 12 c 1 θ 6 θ 3 < c 1 0 ) is equivalent to θ 6 > θ 3 and θ 12 0 . Therefore, in this case, Φ ( n , p , μ ) ( p = n 2 θ 6 > θ 3 θ 12 0 ) , and T ( 2 , 2 ) is proved.
Case 1.3: θ 1 < c 1 0 and p ( n 1 , n 2 ) , p 1 . This case is divided into two sub-cases.
Case 1.3.1: θ 1 < c 1 0 and p ( 13 9 , n 2 ) . By (43) and (44), we have μ 4 > μ 2 and μ 4 > θ 7 . Hence, Φ ( n , p , μ ) μ 4 μ μ 3 .
We now eliminate c 1 from Φ ( n , p , μ ) ( p ( 13 9 , n 2 ) θ 1 < c 1 0 μ 4 μ μ 3 ) . Similar to Case 1.1, we have Φ ( n , p , μ ) ( p ( 13 9 , n 2 ) θ 4 > θ 1 θ 5 0 ) , T ( 3 , 2 ) is proved.
Case 1.3.2: θ 1 < c 1 0 and p ( n 1 , 13 9 ] , p 1 . By (43)–(46), we have μ 4 μ 2 , ( μ 3 θ 7 c 1 η 1 ), ( μ 4 θ 7 c 1 θ 2 ) and ( θ 2 > θ 1 ϕ 3 ). Hence Φ ( n , p , μ ) max ( μ 4 , θ 7 ) μ μ 3 . This case is further divided into two sub-cases.
Case 1.3.2.1: If c 1 θ 2 , then μ 4 μ 5 , and Φ ( n , p , μ ) μ 4 μ μ 3 . Thus, we need θ 1 < θ 2 , which yields ϕ 3 . Thus, Φ ( n , p , μ ) ( θ 1 < c 1 θ 2 , ϕ 3 , μ 4 μ μ 3 ) .
We now eliminate c 1 from Φ ( n , p , μ ) ( p ( n 1 , 13 9 ) , p 1 , ϕ 3 , θ 1 < c 1 θ 2 , μ 4 μ μ 3 ) . Like Case 1.1, we have Φ ( n , p , μ ) ( p ( n 1 , 13 9 ) p 1 ϕ 3 θ 4 > θ 1 θ 5 θ 2 ) , and T ( 4 , 2 ) is proved
Case 1.3.2.2: If c 1 θ 2 , then μ 4 θ 7 , and Φ ( n , p , μ ) θ 7 μ μ 3 . Thus, we need θ 7 μ 3 , which yields c 1 η 1 . By (47), we know η 1 > θ 1 results in ϕ 3 , which yields θ 1 < θ 2 < η 1 . Thus, Φ ( n , p , μ ) ( θ 2 < c 1 min ( 0 , η 1 ) , ϕ 3 , θ 7 μ μ 3 ) .
We now eliminate c 1 from Φ ( n , p , μ ) ( p ( n 1 , 13 9 ) , p 1 , ϕ 3 , θ 2 < c 1 min ( 0 , η 1 ) , θ 7 μ μ 3 ) . θ 7 μ μ 3 is equivalent to θ 7 μ and c 1 θ 4 . c 1 ( c 1 θ 4 θ 2 < c 1 min ( 0 , η 1 ) ) is equivalent to θ 4 > θ 2 . Therefore, in this case, Φ ( n , p , μ ) ( p ( n 1 , 13 9 ) p 1 ϕ 3 θ 7 μ θ 4 > θ 2 ) , and T ( 4 , 3 ) is proved.
Case 1.4: θ 1 < c 1 0 and p = n 1 . When p = n 1 , we have θ 1 = θ 10 , θ 2 = θ 11 , η 1 = η 2 , s 2 = 1 1024 ( 33 + 7 17 ) ( c 1 17 64 n 9 c 1 ) n . Then s 2 0 c 1 θ 10 . Because θ 1 < c 1 0 and p = n 1 > 4 9 , we have s 3 0 μ 4 μ μ 3 . By (44), we have μ 4 θ 7 c 1 θ 2 .
Case 1.4.1: Similar to Case 1.3.2.1, Φ ( n , p , μ ) ( θ 1 < c 1 θ 2 , ϕ 3 , μ 4 μ μ 3 ) . When p = n 1 , we have μ 3 = μ 9 , μ 4 = μ 10 , ϕ 3 n < n 3 . Thus Φ ( n , p , μ ) ( θ 10 < c 1 θ 11 , n < n 3 , μ 10 μ μ 9 ) .
We now eliminate c 1 from Φ ( n , p , μ ) ( p = n 1 , θ 10 < c 1 θ 11 , n < n 3 , μ 10 μ μ 9 ) . μ 10 μ μ 9 is equivalent to θ 14 c 1 θ 13 . c 1 ( θ 14 c 1 θ 13 θ 10 < c 1 θ 11 ) is equivalent to θ 13 > θ 10 and θ 14 θ 11 . Therefore, in this case Φ ( n , p , μ ) ( p = n 1 n < n 3 θ 13 > θ 10 θ 14 θ 11 ) , and T ( 5 , 2 ) is proved.
Case 1.4.2: Similar to Case 1.3.2.2, Φ ( n , p , μ ) ( θ 2 < c 1 min ( 0 , η 1 ) , ϕ 3 , μ 5 μ μ 3 ) . When p = n 1 , we have θ 7 = θ 16 . Thus, Φ ( n , p , μ ) ( θ 11 < c 1 η 2 , n < n 3 , θ 16 μ μ 9 ) .
We now eliminate c 1 from Φ ( n , p , μ ) ( p = n 1 , θ 11 < c 1 η 2 , n < n 3 , θ 16 μ μ 9 ) . θ 16 μ μ 9 is equivalent to c 1 θ 13 and μ θ 16 . c 1 ( c 1 θ 13 θ 11 < c 1 η 2 ) is equivalent to θ 13 > θ 11 . Therefore, in this case, Φ ( n , p , μ ) ( p = n 1 n < n 3 θ 13 > θ 11 μ θ 16 ) , and T ( 5 , 3 ) is proved.
Case 1.5: θ 1 < c 1 0 and p ( 4 9 , n 1 ) . By (42) and (44), we have μ 2 > μ 3 and ( μ 4 θ 7 c 1 θ 2 ). Hence Φ ( n , p , μ ) max ( μ 4 , θ 7 ) μ μ 3 .
Case 1.5.1: Similar to Case 1.3.2.1, we have Φ ( n , p , μ ) ( θ 1 < c 1 θ 2 , ϕ 3 , μ 4 μ μ 3 ) .
We now eliminate c 1 from Φ ( n , p , μ ) ( p ( 4 9 , n 1 ) , ϕ 3 , θ 1 < c 1 θ 2 , μ 4 μ μ 3 ) . Like Case 1.3.2.1, we have Φ ( n , p , μ ) ( p ( 4 9 , n 1 ) ϕ 3 θ 4 > θ 1 θ 5 θ 2 ) , and T ( 6 , 2 ) is proved
Case 1.5.2: Similar to Case 1.3.2.2, we have Φ ( n , p , μ ) ( θ 2 < c 1 η 1 , ϕ 3 , μ 5 μ μ 3 ) .
We now eliminate c 1 from Φ ( n , p , μ ) ( p ( 4 9 , n 1 ) , ϕ 3 , θ 2 < c 1 η 1 , θ 7 μ μ 3 ) . Like Case 1.3.2.2, we have Φ ( n , p , μ ) ( p ( 4 9 , n 1 ) ϕ 3 θ 7 μ θ 4 > θ 2 ) , and T ( 6 , 3 ) is proved.
Case 1.6: θ 1 < c 1 0 and p = 4 9 . When p = 4 9 , we have θ 1 = θ 9 , η 1 = η 3 , θ 7 = θ 8 , s 3 = 4 n 6561 ( 162 n + 25 c 1 ) ( 45 n 2 + 81 n u + 25 c 1 ) . Then s 3 0 μ μ 13 if c 1 θ 9 . By (45), we know μ 3 θ 7 c 1 η 1 . And θ 9 < η 3 n = 1 . Thus Φ ( n , p , μ ) ( θ 9 < c 1 η 3 , n = 1 , θ 8 μ μ 13 ) .
We now eliminate c 1 from Φ ( n , p , μ ) ( p = 4 9 , θ 9 < c 1 η 3 , n = 1 , θ 8 μ μ 13 ) . θ 8 μ μ 13 is equivalent to c 1 θ 15 and μ θ 8 . c 1 ( c 1 θ 15 θ 9 < c 1 η 3 ) is equivalent to θ 15 > θ 9 . Therefore, in this case Φ ( n , p , μ ) ( p = 4 9 n = 1 θ 15 > θ 9 μ θ 8 ) , and T ( 7 , 2 ) is proved
Case 1.7: θ 1 < c 1 0 and 0 < p < 4 9 .
Case 1.7.1: If we select θ 7 μ min ( μ 2 , μ 3 ) , by (42), we have μ 2 > μ 3 . Thus, Φ ( n , p , μ ) θ 7 μ μ 3 . So, we need θ 7 μ 3 , which yields c 1 η 1 . By (47), we know η 1 > θ 1 results in ϕ 3 , which yields n = 1 with 0 < p < 4 9 . Thus Φ ( n , p , μ ) ( θ 1 < c 1 η 1 , n = 1 , θ 7 μ μ 3 ) .
We now eliminate c 1 from Φ ( n , p , μ ) ( p ( 0 , 4 9 ) , n = 1 , θ 1 < c 1 η 1 , θ 7 μ μ 3 ) . Like Case 1.3.2.2, we have Φ ( n , p , μ ) ( p ( 0 , 4 9 ) n = 1 θ 7 μ θ 4 > θ 1 ) , and T ( 8 , 2 ) is proved.
Case 1.7.2: If we select max ( μ 4 , θ 7 ) μ min ( μ 1 , μ 2 ) , by (41), we have μ 1 < μ 4 , which yields a contradiction.
Case 2: c 1 < θ 1 . From (40), we have μ 1 < μ 3 in this case, and from (35), Φ ( n , p , μ ) simplifies to one case: Φ ( n , p , μ ) θ 7 μ min ( μ 1 , μ 2 , μ 4 ) , if 0 < p < 4 9 and c 1 < θ 1 . Since p satisfies 0 < p < 4 9 , we need only consider the following cases.
Case 2.1: c 1 < θ 1 and 0 < p < 4 9 . By (41), (43) and (44), we have μ 1 > μ 4 , μ 2 > μ 4 and ( μ 4 θ 7 c 1 θ 2 ). Then, we need θ 2 < θ 1 , which yields ϕ 3 by (46). Because ϕ 3 means n = 1 with 0 < p < 4 9 , we have Φ ( n , p , μ ) ( θ 2 c 1 < θ 1 , n = 1 , θ 7 μ μ 4 ) .
We now eliminate c 1 from Φ ( n , p , μ ) ( p ( 0 , 4 9 ) , n = 1 , θ 2 c 1 < θ 1 , θ 7 μ μ 4 ) . θ 7 μ μ 4 is equivalent to c 1 θ 5 and μ θ 7 . c 1 ( c 1 θ 5 θ 2 c 1 < θ 1 ) is equivalent to θ 5 < θ 1 . Therefore, in this case, Φ ( n , p , μ ) ( p ( 0 , 4 9 ) n = 1 θ 5 < θ 1 μ θ 7 ) , and T ( 8 , 3 ) is proved.
Case 2.2: c 1 < θ 1 and p = n 2 . In Case 1.5, we know that θ 1 = θ 3 with p = n 2 , and s 2 0 c 1 θ 3 , which yields a contradiction.
Case 2.3: c 1 < θ 1 and p = n 1 . In Case 1.6, we know that θ 1 = θ 10 with p = n 1 , and s 2 0 c 1 θ 10 , which yields a contradiction.
Case 2.4: c 1 < θ 1 and p = 4 9 . We have θ 1 = θ 9 , μ 2 = μ 12 , μ 3 = μ 13 based on p = 4 9 . Then, we have ( s 2 0 μ μ 12 ) and ( s 3 0 μ μ 13 if c 1 θ 9 ). So, we need μ 12 μ 13 . By (42), we have μ 12 < μ 13 , which yields a contradiction.
Case 3: c 1 = θ 1 . When c 1 = θ 1 , we have s 1 = n ( n p n μ + 2 ) , s 2 = n ( 4 p 2 9 p + 4 ) ( n p n μ + 2 ) and s 3 = n 2 ( 9 p 4 ) ( n p n μ + 2 ) 2 . Thus, s 1 0 μ 2 + n ( p 1 ) and s 3 0 ( p 4 9 or μ = 2 + n ( p 1 ) ) .
Case 3.1: If μ = 2 + n ( p 1 ) , then s 1 = s 2 = s 3 = 0 . Furthermore, p 1 μ n ϕ 1 . Thus, Φ ( n , p , μ ) ( c 1 = θ 1 , ϕ 1 , ϕ 2 ) , and T ( i , 4 ) , i = 1 , , 6 are proved.
Case 3.2: If p 4 9 , then s 2 0 μ 2 + n ( p 1 ) . Then, we need 2 + n ( p 1 ) μ 5 , which yields ϕ 1 . And ϕ 1 implies n = 1 with p 4 9 . Thus, Φ ( n , p , μ ) ( c 1 = θ 1 , n = 1 , p μ 1 p ) , and T ( 7 , 4 ) , T ( 8 , 4 ) are proved.

4. Conclusions

This paper is an extension of the work [15,16,17] to the case where the entropy power involves parameters. The basic idea is to prove entropy power inequalities in a systematic way. Precisely, the concavity of Rényi entropy power is considered, where the probability density u t solves the nonlinear heat equation with two parameters p and μ . Our procedure reduces the proof of the CREP to checking the semi-positiveness of a quadratic form (33) whose coefficients are polynomials in the parameters n , p , μ . In principle, a necessary and sufficient condition on parameters n , p , μ for this can be computed with the quantifier elimination [24]. Some interesting works [26,27] can help to understand our approach in this paper.
Based on the above method, we give a sufficient condition Φ ( n , p , μ ) for the CREP, which extends the parameter’s range of the CREP given by Savaré-Toscani [22]. By Theorem 3, our results give the necessary and sufficient condition for the CREP under certain conditions. However, in the general case, Theorem 1 only gives a sufficient condition for the following reasons: Problem 1 may not be equivalent to Problem 2, and more constraints may exist.
For future research, it is interesting to see whether the three conjectures about Costa’s differential entropy studied in [17] can be generalized to this more general case.

Author Contributions

Conceptualization, L.G.; Formal analysis, L.G., C.-M.Y. and X.-S.G.; Funding acquisition, L.G., C.-M.Y. and X.-S.G.; Investigation, L.G. and X.-S.G.; Methodology, L.G.; Project administration, X.-S.G.; Resources, L.G.; Software, L.G.; Supervision, X.-S.G. All authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by NSFC 11688101 and NKRDP 2018YFA0704705, Beijing Natural Science Foundation (No. Z190004), and the Fundamental Research Funds for the Central Universities 2021NTST32.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A. Constraints in (15)

In this appendix, we give the constraints in (15), where u h 1 , h 2 = h 1 + h 2 u h 1 x a , t h 2 x b , t .
R 1 , a , b = 3 p u 1 , 0 4 + 3 u u 2 , 0 u 1 , 0 2 5 u 1 , 0 4 ,
R 2 , a , b = 3 p u 0 , 1 4 + 3 u u 0 , 2 u 0 , 1 2 5 u 0 , 1 4 ,
R 3 , a , b = 3 p u 2 u 1 , 0 u 3 , 0 + u 3 u 4 , 0 3 u 2 u 1 , 0 u 3 , 0 ,
R 4 , a , b = 3 p u 2 u 0 , 1 u 3 , 0 + u 3 u 3 , 1 3 u 2 u 0 , 1 u 3 , 0 ,
R 5 , a , b = 3 p u 2 u 1 , 0 u 2 , 1 + u 3 u 3 , 1 3 u 2 u 1 , 0 u 2 , 1 ,
R 6 , a , b = 3 p u 2 u 0 , 1 u 2 , 1 + u 3 u 2 , 2 3 u 2 u 0 , 1 u 2 , 1 ,
R 7 , a , b = 3 p u 2 u 1 , 0 u 1 , 2 + u 3 u 2 , 2 3 u 2 u 1 , 0 u 1 , 2 ,
R 8 , a , b = 3 p u 2 u 0 , 1 u 1 , 2 + u 3 u 1 , 3 3 u 2 u 0 , 1 u 1 , 2 ,
R 9 , a , b = 3 p u 2 u 1 , 0 u 0 , 3 + u 3 u 1 , 3 3 u 2 u 1 , 0 u 0 , 3 ,
R 10 , a , b = 3 p u 2 u 0 , 1 u 0 , 3 + u 3 u 0 , 4 3 u 2 u 0 , 1 u 0 , 3 ,
R 11 , a , b = 3 p u 0 , 1 u 1 , 0 3 + 3 u u 1 , 1 u 1 , 0 2 5 u 1 , 0 3 u 0 , 1 ,
R 12 , a , b = 3 p u 0 , 1 3 u 1 , 0 + 3 u u 1 , 1 u 0 , 1 2 5 u 0 , 1 3 u 1 , 0 ,
R 13 , a , b = 3 p u 0 , 1 2 u 1 , 0 2 + 2 u u 0 , 1 u 1 , 0 u 1 , 1 + u u 1 , 0 2 u 0 , 2 5 u 1 , 0 2 u 0 , 1 2 ,
R 14 , a , b = 3 p u u 1 , 0 2 u 2 , 0 + u 2 u 1 , 0 u 3 , 0 + u 2 u 2 , 0 2 4 u u 2 , 0 u 1 , 0 2 ,
R 15 , a , b = 3 p u u 0 , 1 u 1 , 0 u 2 , 0 + u 2 u 0 , 1 u 3 , 0 + u 2 u 1 , 1 u 2 , 0 4 u u 2 , 0 u 1 , 0 u 0 , 1 ,
R 16 , a , b = 3 p u u 1 , 0 2 u 1 , 1 + u 2 u 1 , 0 u 2 , 1 + u 2 u 1 , 1 u 2 , 0 4 u u 1 , 1 u 1 , 0 2 ,
R 17 , a , b = 3 p u u 0 , 1 u 1 , 0 u 2 , 0 + u 2 u 1 , 0 u 2 , 1 + u 2 u 1 , 1 u 2 , 0 4 u u 2 , 0 u 1 , 0 u 0 , 1 ,
R 18 , a , b = 3 p u u 0 , 1 2 u 2 , 0 + u 2 u 0 , 1 u 2 , 1 + u 2 u 0 , 2 u 2 , 0 4 u u 0 , 1 2 u 2 , 0 ,
R 19 , a , b = 3 p u u 0 , 1 u 1 , 0 u 1 , 1 + u 2 u 0 , 1 u 2 , 1 + u 2 u 1 , 1 2 4 u u 0 , 1 u 1 , 0 u 1 , 1 ,
R 20 , a , b = 3 p u u 1 , 0 2 u 0 , 2 + u 2 u 1 , 0 u 1 , 2 + u 2 u 0 , 2 u 2 , 0 4 u u 1 , 0 2 u 0 , 2 ,
R 21 , a , b = 3 p u u 0 , 1 u 1 , 0 u 1 , 1 + u 2 u 1 , 0 u 1 , 2 + u 2 u 1 , 1 2 4 u u 0 , 1 u 1 , 0 u 1 , 1 ,
R 22 , a , b = 3 p u u 0 , 1 2 u 1 , 1 + u 2 u 0 , 1 u 1 , 2 + u 2 u 0 , 2 u 1 , 1 4 u u 1 , 1 u 0 , 1 2 ,
R 23 , a , b = 3 p u u 0 , 1 u 1 , 0 u 0 , 2 + u 2 u 0 , 1 u 1 , 2 + u 2 u 0 , 2 u 1 , 1 4 u u 0 , 2 u 1 , 0 u 0 , 1 ,
R 24 , a , b = 3 p u u 0 , 1 u 1 , 0 u 0 , 2 + u 2 u 1 , 0 u 0 , 3 + u 2 u 0 , 2 u 1 , 1 4 u u 0 , 2 u 1 , 0 u 0 , 1 ,
R 25 , a , b = 3 p u u 0 , 1 2 u 0 , 2 + u 2 u 0 , 1 u 0 , 3 + u 2 u 0 , 2 2 4 u u 0 , 2 u 0 , 1 2 ,
R 26 , a , b = 3 p u 0 , 1 u 1 , 0 3 + 2 u u 2 , 0 u 1 , 0 u 0 , 1 + u u 1 , 1 u 1 , 0 2 5 u 1 , 0 3 u 0 , 1 ,
R 27 , a , b = 3 p u 0 , 1 2 u 1 , 0 2 + u u 0 , 1 2 u 2 , 0 + 2 u u 0 , 1 u 1 , 0 u 1 , 1 5 u 1 , 0 2 u 0 , 1 2 ,
R 28 , a , b = 3 p u 0 , 1 3 u 1 , 0 + u u 1 , 1 u 0 , 1 2 + 2 u u 0 , 2 u 1 , 0 u 0 , 1 5 u 0 , 1 3 u 1 , 0 .

References

  1. Shannon, C.E. A mathematical theory of communications. Bell Syst. Tech. J. 1948, 27, 379–423. [Google Scholar] [CrossRef] [Green Version]
  2. Rényi, A. On measures of entropy and information. In Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics; University of California Press: Berkeley, CA, USA, 1961; pp. 547–561. [Google Scholar]
  3. Cover, T.M. Elements of Information Theory; John Wiley & Sons: New York, NY, USA, 1999. [Google Scholar]
  4. Gardner, R.J. The Brunn-Minkowski inequality. Bull. Am. Math. Soc. 2002, 39, 355–405. [Google Scholar] [CrossRef] [Green Version]
  5. Stam, A.J. Some inequalities satisfied by the quantities of information of Fisher and Shannon. Inf. Control 1959, 2, 101–112. [Google Scholar] [CrossRef] [Green Version]
  6. Blachman, N.M. The convolution inequality for entropy powers. IEEE Trans. Inf. Theory 1965, 11, 267–271. [Google Scholar] [CrossRef]
  7. Lieb, E.H. Proof of an entropy conjecture of Wehrl. Commun. Math. Phys. 1978, 62, 35–41. [Google Scholar] [CrossRef]
  8. Verdú, S.; Guo, D. A simple proof of the entropy-power inequality. IEEE Trans. Inf. Theory 2006, 52, 2165–2166. [Google Scholar] [CrossRef]
  9. Rioul, O. Information theoretic proofs of entropy power inequalities. IEEE Trans. Inf. Theory 2011, 57, 33–55. [Google Scholar] [CrossRef] [Green Version]
  10. Bergmans, P.P. A simple converse for broadcast channels with additive white Gaussian noise. IEEE Trans. Inform. Theory 1974, 20, 279–280. [Google Scholar] [CrossRef]
  11. Zamir, R.; Feder, M. A generalization of the entropy power with respect to added Gaussian noise. IEEE Trans. INf. Theory 1993, 39, 1723–1728. [Google Scholar] [CrossRef]
  12. Liu, T.; Viswanath, P. An extremal inequality motivated by multiterminal information-theoretic problems. IEEE Trans. Inf. Theory 2007, 53, 1839–1851. [Google Scholar] [CrossRef] [Green Version]
  13. Wang, L.; Madiman, M. A new approach to the entropy power inequality, via rearrangements. In Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, 7–12 July 2013. [Google Scholar]
  14. Costa, M.H.M. A new entropy power ineqaulity. IEEE Trans. Inf. Theory 1985, 31, 751–760. [Google Scholar] [CrossRef]
  15. Guo, L.; Yuan, C.M.; Gao, X.S. Prove Costa’s entropy power inequality and high order inequality for differential entropy with semidefinite programming. arXiv 2020, arXiv:2004.08543. [Google Scholar]
  16. Guo, L.; Yuan, C.M.; Gao, X.S. Lower bound on derivatives of Costa’s differential entropy. arXiv 2020, arXiv:2007.10145. [Google Scholar]
  17. Guo, L.; Yuan, C.; Gao, X. Lower bound for derivatives of Costa’s differential entropy. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), Melbourne, Australia, 12–20 July 2021; pp. 1516–1521. [Google Scholar]
  18. Dembo, A. Simple proof of the concavity of the entropy power with respect to added Gaussian noise. IEEE Trans. Inf. Theory 1989, 35, 887–888. [Google Scholar] [CrossRef]
  19. Villani, C. A short proof of the concavity of entropy power. IEEE Trans. Inf. Theory 2000, 46, 1695–1696. [Google Scholar] [CrossRef] [Green Version]
  20. Toscani, G. A concavity property for the reciprocal of Fisher information and its consequences on Costa’s EPI. Phys. A Stat. Mech. Appl. 2015, 432, 352. [Google Scholar] [CrossRef] [Green Version]
  21. Cheng, F.; Geng, Y. Higher order derivatives in Costa’s entropy power inequality. IEEE Trans. Inf. Theory 2015, 61, 5892–5905. [Google Scholar] [CrossRef]
  22. Savaré, G.; Toscani, G. The concavity of Rényi entropy power. IEEE Trans. Inf. Theory 2014, 60, 2687–2693. [Google Scholar] [CrossRef] [Green Version]
  23. Zhang, X.; Anantharam, V.; Geng, Y. Gaussian optimality for derivatives of differential entropy using linear matrix inequalities. Entropy 2018, 20, 182. [Google Scholar] [CrossRef] [Green Version]
  24. Caviness, B.F.; Johnson, J.R. Quantifier Elimination and Cylindrical Algebraic Decomposition; Springer: New York, NY, USA, 1998. [Google Scholar]
  25. Treves, F. Topological Vector Spaces, Distributions and Kernels; Pure and Applied Mathematics; Elsevier: New York, NY, USA, 2016. [Google Scholar]
  26. Abbas, I.A.; Marin, M. Analytical solutions of a two-dimensional generalized thermoelastic diffusions problem due to laser pulse. Iran. J. Sci. Technol. Trans. Mech. Eng. 2018, 42, 57–71. [Google Scholar] [CrossRef]
  27. Marin, M.; Othman, M.I.A.; Seadawy, A.R.; Carstea, C. A domain of influence in the Moore–Gibson–Thompson theory of dipolar bodies. J. Taibah Univ. Sci. 2020, 14, 653–660. [Google Scholar] [CrossRef]
Table 1. The description for Φ ( n , p , μ ) in (34).
Table 1. The description for Φ ( n , p , μ ) in (34).
p > n 2 θ 4 > θ 1 θ 5 0 * ϕ 1 ϕ 2
p = n 2 θ 6 > θ 3 θ 12 0 * ϕ 1 ϕ 2
13 9 < p < n 2 θ 4 > θ 1 θ 5 0 * ϕ 1 ϕ 2
n 1 < p 13 9 , p 1 ϕ 3 θ 4 > θ 1 θ 5 θ 2 ϕ 3 θ 7 μ θ 4 > θ 2 ϕ 1 ϕ 2
p = n 1 n < n 3 θ 13 > θ 10 θ 14 θ 11 n < n 3 θ 13 > θ 11 μ θ 16 ϕ 1 ϕ 2
4 9 < p < n 1 ϕ 3 θ 4 > θ 1 θ 5 θ 2 ϕ 3 θ 7 μ θ 4 > θ 2 ϕ 1 ϕ 2
p = 4 9 n = 1 θ 15 > θ 9 μ θ 8 * n = 1 p μ 1 p
0 < p < 4 9 n = 1 θ 7 μ θ 4 > θ 1 n = 1 θ 5 < θ 1 μ θ 7 n = 1 p μ 1 p
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Guo, L.; Yuan, C.-M.; Gao, X.-S. A Generalization of the Concavity of Rényi Entropy Power. Entropy 2021, 23, 1593. https://doi.org/10.3390/e23121593

AMA Style

Guo L, Yuan C-M, Gao X-S. A Generalization of the Concavity of Rényi Entropy Power. Entropy. 2021; 23(12):1593. https://doi.org/10.3390/e23121593

Chicago/Turabian Style

Guo, Laigang, Chun-Ming Yuan, and Xiao-Shan Gao. 2021. "A Generalization of the Concavity of Rényi Entropy Power" Entropy 23, no. 12: 1593. https://doi.org/10.3390/e23121593

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