1. Introduction
The regularity theory of maximal operator has been an active research topic in harmonic analysis. A basic question related to this theory is whether the following inequality
holds or not for some
under the condition that
. Here,
M denotes the centered Hardy–Littlewood maximal operator. This question was first addressed by Kinnunen [
1] in 1997 when he established inequality (
1) for all
. Since then, Kinnunen’s result was extended to various versions (see [
2,
3,
4,
5]). Since the above result did not include the endpoint case
, whether inequality (
1) holds for
is a certainly complex question. This question was well addressed in dimension
. Particularly, Aldaz and Pérez Lázaro [
6] stated that the one-dimension uncentered Hardy–Littlewood maximal function
is absolutely continuous and
where
f is of bounded variation on
and
denotes the total variation of
f on
. This yields (
1) holds for
with
,
and
. Recently, inequality (
2) was extended to the fractional version in [
7]. In [
8], Carneiro et al. established the continuity of the map
from
to
. For the centered case, Kurka [
9] proved inequality (
1) with
,
and
C = 240,004 and inequality (
2) for
with constant
C = 240,004. When
, Luiro [
10] showed that inequality (
1) holds for
and all radial functions in
, which was later extended to the fractional case in [
11]. We can consult [
12,
13,
14,
15,
16,
17,
18,
19] and the references therein for other interesting works.
Motivated by the works in [
6,
7,
8], Liu and Xue [
20] firstly investigated the bounds for the Hardy–Littlewood maximal operator in the space of bounded
p-variation functions on finite connected graphs (see also [
21]). We now introduce some definitions. We denote by
an undirected simple and finite combinatorial graph, where
V is the set of vertices and
E is the set of edges. Let
, the notation
is the cardinality of
A. Let
. If there exists an edge
, then
x and
y are called neighbors. For any
, we use the notation
to denote the set of neighbors of
v. If
, then
G is said to be finite. If for any distinct
, we can find a finite sequence of vertices
,
, such that
, then the graph is said to be connected. For two given vertices
, we denote by
the distance of
u and
v, which is the number of edges in a shortest path connecting
u and
v. Let
be the ball centered at
v, with radius
r on the graph
G, i.e.,
Particularly,
if
and
if
. Let
f be a function defined on
V, we define the Hardy–Littlewood maximal operator on
G by
In the past few years, many scholars have been devoted to studying the Hardy–Littlewood maximal operators on graphs (see [
20,
21,
22,
23,
24,
25]). In particularly, Liu and Xue [
20] firstly studied the regularity results of maximal operators on graphs. In [
20], the authors introduced the space of bounded
p-variation functions on graph.
Definition 1 (
space)
. Let be a graph, where V is the set of vertices and E is the set of edges E. For , the space of bounded p-variation functions is defined bywhere is the p-variation of f defined byParticularly, when , we denote and .
It is not difficult to see that
Recently, Liu and Xue [
20] investigated the boundedness for
and the
-norm of
, which is given by
The main results of [
20] can be shown as follows:
Theorem 1 ([
20])
. Let G be a simple, finite and connected graph with vertices and .- (i)
If , then ;
- (ii)
If and , then ;
- (iii)
Let be the complete graph with n vertices, i.e., for any . If , then . Particularly, ;
- (iv)
Let be the star graph of n vertices, i.e., there exists an unique such that and for every . If , then ;
- (v)
The operator is bounded from to for all . Moreover,
Very recently, partial results in Theorem A were improved by González-Riquelme and Madrid [
21] who obtained.
Theorem 2 ([
21])
. Let and .- (i)
Then provided that one of the following conditions holds:
- (a)
;
- (b)
and ;
- (c)
and .
- (ii)
If , then . Moreover, the equality holds provided that one of the following conditions holds:
- (a′)
;
- (b′)
and ;
- (c′)
and .
It should be pointed out that the graphs considered in the above references are finite undirected graphs. A natural question is that what happens when we consider the finite directed graphs? In this paper, we establish some new variation inequalities for the Hardy–Littlewood maximal operators on finite directed graphs.
Let us recall some notation and definitions. Let be a finite graph, where V is the set of vertices V and E is the set of edges E. For an edge satisfying , we then write . Moreover, v (resp., u) is called a right (resp., left) neighbor of u (resp., v). For , let (resp., ) be the set of right (resp., left) neighbors of v. If every edge in E has only a unique direction and for all , then is said to be a directed graph. In addition, if for any distinct , we can find a finite sequence of vertices , , such that , then is said to be connected.
Throughout this paper, let
be the directed graph, where
V is the set of vertices and
E is the set of edges. We denote by
the ball centered at
v, with radius
r on the graph
, i.e.,
Here for any
, the notation
denotes the number of edges in a shortest path connecting from
u to
v. Clearly,
if
and
if
. Let
f be a real function defined on
V, the Hardy–Littlewood maximal operator on
is given by
Particulary, in the case
, we can rewrite
by
It should be pointed out that the Hardy–Littlewood maximal operator on finite directed graphs was first introduced by Zhang et al. [
26] who investigated the operator norm of the above operator on the Lebesgue spaces. By the definitions of
and
, it is not difficult to find that there is no clear connections between
and
. Based on Theorems A and B, a natural question is to study the
-norm for
, which is the main motivation of this paper.
This paper will be organized as follows. In
Section 2, we establish the boundedness and continuity for
on
. In
Section 3, we discuss the
-norm for
by introducing some directed graphs. Finally, some further comments will be given in
Section 4.
2. Boundedness and Continuity for on
This section concerns the boundedness and continuity for on . Our main result can be formulated as follows.
Theorem 3. Let be a directed graph with vertices and . Then
- (i)
The operator is bounded from to . Specially, - (ii)
If G is connected and , then .
- (iii)
Let be a sequence of functions such that as . If - (iv)
The conclusion (5) could not holds without the assumption (4).
Proof. We first prove part (i). Fix an edge
. By the definition of
, there exist
such that
Without loss of generality, we may assume that
. Then there exist
and
such that
Note that
,
,
. Moreover
. There exist two finite sequences of vertices
and
such that
and
. Then we have
This proves part (i).
Next we prove part (ii). Let
and
with
and
. Given a function
, we have
When
, then
When
, then
These facts yield that
. On the other hand,
This proves .
We now prove part (iii). Fix
, there exists
such that
. Given
, it holds that
which gives
This, together with our assumptions, implies
which leads to
Finally, we prove part (iv) by showing an example. Let , where and . Let and for all . Then and for all . Let for all and . Then we have and for all and . It follows that and for all . Therefore, for all , which gives as . □
Remark 1. Let be a directed connected graph with set of vertices and and . Then if and only if and .
3. Norms for
In this section, we study the norm for . Before presenting our main results, let us introduce some directed graphs.
Definition 2. - (i)
(The inward star graph). We say that is an inward star graph with n vertices if there exists an unique such that and for all . We denote the inward star graph with n vertices by ;
- (ii)
(The outward star graph). We say that is an outward star graph with n vertices if there exists an unique such that and for all . We denote the outward star graph with n vertices by ;
- (iii)
(The directed cyclic graph). We say that is a directed cyclic graph with n vertices if for any we have . We denote the directed cyclic graph with n vertices by .
- (iv)
(The directed path graph). We say that is a directed line graph with n vertices if there exist unique two vertices such that and and for all . We denote the directed line graph with n vertices by .
- (v)
(The directed degraded graph). We say that is a directed degraded graph with n vertices if there exist n vertices such that , , ⋯, .
We denote the directed degraded graph with n vertices by .
The first one of main results can be listed as follows, which focuses on the graph .
Theorem 4. Let and . Then Proof. Without loss of generality, we may assume that
, where
and
. We consider the Kronecker delta function
It is not difficult to see that
and
Clearly,
. It follows that
Next we shall prove
or, equivalently
for all
with
. Fix
. We want to prove (
6). Without loss of generality, we may assume that
. Write
We further write
which gives (
6). This completes the proof of Theorem 4. □
Remark 2. Let , where and . Then if and only if and for all .
Next we shall establish the -norm for .
Theorem 5. Let and . Then
- (i)
;
- (ii)
Proof. The proof will be divided into two steps:
Step 1: Proof of part (i). We may assume without loss of generality that
, where
and
. It is not difficult to see that
. Then we have
Therefore, to prove part (i), it suffices to show that
for all
f with
.
Fix
with
. Without loss of generality, we may assume that
, i.e.,
for
. We can write
We consider two cases:
(a) If
, then
This proves (
7) in this case.
(b) If
, we note that
This proves (
7) in this case.
Step 2: Proof of part (ii). At first, we shall prove that
and
hold for all
with
.
Let
with
and
. Fix a function
with
. Without loss of generality, we may assume that
. By the proof of part (i), one gets
We consider two cases:
(1) (
). Then we have
This proves (
8) and (
9) in this case.
(2) If . For convenience, we set and . The following cases will be discussed:
(a) (
). Without loss of generality, we may assume that
. Then we have
because of
. We write
Note that . Define the function , .
When
, observing that
for all
. It follows that
for all
. Hence,
This proves (
8) in this case.
When
, let
. It is clear that
for all
. Then
. Hence,
and then
This proves (
9) in this case.
(b) (). Without loss of generality, we may assume that . It is clear that .
Assume that
. Then we have
The above facts will give (
8) and (
9) in this case, since
when
.
Assume that
. Then
and
. We can write
This proves (
8) and (
9) in this case since
when
.
(
8) together with part (i) leads to
when
. When
, let us consider the function
defined by
It is clear that
and
,
and
. Then we have
This, together with (
9), leads to
when
. This finishes the proof of Theorem 5. □
Remark 3. It should be pointed out that part (i) of Theorem 5 implies . Let with and and f be a function defined on V. Then
- (i)
if and only if f satisfies one of the following conditions:
- (a)
for some and all ;
- (b)
, ;
- (c)
, ;
- (d)
, , .
- (ii)
If , then if and only if f satisfies the condition (a) or (d).
Theorem 6. Let and . Then
- (i)
;
- (ii)
Here is the unique solution of equation .
Proof. The proof will be divided into two steps.
Step 1: Proof of part (i). We may assume without loss of generality that
, where
and
. Let us consider the function
defined by
,
and
. Clearly,
,
and
. Then we have
Let
and write
One can easily check that
It follows that
which gives (
10) and proves part (i).
Step 2: Proof of part (ii). Let
be given as in Theorem 6. We want to show that
for all
with
.
Now we prove (
11) and (
12). Without loss of generality, we may assume that
, where
and
. Let
. Without loss of generality, we may assume that
and
. One can easily check that
Then we have
We consider the following cases:
(1) (
and
). In this case we have
,
and
This proves (
11) in this case. Noting that
when
. This proves (
12) in this case.
(2) (
and
). In this case we have
,
and
. Moreover,
and
. It holds that
Let
,
. Note that
for all
and
for all
. Hence,
This proves (
11) and (
12) in this case.
(3) (
and
). In this case we have
and
. Hence,
which proves (
11) and (
12) in this case.
(4) (
and
). If
. In this case we have
and
. Then we have
If
. In this case we have
and
. Note that
. Then
Then (
11) and (
12) are proved in this case.
(5) (
and
). If
. Then we have
and
. Note that
. Then
This gives (
11) and (
12) in this case.
If
. Then
,
and
. Moreover,
and
. It holds that
Noting that
when
. Here,
is the unique solution of equation
. This proves (
11) and (
12) in this case.
(6) (
and
). In this case we have
and
. Moreover,
and
. It follows that
When
. It holds that
These prove (
11) and (
12) in this case.
Finally, let us consider the function
defined by
It is clear that
and
,
and
. Then we have
. This gives
, which together with part (i), (
11) and (
12) implies the conclusion in part (ii). This finishes the proof of Theorem 6. □
Remark 4. Let with and and f be a function defined on V. Let . Then if and only if f satisfies and for all .
Theorem 7. Let and . Then
- (i)
;
- (ii)
If and , then .
Proof. We shall divide the proof into two steps:
Step 1: Proof of part (i). Without loss of generality, we may assume that
, where
and
. Taking
by
for
and
. Clearly,
,
for
. Moreover,
. It follows that
This together with Theorem 3 yields part (i) of Theorem 7.
Step 2: Proof of part (ii). By part (i), it suffices to show that
Let
with
and
. Let
with
. One can easily check that
To prove (
13), it is enough to show that
Without loss of generality, we may assume that
. For convenience, we set
We consider the follows cases:
(1) (
and
). In this case we have
and
. It holds that
which gives (
14) in this case.
(2) (
and
). In this case we have
,
and
. It follows that
This proves (
14) in this case.
(3) (
and
). If
. In this case we have
and
. It holds that
If
. Then we have
and
. Note that
. We have
Noting that
for all
since
. This implies
This proves (
14) in this case.
(4) (
and
). In this case we have
and
. If
. Then we have
and
If
. Then
and
. Note that
Then we have
This proves (
14) in this case.
(5) (
and
). If
. Then we have
and
. It follows that
This proves (
14) in this case.
If
. Then we have
. Moreover,
and
. We have
Note that
and let
for all
. Since
for all
because
, then
This proves (
14) in this case.
(6) (
and
). Then
,
and
. Moreover,
and
. Then we have
Let
,
. Notice that
for all
since
. Then
This gives (
14) in this case. The proof of Theorem 7 is now complete. □
Remark 5. Let with and and f be a function defined on V. Then if and only if f satisfies one of the following conditions:
- (a)
for some and all ;
- (b)
, , for all ;
- (c)
, , , for all .
Theorem 8. Let and . Then
- (i)
;
- (ii)
If , then ;
- (iii)
.
Proof. The proof will be divided into two steps.
Step 1: Proof of part (i). Without loss of generality, we may assume that
, where
and
. Let
. It is clear that
Invoking Lemma 2.1 in [
20], we get
On the other hand, we get
This proves part (i) of Theorem 8.
Step 2: Proofs of parts (ii) and (iii). At first, we prove
Without loss of generality, we assume that
with
and
. Let
with
. We write
To prove (
15), it suffices to show that
Without loss of generality we may assume that all
. Let
We only consider the following two cases since the other cases are analogous.
(1) (
and
). When
, then
and
. Moreover,
,
and
. It follows that
Note that
. Let
,
. Noting that
for all
when
. Then
This proves (
16) in this case.
When
. Then
and
,
and
. It follows that
Note that
. Let
,
. Since
, we have
This yields
which proves (
16) in this case.
(2) (
and
). In this case we have
and
. Moreover,
,
and
. It follows that
Let
,
. Notice that
since
. This proves (
16) in this case.
On the other hand, let
be defined by
,
. Then we have
,
and
. It follows that
which together with part (ii) leads to
□