Next Article in Journal
Balancing Tradeoffs in Network Queue Management Problem via Forward–Backward Sweeping with Finite Checkpoints
Next Article in Special Issue
A Study on Solutions for a Class of Higher-Order System of Singular Boundary Value Problem
Previous Article in Journal
Azulene, Reactivity, and Scientific Interest Inversely Proportional to Ring Size; Part 2: The Seven-Membered Ring
Previous Article in Special Issue
Application of the New Iterative Method (NIM) to the Generalized Burgers–Huxley Equation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Existence for Two-Point nth Order Boundary Value Problems under Barrier Strips

by
Ravi P. Agarwal
1,*,
Todor Z. Todorov
2 and
Petio S. Kelevedjiev
3
1
Department of Mathematics, Texas A and M University, Kingsville, TX 78363, USA
2
Department of Electrical Engineering, Electronics and Automation, Faculty of Engineering and Pedagogy of Sliven, Technical University of Sofia, 8800 Sliven, Bulgaria
3
Department of Qualification and Professional Development of Teachers of Sliven, Technical University of Sofia, 8800 Sliven, Bulgaria
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(7), 1394; https://doi.org/10.3390/sym15071394
Submission received: 2 June 2023 / Revised: 23 June 2023 / Accepted: 4 July 2023 / Published: 10 July 2023
(This article belongs to the Special Issue Symmetry in Nonlinear and Convex Analysis)

Abstract

:
Using barrier strip conditions, we study the solvability of two-point boundary value problems for the equation x ( n ) = f ( t , x , x , , x ( n 1 ) ) . In the case n = 4 , we apply the used approach to obtain results guaranteeing positive or non-negative, monotone, convex solutions to boundary value problems with various boundary conditions.

1. Introduction

We consider boundary value problems (BVPs) for the equation
x ( n ) = f ( t , x , x , , x ( n 1 ) ) , t [ 0 , 1 ] ,
n 4 , with boundary conditions (BCs) either
x ( i ) ( 0 ) = A i , i = 0 , k 1 1 ¯ , x ( i ) ( 1 ) = A i , i = k 1 , k 2 1 ¯ , , x ( i ) ( 0 ) = A i , i = k l , n 3 ¯ , x ( n 2 ) ( 0 ) = B , x ( n 2 ) ( 1 ) = C ,
where l N , 1 l n 3 , and k j N , j = 1 , l ¯ , are fixed with k j 1 + 1 k j , j = 2 , l ¯ , k l n 3 , or
x ( i ) ( 1 ) = A i , i = 0 , m 1 1 ¯ , x ( i ) ( 0 ) = A i , i = m 1 , m 2 1 ¯ , , x ( i ) ( 1 ) = A i , i = m s , n 3 ¯ , x ( n 2 ) ( 0 ) = B , x ( n 2 ) ( 1 ) = C ,
where s N , 1 s n 3 , and m j N , j = 1 , s ¯ , are fixed with m j 1 + 1 m j , j = 2 , s ¯ , m s n 3 .
In these problems, the function f ( t , p 0 , , p n 1 ) is defined for ( t , p 0 , , p n 1 ) [ 0 , 1 ] × D 0 × D 1 × × D n 1 , D i R , i = 0 , n 1 ¯ , and A i , i = 0 , n 3 ¯ , B and C are real constants.
The solvability of two-point nth order BVPs has been studied, for example, by N. AL-Zaid et al. [1], P. Eloe and J. Henderson [2], M. El-Shahed [3], A. Granas et al. [4], I. Karaca and F. Fen [5], A. Lepin et al. [6], H. Lian et al. [7], M. Pei and S. Chang [8], K. Prasad et al. [9] and N. Vasil’ev et al. [10]. We will focus our attention in more detail on the most recent of these articles, in which additional literature can be found.
In [1], the authors employ the double decomposition method to obtain an approximate solution of BVPs for equations of the form
x ( n ) + R x ( t ) + N x ( t ) = g ( t ) , t ( a , b ) ,
where R is a linear differential operator, N is a nonlinear operator and the function g is continuous.
The BVP for (1), t ( a , b ) , with BCs
x ( i 1 ) ( T 1 ) = A i , i = 1 , , n 1 , x ( T 2 ) = A n ,
has been studied recently in [2]. Here, a < T 1 < T 2 < b , and f : ( a , b ) × R n R . The authors apply a sequential compactness argument to obtain the existence of solutions under the assumption that the solutions of initial value problems for (1) are unique and extend to ( a , b ) and the solution of the BVPs for (1) with BCs
x ( i 1 ) ( T 1 ) = A i , i = 1 , , n 1 , x ( j 1 ) ( T 2 ) = A n ,
where j { 1 , 2 } are unique if they exist.
A fixed point theorem is used in [5] to obtain the existence of at least two positive solutions for a BVP for
x ( n ) = f ( t , x ) , t ( 0 , 1 ) ,
with integral BCs; here, f : [ 0 , 1 ] × [ 0 , ) [ 0 , ) is continuous.
A result from [7] guarantees at least three solutions in C n 1 [ 0 , ) C n [ 0 , ) to the problem
x ( n ) = q ( t ) f ( t , x , , x ( n 1 ) ) , 0 < t < + ,
x ( i ) ( 0 ) = A i , i = 0 , 1 , , n 3 , x ( n 2 ) ( 0 ) a x ( n 1 ) ( 0 ) = B , lim t + x ( n 1 ) ( t ) = C ,
where q : ( 0 , + ) ( 0 , + ) and f : [ 0 , + ) × R n R are continuous, a > 0 , A i , B , C R , i = 0 , 1 , , n 3 . Here, the authors use upper and lower solutions and a Nagumo-type condition to apply the Schauder fixed point theorem.
The shooting method together with maximum principle and Kneser–Hukahara continuum theorem have been used in [8] to establish an existence and uniqueness result for (1), t ( a , b ) , with BCs
g i ( x ( i ) ( a ) , x ( i + 1 ) ( a ) , , x ( n 1 ) ( a ) ) = 0 , i = 0 , 1 , , n 2 ,
h ( x ( a ) , x ( a ) , , x ( n 1 ) ( a ) ; x ( b ) , x ( b ) , , x ( n 1 ) ( b ) ) = 0 ,
where f ( t , p 0 , p 1 , , p n 1 ) is continuous on [ a , b ] × R n , g i ( p i , p i + 1 , , p n 1 ) , i = 0 , 1 , , n 2 , are continuous on R n i and h ( p 0 , p 1 , , p n 1 ; q 0 , q 1 , , q n 1 ) is continuous on R 2 n .
We will prove the existence of solutions to (1), (2) and (1), (3) under the following assumptions:
Hypothesis 1 (H1).
For some constants F i , L i , i = 1 , 2 , such that
F 2 < F 1 C B L 1 < L 2 , [ F 2 , L 2 ] D n 1 ,
it holds
f ( t , p 0 , , p n 1 ) 0 f o r ( t , p 0 , , p n 1 ) [ 0 , 1 ] × D 0 × D 1 × × D n 2 × [ L 1 , L 2 ] ,
f ( t , p 0 , , p n 1 ) 0 f o r ( t , p 0 , , p n 1 ) [ 0 , 1 ] × D 0 × D 1 × × D n 2 × [ F 2 , F 1 ] .
Hypothesis 2 (H2).
For some constants F i , L i , i = 1 , 2 , such that
F 2 < F 1 C B L 1 < L 2 , [ F 2 , L 2 ] D n 1 ,
it holds
f ( t , p 0 , , p n 1 ) 0 f o r ( t , p 0 , , p n 1 ) [ 0 , 1 ] × D 0 × D 1 × × D n 2 × [ L 1 , L 2 ] ,
f ( t , p 0 , , p n 1 ) 0 f o r ( t , p 0 , , p n 1 ) [ 0 , 1 ] × D 0 × D 1 × × D n 2 × [ F 2 , F 1 ] .
Hypothesis 3 (H3).
For a sufficiently small δ > 0 and suitable constants m i M i , i = 0 , n 1 ¯ , it holds
[ m i δ , M i + δ ] D i , i = 0 , n 1 ¯ ,
and f ( t , p 0 , , p n 1 ) is continuous on [ 0 , 1 ] × J , where
J = [ m 0 δ , M 0 + δ ] × [ m 1 δ , M 1 + δ ] × × [ m n 1 δ , M n 1 + δ ] .
The strips [ 0 , 1 ] × [ L 1 , L 2 ] and [ 0 , 1 ] × [ F 2 , F 1 ] from (H1) as well as [ 0 , 1 ] × [ L 1 , L 2 ] and [ 0 , 1 ] × [ F 2 , F 1 ] from (H2) are a kind of barriers for the ( n 1 ) th derivative of each C n [ 0 , 1 ] -solution to the families of BVPs for
x ( n ) = λ f ( t , x , x , , x ( n 1 ) ) , λ [ 0 , 1 ] , t ( 0 , 1 ) , ( 1 ) λ
with BCs (2) or (3). This property provides a priori bounds for the ( n 1 ) th derivatives of the solutions to (1) λ , (2) and (1) λ , (3), see Lemma 2. Various other applications of barrier strips can be found for example in R. Agarwal et al. [11,12,13].
For each C n [ 0 , 1 ] -solution x ( t ) to families (1) λ , (2) and (1) λ , (3) there is a μ ( 0 , 1 ) such that x ( μ ) = C B . The intervals [ F 2 , F 1 ] , [ F 2 , F 1 ] , [ L 1 , L 2 ] and [ L 1 , L 2 ] are from the coordinate axis O p n 1 . The first two are to the left of p n 1 = x ( μ ) , and the others are to the right of p n 1 = x ( μ ) . This creates the feeling of symmetry with respect to p n 1 = x ( μ ) . As we will see in Lemma 3, the conditions (H1) and (H2) guarantee that, in the general case, the values of x ( t ) , x ( t ) , , x n 2 are in intervals symmetrical to the coordinate origin of the axes O p 0 , O p 1 , , O p n 2 , respectively.
This paper is organized as follows. In Section 2, we obtain a basic existence theorem, our main tool. In Section 3, using (H1) and (H2), we first establish a priori bounds for the eventual C n [ 0 , 1 ] -solutions of families (1) λ , (2) and (1) λ , (3). Next, we use the obtained bounds to apply the basic existence theorem to obtain a result guaranteeing the solvability of (1), (2) and (1), (3). In Section 4, on fourth-order BVPs with various two-point BCs, we show the possibility of using the applied approach to investigate the existence of solutions with important properties. Some examples to demonstrate our results are given in Section 5.

