UPPER AND LOWER SOLUTIONS METHOD FOR SECOND ORDER NONLINEAR FOUR
POINT BOUNDARY VALUE PROBLEMS
Rahmat Ali Khan, Juan J. Nieto, and Rosana Rodr´ıguez-L´ opez
Abstract. We develop the upper and lower solutions method for the four point problem relative to second order differential equations in order to obtain the existence of solution.
1. Introduction
We consider the following second order nonlinear differential equation with four point boundary conditions
(1)
½ x
00(t) = f (t, x(t), x
0(t)), t ∈ I = [a, b], x(a) = x(c), x(b) = x(d),
where a < c ≤ d < b and f : I × R
2→ R is continuous.
The method of upper and lower solutions is used to prove the ex- istence of solution to (1). To obtain a sequence which converges to a solution for this equation, approximated problems are considered. We extend some results of [5].
Note that (1) is a problem at resonance since any constant function is a solution for the linear equation x
00= 0 with the four-point boundary condition.
Received June 22, 2005.
2000 Mathematics Subject Classification: Primary 34A34, 34B10, 34B15.
Key words and phrases: second-order differential equations, four point problems, upper and lower solutions.
The research of R. A. Khan has been supported by Ministry of Science and
Technology, Pakistan. The research of J. J. Nieto and R. Rodr´ıguez-L´opez has
been partially supported by Ministerio de Educaci´on y Ciencia and FEDER, project
MTM2004 - 06652 - C03 - 01, and by Xunta de Galicia and FEDER, project
PGIDIT02PXIC20703PN.
In this paper, the type of upper and lower solutions of (1) admissible is more general, whereas in [5], upper and lower solutions were considered constant functions.
In Section 2, the terms of upper and lower solutions of (1) are defined and an existence result for problem (1) is given, considering the conti- nuity of f and the existence of well-ordered upper and lower solutions.
In [1], it is considered different four-point boundary condition so that the linear part is invertible (see Lemma 2.2 for the expression of the corresponding Green’s function).
Also, in [2], it is studied a four-point boundary value problem for second-order nonlinear ordinary differential equations with the nonlin- earity independent of the derivative. Positive solutions of nonlinear four- point boundary value problems have been studied recently [3, 4].
2. Main results
We consider the spaces of functions C(I) and C
1(I) furnished, re- spectively, with the norms
kxk = sup{|x(t)| : t ∈ I}, kxk
1= kxk + kx
0k.
Definition 1. A function α ∈ C
2[a, b] is said to be a lower solution to problem (1) if
α
00(t) ≥ f (t, α(t), α
0(t)), t ∈ [a, b], α(a) ≤ α(c), α(d) ≥ α(b).
Similarly, β ∈ C
2[a, b] is an upper solution to problem (1) if β
00(t) ≤ f (t, β(t), β
0(t)), t ∈ [a, b],
β(a) ≥ β(c), β(d) ≤ β(b).
This formulation includes the constant case, considered in [5], since functions
α(t) = r
1, β(t) = r
2, t ∈ [a, b],
where r
1, r
2∈ R, verify the boundary conditions in the previous def-
inition. So that the existence result we present is a generalization of
Lemma 2 in [5].
Theorem 2.1. Suppose that α, β ∈ C
2[a, b] are, respectively, lower and upper solutions to problem (1), with α ≤ β on I = [a, b] and that there exists K ∈ R, K > 0 such that
Z
ba
|f (t, x, y)| dt ≤ K, ∀x ∈ [α(t), β(t)], y ∈ R.
Then problem (1) has at least one solution u verifying that α(t) ≤ u(t) ≤ β(t), t ∈ [a, b].
Proof. Consider m ∈ N, m > 1 fixed and define f
m(t, x, y)
=
f (t, β(t), β
0(t)) +
1+|x−β(t)|x−β(t), if β(t) +
m1≤ x, f (t, β(t), y) +
h
f (t, β(t), β
0(t)) − f (t, β(t), y) +
1+|x−β(t)|x−β(t)i
×m(x − β(t)), if β(t) < x < β(t) +
m1, f (t, x, y), if α(t) ≤ x ≤ β(t),
f (t, α(t), y) − h
f (t, α(t), α
0(t)) − f (t, α(t), y) +
1+|x−α(t)|x−α(t)i
×m(x − α(t)), if α(t) −
m1< x < α(t), f (t, α(t), α
0(t)) +
1+|x−α(t)|x−α(t), if x ≤ α(t) −
m1.
Note that f
mis continuous on I × R
2. We consider the problem (2)
½ x
00(t) = f
m(t, x(t), x
0(t)), t ∈ I = [a, b], x(a) = x(c), x(b) = x(d).
If x is a solution to (2) such that α ≤ x ≤ β, then x is a solution to (1).
Take r = max
Iβ − min
Iα. If min
Iα = max
Iβ, then α = β is a constant solution to (1). We can assume, therefore, that r > 0, and define σ =
1+rr, then σ > 0. Choose R ≥ 0 such that
|f (t, α(t), α
0(t))|, |f (t, β(t), β
0(t))| ≤ R, t ∈ I.
Take M
1> 0 large enough such that 0 ≤ R ≤ M
1σ.
Therefore,
−M
1σ ≤ −R ≤ f (t, α(t), α
0(t)), f (t, β(t), β
0(t)) ≤ R ≤ M
1σ, t ∈ I.
Define bounded and continuous functions K
1(t, x) =
MR1σ
, for x ≥ α(t) +
mMR1σ, m(x − α(t)), for α(t) ≤ x ≤ α(t) +
mMR1σ
,
0, for x ≤ α(t),
K
2(t, x) =
0, for x ≥ β(t),
m(x − β(t)), for β(t) −
mMR1σ≤ x ≤ β(t),
−
MR1σ, for x ≤ β(t) −
mMR1σ. Taking
φ(t, x) = [K
1(t, x) + K
2(t, x)]M
1σ, (t, x) ∈ I × R,
then φ is continuous and bounded on I × R and satisfies −R ≤ φ ≤ R on I × R.
Denote
p(t, x) = max{α(t), min{x, β(t)}}.
To prove existence of solution to (2), consider problem (3)
½ x
00(t) = ¯ f
m(t, x(t), x
0(t), λ), t ∈ I = [a, b], x(a) = x(c), x(b) = x(d),
where
f ¯
m(t, x, y, λ) = λf
m(t, x, y) + (1 − λ) {φ(t, x) − p(t, x) + x} , and λ ∈ [0, 1].
Note that if x is a solution to (3) for λ = 1 and x(t) ∈ [α(t), β(t)],
∀t ∈ I, then
x
00(t) = f
m(t, x(t), x
0(t)) = f (t, x(t), x
0(t)) and x is a solution to (1).
If λ = 0, problem (3) is reduced to (4)
½ x
00(t) = φ(t, x(t)) − p(t, x(t)) + x(t), t ∈ I, x(a) = x(c), x(b) = x(d),
and, for λ = 1, it is (2). Since φ(t, x)−p(t, x) is continuous and bounded and the linear problem
½ x
00(t) = x(t), t ∈ I, x(a) = x(c), x(b) = x(d),
has only the trivial solution, then problem (4) has a solution, i.e., prob- lem (3) has a solution for λ = 0.
For λ ∈ [0, 1], any solution u to problem (3) satisfies that α(t) − 1
m ≤ u(t) ≤ β(t) + 1
m , t ∈ I.
Indeed, let λ ∈ [0, 1] and u a solution to (3). Consider the function v(t) = u(t) − β(t) −
m1and suppose that max
t∈Iv(t) = v(t
0) > 0. Using the boundary conditions, we obtain that
v(a) = u(a) − β(a) − 1
m ≤ u(c) − β(c) − 1
m = v(c), v(d) ≥ v(b), so that we can assume that t
0∈ (a, b). Then
v(t
0) > 0, v
0(t
0) = 0, v
00(t
0) ≤ 0, that is,
u(t
0) > β(t
0) + 1
m , u
0(t
0) = β
0(t
0).
Then
u(t
0) > β(t
0) + 1
m ≥ α(t
0) + 1
m ≥ α(t
0) + R mM
1σ , so that
K
1(t
0, u(t
0)) = R
M
1σ , K
2(t
0, u(t
0)) = 0, and, using the definition of φ and the hypotheses on β,
v
00(t
0) = u
00(t
0) − β
00(t
0)
= λf
m(t
0, u(t
0), u
0(t
0))
+(1 − λ) {φ(t
0, u(t
0)) − p(t
0, u(t
0)) + u(t
0)} − β
00(t
0)
≥ λf
m(t
0, u(t
0), u
0(t
0))
+(1 − λ) {φ(t
0, u(t
0)) − p(t
0, u(t
0)) + u(t
0)}
−f (t
0, β(t
0), β
0(t
0))
= λ
·
f (t
0, β(t
0), β
0(t
0)) + u(t
0) − β(t
0) 1 + |u(t
0) − β(t
0)|
¸
+(1 − λ) [R − β(t
0) + u(t
0)] − f (t
0, β(t
0), β
0(t
0))
= (1 − λ) £
R − f (t
0, β(t
0), β
0(t
0)) ¤
+ (u(t
0) − β(t
0))
×
· λ
1 + |u(t
0) − β(t
0)| + (1 − λ)
¸
> (1 − λ) £
R − f (t
0, β(t
0), β
0(t
0)) ¤
≥ 0,
which is a contradiction. This proves that v ≤ 0 on I, so that u(t) ≤ β(t) +
m1, t ∈ I.
Also, we can prove that u(t) ≥ α(t) −
m1, for all t ∈ I. Defining v(t) = u(t) − α(t) +
m1, if min
t∈Iv(t) = v(t
1) < 0, then
v(a) ≥ v(c), v(d) ≤ v(b),
so that we can assume that t
1∈ (a, b). Then
v(t
1) < 0, v
0(t
1) = 0, v
00(t
1) ≥ 0, which imply
u(t
1) < α(t
1) − 1
m , u
0(t
1) = α
0(t
1).
Hence
u(t
1) < α(t
1) − 1
m ≤ β(t
1) − 1
m ≤ β(t
1) − R mM
1σ , and, therefore,
K
1(t
1, u(t
1)) = 0, K
2(t
1, u(t
1)) = − R M
1σ . Using the definition of φ and the hypotheses satisfied by α,
v
00(t
1) = u
00(t
1) − α
00(t
1)
≤ λf
m(t
1, u(t
1), u
0(t
1))
+(1 − λ) {φ(t
1, u(t
1)) − p(t
1, u(t
1)) + u(t
1)}
−f (t
1, α(t
1), α
0(t
1))
= λ
·
f (t
1, α(t
1), α
0(t
1)) + u(t
1) − α(t
1) 1 + |u(t
1) − α(t
1)|
¸
+(1 − λ) [−R − α(t
1) + u(t
1)] − f (t
1, α(t
1), α
0(t
1))
= −(1 − λ) £
R + f (t
1, α(t
1), α
0(t
1)) ¤
+ (u(t
1) − α(t
1))
×
· λ
1 + |u(t
1) − α(t
1)| + (1 − λ)
¸
< −(1 − λ) £
R + f (t
1, α(t
1), α
0(t
1)) ¤
≤ 0,
obtaining a contradiction again. This proves that u(t) ≥ α(t) − 1 m , for all t ∈ I.
The boundary conditions on u imply that there exists ˜t ∈ (a, b) with u
0(˜t) = 0, so that, integrating the equation in (3), we obtain, for t > ˜t, that
u
0(t) = u
0(t) − u
0(˜t) = Z
t˜t
u
00(s) ds
= Z
t˜t
£ λf
m(s, u(s), u
0(s)) + (1 − λ) {φ(s, u(s)) − p(s, u(s)) + u(s)} ¤
ds,
so that
|u
0(t)| ≤ Z
t˜t
|λf
m(s, u(s), u
0(s)) + (1 − λ) {φ(s, u(s)) − p(s, u(s)) + u(s)}| ds
≤ Z
ba
|λf
m(s, u(s), u
0(s)) + (1 − λ) {φ(s, u(s)) − p(s, u(s)) + u(s)}| ds.
A similar estimate can be obtained for t < ˜t, so that, for all t ∈ I, we get
|u
0(t)| ≤ Z
ba
|f
m(s, u(s), u
0(s))| ds + Z
ba
|φ(s, u(s)) − p(s, u(s)) + u(s)| ds.
Since α(t) − 1
m ≤ u(t) ≤ β(t) + 1
m , for t ∈ I, and −R ≤ φ(s, u(s)) ≤ R, s ∈ I, then
−R − β(s) + α(s) − 1
m ≤ φ(s, u(s)) − p(s, u(s)) + u(s)
≤ R − α(s) + β(s) + 1
m , s ∈ I, and
|φ(s, u(s)) − p(s, u(s)) + u(s)| ≤ R + β(s) − α(s) + 1
m , s ∈ I, which implies that
|u
0(t)| ≤ Z
ba
|f
m(s, u(s), u
0(s))| ds+
Z
ba
·
R + β(s) − α(s) + 1 m
¸
ds, t ∈ I.
The expression α(t) − 1
m ≤ u(t) ≤ β(t) + 1
m , for t ∈ I, also provides that f
m(s, u(s), u
0(s)) can be equal to
f (s, β(s), u
0(s)) +
·
f (s, β(s), β
0(s)) − f (s, β(s), u
0(s)) + u(s) − β(s) 1 + |u(s) − β(s)|
¸
× m(u(s) − β(s)), if β(s) < u(s) < β(s) + 1 m , f (s, u(s), u
0(s)), if α(s) ≤ u(s) ≤ β(s), f (s, α(s), u
0(s))
−
·
f (s, α(s), α
0(s)) − f (s, α(s), u
0(s)) + u(s) − α(s) 1 + |u(s) − α(s)|
¸
× m(u(s) − α(s)), if α(s) − 1
m < u(s) < α(s).
For β(s) < u(s) < β(s) + 1 m ,
|f
m(s, u(s), u
0(s))|
≤ |f (s, β(s), u
0(s))|
+
¯ ¯
¯ ¯f (s, β(s), β
0(s)) − f (s, β(s), u
0(s)) + u(s) − β(s) 1 + |u(s) − β(s)|
¯ ¯
¯ ¯
× m (u(s) − β(s))
≤ |f (s, β(s), u
0(s))|
+
¯ ¯
¯ ¯f (s, β(s), β
0(s)) − f (s, β(s), u
0(s)) + u(s) − β(s) 1 + |u(s) − β(s)|
¯ ¯
¯ ¯ m 1 m
≤ |f (s, β(s), u
0(s))| + |f (s, β(s), β
0(s))| + |f (s, β(s), u
0(s))|
+ u(s) − β(s) 1 + u(s) − β(s)
< |f (s, β(s), u
0(s))| + |f (s, β(s), β
0(s))| + |f (s, β(s), u
0(s))| + 1 m , and, for α(s) − 1
m < u(s) < α(s),
|f
m(s, u(s), u
0(s))|
≤ |f (s, α(s), u
0(s))|
+
¯ ¯
¯ ¯f (s, α(s), α
0(s)) − f (s, α(s), u
0(s)) + u(s) − α(s) 1 + |u(s) − α(s)|
¯ ¯
¯ ¯
× m |u(s) − α(s)|
≤ |f (s, α(s), u
0(s))|
+
¯ ¯
¯ ¯f (s, α(s), α
0(s)) − f (s, α(s), u
0(s)) + u(s) − α(s) 1 + |u(s) − α(s)|
¯ ¯
¯ ¯ m 1 m
≤ |f (s, α(s), u
0(s))| + |f (s, α(s), α
0(s))| + |f (s, α(s), u
0(s))|
+
¯ ¯
¯ ¯ u(s) − α(s) 1 + |u(s) − α(s)|
¯ ¯
¯ ¯
< |f (s, α(s), u
0(s))| + |f (s, α(s), α
0(s))| + |f (s, α(s), u
0(s))| + 1 m , so that
Z
ba
|f
m(s, u(s), u
0(s))| ds ≤ 3 K + 1
m (b − a),
which implies
ku
0k ≤ 3 K + 1
m (b − a) + Z
ba
·
R + β(s) − α(s) + 1 m
¸ ds, in particular,
ku
0k ≤ 3 K + (b − a) + Z
ba
[R + β(s) − α(s) + 1] ds = γ, with γ independent of m.
Then, for λ = 1, problem (3) has a solution u
msuch that α(t) − 1
m ≤ u
m(t) ≤ β(t) + 1
m , t ∈ I.
Repeating this procedure for all m ∈ N, m > 1, we obtain a sequence {u
m}
+∞m=2, where u
mis a solution to problem
x
00(t) = f
m(t, x(t), x
0(t)), t ∈ I, x(a) = x(c), x(b) = x(d),
and
ku
mk ≤ max{kαk, kβk} + 1, ku
0mk ≤ γ, so that the sequence {u
m} is bounded in C
1(I) and
ku
00m(t)k = kf
m(t, u
m(t), u
0m(t))k
is bounded, so that {u
m} is equicontinuous in C
1(I). Thus, Arzel´a- Ascoli Theorem implies the existence of a subsequence of {u
m} conver- gent in C
1(I) to a function u. Since
α(t) − 1
m ≤ u
m(t) ≤ β(t) + 1
m , for all t ∈ I, then
α(t) ≤ u(t) ≤ β(t), t ∈ I.
Moreover, ku
0k ≤ γ, or more specifically, ku
0k ≤ 3 K +
Z
ba
[R + β(s) − α(s)] ds.
Function u is a solution to problem (1).
Remark 1. Theorem 2.1 extends Lemma 2 in [5], where constant
upper and lower solutions for (1) are considered.
Theorem 2.2. Suppose that α, β are, respectively, lower and upper solutions of problem (1) such that α ≤ β on I and that there exist real numbers R
1, R
2, R
3, R
4such that R
16= R
3, R
26= R
4,
R
1, R
3≤ − max{kα
0k, kβ
0k}, R
2, R
4≥ max{kα
0k, kβ
0k}
and
f (t, x, R
2) ≥ 0, f (t, x, R
1) ≤ 0, ∀t ∈ [a, b], ∀x ∈ [α(t), β(t)], f (t, x, R
3) ≥ 0, f (t, x, R
4) ≤ 0, for t ∈ [d, b], x ∈ [α(t), β(t)].
Then problem (1) has at least one solution satisfying, for every t ∈ [a, b], that
α(t) ≤ u(t) ≤ β(t),
min{R
1, R
3} ≤ u
0(t) ≤ max{R
2, R
4}.
Proof. Suppose that R
3< R
1and R
4> R
2. Following the proof of Theorem 1 in [5], we can choose n
0∈ N such that, for all n ∈ N, n ≥ n
0, we have that
R
2+ 2
n < R
4, R
1− 2 n > R
3. For n ≥ n
0, let
h
n(t, x, y) =
f (t, x, R
4), R
4< y,
f (t, x, y), R
2+
n2≤ y ≤ R
4,
f (t, x, R
2+
2n) + w
2, R
2+
n1< y < R
2+
n2,
f (t, x, R
2), R
2< y ≤ R
2+
n1,
f (t, x, y), R
1≤ y ≤ R
2,
f (t, x, R
1), R
1−
n1≤ y < R
1,
f (t, x, R
1−
2n) − w
1, R
1−
n2< y < R
1−
n1,
f (t, x, y), R
3≤ y ≤ R
1−
n2,
f (t, x, R
3), y < R
3,
where w
2=
· f
µ
t, x, R
2+ 2 n
¶
− f (t, x, R
2)
¸ n
µ
y − R
2− 2 n
¶ ,
w
1=
· f
µ
t, x, R
1− 2 n
¶
− f (t, x, R
1)
¸ n
µ
y − R
1+ 2 n
¶ . We check that problem
(5)
½ x
00(t) = h
n(t, x(t), x
0(t)), t ∈ I = [a, b], x(a) = x(c), x(b) = x(d)
is under the hypotheses of Theorem 2.1. Indeed, Z
ba
|h
n(t, x, y)| dt ≤ K, for x ∈ [α(t), β(t)], y ∈ R, where
K = Z
ba
sup{|h
n(t, x, y)| : x ∈ [α(t), β(t)], y ∈ R} dt.
Moreover, α, β are, respectively, lower and upper solutions to problem (5), since
α
00(t) ≥ f (t, α(t), α
0(t)) = h
n(t, α(t), α
0(t)), t ∈ I, β
00(t) ≤ f (t, β(t), β
0(t)) = h
n(t, β(t), β
0(t)), t ∈ I,
where we use that R
1≤ α
0(t), β
0(t) ≤ R
2. Using Theorem 2.1, we get that problem (5) has a solution u
nsatisfying
α(t) ≤ u
n(t) ≤ β(t), t ∈ I.
Now, we give estimates for u
0n. Since u
n(a) = u
n(c), u
n(d) = u
n(b), then there exist a
n0∈ (a, c) and b
n0∈ (d, b) with u
0n(a
n0) = 0, u
0n(b
n0) = 0.
Suppose that max{u
0n(t) : t ∈ [a, b
n0]} = u
0n(z
0n) > R
2+
n1. Then z
0n6=
b
n0and there exists (t
n1, t
n2) ⊂ (a, b
n0), with u
0n(t
n2) = R
2, u
0n(t
n1) = R
2+
n1and R
2≤ u
0n(t) ≤ R
2+
n1, for all t ∈ (t
n1, t
n2). Integrating u
00nin the interval (t
n1, t
n2) and using the hypotheses on f , we obtain
0 > − 1
n = R
2− µ
R
2+ 1 n
¶
= u
0n(t
n2) − u
0n(t
n1) = Z
tn2
tn1
u
00n(s) ds
= Z
tn2
tn1
h
n(s, u
n(s), u
0n(s)) ds = Z
tn2
tn1
f (s, u
n(s), R
2) ds ≥ 0,
which is a contradiction. If min{u
0n(t) : t ∈ [a, b
n0]} = u
0n(z
1n) < R
1−
1n,
then z
n16= b
n0and there exists (t
n1, t
n2) ⊂ (a, b
n0), with u
0n(t
n2) = R
1,
u
0n(t
n1) = R
1−
1nand R
1−
n1≤ u
0n(t) ≤ R
1, for all t ∈ (t
n1, t
n2). Integrating again, we get
0 < 1
n = R
1− µ
R
1− 1 n
¶
= u
0n(t
n2) − u
0n(t
n1) = Z
tn2
tn1
u
00n(s) ds
= Z
tn2
tn1
h
n(s, u
n(s), u
0n(s)) ds = Z
tn2
tn1
f (s, u
n(s), R
1) ds ≤ 0, another contradiction. We have proved that
R
1− 1
n ≤ u
0n(t) ≤ R
2+ 1
n , for all t ∈ [a, b
n0].
Now, suppose that max{u
0n(t) : t ∈ [b
n0, b]} = u
0n(z
0n) > R
4+
1n. Then z
n0∈ (b
n0, b] and there exists (t
n1, t
n2) ⊂ (b
n0, b), with u
0n(t
n1) = R
4, u
0n(t
n2) = R
4+
n1, and R
4≤ u
0n(t) ≤ R
4+
1n, for all t ∈ (t
n1, t
n2), so that
0 < 1
n = R
4+ 1
n − R
4= u
0n(t
n2) − u
0n(t
n1) = Z
tn2
tn1
u
00n(s) ds
= Z
tn2
tn1
h
n(s, u
n(s), u
0n(s)) ds = Z
tn2
tn1
f (s, u
n(s), R
4) ds ≤ 0, which is absurd and, similarly, if min{u
0n(t) : t ∈ [b
n0, b]} = u
0n(z
1n) <
R
3−
1n, then z
1n∈ (b
n0, b] and there exists (t
n1, t
n2) ⊂ (b
n0, b), with u
0n(t
n2) = R
3−
n1, u
0n(t
n1) = R
3and R
3−
n1≤ u
0n(t) ≤ R
3, for all t ∈ (t
n1, t
n2). Thus
0 > − 1
n = R
3− 1
n − R
3= u
0n(t
n2) − u
0n(t
n1) = Z
tn2
tn1
u
00n(s) ds
= Z
tn2
tn1
h
n(s, u
n(s), u
0n(s)) ds = Z
tn2
tn1
f (s, u
n(s), R
3) ds ≥ 0, which is again a contradiction. Therefore,
R
3− 1
n ≤ u
0n(t) ≤ R
4+ 1
n , t ∈ [b
n0, b], R
3− 1
n < R
1− 1
n ≤ u
0n(t) ≤ R
2+ 1
n < R
4+ 1
n , t ∈ [a, b
n0], that is,
min{R
1, R
3}− 1
n = R
3− 1
n ≤ u
0n(t) ≤ R
4+ 1
n = max{R
2, R
4}+ 1 n , t ∈ I.
This proves that the sequence {u
n}
+∞n0is bounded and equicontinuous
in C
1(I), so that there exists a subsequence convergent in C
1(I) to a
function u satisfying
α(t) ≤ u(t) ≤ β(t), R
3≤ u
0(t) ≤ R
4. In consequence, u is a solution to equation
x
00(t) = h(t, x(t), x
0(t)), t ∈ I, x(a) = x(c), x(b) = x(d), where
h(t, x, y) =
f (t, x, R
4), y > R
4, f (t, x, y), R
3≤ y ≤ R
4, f (t, x, R
3), y < R
3,
but R
3≤ u
0(t) ≤ R
4, t ∈ I, then u is a solution to (1) with α(t) ≤ u(t) ≤ β(t),
min{R
1, R
3} = R
3≤ u
0(t) ≤ R
4= max{R
2, R
4}.
If R
3< R
1, R
2< R
4is not true, then the proof can be completed following a similar argument.
The following result studies the case where R
1= R
3, R
2= R
4. Theorem 2.3. Suppose that α, β are, respectively, lower and up- per solutions of problem (1) such that α ≤ β on I and that there exist real numbers R
1, R
2, such that R
1≤ − max{kα
0k, kβ
0k}, R
2≥ max{kα
0k, kβ
0k} and
f (t, x, R
2) ≥ 0, f (t, x, R
1) ≤ 0, ∀t ∈ [a, b], ∀x ∈ [α(t), β(t)], f (t, x, R
1) ≥ 0, f (t, x, R
2) ≤ 0, for t ∈ [d, b], x ∈ [α(t), β(t)].
Then problem (1) has at least one solution satisfying α(t) ≤ u(t) ≤ β(t), R
1≤ u
0(t) ≤ R
2, t ∈ I.
Proof. Let h(t, x, y) =
f (t, x, R
2), R
2< y, f (t, x, y), R
1≤ y ≤ R
2, f (t, x, R
1), y < R
1,
= f (t, x, q(y)), where
q(y) = max{R
1, min{y, R
2}}.
In this case, for problem (6)
½ x
00(t) = h(t, x(t), x
0(t)) = f (t, x(t), q(x
0(t))), t ∈ I = [a, b],
x(a) = x(c), x(b) = x(d),
the hypotheses of Theorem 2.1 hold. Indeed, Z
ba
|h(t, x, y)| dt ≤ K, for x ∈ [α(t), β(t)], y ∈ R, where
K = Z
ba
sup{|f (t, x, y)| : x ∈ [α(t), β(t)], y ∈ [R
1, R
2]} dt.
The conditions on R
1and R
2allow to prove that
α
00(t) ≥ f (t, α(t), α
0(t)) = h(t, α(t), α
0(t)), t ∈ I, β
00(t) ≤ f (t, β(t), β
0(t)) = h(t, β(t), β
0(t)), t ∈ I,
so that functions α, β are, respectively, lower and upper solutions to problem (6).
Applying Theorem 2.1, we get that problem (6) has a solution u satisfying
α(t) ≤ u(t) ≤ β(t), t ∈ I.
We prove that R
1≤ u
0(t) ≤ R
2, t ∈ I. The boundary conditions imply that u(a) = u(c), u(d) = u(b), then there exist a
0∈ (a, c) and b
0∈ (d, b) with u
0(a
0) = 0, u
0(b
0) = 0.
Suppose that max{u
0(t) : t ∈ [a, b
0]} = u
0(z
0) > R
2. Then z
06= b
0and there exists (t
1, t
2) ⊂ (a, b
0), with u
0(t
2) = R
2, u
0(t
1) > R
2and R
2≤ u
0(t) ≤ u
0(t
1), for all t ∈ (t
1, t
2). Integrating u
00in the interval (t
1, t
2) and using the hypotheses, we get
0 > R
2− u
0(t
1) = u
0(t
2) − u
0(t
1) = Z
t2t1
u
00(s) ds
= Z
t2t1
h(s, u(s), u
0(s)) ds = Z
t2t1
f (s, u(s), R
2) ds ≥ 0, getting a contradiction. If min{u
0(t) : t ∈ [a, b
0]} = u
0(z
1) < R
1, then z
16= b
0and there exists (t
1, t
2) ⊂ (a, b
0), with u
0(t
2) = R
1, u
0(t
1) < R
1and u
0(t
1) ≤ u
0(t) ≤ R
1, for all t ∈ (t
1, t
2). Integrating again, we get
0 < R
1− u
0(t
1) = u
0(t
2) − u
0(t
1) = Z
t2t1
u
00(s) ds
= Z
t2t1
h(s, u(s), u
0(s)) ds = Z
t2t1
f (s, u(s), R
1) ds ≤ 0, again a contradiction. This provides that
R
1≤ u
0(t) ≤ R
2, for all t ∈ [a, b
0].
Now, suppose that max{u
0(t) : t ∈ [b
0, b]} = u
0(z
0) > R
2. Then z
0∈ (b
0, b] and there exists (t
1, t
2) ⊂ (b
0, b), with u
0(t
1) = R
2, u
0(t
2) > R
2, and R
2≤ u
0(t) ≤ u
0(t
2), for all t ∈ (t
1, t
2), so that
0 < u
0(t
2) − R
2= u
0(t
2) − u
0(t
1) = Z
t2t1
u
00(s) ds
= Z
t2t1
h(s, u(s), u
0(s)) ds = Z
t2t1
f (s, u(s), R
2) ds ≤ 0, which is absurd and, similarly, if min{u
0(t) : t ∈ [b
0, b]} = u
0(z
1) < R
1, then z
1∈ (b
0, b] and there exists (t
1, t
2) ⊂ (b
0, b), with u
0(t
2) < R
1, u
0(t
1) = R
1, and u
0(t
2) ≤ u
0(t) ≤ R
1, for all t ∈ (t
1, t
2), thus
0 > u
0(t
2) − R
1= u
0(t
2) − u
0(t
1) = Z
t2t1
u
00(s) ds
= Z
t2t1
h(s, u(s), u
0(s)) ds = Z
t2t1