Next Article in Journal
The Impact of Working Capital Management on Corporate Performance in Small–Medium Enterprises in the Visegrad Group
Next Article in Special Issue
Boundedness of the Vector-Valued Intrinsic Square Functions on Variable Exponents Herz Spaces
Previous Article in Journal
Do Not Rug on Me: Leveraging Machine Learning Techniques for Automated Scam Detection
Previous Article in Special Issue
A Note on the Boundedness of Doob Maximal Operators on a Filtered Measure Space
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Variation Inequalities for the Hardy-Littlewood Maximal Function on Finite Directed Graphs

1
College of Mathematics and System Science, Shandong University of Science and Technology, Qingdao 266590, China
2
College of Electronic and Information Engineering, Shandong University of Science and Technology, Qingdao 266590, China
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(6), 950; https://doi.org/10.3390/math10060950
Submission received: 25 February 2022 / Revised: 10 March 2022 / Accepted: 14 March 2022 / Published: 16 March 2022
(This article belongs to the Special Issue Recent Advances in Harmonic Analysis and Applications)

Abstract

:
In this paper, the authors establish the bounds for the Hardy-Littlewood maximal operator defined on a finite directed graph G in the space BV p ( G ) of bounded p-variation functions. More precisely, the authors obtain the BV p norms of M G for some directed graphs G .
MSC:
Primary 42B25; 05C12; Secondary 46E35; 05C20

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
M f L p ( R n ) C f L p ( R n )
holds or not for some p [ 1 , ] under the condition that f W 1 , p ( R n ) . 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 1 < p . 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 p = 1 , whether inequality (1) holds for p = 1 is a certainly complex question. This question was well addressed in dimension n = 1 . Particularly, Aldaz and Pérez Lázaro [6] stated that the one-dimension uncentered Hardy–Littlewood maximal function M ˜ f is absolutely continuous and
Var M ˜ f Var ( f ) ,
where f is of bounded variation on R and Var ( f ) denotes the total variation of f on R . This yields (1) holds for M ˜ with p = 1 , n = 1 and C = 1 . Recently, inequality (2) was extended to the fractional version in [7]. In [8], Carneiro et al. established the continuity of the map f ( M ˜ f ) from W 1 , 1 ( R ) to L 1 ( R ) . For the centered case, Kurka [9] proved inequality (1) with p = 1 , n = 1 and C = 240,004 and inequality (2) for M with constant C = 240,004. When n 2 , Luiro [10] showed that inequality (1) holds for M ˜ and all radial functions in W 1 , 1 ( R n ) , 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 G = ( V , E ) an undirected simple and finite combinatorial graph, where V is the set of vertices and E is the set of edges. Let A V , the notation | A | is the cardinality of A. Let x , y V . If there exists an edge x y E , then x and y are called neighbors. For any v V , we use the notation N G ( v ) to denote the set of neighbors of v. If | V | < , then G is said to be finite. If for any distinct x , y V , we can find a finite sequence of vertices { x i } i = 0 k , k N , such that x = x 0 x 1 x k = y , then the graph is said to be connected. For two given vertices u , v V , we denote by d G ( u , v ) the distance of u and v, which is the number of edges in a shortest path connecting u and v. Let B G ( v , r ) be the ball centered at v, with radius r on the graph G, i.e.,
B G ( v , r ) = { u V : d G ( u , v ) r } .
Particularly, B G ( v , r ) = { v } if 0 r < 1 and B G ( v , r ) = { v } N G ( v ) if 1 r < 2 . Let f be a function defined on V, we define the Hardy–Littlewood maximal operator on G by
M G f ( v ) = sup r 0 1 | B G ( v , r ) | w B G ( v , r ) | f ( w ) | .
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
( BV p ( G ) space). Let G = ( V , E ) be a graph, where V is the set of vertices and E is the set of edges E. For 0 < p , the space of bounded p-variation functions is defined by
BV p ( G ) : = { f : V R ; f BV p ( G ) = Var p ( f ) < } ,
where Var p ( f ) is the p-variation of f defined by
Var p ( f ) = u v E | f ( u ) f ( v ) | p 1 / p , if 0 < p < ; sup u v E | f ( u ) f ( v ) | , if p = .
Particularly, when p = 1 , we denote BV p ( G ) = BV ( G ) and Var p ( f ) = Var ( f ) .
It is not difficult to see that
Var q ( f ) Var p ( f ) n ( n 1 ) 2 1 / p 1 / q Var q ( f ) , for 0 < p q .
Recently, Liu and Xue [20] investigated the boundedness for M G : BV p ( G ) BV p ( G ) and the BV p -norm of M G , which is given by
M G BV p : = sup f : V R Var p ( f ) 0 Var p ( M G f ) Var p ( f ) .
The main results of [20] can be shown as follows:
Theorem 1
([20]). Let G be a simple, finite and connected graph with n 2 vertices and 0 < p .
(i)
If n = 2 , then M G BV p = 1 2 ;
(ii)
If n = 3 and 0 < p 1 , then M G BV p = 2 3 ;
(iii)
Let K n = ( V , E ) be the complete graph with n vertices, i.e., | N K n ( v ) | = n 1 for any v V . If n 3 , then 1 1 n M K n BV p < 1 . Particularly, M K 3 BV p = 2 3 ;
(iv)
Let S n = ( V , E ) be the star graph of n vertices, i.e., there exists an unique v V such that | N S n ( v ) | = n 1 and | N S n ( w ) | = 1 for every w V \ { v } . If n 3 , then 1 1 n M S n BV p < 1 ;
(v)
The operator M G is bounded from BV p ( G ) to BV p ( G ) for all 0 < p . Moreover,
M G BV p n 2 1 / p ( n 1 ) max { 1 , 1 / p } .
Very recently, partial results in Theorem A were improved by González-Riquelme and Madrid [21] who obtained.
Theorem 2
([21]). Let n 3 and 0 < p .
(i)
Then M K n BV p = 1 1 n provided that one of the following conditions holds:
(a)
p 1 ;
(b)
0 < p < 1 and n = 4 ;
(c)
n 3 and ln 4 ln 6 p < 1 .
(ii)
If 1 < p , then M S n BV p = ( 1 + 2 p / ( p 1 ) ) ( p 1 ) / p 3 . Moreover, the equality M S n BV p = 1 1 n holds provided that one of the following conditions holds:
(a′)
p = 1 ;
(b′)
0 < p < 1 and n = 4 ;
(c′)
1 / 2 p 1 and n 5 .
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 G = ( V , E ) be a finite graph, where V is the set of vertices V and E is the set of edges E. For an edge u v E satisfying u v , we then write u v = u v . Moreover, v (resp., u) is called a right (resp., left) neighbor of u (resp., v). For v V , let N G , + ( v ) (resp., N G , ( v ) ) be the set of right (resp., left) neighbors of v. If every edge in E has only a unique direction and N G , + ( v ) N G , ( v ) for all v V , then G is said to be a directed graph. In addition, if for any distinct x , y V , we can find a finite sequence of vertices { x i } i = 0 k , k N , such that x = x 0 x 1 x k = y , then G is said to be connected.
Throughout this paper, let G = ( V , E ) be the directed graph, where V is the set of vertices and E is the set of edges. We denote by B G ( v , r ) the ball centered at v, with radius r on the graph G , i.e.,
B G ( v , r ) = { u V : d G ( v , u ) r } .
Here for any u , v V , the notation d G ( u , v ) denotes the number of edges in a shortest path connecting from u to v. Clearly, B G ( v , r ) = { v } if 0 r < 1 and B G ( v , r ) = { v } N G , + ( v ) if 1 r < 2 . Let f be a real function defined on V, the Hardy–Littlewood maximal operator on G is given by
M G f ( v ) = sup r 0 1 | B G ( v , r ) | w B G ( v , r ) | f ( w ) | .
Particulary, in the case | V | = n , we can rewrite M G by
M G f ( v ) = max k = 0 , , n 1 1 | B G ( v , k ) | w B G ( v , k ) | f ( w ) | .
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 M G and M G , it is not difficult to find that there is no clear connections between M G and M G . Based on Theorems A and B, a natural question is to study the BV p -norm for M G , 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 M G on BV p ( G ) . In Section 3, we discuss the BV p -norm for M G by introducing some directed graphs. Finally, some further comments will be given in Section 4.