2. A general Existence Theorem

We will recall notations needed for our discussion.
Let E be a Banach space, Y be its convex subset and U Y be open in Y. The map F : U ¯ Y is called admissible if it is compact and does not have fixed points on U . The set of all such maps denote by L U ( U ¯ , Y ) .
A map F L U ( U ¯ , Y ) is called inessential if there exists a compact map G : U ¯ Y , which is fixed point free and coincides with F on U . A map F L U ( U ¯ , Y ) is called essential if it is not inessential.
The maps F , G L U ( U ¯ , Y ) are called homotopic, F G , if there exists a compact homotopy H λ : U ¯ Y , λ [ 0 , 1 ] , which is admissible and such that F = H 0 and G = H 1 .
Theorem 1
([4], Chapter I, Theorem 2.2). Let p U be fixed and F L U ( U ¯ , Y ) be the constant map F ( x ) = p for x U ¯ . Thus, F is essential.
The following lemma gives an important characteristic of the inessential maps.
Lemma 1
([4], Chapter I, Lemma 2.4). A map F L U ( U ¯ , Y ) is inessential if and only if it is homotopic to a fixed point free map.
As a consequence of Lemma 1 we obtain the topological transversality theorem.
Theorem 2
([4], Chapter I, Theorem 2.5). Let F and G in L U ( U ¯ , Y ) be homotopic maps. Then, one of these maps is essential if and only if the other is.
In fact, the following slightly different but equivalent form of this theorem is used.
Theorem 3
([4], Chapter I, Theorem 2.6). Suppose:
(i) 
F , G : U ¯ Y are compact maps.
(ii) 
G L U ( U ¯ , Y ) is essential.
(iii) 
H λ , λ [ 0 , 1 ] , is a compact homotopy joining G and F , i.e.,
H 0 ( x ) = G ( x ) a n d H 1 ( x ) = F ( x ) .
(iv) 
H λ , λ [ 0 , 1 ] , is fixed point free on U .
Then, H λ , λ [ 0 , 1 ] , has at least one fixed point in U and in particular there is a x 0 U such that x 0 = F ( x 0 ) .
Now, consider the BVP
x ( n ) + k = 0 n 1 s k ( t ) x ( k ) = f ( t , x , x , , x ( n 1 ) ) , t [ 0 , 1 ] , V i ( x ) = A i , i = 1 , n ¯ ,
where s k ( t ) , k = 0 , n 1 ¯ , are continuous on [ 0 , 1 ] , f : [ 0 , 1 ] × D 0 × D 1 × × D n 1 R ,
V i ( x ) j = 0 n 1 [ a i j x ( j ) ( 0 ) + b i j x ( j ) ( 1 ) ] , i = 1 , n ¯ ,
with constants a i j and b i j for which j = 0 n 1 ( a i j 2 + b i j 2 ) > 0 , i = 1 , n ¯ , and A i R .
For λ [ 0 , 1 ] , consider also the family of BVPs
x ( n ) + k = 0 n 1 s k ( t ) x ( k ) = g ( t , x , x , , x ( n 1 ) , λ ) , t [ 0 , 1 ] , V i ( x ) = A i , i = 1 , n ¯ ,
where g : [ 0 , 1 ] × D 0 × D 1 × × D n 1 × [ 0 , 1 ] R , and s k ( t ) , k = 0 , n 1 ¯ , V i , A i , i = 1 , n ¯ , are as above.
Let, as usual, C [ 0 , 1 ] be the Banach space of continuous functions on [ 0 , 1 ] with the sup norm | | x | | 0 = s u p t [ 0 , 1 ] | x ( t ) | , and C n [ 0 , 1 ] be the Banach space of n-times continuously differentiable functions with | | x | | n = max { | | x | | 0 , , | | x ( n ) | | 0 } .
Let B denote the set of functions that satisfy the BCs V i ( x ) = A i , i = 1 , n ¯ , and B 0 be the set of functions satisfying V i ( x ) = 0 , i = 1 , n ¯ . Finally, let C B n [ 0 , 1 ] = C n [ 0 , 1 ] B and C B 0 n [ 0 , 1 ] = C n [ 0 , 1 ] B 0 .
We are now ready to formulate and prove our main theorem. It is a variant of [4], Chapter V, Theorem 1.1.
Theorem 4.
Assume that:
(i) 
For λ = 0 problem (9) has a unique solution x 0 C n [ 0 , 1 ] .
(ii) 
Problems (8) and (9) are equivalent when λ = 1 .
(iii) 
The map Λ h : C B 0 n [ 0 , 1 ] C [ 0 , 1 ] , defined by
Λ h x = x ( n ) + k = 0 n 1 s k ( t ) x ( k ) ,
is one-to-one.
(iv) 
Each solution x C n [ 0 , 1 ] to family (9) satisfies the bounds
m i x ( i ) ( t ) M i f o r t [ 0 , 1 ] , i = 0 , n ¯ ,
where the constants < m i , M i < , i = 0 , n ¯ , are independent of λ and x.
(v) 
There is a sufficiently small δ > 0 such that
[ m i δ , M i + δ ] D i , i = 0 , n 1 ¯ ,
and the function g ( t , p 0 , , p n 1 , λ ) is continuous on [ 0 , 1 ] × J × [ 0 , 1 ] , where J = [ m 0 δ , M 0 + δ ] × [ m 1 δ , M 1 + δ ] × × [ m n 1 δ , M n 1 + δ ] ; m i , M i , i = 0 , n 1 ¯ , are as in (iv).
Then, BVP (8) has at least one solution in C n [ 0 , 1 ] .
Proof. 
The proof utilizes Theorem 3. Let
U ¯ = { x C B n [ 0 , 1 ] : m i δ x ( i ) ( t ) M i + δ on [ 0 , 1 ] , i = 0 , n ¯ }
and define the maps
j : C B n [ 0 , 1 ] C n 1 [ 0 , 1 ] by j x = x ,
Λ : C B n [ 0 , 1 ] C [ 0 , 1 ] by Λ x = x ( n ) + k = 0 n 1 s k ( t ) x ( k ) ,
and for λ [ 0 , 1 ]
Φ λ : C n 1 [ 0 , 1 ] C [ 0 , 1 ] by ( Φ λ x ) ( t ) = g ( t , x ( t ) , x ( t ) , . . . , x ( n 1 ) ( t ) , λ ) , x j ( U ¯ ) .
We need to establish that Λ 1 : C [ 0 , 1 ] C B n [ 0 , 1 ] exists and is continuous. First, we will use (iii) which actually means that for each y C [ 0 , 1 ] the BVP
x ( n ) + k = 0 n 1 s k ( t ) x ( k ) = y ( t ) ,
V i ( x ) = 0 , i = 1 , n ¯ ,
has a unique C n [ 0 , 1 ] -solution x ( t ) . It has the form
x ( t ) = C ˜ 1 x 1 ( t ) + C ˜ 2 x 2 ( t ) + + C ˜ n x n ( t ) + x ¯ ( t ) ,
where x i ( t ) , i = 1 , n ¯ , are linearly independend solutions to the homogeneous equation
x ( n ) + k = 0 n 1 s k ( t ) x ( k ) = 0 ,
x ¯ ( t ) is a solution to (10), and ( C ˜ 1 , C ˜ 2 , , C ˜ n ) is the unique solution to the system
C 1 V i ( x 1 ) + C 2 V i ( x 2 ) + + C n V i ( x n ) = V i ( x ¯ ) , i = 1 , n ¯ .
However, the last means that the determinant of this system is not zero. Thus, the inhomogeneous system
C 1 V i ( x 1 ) + C 2 V i ( x 2 ) + + C n V i ( x n ) = A i , i = 1 , n ¯ ,
also has a unique solution, to say ( C ˘ 1 , C ˘ 2 , , C ˘ n ) , and so
l ( t ) = C ˘ 1 x 1 ( t ) + C ˘ 2 x 2 ( t ) + + C ˘ n x n ( t )
is the unique C n [ 0 , 1 ] -solution to (11) which satisfies the inhomogeneous BCs
V i ( x ) = A i , i = 1 , n ¯ .
Then, it is not difficult to verify that the inverse map of Λ exists and can be defined by Λ 1 y = Λ h 1 y + l . On the other hand, for x C B 0 n [ 0 , 1 ] , we have
| | Λ h x | | 0 | | x ( n ) | | 0 + k = 0 n 1 | | s k | | 0 | | x ( k ) | | 0 | | x | | n + k = 0 n 1 | | s k | | 0 | | x | | n = 1 + k = 0 n 1 | | s k | | 0 | | x | | n .
Setting S = 1 + k = 0 n 1 | | s k | | 0 , we obtain
| | Λ h x | | 0 S | | x | | n ,
which means that the map Λ h is bounded, and so it is continuous because is linear. Thus, Λ h 1 is continuous, which implies that Λ 1 is also continuous.
Now, by
H λ = Λ 1 Φ λ j
define a homotopy H λ : U ¯ C B n [ 0 , 1 ] .
It is easily seen that the solutions to (9) are precisely the fixed points of H λ . Consequently, by (iv), the homotopy is fixed-point-free on U . Since U is bounded, it follows, from the complete continuity of the embedding j , that j ( U ¯ ) is a compact set. However, in view of (v), the map Φ λ is continuous on j ( U ¯ ) for each λ [ 0 , 1 ] . Additionally, we have already established that Λ 1 is continuous. Thus, the homotopy H λ is compact. Hence H 0 H 1 . Finally, in view of (i), we have H 0 = x 0 . Since x 0 U , H 0 is essential by Theorem 1. Then, because H 0 H 1 , H 1 is also essential by Theorem 2. In particular, H 1 has a fixed point, (9) has a solution in C n [ 0 , 1 ] , and, by (ii), problem (8) has a solution in C n [ 0 , 1 ] .

