# Welcome back

## Find a book, put up your feet, stay awhile

Sign in with Facebook

Sorry, we are unable to log you in via Facebook at this time. Please try again later.

or

Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more

Download

Standard view

Full view

of .

Look up keyword

Like this

Share on social networks

0Activity

×

0 of .

Results for: No results containing your search query

P. 1

Fixed Point Theorems for Random Variables in Complete Metric SpacesRatings: (0)|Views: 1|Likes: 0

Published by Alexander Decker

International peer-reviewed academic journals call for papers, http://www.iiste.org/Journals

International peer-reviewed academic journals call for papers, http://www.iiste.org/Journals

See more

See less

https://www.scribd.com/doc/148313825/Fixed-Point-Theorems-for-Random-Variables-in-Complete-Metric-Spaces

06/17/2013

text

original

Mathematical Theory and Modelingwww.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications

70

Fixed Point Theorems for Random Variables in Complete MetricSpaces

Deepak Singh KaushalAbstract

In this paper we prove some fixed point theorem for random variables with one and two self maps satisfyingrational inequality in complete metric spaces

Keywords:

Random fixed point,Complete metric space, Common fixed points.

Mathematics Subject Classification:

47H10

1.INTRODUCTION

Many theorems of fixed point have been proved using rational inequality in ordinary metric space. Some of thenoteworthy contributions are by Bhardwaj, Rajput and Yadava [3], Jaggi and Das[9], Das and Gupta[5] Fisher [7,8] who obtained some fixed point theorems using rational inequality in complete metric spaces.Random fixed point theory has received much attention in recent years.Some of the recent results in randomfixed points have been proved by Beg and Shahzad [1, 2], Choudhary and Ray [4], Dhagat, Sharma andBhardwaj [6]. In particular random iteration schemes leading to random fixed point of randomoperator.Throughout this paper

( )

∑Ω

,

denotes a measurable space, (X,d) be a complete metric space and C isnon empty subset of X.

2.PRELIMINARIESDefinition 2.1:

A function

:

f C C

Ω× →

is said to be random operator, if

( )

C X f

→Ω

:,.

is measurablefor every

.

C X

∈

Definition 2.2:

A function

:

f C

Ω →

is said to be measurable if

( )

∑∈∩

C B f

'

for every Borel subset Bof X.

Definition 2.3:

A measurable function

C g

→Ω

:

is said to be random fixed point of the random operator

C C f

→×Ω

:

, if

( )( ) ( )

.,,

Ω∈∀=

t t g t g t f

Definition 2.4:

A random operator

C C f

→×Ω

:

is said to be continuous if for fixed

( )

C C t f t

×Ω∈

:,.,

is continuous.

3.MAIN RESULTSTheorem3.1:

Let E be a self mapping on a complete metric space

( )

,

X d

satisfying the condition

( )( ) ( )( )( ) ( )( )( ) ( )( )

(),(,()).(),(,())(,()),(,())(),()(),(,()).(),(,())(),()(),(,())(),(,())(),()

d g E g d h E hd E g E hd g hd g E h d h E g d g hd g E g d h E hd g h

ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ α ξ ξ ξ ξ ξ ξ ξ ξ β ξ ξ γ ξ ξ ξ δ ξ ξ ξ η ξ ξ

≥++ ++

For all

(),()

h X

ξ ξ

∈

with

()()

h

ξ ξ

≠

,where

,,,,0

α β γ δ η

>

and

1

α β γ δ η

+ + + + >

and

1

α γ

+ <

and E is onto.Then E has a fixed point in

.

X

Proof:-

Let

0

().

X

ξ

∈

Since E is onto there is an element

1

()

g

ξ

satisfying

110

()(,())

g E g

ξ ξ ξ

−

∈

By thesame way we can choose

11

()(,())

n n

g E g

ξ ξ ξ

−−

∈

where

2,3,4,...

n

=

If

1

()()

m m

g g

ξ ξ

−

=

for some

m

then

()

m

g

ξ

is a fixed point of E.

Mathematical Theory and Modelingwww.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications

71Without loss of generality we can suppose that

1

()()

n n

g g

ξ ξ

−

=

,for every

.

n

So

( ) ( )( ) ( )( )( ) ( )( )( ) ( )

1111111111

(),()(,()),(,())(),(,()).(),(,())(),()(),(,()).(),(,())(),()(),(,())(),(,())(),

n n n nn n n nn nn n n nn nn n n nn

d g g d E g E g d g E g d g E g d g g d g E g d g E g d g g d g E g d g E g d g

ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ α ξ ξ ξ ξ ξ ξ ξ ξ β ξ ξ γ ξ ξ ξ δ ξ ξ ξ η ξ

− ++ +++ +++ +

=≥++ ++

( )

1

()

n

g

ξ

+

( ) ( ) ( ) ( )( )( )( )( )

1111

1(),()(),()1(),()(),()

n n n nn n n n

d g g d g g d g g d g g

α γ ξ ξ δ η ξ ξ α γ ξ ξ ξ ξ δ η

− ++ −

− + ≥ + − + ≤+

It follows that

( ) ( )

11

(),()(),()

n n n n

d g g kd g g

ξ ξ ξ ξ

+ −

≤

where

( )( )

11.

k

α γ δ η

− + = <+