2. Boundedness and Continuity for M G on BV p ( G )

This section concerns the boundedness and continuity for M G on BV p ( G ) . Our main result can be formulated as follows.
Theorem 3.
Let G be a directed graph with n ( n 2 ) vertices and 0 < p , q . Then
(i)
The operator M G is bounded from BV p ( G ) to BV q ( G ) . Specially,
Var q ( M G f ) ( 2 n 4 ) max { 1 1 / p , 0 } n ( n 1 ) 2 1 / q Var p ( f ) , f BV p ( G ) .
(ii)
If G is connected and n = 2 , then M G BV p = 1 .
(iii)
Let { f j } BV p ( G ) be a sequence of functions such that f j f BV p ( G ) 0 as j . If
lim j min u V | f j ( u ) f ( u ) | = 0 .
Then
M G f j M G f BV q ( G ) 0 as j .
(iv)
The conclusion (5) could not holds without the assumption (4).
Proof. 
We first prove part (i). Fix an edge u v E . By the definition of M G , there exist r u , r v { 0 , 1 , , n 1 } such that
M G f ( u ) = 1 | B ( u , r u ) | w B ( u , r u ) | f ( w ) | , M G f ( v ) = 1 | B ( v , r v ) | w B ( v , r v ) | f ( w ) | .
Without loss of generality, we may assume that M G f ( u ) M G f ( v ) . Then there exist τ u B ( u , r u ) and τ v B ( v , r v ) such that
| f ( τ u ) | = max { | f ( w ) | ; w B ( u , r u ) } , | f ( τ v ) | = min { | f ( w ) | ; w B ( v , r v ) } .
Then we have
| M G f ( u ) M G f ( v ) | = M G f ( u ) M G f ( v ) | f ( τ u ) | | f ( τ v ) | | f ( τ u ) f ( τ v ) | .
Note that d G ( u , τ u ) r u , d G ( v , τ v ) r v , d G ( u , τ u ) + d G ( v , τ v ) 2 n 3 . Moreover d G ( u , τ v ) = d G ( v , τ v ) + 1 . There exist two finite sequences of vertices { u i } i = 1 d G ( u , τ u ) and { v i } i = 1 d G ( v , τ v ) + 1 such that u = u 1 u 2 u d G ( u , τ u ) = τ u and u = v 0 v 1 v 2 v d G ( v , τ v ) = τ v . Then we have
| f ( τ u ) f ( τ v ) | | f ( τ u ) f ( u ) | + | f ( u ) f ( τ v ) | i = 1 d G ( u , τ u ) 1 | f ( u i + 1 ) f ( u i ) | + i = 0 d G ( v , τ v ) 1 | f ( v i + 1 ) f ( v i ) | ( d G ( u , τ u ) 1 + d G ( v , τ v ) ) max { 1 1 / p , 0 } × i = 1 d G ( u , τ u ) 1 | f ( u i + 1 ) f ( u i ) | p + i = 0 d G ( v , τ v ) 1 | f ( v i + 1 ) f ( v i ) | p 1 / p ( 2 n 4 ) max { 1 1 / p , 0 } Var p ( f ) .
Therefore
| M G f ( u ) M G f ( v ) | ( 2 n 4 ) max { 1 1 / p , 0 } Var p ( f ) .
It follows that
Var p ( M G f ) ( 2 n 4 ) max { 1 1 / p , 0 } n ( n 1 ) 2 1 / q Var p ( f ) .
This proves part (i).
Next we prove part (ii). Let n = 2 and G = ( V , E ) with V = { 1 , 2 } and E = { 1 2 } . Given a function f : V R , we have
M G f ( 1 ) = max { | f ( 1 ) | , 1 2 ( | f ( 1 ) | + | f ( 2 ) | ) } , M G f ( 2 ) = | f ( 2 ) | .
When | f ( 1 ) | | f ( 2 ) | , then
| M G f ( 1 ) M G f ( 2 ) | = | | f ( 1 ) | | f ( 2 ) | | | f ( 1 ) f ( 2 ) | .
When | f ( 1 ) | < | f ( 2 ) | , then
| M G f ( 1 ) M G f ( 2 ) | = | 1 2 ( | f ( 1 ) | + | f ( 2 ) | ) | f ( 2 ) | | 1 2 | f ( 1 ) f ( 2 ) | .
These facts yield that M G BV p 1 . On the other hand,
M G BV p Var p ( M G δ 1 ) Var p ( δ 1 ) = 1 .
This proves M G BV p = 1 .
We now prove part (iii). Fix j 1 , there exists u V such that min x V | f j ( x ) f ( x ) | = | f j ( u ) f ( u ) | . Given v V , it holds that
| f j ( v ) f ( v ) | | ( f j ( v ) f ( v ) ) ( f j ( u ) f ( u ) ) | + | f j ( u ) f ( u ) | Var ( f j f ) + | f j ( u ) f ( u ) | n max { 1 1 / q , 0 } Var q ( f j f ) + | f j ( u ) f ( u ) | ,
which gives
f j f ( G ) n max { 1 1 / q , 0 } Var q ( f j f ) + min u V | f j ( u ) f ( u ) | .
This, together with our assumptions, implies
M G f j M G f ( G ) M G ( f j f ) ( G ) f j f ( G ) 0 as j ,
which leads to
Var p ( M G f j M G f ) n ( n 1 ) 2 1 / p M G f j M G f ( G ) 0 as j .
This gives (5).
Finally, we prove part (iv) by showing an example. Let G = S I , n = ( V , E ) , where V = { 1 , 2 , , n } and E = { 2 1 , 3 1 , , n 1 } . Let f ( 1 ) = 3 and f ( i ) = 1 for all i = 2 , 3 , , n . Then M S I , n f ( 1 ) = 3 and M S I , n f ( i ) = 2 for all i = 2 , 3 , , n . Let f j ( i ) = f ( i ) 2 for all i V and j 1 . Then we have Var q ( f j f ) = 0 and M S I , n f j ( i ) = 1 for all i V and j 1 . It follows that ( M S I , n f j M S I , n f ) ( 1 ) = 2 and ( M S I , n f j M S I , n f ) ( i ) = 1 for all i = 2 , 3 , , n . Therefore, Var p ( M S I , n f j M S I , n f ) = ( n 1 ) 1 / p for all j 1 , which gives M S I , n f j M S I , n f BV p ( G ) 0 as j . □
Remark 1.
Let G = ( V , E ) be a directed connected graph with set of vertices V = { u , v } and E = { u v } and 0 < p . Then M G f BV p = f BV p if and only if | f ( u ) | > | f ( v ) | and f ( u ) f ( v ) 0 .

3. BV p ( G ) Norms for M G

