1 Introduction
Let
$\mathbb{C}^{n}$
be the complex
$n$
-space and
$dV$
be the ordinary volume measure on
$\mathbb{C}^{n}$
. If
$z=(z_{1},\ldots ,z_{n})$
and
$w=(w_{1},\ldots ,w_{n})$
are points in
$\mathbb{C}^{n}$
, we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU1.gif?pub-status=live)
For any
$0<p\leqslant \infty$
we let
$L_{G}^{p}$
denote the space of Lebesgue measurable functions
$f$
on
$\mathbb{C}^{n}$
such that the function
$f(z)e^{-(1/2)|z|^{2}}$
is in
$L^{p}(\mathbb{C}^{n},dV)$
. When
$0<p<\infty$
, it is clear that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU2.gif?pub-status=live)
We define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU3.gif?pub-status=live)
For
$p=\infty$
the norm in
$L_{G}^{\infty }$
is defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU4.gif?pub-status=live)
Let
$F^{p}$
denote the space of entire functions in
$L_{G}^{p}$
. Then
$F^{2}$
is a closed subspace of the Hilbert space
$L_{G}^{2}$
(see [Reference Zhu15]) with inner product
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU5.gif?pub-status=live)
To give a motivation for our study of Fock–Sobolev spaces, recall that the annihilation operator
$A_{j}$
and the creation operator
$A_{j}^{\ast }$
from the quantum theory are defined by the commutation relation
$[A_{j},A_{k}^{\ast }]=\unicode[STIX]{x1D6FF}_{jk}I$
, where
$I$
is the identity operator. A natural representation of these operators is achieved on the Fock space
$F^{2}$
, namely,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU6.gif?pub-status=live)
Both
$A_{j}$
and
$A_{j}^{\ast }$
, as defined above, are densely defined linear operators on
$F^{2}$
(unbounded though) and satisfy the commutation relation
$[A_{j},A_{k}^{\ast }]=\unicode[STIX]{x1D6FF}_{jk}I$
. Therefore, it is important to study the operator of multiplication by
$z_{j}$
and the operator of differentiation on the Fock space
$F^{2}$
.
We define the radial derivative
$\mathscr{R}$
by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU7.gif?pub-status=live)
and the Fock–Sobolev space
$F_{\mathscr{R}}^{s,p}$
of fractional order
$s$
for which
$\mathscr{R}^{s/2}f$
is given by an
$F^{p}$
function. Then
$F_{\mathscr{R}}^{s,2}$
is a Hilbert space with inner product
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU8.gif?pub-status=live)
for
$f,g\in F_{\mathscr{R}}^{s,2}$
. Each point evaluation is a bounded linear functional on
$F_{\mathscr{R}}^{s,2}$
. So, to each
$z\in \mathbb{C}^{n}$
there corresponds the reproducing kernel
$K_{z}^{s}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU9.gif?pub-status=live)
for
$f\in F_{\mathscr{R}}^{s,2}$
. Let
$K_{s}(z,w):=K_{w}^{s}(z)$
. Defining
$\unicode[STIX]{x1D6EC}(z,w)$
by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU10.gif?pub-status=live)
we have the following estimates of the reproducing kernel
$K_{s}(z,w)$
for
$F_{\mathscr{R}}^{s,2}$
.
Theorem 1.1. Let
$s\in \mathbb{R}$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU11.gif?pub-status=live)
and there are positive constants
$C=C(s)>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU12.gif?pub-status=live)
for
$z,w\in \mathbb{C}^{n}$
.
It will turn out that polynomially growing/decaying weights quite naturally come into play in the study of our fractional Fock–Sobolev spaces. So, we first introduce such weighted Fock spaces. Given
$s$
real we introduce the following norm on
$F_{s}^{p}$
when
$0<p<\infty$
:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU13.gif?pub-status=live)
where
$\unicode[STIX]{x1D714}_{n,s,p}$
is a normalizing constant so that the constant function
$1$
has norm
$1$
in
$F_{s}^{p}$
. When
$p=\infty$
, we define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU14.gif?pub-status=live)
where
$\unicode[STIX]{x1D714}_{s}$
is a normalizing constant so that the constant function
$1$
has norm
$1$
in
$F_{s}^{\infty }$
. Let
$L_{G,s}^{p}$
denote the space of Lebesgue measurable functions
$f$
on
$\mathbb{C}^{n}$
such that the function
$(1+|z|)^{s}f(z)$
is in
$L_{G}^{p}$
. Then
$F_{s}^{p}$
is a closed subspace of
$L_{G,s}^{p}$
.
It follows that the fractional Fock–Sobolev spaces are realized as the weighted Fock spaces that do not involve derivatives as following Theorem 1.2. So, the study on the Fock–Sobolev spaces is reduced to that on the weighted Fock spaces. It is very convenient to study function theoretic and operator theoretic properties on the weighted Fock spaces instead of the Fock–Sobolev spaces (see [Reference Cho, Choe and Koo3, Reference Choe and Yang7, Reference Mengestie9–Reference Mengestie11, Reference Wang, Cao and Xia13]).
Theorem 1.2. Suppose
$0<p\leqslant \infty$
and
$s$
is a real number. Then
$F_{\mathscr{R}}^{s,p}=F_{s}^{p}$
with equivalent norms.
Constants. In this paper we use the same letter
$C$
to denote various positive constants which may vary at each occurrence but do not depend on the essential parameters. Variables indicating the dependency of constants
$C$
will be often specified in parenthesis. For nonnegative quantities
$X$
and
$Y$
the notation
$X\lesssim Y$
or
$Y\gtrsim X$
means
$X\leqslant CY$
for some inessential constant
$C$
. Similarly, we write
$X\approx Y$
if both
$X\lesssim Y$
and
$Y\lesssim X$
hold.
2 Fractional radial derivatives
We note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU15.gif?pub-status=live)
It is easy to see that
$\mathscr{R}$
is unbounded, positive, self-adjoint, and invertible on
$F^{2}$
. In fact,
$\mathscr{R}^{-1}$
is a compact operator.
Example 2.1. Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU16.gif?pub-status=live)
Then
$f\in F^{2}$
, but
$\mathscr{R}f\notin F^{2}$
.
For
$f\in F^{2}$
let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU17.gif?pub-status=live)
be the orthonormal decomposition of
$f$
, where
$e_{\unicode[STIX]{x1D6FC}}(z)=z^{\unicode[STIX]{x1D6FC}}/\Vert z^{\unicode[STIX]{x1D6FC}}\Vert _{2}.$
Associated with the operator
$\mathscr{R}$
is a semigroup
$\{{B_{t}\}}_{t\geqslant 0}$
defined by the expansion
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU18.gif?pub-status=live)
We can check that
$u(z,t):=B_{t}f(z)$
is the solution of the heat-type equation:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU19.gif?pub-status=live)
It is easy to see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU20.gif?pub-status=live)
Thus
$B_{t}$
is contractive. Moreover, we can see that
$-\mathscr{R}$
is the infinitesimal generator of
$\{{B_{t}\}}_{t\geqslant 0}$
. That is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU21.gif?pub-status=live)
See [Reference Cho, Choi and Lee5] for more properties concerning the heat semigroup as well as the spectral property of the operator
$\mathscr{R}$
.
Since
$\mathscr{R}$
has discrete spectrum
$\{2|\unicode[STIX]{x1D6FC}|+n:\unicode[STIX]{x1D6FC}\in \mathbb{N}_{0}^{n}\}$
, by using the spectral theorem, we define the fractional radial derivative
$\mathscr{R}^{s}$
for
$s\in \mathbb{R}$
as following:
Definition 2.2. Let
$s\in \mathbb{R}$
. For
$f\in F^{2}$
let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU22.gif?pub-status=live)
be the orthonormal decomposition of
$f$
. By the spectral theorem,
$\mathscr{R}^{s}$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU23.gif?pub-status=live)
Definition 2.3. Let
$s$
be a real number. The Fock–Sobolev space
$F_{\mathscr{R}}^{s,p}$
of fractional order
$s$
is the space of all entire functions for which
$\mathscr{R}^{s/2}f$
is given by an
$F^{p}$
function. The Fock–Sobolev norm of
$f$
of fractional order
$s$
is defined accordingly,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU24.gif?pub-status=live)
By using the semigroup, we have the integral representations for the fractional radial derivatives as following. See [Reference Bongioanni and Torrea2] for analogues in the context of other type of Sobolev spaces.
Proposition 2.4. Let
$f\in F^{2}$
and
$z\in \mathbb{C}^{n}$
. Then the following identities hold:
(i) For
$0<s<1$ we have
$$\begin{eqnarray}\mathscr{R}^{s}f(z)=\frac{1}{\unicode[STIX]{x1D6E4}(-s)}\int _{0}^{\infty }\frac{[e^{-t\mathscr{R}}f(z)-f(z)]}{t^{s}}\,\frac{dt}{t},\end{eqnarray}$$
$\unicode[STIX]{x1D6E4}(-s)$ is the gamma function to negative numbers defined by
$$\begin{eqnarray}\unicode[STIX]{x1D6E4}(-s)=\frac{\unicode[STIX]{x1D6E4}(-s+n)}{(-s)(-s+1)\cdots (-s+n-1)}\end{eqnarray}$$
$n$ such that
$-s+n$ is positive.
(ii) For
$s>0$ we have
$$\begin{eqnarray}\mathscr{R}^{-s}f(z)=\frac{1}{\unicode[STIX]{x1D6E4}(s)}\int _{0}^{\infty }t^{s}e^{-t\mathscr{R}}f(z)\,\frac{dt}{t}.\end{eqnarray}$$
Proof. We prove (i); the proof for (ii) is simpler.
In [Reference Cho, Choe and Koo4, Proposition 2.2], we calculated the size of Taylor coefficients as following:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqn1.gif?pub-status=live)
for a given multi-index
$\unicode[STIX]{x1D6FC}$
where
$\unicode[STIX]{x1D6FC}_{j}^{-\unicode[STIX]{x1D6FC}_{j}/2}$
is understood to be
$1$
when
$\unicode[STIX]{x1D6FC}_{j}=0$
.
For
$f\in F^{2}$
let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU28.gif?pub-status=live)
be the orthonormal decomposition of
$f$
, where
$c_{\unicode[STIX]{x1D6FC}}=\unicode[STIX]{x2202}^{\unicode[STIX]{x1D6FC}}f(0)/\sqrt{\unicode[STIX]{x1D6FC}!}$
and
$e_{\unicode[STIX]{x1D6FC}}(z)=z^{\unicode[STIX]{x1D6FC}}/\sqrt{\unicode[STIX]{x1D6FC}!}$
. Note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqn2.gif?pub-status=live)
By (2.1) and (2.2), it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU29.gif?pub-status=live)
We note that the power series on the right side of the inequality above is convergent for every
$z\in \mathbb{C}^{n}$
. By the dominated convergence theorem, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU30.gif?pub-status=live)
Remark 2.5. We refer to [Reference Cho, Choe and Koo4] for another fractional derivatives. In [Reference Cho, Choe and Koo4], the following derivative
${\mathcal{D}}^{s}f$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU31.gif?pub-status=live)
We remark that our definition of
$\mathscr{R}^{s}f$
is slightly different from
${\mathcal{D}}^{s}f$
, but they are asymptotically the same in the sense that
$\unicode[STIX]{x1D6E4}(n+s+|\unicode[STIX]{x1D6FC}|)/\unicode[STIX]{x1D6E4}(n+|\unicode[STIX]{x1D6FC}|)\approx (2|\unicode[STIX]{x1D6FC}|+n)^{s}$
as
$|\unicode[STIX]{x1D6FC}|\rightarrow \infty$
by Stirling’s formula.
3 Estimates of the reproducing kernel for
$F_{\mathscr{R}}^{s,2}$
In what follows we use the conventional multi-index notation. Thus for an
$n$
-tuple
$\unicode[STIX]{x1D6FC}=(\unicode[STIX]{x1D6FC}_{1},\ldots ,\unicode[STIX]{x1D6FC}_{n})$
of nonnegative integers we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU32.gif?pub-status=live)
where
$\unicode[STIX]{x2202}_{j}$
denotes partial differentiation with respect to the
$j$
th component. If
$z=(z_{1},\ldots ,z_{n})$
, then
$z^{\unicode[STIX]{x1D6FC}}=z_{1}^{\unicode[STIX]{x1D6FC}_{1}}\cdots z_{n}^{\unicode[STIX]{x1D6FC}_{n}}$
.
First we get pointwise size estimates for the fractional radial derivatives of the Fock kernel as following.
Theorem 3.1. Given
$s$
real, there are positive constants
$C=C(s)>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU33.gif?pub-status=live)
for
$z,w\in \mathbb{C}^{n}$
.
Proof. Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU34.gif?pub-status=live)
the cases
$s=0,1$
are trivial.
Let
$0<s<1$
. By (i) of Proposition 2.4, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU35.gif?pub-status=live)
Now
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU36.gif?pub-status=live)
Thus
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqn3.gif?pub-status=live)
We write the integral on the right-hand side of (3.1) as the sum of two pieces
$I_{1}$
and
$I_{2}$
defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU37.gif?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU38.gif?pub-status=live)
Given
$z,w\in \mathbb{C}^{n}$
, put
$x=\text{Re}(z\cdot \overline{w})$
for short. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU39.gif?pub-status=live)
Also,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU40.gif?pub-status=live)
Here
$E_{s}(x)$
is the truncated exponential function (see Definition A.1 in Appendix A). Note that (see (A1))
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU41.gif?pub-status=live)
Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU42.gif?pub-status=live)
Hence we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU43.gif?pub-status=live)
Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU44.gif?pub-status=live)
there exist
$c>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU45.gif?pub-status=live)
If
$x\leqslant 1$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU46.gif?pub-status=live)
So, in case
$x\leqslant 1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqn4.gif?pub-status=live)
Here we used the following inequality
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU47.gif?pub-status=live)
If
$x>1$
, by Fubini’s theorem, it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU48.gif?pub-status=live)
Hence, in case
$x>1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU49.gif?pub-status=live)
For the case
$x=\text{Re}(z\cdot \overline{w})>1$
, we write
$\text{Re}(z\cdot \overline{w})=|z||w|\cos \unicode[STIX]{x1D703}$
, where
$\unicode[STIX]{x1D703}$
is the angle between
$z$
and
$w$
identified as real vectors in
$\mathbb{R}^{2n}$
, and
$\unicode[STIX]{x1D6FF}=\cos ^{-1}(\frac{1}{4})$
. If
$|\unicode[STIX]{x1D703}|\leqslant \unicode[STIX]{x1D6FF}$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU50.gif?pub-status=live)
Hence we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqn5.gif?pub-status=live)
If
$\unicode[STIX]{x1D6FF}<\unicode[STIX]{x1D703}<\unicode[STIX]{x1D70B}/2$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU51.gif?pub-status=live)
Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqn6.gif?pub-status=live)
This, together with (3.2), yields the asserted estimate for
$0<s<1$
.
Now, assume
$s>1$
. Let
$m$
be the greatest nonnegative integer less than
$s$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU52.gif?pub-status=live)
Note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU53.gif?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU54.gif?pub-status=live)
for some nonnegative integers
$\ell _{j}$
. Thus
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU55.gif?pub-status=live)
We write the integral on the right-hand side of the above equation as the sum of two pieces
$J_{1}$
and
$J_{2}$
defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU56.gif?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU57.gif?pub-status=live)
Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU58.gif?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU59.gif?pub-status=live)
These yield the asserted estimate for
$s>1$
.
Now for
$s>0$
, by (ii) of Proposition 2.4, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU60.gif?pub-status=live)
Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU61.gif?pub-status=live)
If
$x=\text{Re}(z\cdot \overline{w})\leqslant 1$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU62.gif?pub-status=live)
Now we assume that
$x=\text{Re}(z\cdot \overline{w})>1$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU63.gif?pub-status=live)
By Stirling’s formula, it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU64.gif?pub-status=live)
Hence, by Corollary A.4, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqn7.gif?pub-status=live)
For the case
$x=\text{Re}(z\cdot \overline{w})>1$
, we write
$\text{Re}(z\cdot \overline{w})=|z||w|\cos \unicode[STIX]{x1D703}$
, where
$\unicode[STIX]{x1D703}$
is the angle between
$z$
and
$w$
identified as real vectors in
$\mathbb{R}^{2n}$
, and
$\unicode[STIX]{x1D6FF}=\cos ^{-1}(\frac{1}{4})$
. It is easily seen from (3.5) that the required estimate holds when
$|\unicode[STIX]{x1D703}|\leqslant \unicode[STIX]{x1D6FF}$
, because
$x\approx |z||w|$
for such
$z$
and
$w$
. So, assume
$\unicode[STIX]{x1D6FF}<\unicode[STIX]{x1D703}<\unicode[STIX]{x1D70B}/2$
. Note
$x<\frac{1}{4}|z||w|$
for such
$z$
and
$w$
. We thus have by our choice of
$\unicode[STIX]{x1D6FF}$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqn8.gif?pub-status=live)
This, together with (3.5), yields the asserted estimate for
$x>1$
. This completes the proof.◻
It is the well-known formula [Reference Aronszajn1] that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU65.gif?pub-status=live)
where
$\{\unicode[STIX]{x1D719}_{\unicode[STIX]{x1D6FC}}\}$
is any orthonormal basis for
$F_{\mathscr{R}}^{s,2}$
.
Lemma 3.2. Let
$s$
be real and
$\unicode[STIX]{x1D6FC}$
be a multi-index of nonnegative integers. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU66.gif?pub-status=live)
Proof. Since
$\mathscr{R}^{s/2}z^{\unicode[STIX]{x1D6FC}}=(2|\unicode[STIX]{x1D6FC}|+n)^{s/2}z^{\unicode[STIX]{x1D6FC}}$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU67.gif?pub-status=live)
Theorem 3.3. Let
$s\in \mathbb{R}$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU68.gif?pub-status=live)
and there are positive constants
$C=C(s)>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU69.gif?pub-status=live)
for
$z,w\in \mathbb{C}^{n}$
.
Proof. By Lemma 3.2, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU70.gif?pub-status=live)
Hence the size estimates of
$K_{s}(z,w)$
follow from Theorem 3.1.◻
4 Auxiliary integral estimates
It follows that the fractional Fock–Sobolev spaces are realized as the weighted Fock spaces that do not involve derivatives. To prove the results we introduce an auxiliary integral estimate for
$\unicode[STIX]{x1D6EC}$
defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU71.gif?pub-status=live)
To handle the case
$1\leqslant p<\infty$
and for other purposes later, we introduce an integral operator induced by
$\unicode[STIX]{x1D6EC}$
. Given
$s$
real, we consider an integral operator
$L_{s}$
defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU72.gif?pub-status=live)
for
$\unicode[STIX]{x1D713}$
which makes the above integral well-defined.
Lemma 4.1. [Reference Cho, Choe and Koo4]
Given
$s$
real, the operator
$L_{s}$
is bounded on
$L_{G}^{p}$
for any
$1\leqslant p\leqslant \infty$
.
The following Jensen-type inequality is needed to handle the case
$0<p\leqslant 1$
.
Lemma 4.2. [Reference Cho, Choe and Koo4]
Given
$0<p\leqslant 1$
,
$a>0$
and
$s$
real, there is a constant
$C=C(p,a,s)>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqn9.gif?pub-status=live)
for
$f\in H(\mathbb{C}^{n})$
.
Lemma 4.3. [Reference Cho, Choe and Koo4]
Let
$0<p<\infty$
and
$\unicode[STIX]{x1D6FC}$
be an arbitrary real number. Then there is
$C=C(p,\unicode[STIX]{x1D6FC})>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU73.gif?pub-status=live)
5 Fourier type characterization
Cho and Zhu [Reference Cho and Zhu6] studied Fock–Sobolev spaces of positive integer order. For any positive integer
$m$
and
$0<p\leqslant \infty$
we consider the space
$F^{m,p}$
consisting of entire functions
$f$
on
$\mathbb{C}^{n}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU74.gif?pub-status=live)
where
$\Vert ~\Vert _{p}$
is the norm in
$F^{p}$
. See [Reference Hall and Lewkeeratiyutkul8, Reference Radha and Thangavelu12] for other similar Sobolev spaces. Cho and Zhu [Reference Cho and Zhu6] proved a useful Fourier type characterization of the Fock–Sobolev space of integer order as following.
Theorem 5.1. [Reference Cho and Zhu6]
Suppose
$0<p\leqslant \infty$
,
$m$
is a nonnegative integer, and
$f$
is an entire function on
$\mathbb{C}^{n}$
. Then
$f\in F^{m,p}$
if and only if the function
$z^{\unicode[STIX]{x1D6FC}}f(z)$
is in
$F^{p}$
for all multi-indices
$\unicode[STIX]{x1D6FC}$
with
$|\unicode[STIX]{x1D6FC}|=m$
. Moreover,
$\Vert f\Vert _{F^{m,p}}$
is comparable to the norm of the function
$|z|^{m}f(z)$
in
$L_{G}^{p}$
.
The purpose of the current paper is to extend the notion of the Fock–Sobolev spaces to the case of fractional orders allowed to be any real number.
Theorem 5.2. Let
$s\in \mathbb{R}$
and
$0<p\leqslant \infty$
. There is a constant
$C=C(s,p)>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU75.gif?pub-status=live)
Proof. We now consider the cases
$0<p<1$
and
$1\leqslant p\leqslant \infty$
separately.
Assume
$1\leqslant p\leqslant \infty$
. If the function
$(1+|w|)^{s}f(w)$
is in
$L_{G}^{p}$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU76.gif?pub-status=live)
Thus we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqn10.gif?pub-status=live)
The convergence of the integrals above follows from pointwise estimates for functions in Fock spaces. Hence it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU77.gif?pub-status=live)
By Lemma 4.1, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU78.gif?pub-status=live)
Now let
$0<p<1$
. Then, by Lemma 4.2 and Theorem 3.1,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU79.gif?pub-status=live)
or
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU80.gif?pub-status=live)
Now, by Lemma 4.3, it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU81.gif?pub-status=live)
Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU82.gif?pub-status=live)
Theorem 5.3. Suppose
$0<p\leqslant \infty$
and
$s$
is a real number. Then there is a constant
$C=C(s,p)>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU83.gif?pub-status=live)
for all
$f\in F_{\mathscr{R}}^{s,p}$
.
Proof. Let
$1\leqslant p\leqslant \infty$
. From the reproducing formula for
$\mathscr{R}^{s/2}f$
we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU84.gif?pub-status=live)
This together with Theorem 3.1 shows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU85.gif?pub-status=live)
By Lemma 4.1, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU86.gif?pub-status=live)
When
$0<p<1$
, it follows from Lemma 4.2 and Theorem 3.1 that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU87.gif?pub-status=live)
Fubini’s theorem shows that the integral
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU88.gif?pub-status=live)
satisfies the following estimates:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU89.gif?pub-status=live)
Note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU90.gif?pub-status=live)
The proof is complete. ◻
Appendix. Truncated exponential functions
Let
$m$
be a positive integer. We consider the left truncated exponential function of integer order
$m$
,
$E_{m}(\unicode[STIX]{x1D706})$
, defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU91.gif?pub-status=live)
where
$\unicode[STIX]{x1D6E4}$
is the classical gamma function.
It is easy to check that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqn11.gif?pub-status=live)
which immediately yields a useful inequality
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqn12.gif?pub-status=live)
Now we consider the truncated exponential function of fractional order.
Definition A.1. Let
$s\in \mathbb{R}$
. We define the generalized exponential function of fractional order
$s$
,
$E_{s}(x)$
, by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU92.gif?pub-status=live)
We have the following integral representation of
$E_{s}(x)$
:
Proposition A.2. Let
$s>0$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU93.gif?pub-status=live)
Proof. Note that the following well-known property of gamma functions
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU94.gif?pub-status=live)
Thus
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU95.gif?pub-status=live)
Proposition A.3. Let
$s=m+r$
where
$m$
is a nonnegative integer and
$0\leqslant r<1$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU96.gif?pub-status=live)
Proof. We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU97.gif?pub-status=live)
By Propositions A.2 and A.3, we have the following.
Corollary A.4. Let
$s\in \mathbb{R}$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200205043943570-0954:S0027763018000119:S0027763018000119_eqnU98.gif?pub-status=live)