Khabibullin's conjecture is a conjecture in mathematics related to Paley's problem for plurisubharmonic functions and to various extremal problems in the theory of entire functions of several variables. The conjecture was named after its proposer, B. N. Khabibullin. There are three versions of the conjecture, one in terms of logarithmically convex functions, one in terms of increasing functions, and one in terms of non-negative functions. The conjecture has implications in the study of complex functions and is related to Euler's Beta function. While the conjecture is known to hold for certain conditions, counterexamples have also been found.
The first statement in terms of logarithmically convex functions Khabibullin's conjecture (version 1, 1992). Let S {\displaystyle \displaystyle S} be a non-negative increasing function on the half-line [ 0 , + ∞ ) {\displaystyle [0,+\infty )} such that S ( 0 ) = 0 {\displaystyle \displaystyle S(0)=0} . Assume that S ( e x ) {\displaystyle \displaystyle S(e^{x})} is a convex function of x ∈ [ − ∞ , + ∞ ) {\displaystyle x\in [-\infty ,+\infty )} . Let λ ≥ 1 / 2 {\displaystyle \lambda \geq 1/2} , n ≥ 2 {\displaystyle n\geq 2} , and n ∈ N {\displaystyle n\in \mathbb {N} } . If
then
This statement of the Khabibullin's conjecture completes his survey.
Relation to Euler's Beta function The product in the right hand side of the inequality (2) is related to the Euler's Beta function B {\displaystyle \mathrm {B} } :
π ( n − 1 ) 2 λ ∏ k = 1 n − 1 ( 1 + λ 2 k ) = π ( n − 1 ) λ 2 ⋅ 1 B ( λ / 2 , n ) {\displaystyle {\frac {\pi \,(n-1)}{2\lambda }}\prod _{k=1}^{n-1}{\Bigl (}1+{\frac {\lambda }{2k}}{\Bigr )}={\frac {\pi \,(n-1)}{\lambda ^{2}}}\cdot {\frac {1}{\mathrm {B} (\lambda /2,n)}}}
Discussion For each fixed λ ≥ 1 / 2 {\displaystyle \lambda \geq 1/2} the function
S ( t ) = 2 ( n − 1 ) ∏ k = 1 n − 1 ( 1 + λ 2 k ) t λ , {\displaystyle S(t)=2(n-1)\prod _{k=1}^{n-1}{\Bigl (}1+{\frac {\lambda }{2k}}{\Bigr )}\,t^{\lambda },}
turns the inequalities (1) and (2) to equalities. The Khabibullin's conjecture is valid for λ ≤ 1 {\displaystyle \lambda \leq 1} without the assumption of convexity of S ( e x ) {\displaystyle S(e^{x})} . Meanwhile, one can show that this conjecture is not valid without some convexity conditions for S {\displaystyle S} . In 2010, R. A. Sharipov showed that the conjecture fails in the case n = 2 {\displaystyle n=2} and for λ = 2 {\displaystyle \lambda =2} .
The second statement in terms of increasing functions Khabibullin's conjecture (version 2). Let h {\displaystyle \displaystyle h} be a non-negative increasing function on the half-line [ 0 , + ∞ ) {\displaystyle [0,+\infty )} and α > 1 / 2 {\displaystyle \alpha >1/2} . If
∫ 0 1 h ( t x ) x ( 1 − x ) n − 1 d x ≤ t α for all t ∈ [ 0 , + ∞ ) , {\displaystyle \int _{0}^{1}{\frac {h(tx)}{x}}\,(1-x)^{n-1}\,dx\leq t^{\alpha }{\text{ for all }}t\in [0,+\infty ),}
then
∫ 0 + ∞ h ( t ) t d t 1 + t 2 α ≤ π 2 ∏ k = 1 n − 1 ( 1 + α k ) = π 2 α ⋅ 1 B ( α , n ) . {\displaystyle \int _{0}^{+\infty }{\frac {h(t)}{t}}\,{\frac {dt}{1+t^{2\alpha }}}\leq {\frac {\pi }{2}}\prod _{k=1}^{n-1}{\Bigl (}1+{\frac {\alpha }{k}}{\Bigr )}={\frac {\pi }{2\alpha }}\cdot {\frac {1}{\mathrm {B} (\alpha ,n)}}.}
The third statement in terms of non-negative functions Khabibullin's conjecture (version 3). Let q {\displaystyle \displaystyle q} be a non-negative continuous function on the half-line [ 0 , + ∞ ) {\displaystyle [0,+\infty )} and α > 1 / 2 {\displaystyle \alpha >1/2} . If
∫ 0 1 ( ∫ x 1 ( 1 − y ) n − 1 d y y ) q ( t x ) d x ≤ t α − 1 for all t ∈ [ 0 , + ∞ ) , {\displaystyle \int _{0}^{1}{\Bigl (}\,\int _{x}^{1}(1-y)^{n-1}{\frac {dy}{y}}{\Bigr )}q(tx)\,dx\leq t^{\alpha -1}{\text{ for all }}t\in [0,+\infty ),}
then
∫ 0 + ∞ q ( t ) log ( 1 + 1 t 2 α ) d t ≤ π α ∏ k = 1 n − 1 ( 1 + α k ) = π B ( α , n ) . {\displaystyle \int _{0}^{+\infty }q(t)\log {\Bigl (}1+{\frac {1}{t^{2\alpha }}}{\Bigr )}\,dt\leq \pi \alpha \prod _{k=1}^{n-1}{\Bigl (}1+{\frac {\alpha }{k}}{\Bigr )}={\frac {\pi }{\mathrm {B} (\alpha ,n)}}.}
See also Logarithmically convex function
References