In this section, we study the BV p ( G ) norm for M G . Before presenting our main results, let us introduce some directed graphs.
Definition 2.
(i)
(The inward star graph). We say that G = ( V , E ) is an inward star graph with n vertices if there exists an unique u V such that N G , + ( u ) = and N G , + ( v ) = { u } for all v V \ { u } . We denote the inward star graph with n vertices by S I , n ;
(ii)
(The outward star graph). We say that G = ( V , E ) is an outward star graph with n vertices if there exists an unique u V such that N G , + ( u ) = V \ { u } and N G , + ( v ) = for all v V \ { u } . We denote the outward star graph with n vertices by S O , n ;
(iii)
(The directed cyclic graph). We say that G = ( V , E ) is a directed cyclic graph with n vertices if for any u V we have | N G , + ( u ) | = | N G , ( u ) | = 1 . We denote the directed cyclic graph with n vertices by C n .
(iv)
(The directed path graph). We say that G = ( V , E ) is a directed line graph with n vertices if there exist unique two vertices u , v V such that N G , + ( u ) = and | N G , + ( v ) | = 1 and | N G , + ( w ) | = | N G , ( w ) | = 1 for all w V \ { u , v } . We denote the directed line graph with n vertices by P n .
(v)
(The directed degraded graph). We say that G = ( V , E ) is a directed degraded graph with n vertices if there exist n vertices { u i } i = 1 n = V such that N G , + ( u 1 ) = , N G , + ( u 2 ) = { u 1 } , ⋯, N G , + ( u n ) = { u 1 , u 2 , , u n 1 } .
We denote the directed degraded graph with n vertices by D n .
The first one of main results can be listed as follows, which focuses on the graph S I , n .
Theorem 4.
Let n 3 and 0 < p . Then
M S I , n BV p = 1 .
Proof. 
Without loss of generality, we may assume that S I , n = ( V , E ) , where V = { 1 , 2 , , n } and E = { 2 1 , 3 1 , , n 1 } . We consider the Kronecker delta function
δ j ( i ) = 1 , i = j ; 0 , i j .
It is not difficult to see that Var p ( δ 2 ) = 1 and
M S I , n δ 2 ( i ) = 1 , i = 2 ; 0 , i = 1 , 3 , 4 , , n .
Clearly, Var p ( δ 2 ) = Var p ( M S I , n δ 2 ) = 1 . It follows that
M S I , n BV p 1 .
Next we shall prove
M S I , n BV p 1 .
or, equivalently
Var p ( M S I , n f ) Var p ( f )
for all f : V R with Var p ( f ) > 0 . Fix f = i = 1 n a i δ i . We want to prove (6). Without loss of generality, we may assume that f 0 . Write
M S I , n f ( i ) = a 1 , i = 1 ; max a i , 1 2 ( a i + a 1 ) , i = 2 , 3 , , n .
Then we have
Var p ( M S I , n f ) = i = 2 n | a 1 max a i , 1 2 ( a i + a 1 ) | p 1 / p .
Set
N 1 : = { j { 2 , 3 , , n } : a j a 1 } , N 2 : = { j { 2 , 3 , , n } : a j < a 1 } .
We further write
( Var p ( M S I , n f ) ) p = i N 1 | a 1 a i | p + i N 2 | a 1 1 2 ( a i + a 1 ) | p i N 1 | a 1 a i | p + 1 2 p i N 2 | a 1 a i | p i = 1 n | a 1 a i | p = ( Var p ( f ) ) p ,
which gives (6). This completes the proof of Theorem 4. □
Remark 2.
Let S I , n = ( V , E ) , where V = { 1 , 2 , , n } and E = { 2 1 , 3 1 , , n 1 } . Then Var p ( M S I , n f ) = Var p ( f ) if and only if | f ( i ) | | f ( 1 ) | and f ( i ) f ( 1 ) 0 for all i = 2 , 3 , , n .
Next we shall establish the BV p -norm for M S O , n .
Theorem 5.
Let n 3 and 0 < p . Then
(i)
1 M S O , n BV p ( n 1 ) max { 1 + 1 / p , 2 } n ;
(ii)
If n = 3 , then
M S O , n BV p = 1 , if 1 p ; ( 1 + 2 p ) 1 / p 3 , if 0 < p < 1 .
Proof. 
The proof will be divided into two steps:
Step 1: Proof of part (i). We may assume without loss of generality that S O , n = ( V , E ) , where V = { 1 , 2 , , n } and E = { 1 2 , 1 3 , , 1 n } . It is not difficult to see that M S O , n δ 1 = δ 1 . Then we have
M S O , n BV p Var p ( M S O , n δ 1 ) Var p ( δ 1 ) = 1 .
Therefore, to prove part (i), it suffices to show that
Var p ( M S O , n f ) ( n 1 ) max { 1 + 1 / p , 2 } n Var p ( f )
for all f with Var p ( f ) > 0 .
Fix f = i = 1 n a i δ i with i = 2 n | a i a 1 | p > 0 . Without loss of generality, we may assume that f 0 , i.e., a i 0 for i = 1 , 2 , , n . We can write
M S O , n f ( i ) = max a 1 , 1 n j = 1 n a j , i = 1 ; a i , i = 2 , 3 , , n .
Then we have
Var p ( M S O , n f ) = i = 2 n | a i max a 1 , 1 n j = 1 n a j | p 1 / p .
We consider two cases:
(a) If a 1 1 n j = 1 n a j , then
Var p ( M S O , n f ) = i = 2 n | a i a 1 | p 1 / p = Var p ( f ) .
This proves (7) in this case.
(b) If a 1 < 1 n j = 1 n a j , we note that
| a i 1 n j = 1 n a j | n 1 n j = 2 n | a j a 1 | , for i = 2 , 3 , , n .
It follows that
Var p ( M S O , n f ) = i = 2 n | a i 1 n j = 1 n a j | p 1 / p ( n 1 ) 1 + 1 / p n j = 2 n | a j a 1 | ( n 1 ) max { 1 + 1 / p , 2 } n Var p ( f ) .
This proves (7) in this case.
Step 2: Proof of part (ii). At first, we shall prove that
Var p ( M S O , 3 f ) Var p ( f ) , p 1 ;
and
Var p ( M S O , 3 f ) ( 1 + 2 p ) 1 / p 3 Var p ( f ) , p ( 0 , 1 )
hold for all f : V R with Var p ( f ) > 0 .
Let S O , 3 = ( V , E ) with V = { 1 , 2 , 3 } and E = { 1 2 , 1 3 } . Fix a function f = i = 1 3 a i δ i with | a 2 a 1 | p + | a 3 a 1 | p > 0 . Without loss of generality, we may assume that a i 0 ( i = 1 , 2 , 3 ) . By the proof of part (i), one gets
Var p ( M S O , 3 f ) = i = 2 3 | a i max a 1 , 1 3 j = 1 3 a j | p 1 / p .
We consider two cases:
(1) ( a 1 1 2 ( a 2 + a 3 ) ). Then we have
Var p ( M S O , 3 f ) = ( | a 2 a 1 | p + | a 3 a 1 | p ) 1 / p = Var p ( f ) .
This proves (8) and (9) in this case.
(2) If a 1 < 1 2 ( a 2 + a 3 ) . For convenience, we set β = | a 2 a 1 | and γ = | a 3 a 1 | . The following cases will be discussed:
(a) ( max { a 2 , a 3 } a 1 min { a 2 , a 3 } ). Without loss of generality, we may assume that a 3 > a 2 . Then we have β < γ because of a 1 < 1 2 ( a 2 + a 3 ) . We write
Var p ( M S O , 3 f ) Var p ( f ) p = | a 2 1 3 ( a 1 + a 2 + a 3 ) | p + | a 3 1 3 ( a 1 + a 2 + a 3 ) | p | a 2 a 1 | p + | a 3 a 1 | p = 1 3 p ( 2 β + γ ) p + ( 2 γ + β ) p β p + γ p = 1 3 p 2 β γ + 1 p + 2 + β γ p 1 + β γ p .
Note that β γ [ 0 , 1 ) . Define the function g ( x ) = ( 2 x + 1 ) p + ( 2 + x ) p 1 + x p , x [ 0 , 1 ) .
When p 1 , observing that 3 p ( 2 + x ) p ( 2 x + 1 ) p ( 3 x ) p for all x [ 0 , 1 ) . It follows that g ( x ) 3 p for all x [ 0 , 1 ) . Hence,
Var p ( M S O , 3 f ) Var p ( f ) p 1 .
This proves (8) in this case.
When p ( 0 , 1 ) , let h ( x ) = ( 1 + 2 p ) ( 1 + x p ) ( 2 x + 1 ) p ( 2 + x ) p . It is clear that h ( x ) 0 for all x [ 0 , 1 ) . Then h ( x ) h ( 0 ) = 0 . Hence, g ( x ) 1 + 2 p and then
Var p ( M S O , 3 f ) Var p ( f ) ( 1 + 2 p ) 1 / p 3 .
This proves (9) in this case.
(b) ( a 1 < min { a 2 , a 3 } ). Without loss of generality, we may assume that a 3 > a 2 . It is clear that a 1 < a 2 < a 3 .
Assume that a 2 1 2 ( a 1 + a 3 ) . Then we have
| a 2 1 3 ( a 1 + a 2 + a 3 ) | = a 2 1 3 ( a 1 + a 2 + a 3 ) a 2 a 1 = | a 2 a 1 | ,
| a 3 1 3 ( a 1 + a 2 + a 3 ) | = a 3 1 3 ( a 1 + a 2 + a 3 ) a 3 a 1 = | a 3 a 1 | .
The above facts will give (8) and (9) in this case, since 1 + 2 p 3 p 1 when p ( 0 , 1 ) .
Assume that a 2 < 1 2 ( a 1 + a 3 ) . Then γ > 2 β 0 and β γ [ 0 , 1 / 2 ) . We can write
Var p ( M S O , 3 f ) Var p ( f ) p = | a 2 1 3 ( a 1 + a 2 + a 3 ) | p + | a 3 1 3 ( a 1 + a 2 + a 3 ) | p | a 2 a 1 | p + | a 3 a 1 | p = 1 3 p ( γ 2 β ) p + ( 2 γ β ) p β p + γ p = 1 3 p 1 2 β γ p + 2 β γ p 1 + β γ p 1 + 2 p 3 p .
This proves (8) and (9) in this case since 1 + 2 p 3 p 1 when p 1 .
(8) together with part (i) leads to M S O , n BV p = 1 when p 1 . When 0 < p < 1 , let us consider the function f : V R defined by
f ( 1 ) = 1 , f ( 2 ) = 1 , f ( 3 ) = 4 .
It is clear that Var p ( f ) = 3 and M S O , 3 f ( 1 ) = 1 , M S O , 3 f ( 2 ) = 2 and M S O , 3 f ( 3 ) = 4 . Then we have
M S O , n BV p Var p ( M S O , 3 f ) Var p ( f ) = 1 + 2 p 3 p .
This, together with (9), leads to M S O , n BV p = 1 + 2 p 3 p when p ( 0 , 1 ) . This finishes the proof of Theorem 5. □
Remark 3.
It should be pointed out that part (i) of Theorem 5 implies M S O , n BV = 1 . Let S O , 3 = ( V , E ) with V = { 1 , 2 , 3 } and E = { 1 2 , 1 3 } and f be a function defined on V. Then
(i)
Var ( M S O , 3 f ) = Var ( f ) if and only if f satisfies one of the following conditions:
(a)
f ( i ) C for some C R and all i { 1 , 2 , 3 } ;
(b)
| f ( 1 ) | = | f ( 2 ) | < | f ( 3 ) | , f ( 1 ) f ( 3 ) 0 ;
(c)
| f ( 1 ) | = | f ( 3 ) | < | f ( 2 ) | , f ( 1 ) f ( 2 ) 0 ;
(d)
| f ( 1 ) | > 1 2 ( | f ( 2 ) | + | f ( 3 ) | ) , a 1 a i 0 , i = 2 , 3 .
(ii)
If p > 1 , then Var p ( M S O , 3 f ) = Var p ( f ) if and only if f satisfies the condition (a) or (d).
Theorem 6.
Let n 3 and 0 < p . Then
(i)
1 M P n BV p ( n 1 ) max { 1 , 1 / p } ;
(ii)
If n = 3 , then
M P n BV p = 1 , if p 0 p ; ( 1 + 3 p ) 1 / p 6 , if 0 < p < p 0 .
Here p 0 is the unique solution of equation 1 + 3 x = 6 x .
Proof. 
The proof will be divided into two steps.
Step 1: Proof of part (i). We may assume without loss of generality that P n = ( V , E ) , where V = { 1 , 2 , , n } and E = { n n 1 , n 1 n 2 , , 2 1 } . Let us consider the function f : V R defined by f ( i ) = 1 , i = 2 , 3 , , n and f ( 1 ) = 0 . Clearly, M P n f ( i ) = 1 , i = 2 , 3 , , n and M P n f ( 1 ) = 0 . Then we have
M P n BV p Var p ( M P n f ) Var p ( f ) = 1 .
We now prove
M P n BV p ( n 1 ) max { 1 / p , 1 } .
Let f = i = 1 n a i δ i and write
M P n f ( 1 ) = | a 1 | ,
M P n f ( 2 ) = max | a 2 | , 1 2 ( | a 2 | + | a 1 | ) ,
,
M P n f ( n 1 ) = max | a n 1 | , 1 2 ( | a n 1 | + | a n 2 | ) , , 1 n 1 i = 1 n 1 | a i | ,
M P n f ( n ) = max | a n | , 1 2 ( | a n | + | a n 1 | ) , , 1 n i = 1 n | a i | .
One can easily check that
| M P n f ( i ) M P n f ( i + 1 ) | i = 1 n 1 | a i a i + 1 | = Var ( f ) , for i = 1 , 2 , , n 1 .
It follows that
Var p ( M P n f ) i = 1 n 1 | M P n f ( i ) M P n f ( i + 1 ) | p 1 / p ( n 1 ) 1 / p Var ( f ) ( n 1 ) max { 1 / p , 1 } Var p ( f ) ,
which gives (10) and proves part (i).
Step 2: Proof of part (ii). Let p 0 be given as in Theorem 6. We want to show that
Var p ( M P 3 f ) Var p ( f ) , if p 0 p ,
Var p ( M P 3 f ) ( 1 + 3 p ) 1 / p 6 Var p ( f ) , if 0 < p < p 0 ,
for all f : V R with Var p ( f ) > 0 .
Now we prove (11) and (12). Without loss of generality, we may assume that P 3 = ( V , E ) , where V = { 1 , 2 , 3 } and E = { 1 2 , 2 3 } . Let f = i = 1 3 a i δ i . Without loss of generality, we may assume that a i 0 ( i = 1 , 2 , 3 ) and | a 1 a 2 | + | a 2 a 3 | > 0 . One can easily check that
M P 3 f ( 1 ) = max a 1 , 1 2 ( a 1 + a 2 ) , 1 3 ( a 1 + a 2 + a 3 ) ,
M P 3 f ( 2 ) = max a 2 , 1 2 ( a 2 + a 3 ) , M L 3 f ( 3 ) = a 3 .
Then we have
Var p ( M P 3 f ) = ( | M P 3 f ( 2 ) M P 3 f ( 1 ) | p + | M P 3 f ( 3 ) M P 3 f ( 2 ) | p ) 1 / p .
For convenience, we set
β = | a 1 a 2 | , γ = | a 2 a 3 | .
We consider the following cases:
(1) ( a 1 a 2 a 3 and a 1 > a 3 ). In this case we have M P 3 f ( 1 ) = a 1 , M P 3 f ( 2 ) = a 2 and
Var p ( M P 3 f ) Var p ( f ) = 1 .
This proves (11) in this case. Noting that 1 < ( 1 + 3 p ) 1 / p 6 when 0 < p < p 0 . This proves (12) in this case.
(2) ( a 1 a 3 a 2 and a 1 > a 2 ). In this case we have β γ , β > 0 and γ β [ 0 , 1 ] . Moreover, M P 3 f ( 1 ) = a 1 and M L 3 f ( 2 ) = 1 2 ( a 2 + a 3 ) . It holds that
( Var p ( M P 3 f ) ) p ( Var p ( f ) ) p = | 1 2 ( a 2 + a 3 ) a 1 | p + | 1 2 ( a 3 a 2 ) | p ( a 1 a 2 ) p + ( a 3 a 2 ) p = 1 2 p ( 2 β γ ) p + γ p β p + γ p = 1 2 p ( 2 γ β ) p + ( γ β ) p 1 + ( γ β ) p .
Let h ( x ) = ( 2 x ) p + x p 1 + x p , x [ 0 , 1 ] . Note that h ( x ) 0 for all x [ 0 , 1 ] and h ( x ) 2 p for all x [ 0 , 1 ] . Hence,
( Var p ( M P 3 f ) ) p ( Var p ( f ) ) p < 1 .
This proves (11) and (12) in this case.
(3) ( a 2 a 1 a 3 and a 2 > a 3 ). In this case we have M P 3 f ( 1 ) = 1 2 ( a 1 + a 2 ) and M P 3 f ( 2 ) = a 2 . Hence,
( Var p ( M P 3 f ) ) p ( Var p ( f ) ) p = | 1 2 ( a 2 a 1 ) | p + | a 2 a 3 | p | a 2 a 1 | p + | a 3 a 2 | p 1 ,
which proves (11) and (12) in this case.
(4) ( a 2 a 3 a 1 and a 2 > a 1 ). If a 3 1 2 ( a 1 + a 2 ) . In this case we have M P 3 f ( 1 ) = 1 2 ( a 1 + a 2 ) and M P 3 f ( 2 ) = a 2 . Then we have
( Var p ( M P 3 f ) ) p ( Var p ( f ) ) p = | 1 2 ( a 2 a 1 ) | p + | a 2 a 3 | p | a 2 a 1 | p + | a 3 a 2 | p < 1 .
If a 3 > 1 2 ( a 1 + a 2 ) . In this case we have M P 3 f ( 1 ) = 1 3 ( a 1 + a 2 + a 3 ) and M P 3 f ( 2 ) = a 2 . Note that | 2 a 2 ( a 1 + a 3 ) | 2 | a 2 a 1 | . Then
( Var p ( M P 3 f ) ) p ( Var p ( f ) ) p = | 1 3 ( 2 a 2 a 1 a 3 ) | p + | a 2 a 3 | p ( a 2 a 1 ) p + ( a 2 a 3 ) p < 1 .
Then (11) and (12) are proved in this case.
(5) ( a 3 a 1 a 2 and a 3 > a 2 ). If a 1 1 2 ( a 2 + a 3 ) . Then we have M P 3 f ( 1 ) = a 1 and M P 3 f ( 2 ) = 1 2 ( a 2 + a 3 ) . Note that | 2 a 1 ( a 2 + a 3 ) | a 1 a 2 . Then
( Var p ( M P 3 f ) ) p ( Var p ( f ) ) p = | 1 2 ( 2 a 1 a 2 a 3 ) | p + | 1 2 ( a 3 a 2 ) | p ( a 1 a 2 ) p + ( a 3 a 2 ) p 1 2 p < 1 .
This gives (11) and (12) in this case.
If a 1 < 1 2 ( a 2 + a 3 ) . Then γ > 2 β , γ > 0 and β γ [ 0 , 1 / 2 ) . Moreover, M P 3 f ( 1 ) = 1 3 ( a 1 + a 2 + a 3 ) and M P 3 f ( 2 ) = 1 2 ( a 2 + a 3 ) . It holds that
( Var p ( M P 3 f ) ) p ( Var p ( f ) ) p = | 1 6 ( a 2 + a 3 2 a 1 ) | p + | 1 2 ( a 3 a 2 ) | p ( a 1 a 2 ) p + ( a 3 a 2 ) p = 1 6 p ( γ 2 β ) p + ( 3 γ ) p γ p + β p = 1 6 p ( 1 2 β γ ) p + 3 p 1 + ( β γ ) p 1 + 3 p 6 p .
Noting that 1 + 3 p 6 p 1 when p p 0 . Here, p 0 is the unique solution of equation 1 + 3 x = 6 x . This proves (11) and (12) in this case.
(6) ( a 3 a 2 a 1 and a 3 > a 1 ). In this case we have γ β and γ > 0 . Moreover, M P 3 f ( 1 ) = 1 3 ( a 1 + a 2 + a 3 ) and M P 3 f ( 2 ) = 1 2 ( a 2 + a 3 ) . It follows that
( Var p ( M P 3 f ) ) p ( Var p ( f ) ) p = | 1 6 ( a 2 + a 3 2 a 1 ) | p + | 1 2 ( a 3 a 2 ) | p ( a 2 a 1 ) p + ( a 3 a 2 ) p = 1 6 p ( γ + 2 β ) p + ( 3 γ ) p β p + γ p .
When p ( 0 , 1 ] . It holds that
1 6 p ( γ + 2 β ) p + ( 3 γ ) p β p + γ p 1 6 p γ p + 2 p β p + ( 3 γ ) p β p + γ p < 1 + 3 p 6 p .
When p > 1 . Then
1 6 p ( γ + 2 β ) p + ( 3 γ ) p β p + γ p 1 6 p 2 p 1 γ p + 2 2 p 1 β p + ( 3 γ ) p β p + γ p max { 2 p 1 + 3 p , 2 2 p 1 } 6 p < 1 .
These prove (11) and (12) in this case.
Finally, let us consider the function f : V R defined by
f ( 1 ) = 1 , f ( 2 ) = 1 , f ( 3 ) = 7 .
It is clear that Var p ( f ) = 6 and M P 3 f ( 1 ) = 3 , M P 3 f ( 2 ) = 4 and M P 3 f ( 3 ) = 7 . Then we have Var p ( M P 3 f ) = ( 1 + 3 p ) 1 / p . This gives Var p ( M P 3 f ) Var p ( f ) ( 1 + 3 p ) 1 / p 6 , which together with part (i), (11) and (12) implies the conclusion in part (ii). This finishes the proof of Theorem 6. □
Remark 4.
Let P 3 = ( V , E ) with V = { 1 , 2 , 3 } and E = { 1 2 , 2 3 } and f be a function defined on V. Let 0 < p . Then Var ( M P 3 f ) = Var ( f ) if and only if f satisfies | f ( 1 ) | | f ( 2 ) | | f ( 3 ) | and f ( i ) f ( j ) 0 for all i , j { 1 , 2 , 3 } .
Theorem 7.
Let n 3 and 0 < p . Then
(i)
1 M D n BV p n ( n 1 ) 2 1 / p ( 2 n 4 ) max { 1 1 / p , 0 } ;
(ii)
If p 1 and n = 3 , then M D 3 BV p = 1 .
Proof. 
We shall divide the proof into two steps:
Step 1: Proof of part (i). Without loss of generality, we may assume that D n = ( V , E ) , where V = { 1 , 2 , , n } and E = { i j : 1 j < i n } . Taking f : V R by f ( i ) = 1 for i = 2 , , n and f ( 1 ) = 0 . Clearly, M D n f ( 1 ) = 0 , M D n f ( i ) = 1 for i = 2 , 3 , , n . Moreover, Var p ( f ) = Var p ( M D n f ) = ( n 1 ) 1 / p . It follows that
M D n BV p Var p ( M D n f ) Var p ( f ) = 1 .
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
M D 3 BV p 1 .
Let D 3 = ( V , E ) with V = { 1 , 2 , 3 } and E = { 1 2 , 2 3 , 1 3 } . Let f = i = 1 3 a i δ i with | a 2 a 1 | p + | a 3 a 2 | p + | a 1 a 3 | p > 0 . One can easily check that
M D 3 f ( 1 ) = max a 1 , 1 3 i = 1 3 ( a 1 + a 2 + a 3 ) ,
M D 3 f ( 2 ) = max a 2 , 1 2 ( a 2 + a 3 ) , M D 3 f ( 3 ) = a 3 .
To prove (13), it is enough to show that
Var p ( M D 3 f ) Var p ( f ) .
Without loss of generality, we may assume that a i 0 ( i = 1 , 2 , 3 ) . For convenience, we set
β = | a 1 a 2 | , γ = | a 1 a 3 | .
We consider the follows cases:
(1) ( a 1 a 2 a 3 and a 1 > a 3 ). In this case we have M D 3 f ( 1 ) = a 1 and M D 3 f ( 2 ) = a 2 . It holds that
( Var p ( M D 3 f ) ) p ( Var p ( f ) ) p = | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p = 1 ,
which gives (14) in this case.
(2) ( a 1 a 3 a 2 and a 1 > a 2 ). In this case we have M D 3 f ( 1 ) = a 1 , M D 3 f ( 2 ) = 1 2 ( a 2 + a 3 ) and | M D 3 f ( 2 ) M D 3 f ( 1 ) | = 1 2 ( 2 a 1 ( a 2 + a 3 ) ) | a 1 a 2 | . It follows that
( Var p ( M D 3 f ) ) p ( Var p ( f ) ) p = | 1 2 ( 2 a 1 ( a 2 + a 3 ) ) | p + | 1 2 ( a 3 a 2 ) | p + | a 3 a 1 | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p = 1 .
This proves (14) in this case.
(3) ( a 2 a 1 a 3 and a 2 > a 3 ). If a 1 1 2 ( a 2 + a 3 ) . In this case we have M D 3 f ( 1 ) = a 1 and M D 3 f ( 2 ) = a 2 . It holds that
( Var p ( M D 3 f ) ) p ( Var p ( f ) ) p = | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p = 1 .
If a 1 < 1 2 ( a 2 + a 3 ) . Then we have M D 3 f ( 1 ) = 1 3 ( a 1 + a 2 + a 3 ) and M D 3 f ( 2 ) = a 2 . Note that β > γ 0 . We have
( Var p ( M D 3 f ) ) p ( Var p ( f ) ) p = | 1 3 ( 2 a 2 ( a 1 + a 3 ) ) | p + | a 3 a 2 | p + | 1 3 ( a 1 + a 2 2 a 3 ) | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p 1 3 p ( 2 β + γ ) p + 3 p ( β + γ ) p + ( β + 2 γ ) p β p + ( β + γ ) p + γ p 1 3 p ( 2 + γ β ) p + 3 p ( 1 + γ β ) p + ( 1 + 2 γ β ) p 1 + ( 1 + γ β ) p + ( γ β ) p .
Noting that h 1 ( x ) = ( 2 + x ) p + 3 p ( 1 + x ) p + ( 1 + 2 x ) p 1 + x p + ( 1 + x ) p 3 p for all x [ 0 , 1 ) since p 1 . This implies
( Var p ( M D 3 f ) ) p ( Var p ( f ) ) p 1 .
This proves (14) in this case.
(4) ( a 2 a 3 a 1 and a 2 > a 1 ). In this case we have M D 3 f ( 1 ) = 1 3 ( a 1 + a 2 + a 3 ) and M D 3 f ( 2 ) = a 2 . If a 3 1 2 ( a 1 + a 2 ) . Then we have
| M D 3 f ( 1 ) M D 3 f ( 2 ) | = 1 3 ( 2 a 2 ( a 1 + a 3 ) ) < a 2 a 1
and
| M D 3 f ( 3 ) M D 3 f ( 1 ) | = 1 3 ( 2 a 3 ( a 1 + a 2 ) ) < a 3 a 1 .
It holds that
( Var p ( M D 3 f ) ) p ( Var p ( f ) ) p = | 1 3 ( 2 a 2 ( a 1 + a 3 ) ) | p + | a 3 a 2 | p + | 1 3 ( 2 a 3 ( a 1 + a 2 ) ) | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p = 1 .
If a 3 < 1 2 ( a 1 + a 2 ) . Then β > 2 γ and γ β [ 0 , 1 / 2 ) . Note that
h 2 ( x ) = ( 2 x ) p + 3 p ( 1 x ) p + ( 1 2 x ) p 1 + x p + ( 1 x ) p 3 p , for all x [ 0 , 1 2 ] .
Then we have
( Var p ( M D 3 f ) ) p ( Var p ( f ) ) p = | 1 3 ( 2 a 2 ( a 1 + a 3 ) ) | p + | a 3 a 2 | p + | 1 3 ( a 1 + a 2 2 a 3 ) | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p 1 3 p ( 2 β γ ) p + 3 p ( β γ ) p + ( β 2 γ ) p β p + ( β γ ) p + γ p 1 3 p ( 2 γ β ) p + 3 p ( 1 γ β ) p + ( 1 2 γ β ) p 1 + ( 1 γ β ) p + ( γ β ) p 1 .
This proves (14) in this case.
(5) ( a 3 a 1 a 2 and a 3 > a 2 ). If a 1 1 2 ( a 2 + a 3 ) . Then we have M D 3 f ( 1 ) = a 1 and M D 3 f ( 2 ) = 1 2 ( a 2 + a 3 ) . It follows that
| M D 3 f ( 1 ) M D 3 f ( 2 ) | = 1 2 ( 2 a 1 ( a 2 + a 3 ) ) ( a 1 a 2 ) .
Therefore,
( Var p ( M D 3 f ) ) p ( Var p ( f ) ) p = | 1 2 ( 2 a 1 ( a 2 + a 3 ) ) | p + | 1 2 ( a 2 a 3 ) | p + | a 3 a 1 | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p < | a 1 a 2 | p + | a 2 a 3 | p + | a 3 a 1 | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p = 1 .
This proves (14) in this case.
If a 1 < 1 2 ( a 2 + a 3 ) . Then we have β < γ . Moreover, M D 3 f ( 1 ) = 1 3 ( a 1 + a 2 + a 3 ) and M D 3 f ( 2 ) = 1 2 ( a 2 + a 3 ) . We have
( Var p ( M D 3 f ) ) p ( Var p ( f ) ) p = | 1 6 ( a 2 + a 3 2 a 1 ) | p + | 1 2 ( a 3 a 2 ) | p + | 1 3 ( 2 a 3 ( a 1 + a 2 ) ) | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p 1 6 p ( γ β ) p + 3 p ( β + γ ) p + 2 p ( β + 2 γ ) p β p + ( β + γ ) p + γ p 1 6 p ( 1 β γ ) p + 3 p ( 1 + β γ ) p + 2 p ( 2 + β γ ) p 1 + ( 1 + β γ ) p + ( β γ ) p .
Note that β γ [ 0 , 1 ) and let h 3 ( x ) = ( 1 x ) p + 3 p ( 1 + x ) p + 2 p ( 2 + x ) p 1 + x p + ( 1 + x ) p for all x [ 0 , 1 ) . Since ( 1 x ) p + 3 p ( 1 + x ) p ( 4 + 2 x ) p for all x [ 0 , 1 ) because p 1 , then
h 3 ( x ) 2 ( 4 + 2 x ) p 1 + x p + ( 1 + x ) p 6 p , for all x [ 0 , 1 ) .
Hence, we have
( Var p ( M D 3 f ) ) p ( Var p ( f ) ) p 1 .
This proves (14) in this case.
(6) ( a 3 a 2 a 1 and a 3 > a 1 ). Then γ > β , γ > 0 and β γ [ 0 , 1 ) . Moreover, M D 3 f ( 1 ) = 1 3 ( a 1 + a 2 + a 3 ) and M D 3 f ( 2 ) = 1 2 ( a 2 + a 3 ) . Then we have
( Var p ( M D 3 f ) ) p ( Var p ( f ) ) p = | 1 6 ( a 2 + a 3 2 a 1 ) | p + | 1 2 ( a 3 a 2 ) | p + | 1 3 ( 2 a 3 ( a 1 + a 2 ) ) | p | a 2 a 1 | p + | a 3 a 2 | p + | a 3 a 1 | p 1 6 p ( γ + β ) p + 3 p ( γ β ) p + 2 p ( 2 γ β ) p β p + ( γ β ) p + γ p 1 6 p ( 1 + β γ ) p + 3 p ( 1 β γ ) p + 2 p ( 2 β γ ) p 1 + ( 1 β γ ) p + ( β γ ) p .
Let h 4 ( x ) = ( 1 + x ) p + 3 p ( 1 x ) p + 2 p ( 2 x ) p 1 + x p + ( 1 x ) p , x [ 0 , 1 ) . Notice that ( 1 + x ) p + 3 p ( 1 x ) p ( 4 2 x ) p for all x [ 0 , 1 ) since p 1 . Then
h ( x ) 2 ( 4 2 x ) p 1 + x p + ( 1 x ) p 6 p , for all x [ 0 , 1 ) .
Therefore,
( Var p ( M D 3 f ) ) p ( Var p ( f ) ) p 1 .
This gives (14) in this case. The proof of Theorem 7 is now complete. □
Remark 5.
Let D 3 = ( V , E ) with V = { 1 , 2 , 3 } and E = { 1 2 , 2 3 , 1 3 } and f be a function defined on V. Then Var ( M D 3 f ) = Var ( f ) if and only if f satisfies one of the following conditions:
(a)
f ( i ) C for some C R and all i { 1 , 2 , 3 } ;
(b)
| f ( 1 ) | | f ( 2 ) | | f ( 3 ) | , | f ( 1 ) | > | f ( 3 ) | , f ( i ) f ( j ) 0 for all i , j { 1 , 2 , 3 } ;
(c)
| f ( 2 ) | | f ( 1 ) | | f ( 3 ) | , | f ( 2 ) | > | f ( 3 ) , | f ( 1 ) | 1 2 ( | f ( 2 ) | + | f ( 3 ) | ) , f ( i ) f ( j ) 0 for all i , j { 1 , 2 , 3 } .
Theorem 8.
Let n 3 and 0 < p . Then
(i)
1 1 n n 2 min { 1 / p 1 , 0 } M C n BV p n max { 1 , 1 / p } ( j = 1 n 1 1 j ) ;
(ii)
If p 1 , then M C 3 BV p 2 3 ;
(iii)
M C 3 BV = 2 3 .
Proof. 
The proof will be divided into two steps.
Step 1: Proof of part (i). Without loss of generality, we may assume that C n = ( V , E ) , where V = { 1 , 2 , , n } and E = { 1 2 , 2 3 , , n 1 n , n 1 } . Let f = i = 1 n a i δ i . It is clear that
M C n f ( 1 ) = max | a 1 | , 1 2 ( | a 1 | + | a 2 | ) , , 1 n i = 1 n | a i | ,
M C n f ( 2 ) = max | a 2 | , 1 2 ( | a 2 | + | a 3 | ) , , 1 n i = 1 n | a i | ,
,
M C n f ( n 1 ) = max | a n 1 | , 1 2 ( | a n 1 | + | a n | ) , , 1 n i = 1 n | a i | ,
M C n f ( n ) = max | a n | , 1 2 ( | a n | + | a 1 | ) , , 1 n i = 1 n | a i | .
Invoking Lemma 2.1 in [20], we get
| M C n f ( 1 ) M C n f ( 2 ) | | a 1 a 2 | + 1 2 | a 1 a 3 | + + 1 n 2 | a 1 a n 1 | + 1 n 1 | a 1 a n | j = 1 n 1 1 j | a 1 a 2 | + j = 2 n 1 1 j | a 2 a 3 | + + 1 n 1 | a n 1 a n | j = 1 n 1 1 j Var ( f ) .
Similarly one has
| M C n f ( i ) M C n f ( i + 1 ) | j = 1 n 1 1 j Var ( f ) , for i = 2 , , n 1 ;
| M C n f ( n ) M C n f ( 1 ) | j = 1 n 1 1 j Var ( f ) .
Thus we have
Var p ( M C n f ) = i = 2 n | M C n f ( i ) M C n f ( i 1 ) | p + | M C n f ( n ) M C n f ( 1 ) | p 1 / p n 1 / p j = 1 n 1 1 j Var ( f ) n max { 1 , 1 / p } j = 1 n 1 1 j Var p ( f ) .
This gives
M C n BV p n max { 1 , 1 / p } j = 1 n 1 1 j .
On the other hand, we get
M C n BV p Var p ( M C n δ 1 ) Var p ( δ 1 ) = ( 1 1 n ) p + j = 1 n 1 ( 1 j 1 j + 1 ) p 1 / p 2 1 / p 1 1 n n 2 min { 1 / p 1 , 0 } .
This proves part (i) of Theorem 8.
Step 2: Proofs of parts (ii) and (iii). At first, we prove
M C 3 BV p 2 3 .
Without loss of generality, we assume that C 3 = ( V , E ) with V = { 1 , 2 , 3 } and E = { 1 2 , 2 3 , 3 1 } . Let f = i = 1 3 a i δ i with | a 2 a 1 | p + | a 3 a 2 | p + | a 1 a 3 | p > 0 . We write
M C 3 f ( 1 ) = max | a 1 | , 1 2 ( | a 1 | + | a 2 | ) , 1 3 ( | a 1 | + | a 2 | + | a 3 | ) ,
M C 3 f ( 2 ) = max | a 2 | , 1 2 ( | a 2 | + | a 3 | ) , 1 3 ( | a 1 | + | a 2 | + | a 3 | ) ,
M C 3 f ( 3 ) = max | a 3 | , 1 2 ( | a 3 | + | a 1 | ) , 1 3 ( | a 1 | + | a 2 | + | a 3 | ) .
Then we have
Var p ( M C 3 f ) = ( | M C 3 f ( 1 ) M C 3 f ( 2 ) | p + | M C 3 f ( 2 ) M C 3 f ( 3 ) | p + | M C 3 f ( 3 ) M C 3 f ( 1 ) | p ) 1 / p .
To prove (15), it suffices to show that
Var p ( M C 3 f ) 2 3 Var p ( f ) .
Without loss of generality we may assume that all a i 0 ( i = 1 , 2 , 3 ) . Let
β = | a 1 a 2 | , γ = | a 2 a 3 | .
We only consider the following two cases since the other cases are analogous.
(1) ( a 1 a 2 a 3 and a 1 > a 3 ). When a 2 1 2 ( a 1 + a 3 ) , then γ β and γ > 0 . Moreover, M C 3 f ( 1 ) = a 1 , M C 3 f ( 2 ) = a 2 and M C 3 f ( 3 ) = 1 3 ( a 1 + a 2 + a 3 ) . It follows that
( Var p ( M C 3 f ) ) p Var p ( f ) = ( a 1 a 2 ) p + 2 a 2 ( a 1 + a 3 ) 3 p + 2 a 1 ( a 2 + a 3 ) 3 p ( a 1 a 2 ) p + ( a 2 a 3 ) p + ( a 1 a 3 ) p = β p + γ β 3 p + 2 β + γ 3 p β p + γ p + ( β + γ ) p = 1 3 p ( 3 β γ ) p + ( 1 β γ ) p + ( 2 β γ + 1 ) p ( β γ ) p + ( 1 + β γ ) p + 1 .
Note that β γ [ 0 , 1 ] . Let g ( x ) = ( 3 x ) p + ( 1 x ) p + ( 2 x + 1 ) p x p + ( 1 + x ) p + 1 , x [ 0 , 1 ] . Noting that g ( x ) < 2 p for all x [ 0 , 1 ] when p 1 . Then
( Var p ( M C 3 f ) ) p ( Var p ( f ) ) p 2 3 p .
This proves (16) in this case.
When a 2 < 1 2 ( a 1 + a 3 ) . Then γ < β and M C 3 f ( 1 ) = a 1 , M C 3 f ( 2 ) = 1 3 ( a 1 + a 2 + a 3 ) and M C 3 f ( 3 ) = 1 2 ( a 1 + a 3 ) . It follows that
( Var p ( M C 3 f ) ) p Var p ( f ) = 2 a 1 ( a 2 + a 3 ) 3 p + ( a 1 + a 3 ) 2 a 2 6 p + a 1 a 3 2 p ( a 1 a 2 ) p + ( a 2 a 3 ) p + ( a 1 a 3 ) p = 2 β + γ 3 p + β γ 6 p + β + γ 2 p β p + ( β + γ ) p + γ p = 1 6 p ( 2 ( 2 + γ β ) ) p + ( 1 γ β ) p + ( 3 ( 1 + γ β ) ) p 1 + ( 1 + γ β ) p + ( γ β ) p .
Note that γ β [ 0 , 1 ) . Let g ( x ) = ( 2 ( 2 + x ) ) p + ( 1 x ) p + ( 3 ( 1 + x ) ) p 1 + ( 1 + x ) p + x p , x [ 0 , 1 ) . Since p 1 , we have
g ( x ) 4 p 2 ( 1 + x 2 ) p 1 + ( 1 + x ) p + x p 4 p , for x [ 0 , 1 ) .
This yields
( Var p ( M C 3 f ) ) p ( Var p ( f ) ) p 2 3 p ,
which proves (16) in this case.
(2) ( a 1 a 3 a 2 and a 1 > a 2 ). In this case we have β γ and β > 0 . Moreover, M C 3 f ( 1 ) = a 1 , M C 3 f ( 2 ) = 1 3 ( a 1 + a 2 + a 3 ) and M C 3 f ( 3 ) = 1 2 ( a 1 + a 3 ) . It follows that
( Var p ( M C 3 f ) ) p ( Var p ( f ) ) p = 2 a 1 ( a 2 + a 3 ) 3 p + ( a 1 + a 3 ) 2 a 2 6 p + a 1 a 3 2 p ( a 1 a 2 ) p + ( a 3 a 2 ) p + ( a 1 a 3 ) p = 2 β γ 3 p + β + γ 6 p + β γ 2 p β p + γ p + ( β γ ) p = 1 6 p ( 2 ( 2 γ β ) ) p + ( 1 + γ β ) p + ( 3 ( 1 γ β ) ) p 1 + ( γ β ) p + ( 1 γ β ) p .
Let h ( x ) = ( 2 ( 2 x ) ) p + ( 1 + x ) p + ( 3 ( 1 x ) ) p 1 + x p + ( 1 x ) p , x [ 0 , 1 ] . Notice that
h ( x ) 2 ( 2 ( 2 x ) ) p 1 + x p + ( 1 x ) p 4 p 2 ( 1 x 2 ) p 1 + x p + ( 1 x ) p 4 p , for x [ 0 , 1 ]
since p 1 . This proves (16) in this case.
On the other hand, let f : { 1 , 2 , 3 } R be defined by f ( 1 ) = 2 , f ( 2 ) = f ( 3 ) = 1 . Then we have M C 3 f ( 1 ) = 2 , M C 3 f ( 2 ) = 4 3 and M C 3 f ( 3 ) = 3 2 . It follows that
Var ( M C 3 f ) Var ( f ) = ( 2 4 3 ) + ( 3 2 4 3 ) + ( 2 3 2 ) 2 = 2 3 ,
which together with part (ii) leads to
M C 3 BV = 2 3 .

