Professional Documents
Culture Documents
Department of Mathematics, Kandaswami Kandars College, Velur 638 182, Namakkal Dt. Tamil Nadu,
India.
Department of Mathematics, Periyar University College of Arts and Science College, Pappireddipatti-636
905, Tamil Nadu, India.
Abstract
In this paper, we discuss the existence of nonoscillatory solutions of first order nonlinear neutral difference equations of
the from
Q(n)G x(n ) 0,
x(n) p n x n
s c
and
d
x(n) p n, s x n s Q(n, s )G x(n s ) 0.
s a
s c
We use the Knaster-Tarski fixed point theorem to obtain some sufficient conditions for the existence of nonoscillatory
solutions of above equations. Examples are provided to illustrate the main results.
ISSN 2347-1921
1. INTRODUCTION
In this paper, we discuss the existence of nonoscillatory solutions of first order nonlinear neutral difference equations of
the from
Q(n)G x(n ) 0, n N
x(n) p n x n
0.
(1.1)
s c
(1.2)
and
d
x(n) p n, s x n s Q(n, s)G x(n s) 0, n N0
s a
s c
is
the
forward
difference
operator
defined
by
where
C1
(1.3)
and
C2 a, b, c, and d
ab
and
cd;
xG( x) 0 for x 0 .
max , . By a solution of equations (1.1)-(1.3), we mean a real sequence x(n) defined and satisfying
equations (1.1)-(1.3) for all n n0 . Such a solution is said to be oscillatory if it is neither eventually positive nor
Let
2. Nonoscillation Theorems
In this section, we present some sufficient conditions for the existence of bounded nonoscillatory solutions of equations
(1.1)-(1.3). We begin with the following lemma.
Q(n) ,
(2.1)
n n0
Proof: Let B
be the set of all bounded real valued sequence with the supremum norm,
5231 | P a g e
ISSN 2347-1921
x sup | xn | .
xn B
Then clearly
that
x1 , x2 B, x1 x2
means
S x B : C1 x(n) C2 , n n0 ,
where
C1
and
C2
C1 (1 p)C2 .
If
x1 (n) C1 , n n0 ,
then
x1 S
and
S* x B : x(n) , C1 , C2 , n n0 .
Let
exists
n1 n0
Then
x2 S
and
with
n1 n0 max{ , }
(2.2)
Q( s )
s n
For
[(1 p)C2 ]
, n n1.
G(C2 )
(2.3)
x S , we define
1/
p
(
n
)
x
(
n
Q
(
s
)
G
(
x
(
s
))
, n n1
(Tx)(n)
s n
n0 n n1.
(Tx1 )(n),
For
n n1
and
xS ,
1/
[(1 p )C2 ]
pC2 G (C2 )
G (C2 )
1/
C2 ,
and
(Tx)(n) C1.
Theorem 2.2.
x S . Let x1 , x2 S
Assume that
with
x1 x2
. Since
1 p p(n) p0 , G
is nondecreasing,
5232 | P a g e
ISSN 2347-1921
B be a Banach space as defined in Theorem 2.1. We can define
x1 , x2 B, x1 x2 means that x1 (n) x2 (n) for n n0 N0 . Define
Proof: Let
S x B : C3 x(n) C4 , n n0 ,
where
C3
and
C4
( p0 1)C3 (1 p)C4 .
If
x1 (n) C3 , n n0 ,
x1 S
then
and
S* x B : x(n) , C3 , C4 , n n0 .
Let
exists
n1 n0
Then
x2 S
and
with
n1 n0
(2.4)
[( p0 1)C3 ]
s n
G(C3 )
Q( s )
For
, n n1.
(2.5)
x S , we define
1/
x(n ) Q( s)G ( x( s )) , n n1
(Tx)(n) p(n )
s n
n0 n n1.
(Tx1 )(n),
For
n n1
and
xS ,
(Tx)(n)
1
1
1
1/
C
C4 C4 (1 p)C4 C4 ,
p
p
p
and
1/
1
(Tx)(n)
C3 G (C3 ) Q( s )
p(n )
s n
1/
[( p0 1)C3 ]
1
C3 G (C3 )
p (n )
G (C3 )
1
C [( p 1)C ] 1/
3
0
3
p(n )
1
C3 p0C3 C3
p(n )
C3 ,
5233 | P a g e
x S . Let x1 , x2 S
with
x1 x2
. Since
is nondecreasing,
ISSN 2347-1921
Theorem 2.3. Assume that 0 p(n) p 1, G
is nondecreasing and
Q(n, s) ,
(2.6)
n n0 s c
Proof: Let B be a Banach space as defined in Theorem 2.1. We can define a partial ordering as follows: for given
x1 , x2 B, x1 x2 means that x1 (n) x2 (n) for n n0 N0 . Define
S x B : C5 x(n) C6 , n n0 ,
where
C5
and
C6
C5 ( p 1)C6 .
If
x1 (n) C5 , n n0 ,
then
x1 S
and
S* x B : x(n) , C5 , C6 , n n0 .
Let
exists
n1 n0
Then
x2 S
and
with
n1 n0 max{ , d}
sufficiently large that
Q ( s, i )
s n i c
For
[(1 p)C6 ]
, n n1.
G(C6 )
x S , we define
1/
n0 n n1.
(Tx1 )(n),
The remaining part of the proof is similar to that of Theorem 2.1, and hence the details are omitted.
Proof: Let B be a Banach space as defined in Theorem 2.1. We can define a partial ordering as
x1 , x2 B, x1 x2 means that x1 (n) x2 (n) for n n0 N0 . Define
S x B : C7 x(n) C8 , n n0 ,
where
C7
and
C8
( p0 1)C7 ( p 1)C8 .
If
x1 (n) C7 , n n0 ,
then
x1 S
and
S* x B : x(n) , C7 , C8 , n n0 .
Let
exists
n1 n0
Then
x2 S
and
with
5234 | P a g e
ISSN 2347-1921
n1 n0 d
sufficiently large that
Q ( s, i )
[( p0 1)C7 ]
s n i c
For
G(C7 )
, n n1.
x S , we define
1/
d
1
x(n ) Q( s, i )G ( x( s i )) , n n1
(Tx)(n) p(n )
s n i c
n0 n n1.
(Tx1 )(n),
The remaining part of the proof is similar to that of Theorem 2.2, and hence the details are omitted.
b
s a
Proof: Let B be a Banach space as defined in Theorem 2.1. We can define a partial ordering as follows: for given
x1 , x2 B, x1 x2 means that x1 (n) x2 (n) for n n0 N0 . Define
S x B : C9 x(n) C10 , n n0 ,
where
C9
and
C10
C9 (1 p)C10 .
If
x1 (n) C9 , n n0 ,
then
x1 S
and
S* x B : x(n) , C9 , C10 , n n0 .
Let
exists
n1 n0
Then
x2 S
and
with
n1 n0 max{b, d}
sufficiently large that
s n i c
For
Q ( s, i )
[(1 p)C10 ]
, n n1.
G(C10 )
x S , we define
1/
b
d
p
(
n
,
s
)
x
(
n
s
)
Q
(
s
,
i
)
G
(
x
(
s
i
))
, n n1
(Tx)(n)
s a
s n i c
n0 n n1.
(Tx1 )(n),
The remaining part of the proof is similar to that of Theorem 2.1, and hence the details are omitted.
3. Examples
In this section, we present some examples to illustrate the main results.
5235 | P a g e
ISSN 2347-1921
3
1
7
x(n) x(n 1) 2 n 8 x(n 2) 0, n 0.
4
2
Here
1
7
p(n) , Q(n) 2 n8 , 3 ,
4
2
and
1, 2 .
By taking
(3.1)
G ( x) x ,
we see that
Q ( n) .
n 1
Further it is easy to verify that all other conditions of Theorem 2.1 are satisfied. Therefore the equation (3.1) has a
bounded nonoscillatory solution. In fact,
1
2 1
x(n) x(n 3)
x(n s) 0, n 0.
s 1 n s
2
Here
1
1
p(n) , Q(n, s)
, 3,
2
ns
and
(3.2)
of Theorem 2.3 are satisfied and hence every solution of equation (3.2) has a bounded nonoscillatory.
3
1
1
x ( n)
x(n s )
x(n s) 0, n 0.
2
s 1 2( n s 1)
s 2 (n s )
Here
p ( n)
1
1
, Q(n, s)
, 1, a 1, b 2, ,
2(n s 1)
(n s) 2
and
(3.3)
c 2, d 3 . By taking G( x) x , we
see that all other conditions of Theorem 2.5 are satisfied and hence every solution of equation (3.3) has a bounded
nonoscillatory.
References
[1] R.P. Agarwal, Difference Equations and Inequalities, Second Edition, Marcel Dekker, New York, 2000.
[2] R.P. Agarwal, M.Bohner, S.R.Grace and D.ORegan, Discrete Oscillation Theory, Hindawi Publ. Corp., New
York, 2005.
[3] R.P. Agarwal, S.R.Grace and D.ORegan, Oscillation Theory for Difference and Functional Differential
Equations, Kluwer Academic, 2000.
[4] R.Arul and G.Ayyappan, Some oscillation results for first order nonlinear neutral difference equations, JMI Int.J.
of Math. Sci., 4(1)(2013), 1-9.
[5] R.Arul and T.J.Raghupathi, Existence of nonoscillatory solutions of nonlinear delay difference equations, Far
East J. of Math. Sci., 76(1)(2013), 71-80.
[6] T.Candan, Existence of nonoscillatory solutions of first order nonlinear neutral difference equations, Appl. Math.
Lett., 26(2013), 1182-1186
[7] M.P.Chen and B.G.Zhang, The existence of bounded positive solutions of delay difference equations, Pan
America Math. I., 3(1)(1993), 79-94.
[8] S.S.Chang and W.T.Patula, An existence theorem for a nonlinear difference equations, Nonlinear Anal.,
20(1993), 193-203.
[9] J.R.Graef, E.Thandapani and S.Elizabeth, Oscillation of first order nonlinear neutral difference equations,
Indian J.Pure Appl. Math., 36(9)(2005), 503-512.
[10] S.Lourdu Marian, M.Paul Loganathan and A.George Maria Selvam, Existence of nonoscillatory solutions of
first order nonlinear neutral delay difference equations, American J. of Math. Sci. and Appl., 1(1)(2013), 21-26.
[11] O.Ocalan and O.Duman, Oscillation analysis of neutral difference equations with delays, Chaos Solitons and
Fractals, 39(2009), 261-270.
[12] N.Parhi, Behavior of solutions of delay difference equations, Indian J. Pure Appl. Math., 33(1)(2002), 31-43.
5236 | P a g e
ISSN 2347-1921
[13] E.Thandapani, R.Arul and P.S.Raja, Oscillation of first order neutral delay difference equations, Appl. Math. ENotes, 3(2003), 88-94.
[14] E.Thandapani, R.Arul and P.S.Raja, The asymptotic behavior of nonoscillatory solutions of nonlinear neutral
type difference equations, Math. Comput. Model., 39(13)(2004), 1457-1465.
[15] E.Thandapani, J.R.Graef and P.W.Spikes, On existence of positive solutions and oscillations of
difference equations of odd order, J.Diff. Equ. Appl., 2(1996), 175-183.
neutral
[16] G.Wei, Asymptotic behavior results for nonlinear neutral delay difference equations, Appl. Math. Comput.,
217(2011), 7184-7190.
5237 | P a g e