3. Existence Results

With a few auxiliary results, we will prepare the application of Theorem 4.
Lemma 2.
Let (H1) and (H2) hold. Then every solution x C n [ 0 , 1 ] to (1) λ , (2) or (1) λ , (3) satisfies the bounds
min { F 1 , F 1 } x ( n 1 ) ( t ) max { L 1 , L 1 } , t [ 0 , 1 ] .
Proof. 
By the Lagrange mean value theorem, there is a τ ( 0 , 1 ) such that
x ( n 1 ) ( τ ) = x ( n 2 ) ( 1 ) x ( n 2 ) ( 0 ) = C B .
Reasoning by contradiction, assume that x ( n 1 ) ( t ) > L 1 for some t [ 0 , τ ] , that is, assume that
S + = { t [ 0 , τ ] : L 1 < x ( n 1 ) ( t ) L 2 }
is a non-empty set. However, by the assumption, x ( n 1 ) ( τ ) L 1 and x ( n 1 ) ( t ) is continuous on [ 0 , τ ] , from where it follows that x ( n 1 ) ( t ) decreases on any subset of S + . This means that there exists an α S + such that
x ( n ) ( α ) < 0 .
On the other hand, in particular for t = α , we have
x ( n ) ( α ) = λ f ( α , x ( α ) , x ( α ) , , x ( n 1 ) ( α ) ) ,
because x ( t ) is a C n [ 0 , 1 ] -solution to (1) λ . Additionally,
( α , x ( α ) , x ( α ) , , x ( n 1 ) ( α ) ) S + × D 0 × × D n 2 × ( L 1 , L 2 ] .
Therefore, we can use (4) to establish
λ f ( α , x ( α ) , x ( α ) , , x ( n 1 ) ( α ) ) 0 , λ [ 0 , 1 ] ,
which means
x ( n ) ( α ) 0 ,
which is a contradiction. So, the set S + is empty and
x ( n 1 ) ( t ) L 1 on [ 0 , τ ] .
Let, again on the contrary, the set
S = { t [ 0 , τ ] : F 2 x ( n 1 ) ( t ) < F 1 }
not be empty. Then, using (5) and proceeding analogously to above, we arrive at a contradiction, which implies that
F 1 x ( n 1 ) ( t ) on [ 0 , τ ] .
Now, assume that the set
S + = { t [ τ , 1 ] : F 2 x ( n 1 ) ( t ) < F 1 }
is not empty. However, x ( n 1 ) ( τ ) = C B F 1 and x ( n 1 ) ( t ) is continuous on [ τ , 1 ] . Hence, there is a β S + such that
x ( n ) ( β ) < 0 .
We have also
x ( n ) ( β ) = λ f ( β , x ( β ) , x ( β ) , , x ( n 1 ) ( β ) )
and ( β , x ( β ) , x ( β ) , , x ( n 1 ) ( β ) ) S + × D 0 × × D n 2 × [ F 2 , F 1 ) , from where, in view of (7), it follows that
x ( n ) ( β ) 0 ,
which is a contradiction. Consequently, the set S + is empty and
F 1 x ( n 1 ) ( t ) on [ τ , 1 ] .
Finally, using (6), we establish similarly that the set
S = { t [ τ , 1 ] : L 1 < x ( n 1 ) ( t ) L 2 }
is empty and so
x ( n 1 ) ( t ) L 1 on [ τ , 1 ] .
The bounds obtained at the intervals [ 0 , τ ] and [ τ , 1 ] yield the lemma. □
Lemma 3.
Let (H1) and (H2) hold. Then, every solution x C n [ 0 , 1 ] to (1) λ , (2) or (1) λ , (3) satisfies the bounds
| x ( n 2 ) ( t ) | | B | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , t [ 0 , 1 ] ,
| x ( i ) ( t ) | | B | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } + j = i n 3 | A j | , t [ 0 , 1 ] , i = 0 , n 3 ¯ .
Proof. 
Let x ( t ) be a solution to (1) λ , (2). We will establish the truth of the statement by repeatedly applying the mean value theorem. At first, for each t ( 0 , 1 ] , there is a ξ ( 0 , t ) such that
x ( n 2 ) ( t ) x ( n 2 ) ( 0 ) = x ( n 1 ) ( ξ ) t , t ( 0 , 1 ] ,
and therefore,
| x ( n 2 ) ( t ) | | x ( n 2 ) ( 0 ) | + | x ( n 1 ) ( ξ ) | , t [ 0 , 1 ] .
However, Lemma 2 implies
| x ( n 1 ) ( t ) | max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } for t [ 0 , 1 ]
and in particular
| x ( n 1 ) ( ξ ) | max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } .
Substituting into (12) gives the bound for | x ( n 2 ) ( t ) | .
Again, from the mean value theorem, for each t ( 0 , 1 ] , there is an η ( 0 , t ) with the property
x ( n 3 ) ( t ) x ( n 3 ) ( 0 ) = x ( n 2 ) ( η ) t , t [ 0 , 1 ) ,
from where, using the obtained bound for | x ( n 2 ) ( t ) | and x ( n 3 ) ( 0 ) = A n 3 , we can establish
| x ( n 3 ) ( t ) | | B | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } + | A n 3 | , t [ 0 , 1 ] .
Likewise, we obtain
| x ( i ) ( t ) | | B | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } + j = i n 3 | A j | , t [ 0 , 1 ] , i = k l , n 3 ¯ .
Next, keeping in mind x ( i ) ( 1 ) = A i , i = k l 1 , k l 1 ¯ , we apply the mean value theorem on intervals of the form ( t , 1 ) ; that is, for each t [ 0 , 1 ) , there is an ζ ( t , 1 ) such that
x ( k l 1 ) ( 1 ) x ( k l 1 ) ( t ) = x ( k l ) ( ζ ) ( 1 t ) , t [ 0 , 1 ) ,
which gives successively first
| x ( k l 1 ) ( t ) | | B | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } + j = k l n 3 | A j | + | A k l 1 | , t [ 0 , 1 ] ,
and then
| x ( i ) ( t ) | | B | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } + j = i n 3 | A j | , t [ 0 , 1 ] , i = k l 1 , n 3 ¯ .
Further, because x ( i ) ( 0 ) = A i , i = k l 2 , k l 1 1 ¯ , we apply k l 1 k l 2 times the mean value theorem on intervals of the form ( 0 , t ) for each t ( 0 , 1 ] to establish
| x ( i ) ( t ) | | B | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } + j = i n 3 | A j | , t [ 0 , 1 ] , i = k l 2 , n 3 ¯ .
Continuing this process leads to the establishment of the truth of the lemma. In a similar way, we can prove it if x ( t ) is a solution to (1) λ , (3). □
Lemma 4.
Each of the BVPs for the equation
x ( n ) = 0
with BCs (2) or (3) has a unique solution.
Proof. 
It is well known that the solutions to (13) are polynomials of the form
P n 1 ( t ) = a n 1 t n 1 + a n 2 t n 2 + + a m s t m s + + a m 1 t m 1 + + a 3 t 3 + a 2 t 2 + a 1 t + a 0 .
The BCs (3), for example, are satisfied by those polynomials whose coefficients a i , i = 0 , n 1 ¯ are a solution of the system:
a n 1 + a n 2 + + a 3 + a 2 + a 1 + a 0 = A 0 ( n 1 ) a n 1 + ( n 2 ) a n 2 + . . + 3 a 3 + 2 a 2 + a 1 = A 1 ( n 1 ) ( n 2 ) a n 1 + ( n 2 ) ( n 3 ) a n 2 + . + 3.2 a 3 + 2 a 2 = A 2 m 1 ! a m 1 = A m 1 ( m 1 + 1 ) ! a m 1 + 1 = A m 1 + 1 ( n 1 ) ( n m s ) a n 1 + ( n 2 ) ( n m s 1 ) a n 2 + + m s ! a m s = A m s ( n 1 ) 3 a n 1 + ( n 2 ) 2 a n 2 + ( n 3 ) ! a n 3 = A n 3 ( n 2 ) ! a n 2 = B ( n 1 ) 2 a n 1 + ( n 2 ) ! a n 2 = C .
From the last two equations, we find successively
a n 2 = B ( n 2 ) ! and a n 1 = C B ( n 1 ) ! .
By substituting a n 1 and a n 2 in the remaining equations, we obtain a system with unknowns a i , i = 0 , n 3 ¯ . The determinant of the new system is:
1   1 1 1 1   ( n 3 )   3 2 1 0 ( n 3 ) ( n 4 ) . . 3.2 2 0 0 m 1 ! 0 . 0 0   ( m 1 + 1 ) ! 0 0 . 0 0 ( n 3 ) ( n m s 2 ) m s ! 0   . 0 0 ( n 3 ) ! 0 0 0 =
= 2 ! 3 ! m 1 ! ( m 1 + 1 ) ! m s ! ( n 3 ) ! ,
obviously non-zero. Hence, the reduced system has a unique solution. Then, the original system also has a unique solution, say ( a n 1 * , a n 2 * , , a 1 * , a 0 * ) , and so the polynomial
P n 1 * ( t ) = a n 1 * t n 1 + a n 2 * t n 2 + + a 3 * t 3 + a 2 * t 2 + a 1 * t + a 0 *
is the unique solution of (13), (3).
The validity of the lemma for problem (13), (2) is established by similar reasoning. □
By the end of this part, B 0 will be the set of functions satisfying the homogeneous boundary conditions (2) or (3); obviously they are of the form V i ( x ) = 0 , i = 1 , n ¯ .
Lemma 5.
The map Λ h : C B 0 n [ 0 , 1 ] C [ 0 , 1 ] , defined by Λ h x = x ( n ) , is one-to-one.
Proof. 
Let B 0 be the set of functions satisfying the homogeneous boundary conditions (3); similar considerations can be applied to the homogeneous conditions (2) as well.
In fact, it is enough to show that, for an arbitrary y ( t ) C [ 0 , 1 ] , the BVP
x ( n ) = y ( t )
x ( i ) ( 1 ) = 0 , i = 0 , m 1 1 ¯ , x ( i ) ( 0 ) = 0 , i = m 1 , m 2 1 ¯ , , x ( i ) ( 1 ) = 0 , i = m s , n 3 ¯ , x ( n 2 ) ( 0 ) = 0 , x ( n 2 ) ( 1 ) = 0 ,
has a unique solution in C n [ 0 , 1 ] . We know that the solutions of (15) have the form
x ( t ) = P n 1 ( t ) + η ( t ) ,
where P n 1 ( t ) is the polynomial (14), and η ( t ) is a solution to (15). To isolate a solution to (15), (16), we should determine the coefficients a i , i = 0 , n 1 ¯ of the polynomial P n 1 ( t ) from a system similar to that of the proof of Lemma 4, but with
A i = η ( i ) ( 1 ) , i = 0 , m 1 1 ¯ , A i = η ( i ) ( 0 ) , m 1 , m 2 1 ¯ , , A i = η ( i ) ( 1 ) , i = m s , n 3 ¯ ,
B = η ( n 2 ) ( 0 ) , C = η ( n 2 ) ( 1 ) .
However, from the proof of Lemma 4, we known that the determinant of this system is nonzero. Therefore, problem (15), (16) has a unique solution which means that Λ h : C B 0 n [ 0 , 1 ] C [ 0 , 1 ] is one-to-one. □
Now, we can present the main result of this part.
Theorem 5.
Let (H1) and (H2) hold. Let in addition (H3) hold for
M i = | B | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } + j = i n 3 | A j | , m i = M i , i = 0 , n 3 ¯ ,
M n 2 = | B | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , m n 2 = M n 2 ,
m n 1 = min { F 1 , F 1 } , M n 1 = max { L 1 , L 1 } .
Then, each of the BVPs (1), (2) and (1), (3) has at least one solution in C n [ 0 , 1 ] .
Proof. 
We will prove the assertion for (1), (2); essentially the same considerations apply to (1), (3) as well. Moreover, we will check that all hypotheses of Theorem 4 are fullfiled for BVP (1), (2) and family (1) λ , (2). According to Lemma 4, (i) is satisfied. Additionally, (ii) is obvious. It follows from Lemma 5 that (iii) holds. Furthermore, for each solution x ( t ) C n [ 0 , 1 ] to (1) λ , (2), we have
m i x ( i ) ( t ) M i , t [ 0 , 1 ] , i = 0 , n 2 ¯ ,   by   Lemma 3 ,
m n 1 x ( n 1 ) ( t ) M n 1 , t [ 0 , 1 ] ,   by   Lemma 2 ,
Because of the continuity of f on [ 0 , 1 ] × J , there are constants m n and M n such that
m n λ f ( t , p 0 , , p n 1 ) M n for λ [ 0 , 1 ] and ( t , p 0 , , p n 1 ) [ 0 , 1 ] × J .
However, from above, we have ( x ( t ) , x ( t ) , . . . x ( n 1 ) ( t ) ) J for t [ 0 , 1 ] . Thus, Equation (1) λ implies
m n x ( n ) ( t ) M n for t [ 0 , 1 ] .
Hence, (iv) also holds. Finally, (v) follows again from the continuity of f on the set J . Therefore, the assertion is true by Theorem 4. □

4. Fourth-Order BVPs

The idea from the previous part is also applicable to BVPs with boundary conditions that do not include set values for x ( n 2 ) ( 0 ) and/or x ( n 2 ) ( 1 ) . We will demonstrate this on fourth-order BVPs.
So, we consider the equation
x ( 4 ) = f ( t , x , x , x , x ) , t [ 0 , 1 ] ,
with BCs either
x ( 0 ) = A , x ( 0 ) = B , x ( 0 ) = C , x ( 1 ) = D ,
x ( 0 ) = A , x ( 0 ) = B , x ( 1 ) = C , x ( 1 ) = D ,
or
x ( 0 ) = A , x ( 0 ) = B , x ( 1 ) = C , x ( 1 ) = D .
For convenience, we will reformulate the hypotheses for the case under consideration. In them, the constant K will be further specified for each of the considered BVPs.
Hypothesis 4 (H4).
For some constants F i , L i , i = 1 , 2 , such that [ F 2 , L 2 ] D 3 , F 2 < F 1 K L 1 < L 2 , it holds
f ( t , p 0 , p 1 , p 2 , p 3 ) 0 f o r ( t , p 0 , p 1 , p 2 , p 3 ) [ 0 , 1 ] × D 0 × D 1 × D 2 × [ L 1 , L 2 ] , f ( t , p 0 , p 1 , p 2 , p 3 ) 0 f o r ( t , p 0 , p 1 , p 2 , p 3 ) [ 0 , 1 ] × D 0 × D 1 × D 2 × [ F 2 , F 1 ] .
Hypothesis 5 (H5).
For some constants F i , L i , i = 1 , 2 , such that [ F 2 , L 2 ] D 3 , F 2 < F 1 K L 1 < L 2 , it holds
f ( t , p 0 , p 1 , p 2 , p 3 ) 0 f o r ( t , p 0 , p 1 , p 2 , p 3 ) [ 0 , 1 ] × D 0 × D 1 × D 2 × [ L 1 , L 2 ] , f ( t , p 0 , p 1 , p 2 , p 3 ) 0 f o r ( t , p 0 , p 1 , p 2 , p 3 ) [ 0 , 1 ] × D 0 × D 1 × D 2 × [ F 2 , F 1 ] .
Hypothesis 6 (H6).
For a sufficiently small δ > 0 and suitable constants m i M i , i = 0 , 3 ¯ , it holds
[ m i δ , M i + δ ] D i , i = 0 , 3 ¯ ,
and f ( t , p 0 , p 1 , p 2 , p 3 ) is continuous on [ 0 , 1 ] × J , where
J = [ m 0 δ , M 0 + δ ] × [ m 1 δ , M 1 + δ ] × [ m 2 δ , M 2 + δ ] × [ m 3 δ , M 3 + δ ] .
Consider also the families of BVPs for
x ( 4 ) = λ f ( t , x , x , x , x ) , λ [ 0 , 1 ] , t ( 0 , 1 ) , ( 17 ) λ
with BCs (18)–(20).
Lemma 6.
Let (H4) and (H5) hold for K = D B A . Then every solution x C 4 [ 0 , 1 ] to (17) λ , (18) satisfies the bounds
min { F 1 , F 1 } x ( t ) max { L 1 , L 1 } , t [ 0 , 1 ] .
Proof. 
According to the mean value theorem, there is a ν ( 0 , 1 ) such that x ( ν ) = D B and there is a τ ( 0 , ν ) such that x ( τ ) = x ( ν ) x ( 0 ) = D B A . Further, the proof follows the proof of Lemma 2, of course for n = 4 .
Lemma 7.
Let (H4) and (H5) hold for K = D B A . Then, every solution x C 4 [ 0 , 1 ] to (17) λ , (18) satisfies the bounds
| x ( t ) | | A | + | B | + | C | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , t [ 0 , 1 ] ,
| x ( t ) | | A | + | B | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , t [ 0 , 1 ] ,
| x ( t ) | | A | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , t [ 0 , 1 ] .
Proof. 
According to the mean value theorem, for each t ( 0 , 1 ] , there is a ξ ( 0 , t ) such that
x ( t ) x ( 0 ) = x ( ξ ) t , t ( 0 , 1 ] ,
and therefore,
| x ( t ) | | x ( 0 ) | + | x ( ξ ) | , t [ 0 , 1 ] .
But, from Lemma 6, we have
| x ( t ) | max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } f o r t [ 0 , 1 ]
and in particular
| x ( ξ ) | max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } .
Substituting into (21) gives the bound for | x ( t ) | .
Again, from the mean value theorem, for each t ( 0 , 1 ] , there is an η ( 0 , t ) with the property
x ( t ) x ( 0 ) = x ( η ) t , t ( 0 , 1 ] ,
which yields the bound for | x ( t ) | .
The bound for | x ( t ) | follows similarly by applying the mean value theorem on x ( t ) in intervals of the form ( 0 , t ) for each t ( 0 , 1 ] .
Lemma 8.
Let A , B 0 , D > A + B and (H4) and (H5) hold for K = D B A with F 1 , F 1 0 . Then, each solution x C 4 [ 0 , 1 ] to (17) λ , (18) satisfies the bounds
C x ( t ) A + B + C + max { L 1 , L 1 } , t [ 0 , 1 ] ,
B x ( t ) A + B + max { L 1 , L 1 } , t [ 0 , 1 ] ,
A x ( t ) A + max { L 1 , L 1 } , t [ 0 , 1 ] .
Proof. 
By Lemma 6,
0 min { F 1 , F 1 } x ( t ) max { L 1 , L 1 } , t [ 0 , 1 ] .
Then, for t ( 0 , 1 ] , we have
0 0 t x ( s ) d s 0 t max { L 1 , L 1 } d s ,
which yields consequtively
0 x ( t ) A max { L 1 , L 1 } t , t [ 0 , 1 ] ,
0 x ( t ) A max { L 1 , L 1 } , t [ 0 , 1 ] ,
and (23). Next, by integration of (23) from 0 to t ( 0 , 1 ] we obtain (22), and a new integration from 0 to t ( 0 , 1 ] gives the bound for x ( t ) .
Lemma 9.
Let (H4) and (H5) hold for K = A + B + D C . Then, every solution x C 4 [ 0 , 1 ] to (17) λ , (19) satisfies the bounds
min { F 1 , F 1 } x ( t ) max { L 1 , L 1 } , t [ 0 , 1 ] .
Proof. 
By the mean value theorem, there is a μ ( 0 , 1 ) such that x ( μ ) = C B and there is a ν ( 0 , μ ) such that x ( ν ) = x ( μ ) x ( 0 ) = C B A . Finally, there is a τ ( ν , 1 ) for which x ( τ ) = x ( 1 ) x ( ν ) = A + B + D C . Now the proof continues following the line of proof of Lemma 2. □
Lemma 10.
Let (H4) and (H5) hold for K = A + B + D C . Then every solution x C 4 [ 0 , 1 ] to (17) λ , (19) satisfies the bounds
| x ( t ) | | A | + | B | + | D | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , t [ 0 , 1 ] ,
| x ( t ) | | A | + | D | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , t [ 0 , 1 ] ,
| x ( t ) | | D | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , t [ 0 , 1 ] .
Proof. 
By the mean value theorem for each t [ 0 , 1 ) there is a ξ ( t , 1 ) with the property
x ( 1 ) x ( t ) = x ( ξ ) ( 1 t ) , t [ 0 , 1 ) ,
from where, using Lemma 9, the bound for | x ( t ) | follows. Further, for each t ( 0 , 1 ] , there is an η ( 0 , t ) such that
x ( t ) x ( 0 ) = x ( η ) t , t ( 0 , 1 ] ,
which gives (24). Finally, for each t ( 0 , 1 ] there is a ζ ( 0 , t ) such that
x ( t ) x ( 0 ) = x ( ζ ) t ,
which together with the obtained bound for | x ( t ) | yields the bound for | x ( t ) | .
Lemma 11.
Let A , D 0 , A + B + D < C and (H4) and (H5) hold for K = A + B + D C with L 1 , L 1 0 . Then, each solution x C 4 [ 0 , 1 ] to (17) λ , (19) satisfies the bounds
B x ( t ) A + B + D min { F 1 , F 1 } , t [ 0 , 1 ] ,
A x ( t ) A + D min { F 1 , F 1 } , t [ 0 , 1 ] ,
D x ( t ) D min { F 1 , F 1 } , t [ 0 , 1 ] .
Proof. 
From Lemma 9, we have
min { F 1 , F 1 } x ( t ) max { L 1 , L 1 } 0 , t [ 0 , 1 ] ,
which yields
t 1 min { F 1 , F 1 } d s t 1 x ( s ) d s 0 , t [ 0 , 1 ) ,
and
min { F 1 , F 1 } ( 1 t ) D x ( t ) 0 , t [ 0 , 1 ] ,
from where (25) follows. Then, integrating (25) twice from 0 to t ( 0 , 1 ] gives us successively the bounds for x ( t ) and x ( t ) .
Lemma 12.
Let (H4) and (H5) hold for K = A + 2 B + D 2 C . Then, every solution x C 4 [ 0 , 1 ] to (17) λ , (20) satisfies the bounds
min { F 1 , F 1 } x ( t ) max { L 1 , L 1 } , t [ 0 , 1 ] .
Proof. 
From the mean value theorem, it follows that there exists a μ ( 0 , 1 ) such that x ( μ ) = C B . Additionally, there exists a ν 1 ( 0 , μ ) and a ν 2 ( μ , 1 ) with the properties
x ( ν 1 ) = x ( μ ) x ( 0 ) = C B A and x ( ν 2 ) = x ( 1 ) x ( μ ) = D C + B .
Finally, there is a τ ( ν 1 , ν 2 ) for which x ( τ ) = x ( ν 2 ) x ( ν 1 ) = A + 2 B + D 2 C . In the next part of the proof, we proceed analogously to the proof of Lemma 2. □
Lemma 13.
Let (H4) and (H5) hold for K = A + 2 B + D 2 C . Then, every solution x C 4 [ 0 , 1 ] to (17) λ , (20) satisfies the bounds
| x ( t ) | | A | + | B | + | D A | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , t [ 0 , 1 ] ,
| x ( t ) | | A | + | D A | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , t [ 0 , 1 ] ,
| x ( t ) | | D A | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , t [ 0 , 1 ] .
Proof. 
It is clear, there is a μ ( 0 , 1 ) for which x ( μ ) = D A . Then, for each t [ 0 , μ ) there is a ξ ( t , μ ) such that
x ( μ ) x ( t ) = x ( ξ ) ( μ t ) ,
from where, using Lemma 12, we obtain
| x ( t ) | | D A | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , t [ 0 , μ ] .
We can proceed analogously to see that the same bound is valid for t [ μ , 1 ] . Next, the bounds for | x ( t ) | and | x ( t ) | follow as in the proof of Lemma 10. □
Lemma 14.
Let A , D 0 , A + 2 B + D < 2 C and (H4) and (H5) hold for K = A + 2 B + D 2 C with L 1 , L 1 0 and D A m i n { F 1 , F 1 } . Then each solution x C 4 [ 0 , 1 ] to (17) λ , (20) satisfies the bounds
B x ( t ) B + D min { F 1 , F 1 } , t [ 0 , 1 ] ,
A x ( t ) D min { F 1 , F 1 } , t [ 0 , 1 ] ,
D A + min { F 1 , F 1 } x ( t ) D A min { F 1 , F 1 } , t [ 0 , 1 ] .
Proof. 
There is a μ ( 0 , 1 ) such that x ( μ ) = D A . Now, integrating from t [ 0 , μ ) to μ the bounds
min { F 1 , F 1 } x ( t ) max { L 1 , L 1 } 0 , t [ 0 , 1 ] ,
from Lemma 12, we establish
min { F 1 , F 1 } ( μ t ) x ( μ ) x ( t ) 0 , t [ 0 , μ ) ,
( D A ) + min { F 1 , F 1 } x ( t ) ( D A ) , t [ 0 , μ ) ,
D A x ( t ) D A min { F 1 , F 1 } , t [ 0 , μ ] .
Then, integrating (27) from μ to t ( μ , 1 ] , we establish similarly
D A + min { F 1 , F 1 } x ( t ) D A , t ( μ , 1 ] .
As a result, keeping in mind that min { F 1 , F 1 } 0 , we obtain (26). Integrating (26) from 0 to t ( 0 , 1 ] and using D A + min { F 1 , F 1 } 0 , we obtain the bounds for x ( t ) . A new integration from 0 to t ( 0 , 1 ] gives the bounds for x ( t ) .
We are ready to obtain the results guaranteeing the solvability of the BVPs under consideration. We will use again Theorem 4, applying it to the families of BVPs for (17) λ with BCs either (18), (19) or (20), which are of the form (9).
Theorem 6.
Let (H4) and (H5) hold for K = D B A . Let, in addition, (H6) hold for
M 0 = | A | + | B | + | C | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , m 0 = M 0 ,
M 1 = | A | + | B | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , m 1 = M 1 ,
M 2 = | A | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , m 2 = M 2
and
m 3 = min { F 1 , F 1 } , M 3 = max { L 1 , L 1 } .
Then, BVP (17), (18) has at least one solution in C 4 [ 0 , 1 ] .
Proof. 
It is not difficult to check that (17) 0 , (18), that is, the BVP
x ( 4 ) = 0 , t ( 0 , 1 ) ,
x ( 0 ) = A , x ( 0 ) = B , x ( 0 ) = C , x ( 1 ) = D ,
has a unique solution in C 4 [ 0 , 1 ] . Thus, we establish that (i) of Theorem 4 is fulfilled. Obviously, (17), (18) and (17) 1 (18) are the same problem, and so (ii) is satisfied. To show that the map Λ h : C B 0 4 [ 0 , 1 ] C [ 0 , 1 ] , defined by Λ h x = x ( 4 ) , is one-to-one, we simply establish that for each y C [ 0 , 1 ] , the BVP
x ( 4 ) = y ( t ) , t ( 0 , 1 ) ,
x ( 0 ) = 0 , x ( 0 ) = 0 , x ( 0 ) = 0 , x ( 1 ) = 0 ,
has a unique solution x ( t ) in C 4 [ 0 , 1 ] , and (iii) holds. Next, by Lemma 7 and Lemma 6, for each solution x C 4 [ 0 , 1 ] to (17) λ , (18), we have
m i x ( i ) ( t ) M i , t [ 0 , 1 ] , i = 0 , 1 , 2 , 3 .
From the continuity of f ( t , p 0 , p 1 , p 2 , p 3 ) on [ 0 , 1 ] × J , it follows that there exist constants m 4 and M 4 such that
m 4 λ f ( t , p 0 , p 1 , p 2 , p 3 ) M 4   for   ( t , p 0 , p 1 , p 2 , p 3 ) [ 0 , 1 ] × J   and   λ [ 0 , 1 ] ,
which, together with the obtained above ( x ( t ) , x ( t ) , x ( t ) , x ( t ) ) J for t [ 0 , 1 ] and Equation (17) λ , implies
m 4 x ( 4 ) ( t ) M 4 , t [ 0 , 1 ] .
This implies that (iv) holds for (17) λ , (18). Again, from the continuity of f on the set J, it follows that (v) is satisfied, and so the assertion is true by Theorem 4. □
Theorem 7.
Let A , B , C 0 ( B , C > 0 ) , D > A + B , (H4) and (H5) hold for K = D B A with F 1 , F 1 0 and (H6) hold for
m 0 = C , M 0 = A + B + C + max { L 1 , L 1 } ,
m 1 = B , M 1 = A + B + max { L 1 , L 1 } ,
m 2 = A , M 2 = A + max { L 1 , L 1 } , m 3 = min { F 1 , F 1 } , M 3 = max { L 1 , L 1 } .
Then, BVP (17), (18) has at least one non-negative (positive), non-decreasing (increasing), convex solution in C 4 [ 0 , 1 ] .
Proof. 
Essentially the same reasoning as in the proof of Theorem 6 establishes that (17), (18) has a solution x ( t ) in C 4 [ 0 , 1 ] . Moreover, Lemma 8 guarantees the bounds
m 0 x ( i ) ( t ) M 0 , t [ 0 , 1 ] , i = 0 , 1 , 2 ,
and Lemma 6 yields
m 3 x ( t ) M 3 , t [ 0 , 1 ] .
Since for t [ 0 , 1 ] we have x ( t ) C 0 ( x ( t ) C > 0 ) , x ( t ) B 0 ( x ( t ) B > 0 ) and x ( t ) A 0 , this solution has the desired properties. □
Theorem 8.
Let (H4) and (H5) hold for K = A + B + D C and (H6) hold for
M 0 = | A | + | B | + | D | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , m 0 = M 0 ,
M 1 = | A | + | D | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , m 1 = M 1 ,
M 2 = | D | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , m 2 = M 2 , m 3 = min { F 1 , F 1 } , M 3 = max { L 1 , L 1 } .
Then, BVP (17), (19) has at least one solution in C 4 [ 0 , 1 ] .
Proof. 
It is similar to the proof of Theorem 6. Now Lemma 10 guarantees
m i x ( i ) ( t ) M i , t [ 0 , 1 ] , i = 0 , 1 , 2 ,
and Lemma 9 yields
m 3 x ( t ) M 3 , t [ 0 , 1 ] .
Theorem 9.
Let A , B , D 0 ( A , B > 0 ) , A + B + D < C , (H4) and (H5) hold for K = A + B + D C with L 1 , L 1 0 and (H6) hold for
m 0 = B , M 0 = A + B + D min { F 1 , F 1 } ,
m 1 = A , M 1 = A + D min { F 1 , F 1 } ,
m 2 = D , M 2 = D min { F 1 , F 1 } , m 3 = min { F 1 , F 1 } , M 3 = max { L 1 , L 1 } .
Then, BVP (17), (19) has at least one non-negative (positive), non-decreasing (increasing), convex solution in C 4 [ 0 , 1 ] .
Proof. 
Following the proof of Theorem 6 establishes that (17), (19) has a solution x ( t ) in C 4 [ 0 , 1 ] . Now, Lemma 11 provides the bounds
m 0 x ( i ) ( t ) M 0 , t [ 0 , 1 ] , i = 0 , 1 , 2 ,
and again Lemma 9 yields
m 3 x ( t ) M 3 , t [ 0 , 1 ] .
Since for t [ 0 , 1 ] we have x ( t ) B 0 ( x ( t ) B > 0 ) , x ( t ) A 0 ( x ( t ) A > 0 ) and x ( t ) D 0 , this solution possesses the specified properties. □
Theorem 10.
Let (H4) and (H5) hold for K = A + 2 B + D 2 C and (H6) hold for
M 0 = | A | + | B | + | D A | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , m 0 = M 0 ,
M 1 = | A | + | D A | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , m 1 = M 1 ,
M 2 = | D A | + max { | F 1 | , | F 1 | , | L 1 | , | L 1 | } , m 2 = M 2 ,
m 3 = min { F 1 , F 1 } , M 3 = max { L 1 , L 1 } .
Then BVP (17), (20) has at least one solution in C 4 [ 0 , 1 ] .
Proof. 
From Lemmas 13 and 12 we have respectively
m i x ( i ) ( t ) M i , t [ 0 , 1 ] , i = 0 , 1 , 2 ,
and
m 3 x ( t ) M 3 , t [ 0 , 1 ] .
The rest of the proof does not differ from that of Theorem 6. □
Theorem 11.
Let A , B , D 0 ( A , B > 0 ) , A + 2 B + D < 2 C , (H4) and (H5) hold for K = A + 2 B + D 2 C with L 1 , L 1 0 and
D A min { F 1 , F 1 } ,
and (H6) hold for
m 0 = B , M 0 = B + D min { F 1 , F 1 } ,
m 1 = A , M 1 = D min { F 1 , F 1 } ,
m 2 = D A + min { F 1 , F 1 } , M 2 = D A min { F 1 , F 1 } ,
m 3 = min { F 1 , F 1 } , M 3 = max { L 1 , L 1 } .
Then, BVP (17), (20) has at least one non-negative (positive), non-decreasing (increasing), convex solution in C 4 [ 0 , 1 ] .
Proof. 
As undertaken in the proof of Theorem 6, we establish that (17), (20) has a solution x ( t ) in C 4 [ 0 , 1 ] . Now, the bounds
m 0 x ( i ) ( t ) M 0 , t [ 0 , 1 ] , i = 0 , 1 , 2 ,
follow from Lemma 14, and Lemma 12 yields
m 3 x ( t ) M 3 , t [ 0 , 1 ] .
Since for t [ 0 , 1 ] we have x ( t ) B 0 ( x ( t ) B > 0 ) , x ( t ) A 0 ( x ( t ) A > 0 ) and x ( t ) D A + min { F 1 , F 1 } 0 , this solution possesses the specified properties. □

5. Examples

Example 1.
Consider the BVP
x ( 6 ) = φ ( t , x , x , x , x , x ( 4 ) ) P n ( x ( 5 ) ) , t [ 0 , 1 ] ,
x ( 4 ) ( 0 ) = B , x ( 0 ) = A 0 , x ( 0 ) = A 1 , x ( 1 ) = A 2 , x ( 0 ) = A 3 , x ( 4 ) ( 1 ) = C ,
where φ : [ 0 , 1 ] × R 5 R is continuous and does not change its sign, and the polynomial P n ( p 5 ) , n 2 , has simple zeros z 1 and z 2 such that z 1 < C B < z 2 .
The BCs are of the form (2) with k 1 = 2 and k 2 = 3 .
Clearly, there is a θ > 0 such that z 1 + θ B C z 2 θ and
P n ( p 5 ) 0 for p 5 i = 1 2 ( z i θ , z i + θ ) { z i } .
Now, let for concreteness φ ( t , p 0 , p 1 , p 2 , p 3 , p 4 ) 0 on [ 0 , 1 ] × R 5 and
P n ( p 5 ) < 0 for p 5 ( z 1 θ , z 1 ) and P n ( p 5 ) > 0 for p 5 ( z 2 , z 2 + θ ) ;
the other cases can be considered analogously. It is easy to verify that (H4) holds for F 2 = z 1 θ , F 1 = z 1 , L 1 = z 2 , L 2 = z 2 + θ and (H5) holds for F 2 = z 1 , F 1 = z 1 + θ , L 1 = z 2 θ , L 2 = z 2 . Additionally, since the right-hand side φ ( t , p 0 , p 1 , p 2 , p 3 , p 4 ) P n ( p 5 ) of the equation is continuous on [ 0 , 1 ] × R 6 , (H6) also holds.
So, we can apply Theorem 5 to conclude that the considered problem has at least one solution in C 6 [ 0 , 1 ] .
Example 2.
Consider the BVP
x ( 4 ) = ( x + 9 ) ( x + 3 ) 225 x 2 900 x 2 , t [ 0 , 1 ] ,
x ( 0 ) = 1 , x ( 0 ) = 4 , x ( 0 ) = 2 , x ( 1 ) = 3 .
Let us pay attention first that here, D 0 , D 3 = ( , ) , but D 1 = ( 30 , 30 ) and D 2 = [ 15 , 15 ] are bounded. Since the BCs are of the form (18), K = D B A = 6 . Then, (H4) and (H5) are satisfied for F 2 = 8 , F 1 = 7 , L 1 = 2 , L 2 = 1 , F 2 = 11 , F 1 = 10 ,   L 1 = 5 , L 2 = 4 . Finally, considering that m 0 = 17 , M 0 = 17 , m 1 = 15 , M 1 = 15 , m 2 = 11 , M 2 = 11 , m 3 = 10 and M 3 = 2 , we easily check that (H6) holds for a sufficiently small δ > 0 . So, this problem has a solution in C 4 [ 0 , 1 ] by Theorem 6.
Example 3.
Consider the BVP for (29) with BCs
x ( 0 ) = 1 , x ( 0 ) = 1 , x ( 1 ) = 7 , x ( 1 ) = 0 .
The BCs are of the form (19). Although now K = A + B + D C = 5 , we can choose the same constants as in Example 2, namely F 2 = 8 , F 1 = 7 , L 1 = 2 , L 2 = 1 , F 2 = 11 , F 1 = 10 , L 1 = 5 and L 2 = 4 , to see that (H4) and (H5) are satysfied with L 1 , L 1 < 0 . Additionally, (H6) holds for m 0 = 1 , M 0 = 12 , m 1 = 1 , M 1 = 11 , m 2 = 0 , M 2 = 10 , m 3 = 10 , M 3 = 2 and a sufficiently small δ > 0 . So, by Theorem 9, this problem has a positive, increasing, convex solution in C 4 [ 0 , 1 ] .
Example 4.
Consider the BVP for (19) with BCs
x ( 0 ) = 1 , x ( 0 ) = 1 , x ( 1 ) = 10 , x ( 1 ) = 12 .
The BCs are of the form (20). Now K = A + 2 B + D 2 C = 5 and so we can choose again F 2 = 8 , F 1 = 7 , L 1 = 2 , L 2 = 1 , F 2 = 11 , F 1 = 10 , L 1 = 5 and L 2 = 4 , to see that (H4) and (H5) are satysfied with L 1 , L 1 < 0 and (28). (H6) also holds for m 0 = 1 , M 0 = 23 , m 1 = 1 , M 1 = 22 , m 2 = 1 , M 2 = 21 , m 3 = 10 , M 3 = 2 and a sufficiently small δ > 0 . So, by Theorem 11, this problem has a positive, increasing, convex solution in C 4 [ 0 , 1 ] .

6. Conclusions

This paper shows how the barrier strip technique (based here on conditions (H1) and (H2)) can be used to study the solvability of two-point BVPs for nth-order nonlinear differential equations. The idea is realized on two BVPs, but it can be applied to others problems as well. This possibility is demonstrated on fourth-order BVPs for which results guaranteeing positive or non-negative, monotone, convex solutions have been also obtained.

Author Contributions

Investigation, R.P.A.; writing—original draft preparation, T.Z.T.; writing—review and editing, P.S.K. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. AL-Zaid, N.; AL-Refaidi, A.; Bakodah, H.; AL-Mazmumy, M. Solution of second- and higher-order nonlinear two-point boundary-value problems using duble decomposition method. Mathematics 2022, 10, 3519. [Google Scholar] [CrossRef]
  2. Eloe, P.W.; Henderson, J. Two-point boundary value problems for ordinary differential equations, uniqueness implies existence. Proc. Amer. Math. Soc. 2020, 148, 4377–4387. [Google Scholar] [CrossRef]
  3. El-Shahed, M. Positive solutions of boundary value problems for nth order ordinary differential equations. Electron. J. Qual. Theory Differ. Equ. 2008, 1, 1–9. [Google Scholar] [CrossRef]
  4. Granas, A.; Guenther, R.B.; Lee, J.W. Nonlinear Boundary Value Problems for Ordinary Differential Equations; Instytut Matematyczny Polskiej Akademi Nauk: Warszawa, Poland, 1985. [Google Scholar]
  5. Karaca, I.Y.; Fen, F.T. Positive solutions of nth-order boundary value problems with integral boundary conditions. Math. Model. Anal. 2015, 2, 188–204. [Google Scholar] [CrossRef]
  6. Lepin, A.Y.; Lepin, L.A.; Myshkis, A.D. Two-point boundary value problem for nonlinear differential equation of nth order. Nonlinear Anal. 2000, 40, 397–406. [Google Scholar] [CrossRef]
  7. Lian, H.; Zhao, J.; Agarwal, R.P. Upper and lower solution method for nth-order BVPs on an infinite interval. Bound. Value Probl. 2014, 2014, 100. [Google Scholar] [CrossRef] [Green Version]
  8. Pei, M.; Chang, S.K. Existence and uniqueness of solutions for nth-order nonlinear two-point boundary value problems. Appl. Math. Comput. 2013, 219, 11005–11017. [Google Scholar] [CrossRef]
  9. Prasad, K.R.; Murali, P.; Suryanarayana, N.V.V.S. Existence of multiple positive solutions for nth order two-point boundary value problems on time scales. Adv. Pure Math. 2013, 3, 70–77. [Google Scholar] [CrossRef]
  10. Vasil’ev, N.I.; Lepin, A.Y.; Lepin, L.A. On boundary value problems for an nth-order equation. Differ. Equations 2010, 46, 182–186. [Google Scholar] [CrossRef]
  11. Agarwal, R.P.; Mihaylova, G.; Kelevedjiev, P. Existence for nonlinear fourth-order two-point boundary value problems. Dynamics 2023, 3, 152–170. [Google Scholar] [CrossRef]
  12. Agarwal, R.P.; Kelevedjiev, P.S. On the solvability of fourth–order two–point boundary value problems. Mathematics 2020, 8, 603. [Google Scholar] [CrossRef] [Green Version]
  13. Agarwal, R.P.; Kelevedjiev, P.S.; Todorov, T.Z. On the solvability of nonlinear third-order two-point boundary value problems. Axioms 2020, 9, 62. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Agarwal, R.P.; Todorov, T.Z.; Kelevedjiev, P.S. Existence for Two-Point nth Order Boundary Value Problems under Barrier Strips. Symmetry 2023, 15, 1394. https://doi.org/10.3390/sym15071394

AMA Style

Agarwal RP, Todorov TZ, Kelevedjiev PS. Existence for Two-Point nth Order Boundary Value Problems under Barrier Strips. Symmetry. 2023; 15(7):1394. https://doi.org/10.3390/sym15071394

Chicago/Turabian Style

Agarwal, Ravi P., Todor Z. Todorov, and Petio S. Kelevedjiev. 2023. "Existence for Two-Point nth Order Boundary Value Problems under Barrier Strips" Symmetry 15, no. 7: 1394. https://doi.org/10.3390/sym15071394

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