4. Conclusions and Further Comments

It should be pointed out that our main results represent some significant extensions of the main results in [20,21]. In the works [20,21], the authors established some BV p norms of the Hardy–Littlewood maximal operator on undirected graphs. Here, we focus on the BV p norms of the Hardy–Littlewood maximal operator on some directed graphs. Combining with the undirected graph case, the directed graph case is often more complex. Our main results not only enrich the variation inequalities for Hardy–Littlewood maximal operators defined on finite graphs, but also explore some new graphs to serve our aim. This is the novelty of this paper.

Author Contributions

Validation and formal analysis, F.L.; Writing original draft and editing, X.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported partly by the National Natural Science Foundation of China (Grant No. 11701333).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors want to express their sincere thanks to the referees for their valuable remarks and suggestions, which made this paper more readable.

Conflicts of Interest

All of authors in this article declare no conflict of interest. All of funders in this article support the article’s publication.

References

  1. Kinnunen, J. The Hardy-Littlewood maximal function of a Sobolev function. Israel J. Math. 1997, 100, 117–124. [Google Scholar] [CrossRef]
  2. Carneiro, E.; Moreira, D. On the regularity of maximal operators. Proc. Am. Math. Soc. 2008, 136, 4395–4404. [Google Scholar] [CrossRef] [Green Version]
  3. Kinnunen, J.; Lindqvist, P. The derivative of the maximal function. J. Reine Angew. Math. 1998, 503, 161–167. [Google Scholar]
  4. Kinnunen, J.; Saksman, E. Regularity of the fractional maximal function. Bull. Lond. Math. Soc. 2003, 35, 529–535. [Google Scholar] [CrossRef]
  5. Liu, F.; Wu, H. On the regularity of the multisublinear maximal functions. Can. Math. Bull. 2015, 58, 808–817. [Google Scholar] [CrossRef]
  6. Aldaz, J.M.; Lázaro, J.P. Functions of bounded variation, the derivative of the one dimensional maximal function, and applications to inequalities. Trans. Am. Math. Soc. 2007, 359, 2443–2461. [Google Scholar] [CrossRef]
  7. Carneiro, E.; Madrid, J. Derivative bounds for fractional maximal functions. Trans. Am. Math. Soc. 2017, 369, 4063–4092. [Google Scholar] [CrossRef]
  8. Carneiro, E.; Madrid, J.; Pierce, L.B. Endpoint Sobolev and BV continuity for maximal operators. J. Funct. Anal. 2017, 273, 3262–3294. [Google Scholar] [CrossRef] [Green Version]
  9. Kurka, O. On the variation of the Hardy-Littlewood maximal function. Ann. Acad. Sci. Fenn. Math. 2015, 40, 109–133. [Google Scholar] [CrossRef]
  10. Luiro, H. The variation of the maximal function of a radial function. Ark. Mat. 2018, 56, 147–161. [Google Scholar] [CrossRef] [Green Version]
  11. Luiro, H.; Madrid, J. The variation of the fractional maximal functoin of a radial function. Int. Math. Res. Not. 2019, 2019, 5284–5298. [Google Scholar] [CrossRef] [Green Version]
  12. Hajłasz, P.; Malý, J. On approximate differentiability of the maximal function. Proc. Am. Math. Soc. 2010, 138, 165–174. [Google Scholar] [CrossRef] [Green Version]
  13. Chen, P.; Duong, X.T.; Li, J.; Wu, Q. Compactness of Riesz transform commutator on stratified Lie groups. J. Funct. Anal. 2019, 277, 1639–1676. [Google Scholar] [CrossRef] [Green Version]
  14. Chen, W.; Fu, Z.; Grafakos, L.; Wu, Y. Fractional Fourier transforms on Lp and applications. Appl. Comput. Harmon. Anal. 2021, 55, 71–96. [Google Scholar] [CrossRef]
  15. Shi, S.; Fu, Z.; Lu, S. On the compactness of commutators of Hardy operators. Pac. J. Math. 2020, 307, 239–256. [Google Scholar] [CrossRef]
  16. Shi, S.; Xiao, J. Fractional capacities relative to bounded open Lipschitz sets complemented. Calc. Var. Partial. Differ. Equ. 2017, 56, 1–22. [Google Scholar] [CrossRef]
  17. Yang, M.; Fu, Z.; Sun, J. Existence and large time behavior to coupled chemotaxis-fluid equations in Besov–Morrey spaces. J. Differ. Equa. 2019, 266, 5867–5894. [Google Scholar] [CrossRef]
  18. Hajłasz, P.; Onninen, J. On boundedness of maximal functions in Sobolev spaces. Ann. Acad. Sci. Fenn. Math. 2004, 29, 167–176. [Google Scholar]
  19. Luiro, H. Continuity of the maximal operator in Sobolev spaces. Proc. Am. Math. Soc. 2007, 135, 243–251. [Google Scholar] [CrossRef] [Green Version]
  20. Liu, F.; Xue, Q. On the variation of the Hardy-Littlewood maximal functions on finite graphs. Collect. Math. 2021, 72, 333–349. [Google Scholar] [CrossRef]
  21. González-Riquelme, C.; Madrid, J. Sharp inequalities for maixmal operators on finite graphs. J. Geom. Anal. 2021, 31, 9708–9744. [Google Scholar] [CrossRef]
  22. Badr, N.; Martell, J.M. Weighted norm inequalities on graphs. J. Geom. Anal. 2012, 22, 1173–1210. [Google Scholar] [CrossRef] [Green Version]
  23. Cowling, M.; Meda, S.; Setti, A.G. Estimates for functions of the Laplace operator on homogeneous trees. Trans. Am. Math. Soc. 2000, 352, 4271–4293. [Google Scholar] [CrossRef]
  24. Korányi, A.; Picardello, M.A. Boundary behaviour of eigenfunctions of the Laplace operator on trees. Ann. Sc. Norm. Super. Pisa-Cl. Sci. 1986, 13, 389–399. [Google Scholar]
  25. Soria, J.; Tradacete, P. Best constants for the Hardy-Littlewood maximal operator on finite graphs. J. Math. Anal. Appl. 2016, 436, 661–682. [Google Scholar] [CrossRef]
  26. Zhang, X.; Liu, F.; Zhang, H. Sharp inequalities for the Hardy-Littlewood maximal operator on finite directed graphs. Mathematics 2021, 9, 946. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Liu, F.; Zhang, X. Variation Inequalities for the Hardy-Littlewood Maximal Function on Finite Directed Graphs. Mathematics 2022, 10, 950. https://doi.org/10.3390/math10060950

AMA Style

Liu F, Zhang X. Variation Inequalities for the Hardy-Littlewood Maximal Function on Finite Directed Graphs. Mathematics. 2022; 10(6):950. https://doi.org/10.3390/math10060950

Chicago/Turabian Style

Liu, Feng, and Xiao Zhang. 2022. "Variation Inequalities for the Hardy-Littlewood Maximal Function on Finite Directed Graphs" Mathematics 10, no. 6: 950. https://doi.org/10.3390/math10060950

APA Style

Liu, F., & Zhang, X. (2022). Variation Inequalities for the Hardy-Littlewood Maximal Function on Finite Directed Graphs. Mathematics, 10(6), 950. https://doi.org/10.3390/math10060950

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