By routine calculation the following inequality holds for

.

p n

>

( )

( )

1

(),()(),()

n n p n i n i

d g g d g g

ξ ξ ξ ξ

+ + − +

≤

∑

( )( )

10101

(),()(),()1

n in

k d g g k d g g k

ξ ξ ξ ξ

+ −

≤≤−

Now making

n

→∞

we obtain

( )

(),()0

n n p

d g g

ξ ξ

+

→

Hence

{ }

()

n

g

ξ

is a Cauchy sequence. Since

X

is complete

{ }

()

n

g

ξ

converges to

()

g

ξ

,for some

().

g X

ξ

∈

Since E is onto then there exists

()

h X

ξ

∈

such that

1

()(,())

h E g

ξ ξ ξ

−

∈

and for infinitely many

,()()

n

n g g

ξ ξ

≠

for such

.

n

( ) ( )( ) ( )( )( ) ( )( )( ) ( )( )

1111111111

(),()(,()),(,())(),(,()).(),(,())(),()(),(,()).(),(,())(),()(),(,())(),(,())(),()

n nn nnn nnn nn

d g g d E g E hd g E g d h E hd g hd g E h d h E g d g hd g E g d h E hd g h

ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ α ξ ξ ξ ξ ξ ξ ξ ξ β ξ ξ γ ξ ξ ξ δ ξ ξ ξ η ξ ξ

++ +++ +++ ++

=≥++ ++

Mathematical Theory and Modelingwww.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications

72

( ) ( )( )( ) ( )( )( ) ( )( )

111111

(),().(),()(),()(),().(),()(),()(),())(),())(),()

n nnn nnn nn

d g g d h g d g hd g g d h g d g hd g g d h g d g h

ξ ξ ξ ξ α ξ ξ ξ ξ ξ ξ β ξ ξ γ ξ ξ δ ξ ξ η ξ ξ

++++++

≥++ ++

On taking limit as

n

→∞

we have

( ) ( )

1

0(),()lim(),()

n n

d h g d g h

δ ξ ξ η ξ ξ

→∞ +

≥ +

Since

( )

,0,So(),()0

d g h

δ η ξ ξ

> =

and

( )

1

lim(),()0

n n

d g h

ξ ξ

→∞ +

=

So in both cases we get

()()

g h

ξ ξ

=

.Thus E has a fixed point in

.

X

Theorem 3.2:

Let E be a self mapping on a complete metric sapce

( )

,

X d

satisfying the condition

( )( ) ( ) ( ) ( )( )( ) ( ) ( ) ( )( )( )

(,()),(,())(),(,()).(),(,())(),(,()).(),(,()),(),()(),(,()).(),(,())(),(,()).(),(,())min,(),()(),(,()),(),(,

d E g E hd g E g d h E h d g E h d h E g d g hd g E h d h E g d h E h d h E hd g hd h E h d g E g

ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ α ξ ξ ξ ξ ξ ξ ξ

++≥

( ) ( )

()),(),()

d g h

ξ ξ ξ

For all

(),()

h X

ξ ξ

∈

with

()()

h

ξ ξ

≠

, where

1

α

>

and E is onto. Then E has a fixed point in

.

X

Proof:-

Let

0

().

X

ξ

∈

Since E is onto there is an element

1

()

g

ξ

satisfying

110

()(,())

g E g

ξ ξ ξ

−

∈

By thesame way we can choose

11

()(,())

n n

g E g

ξ ξ ξ

−−

∈

where

2,3,4,...

n

=

If

1

()()

m m

g g

ξ ξ

−

=

for some

m

then

()

m

g

ξ

is a fixed point of E.Without loss of generality we can suppose that

1

()()

n n

g g

ξ ξ

−

=

for every

.

n

So

( ) ( )

11

(),()(,()),(,())

n n n n

d g g d E g E g

ξ ξ ξ ξ ξ ξ

− +

=

( ) ( ) ( ) ( )( )( ) ( ) ( )( )( )

1111121111111

(),(,()).(),(,())(),(,()).(),(,()),(),()(),(,()).(),(,())(),(,())min,(),()(),(,())

n n n n n n n nnn n n n n nn nn n

d g E g d g E g d g E g d g E g d g g d g E g d g E g d g E g d g g d g E g

ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ ξ α ξ ξ ξ ξ ξ

+ + + +++ + + +++ +

+ + ≥

( ) ( )

1

,(),(,()),(),()

n n n n

d g E g d g g

ξ ξ ξ ξ ξ

+

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

© Copyright 2015 Scribd Inc.

Language:

Choose the language in which you want to experience Scribd:

Sign in with Facebook

Sorry, we are unable to log you in via Facebook at this time. Please try again later.

or

Password Reset Email Sent

Join with Facebook

Sorry, we are unable to log you in via Facebook at this time. Please try again later.

or

By joining, you agree to our

read free for one month

Personalized recommendationsbased on books you love

Syncing across all your devices

Join with Facebook

or Join with EmailSorry, we are unable to log you in via Facebook at this time. Please try again later.

Already a member? Sign in.

By joining, you agree to our

to download

Personalized recommendationsbased on books you love

Syncing across all your devices

Continue with Facebook

Sign inJoin with emailSorry, we are unable to log you in via Facebook at this time. Please try again later.

By joining, you agree to our

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd