• No results found

Fixed Point Theorem on Complete N - Metric Spaces

N/A
N/A
Protected

Academic year: 2020

Share "Fixed Point Theorem on Complete N - Metric Spaces"

Copied!
14
0
0

Loading.... (view fulltext now)

Full text

(1)

Fixed Point Theorem on Complete N - Metric

Spaces

S.C. Ghosh ; M. Srivastava Department of Mathematics D.A-V.College, Kanpur, U.P., India

ABSTRACT: In this paper we have proved the generalized fixed point theorem on complete N-Metric Space with the help of N-mappings. This theorem generalizes and extends the result of R.K. Jain, H.K. Sahu and B. Fisher [3], Kikina [2] and chaube, Gupta and Shau [1] from three, four, five metric space to N-Metric Spaces.

KEY WORDS: Complete metric spaces, Cauchy sequences, fixed point. 2010 AMS subjectclassification 47 H10; 54H25

INTRODUCTION: In this paper

X

1

,

X

2

,

X

N are taken as complete N-Metric Spaces and

1 1

3 2

1 2

1

X

,

f

:

X

X

f

:

X

X

X

:

f

N

N

N

as N-mappings which are all the

self mappings. The elements of the metric spaces are taken as

N N

n n

n

X

,

X

X

x

X

x

1

1 2

2

where the first suffix indicating the respective metric

space and the second one are the number of elements where

n

N

(Set of natural number).

MAIN RESULT:

Theorem [1.1] Let

X

1

,

d

1

 

,

X

2

,

d

2

 

,

X

3

,

d

3

X

N

,

d

N

are N-complete metric

spaces and

f

1

f

2

f

3

f

N are self mappings such that

1 1

1 2

1 2

3

4 3

2 3 2

1 2

1

X

X

:

f

,

X

X

:

f

,

X

X

:

f

X

X

:

f

,

X

X

:

f

,

X

X

:

f

N N

N N

N

N N

N

 

Satisfying following conditions

1

1

1

1 2 1 1 1

1 2 1 1 1 1

1 3

2 1 1 2 1 3

2 1

1

.

.

x

,

x

x

,

x

x

f

f

f

f

,

x

f

f

f

f

d

N N

1

1

2

1 3 1 2 2

1 3 1 2 2 1

2 1 3

2 1 1

3 1 3

2 1

2

.

.

x

,

x

x

,

x

x

f

f

f

f

f

,

x

f

f

f

f

f

d

N N N N

1

1

3

1 4 1 3 3

1 4 1 3 3 1

3 2 3

2 1 1 1 1 3 3

2 1 1

3

.

.

x

,

x

x

,

x

x

f

f

f

f

f

f

,

x

f

f

f

f

f

f

d

N N N N N N



 

 

1

1

4

1 5 1 4 4

1 5 1 4 4 1

4 3

2 1 1 2 1 5 4 3

2 1 1 2

4

.

.

x

,

x

x

,

x

x

f

f

f

f

f

f

f

,

x

f

f

f

f

f

f

f

d

N N N N N N N N



  

(2)

1

1

5

1

1 1

1 1 1 1

1 2 3 1

1 1 1

4 3

2

.

.

x

,

x

x

,

x

x

f

f

f

f

f

,

x

f

f

f

f

f

d

N N

N N N

N N N

N N



N

N

X

x

X

x

,

X

x

,

X

x

11 1 21 2 31 3

1

and

 

0

,

1

, Also

1

2

N and

1

,

2

,

3

N indicated in above inequality are defined as follows,

11 21

0

2

21 31

0

3

31 41

0

1 11

0

1

x

,

x

,

x

,

x

x

,

x

N

x

N

,

x

 

21 11



1

1

6

2

1 2 1 3

2 1 1 1 1 1

1 5

4

1 2 1 6

5 4 2 1

1 3

2 1 1 1 1

1 1 1 4

3 1 3 2 5

4 3 1

1 3

2 1 1 1 1 1 1 1 3

2

1 2 1 2 3

2 1

3 2 1 1 1 1 1

2 1 1 1

.

.

x

f

,

x

d

,

x

f

f

f

f

,

x

d

x

f

f

f

x

f

f

f

f

d

,

x

f

f

f

f

,

x

d

,

x

f

f

f

f

,

x

f

f

f

f

d

,

x

f

f

f

f

,

x

d

,

x

f

f

f

f

,

x

f

f

f

f

d

,

x

f

f

f

f

,

x

d

max

x

,

x

N

N N

N N

N

N N N

N

N N N

N

N N N

N N

  

 

 

(3)

 

 

11 1 11

1

1

7

1 1 1 3 2 1 1 1 3 2 1 1 1 1 1 1 1 4 3 2 1 1 1 2 3 1 1 1 1 7 6 5 3 1 1 4 3 2 1 1 1 5 4 3 1 1 6 5 4 2 1 1 4 3 2 1 1 1 5 4 3 1 1 5 4 3 1 1 1 5 4 3 2 1 1 1 1

.

.

x

f

,

x

d

,

x

f

f

f

x

d

,

x

f

f

f

f

,

x

d

,

x

f

f

f

f

,

x

d

,

x

f

f

f

f

f

,

x

f

f

f

f

d

,

x

f

f

f

f

f

,

x

d

,

x

f

f

f

f

f

,

x

f

f

f

f

d

,

x

,

f

f

f

f

f

,

x

d

,

x

f

f

f

f

f

,

x

f

f

f

f

d

,

x

f

f

f

f

f

f

,

x

d

max

x

,

x

N N , N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N          

Again

1

2

3

N are defined as -

 

11 1 2 3 1 11



2 1 1 3 2 1 1 1 1 1 1 1 3 2 1 1 1 1 1 2 1 1 1    

N N N N N , N N ,

x

f

f

f

f

f

,

x

f

d

,

x

f

f

f

f

x

d

,

x

f

f

f

f

,

x

d

max

x

x

 

1 21 1 1 2 3 2 21



1

1

8

3 1 1 3 2 1 1 2 2 1 2 2 3 2 1 1 2 2 1 3 1 2 2

.

.

x

f

f

f

f

f

f

,

x

f

d

,

x

f

f

f

f

x

d

,

x

f

f

f

f

f

,

x

d

max

x

x

r

N N N N N N , N N N ,      

 

,

,



1

.

1

.

9

,

,

max

1 1 4 3 2 1 1 1 1 1 2 1 5 4 3 2 , 1 11 4 3 2 1 11 , 1

x

f

f

f

f

f

x

f

d

x

f

f

f

f

f

f

x

d

x

f

f

f

f

x

d

x

x

r

N N N N N N N N N N N

i)

(4)

iv)

f

N2,

f

N1

f

N

f

1

f

2

f

N3 has a unique fixed point

4

X

4 and so on for

,

X

5

5

6

X

6 and finally we obtain

f

2

f

3

f

4

f

5

f

N1

f

N

f

1 has a unique fixed point

N

X

N

.

Further

f

N

1

2

,

f

N1

2

3

,

f

N2

3

4

,

f

N3

4

5

,

f

1

N

1

Proof : Let us take x10 an element in

X

1 Now let us define the sequences

     

x

1n

,

x

2n

,

x

3n

 

x

Nn on the complete metric spaces

X

1

,

X

2

,

X

3

,

X

4

X

N

respectively and the sequences defined on

X

1

,

X

2

,

X

3

X

N as follows

1 2 3

10

1

f

f

f

f

x

x

n

N n - - - -(1.1.10)

n N

n n

N

n

f

x

,

x

f

,

x

x

2

1 1 3

1 3 - - - -(1.1.11)

n N

n

f

x

x

4

2 4 - - - -(1.1.12)

n N n

N

f

x

x

1 for all positive integer n First we take

1 3 3 1 2 2

1 1

1n

x

n

,

x

n

x

n

,

x

n

x

n

x

and

x

Nn

x

Nn1 and therefore we take -

2 1

2 3 1

3

3 3

2 2

1 1

 

n N n

N n

n

N n

N n

n n

x

x

x

x

x

,

x

,

x

,

x

Again we can put

N n

N n

n

n

,

x

,

x

,

x

x

1

1 2

2 3

3

if

x

2n

x

2n1

,

x

3n

x

3n1

,

x

Nn

x

Nn1

(5)

 

 

 

 



n n

 

n n

n n

n N n N N n n n n n n n n n n n n n n n n n n n N N n N N n n

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

d

,

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

x

,

x

x

f

f

f

f

f

,

x

f

f

f

f

f

d

x

,

x

d

3 3 3 1 2 2 2 2 2 2 1 1 2 2 2 4 1 4 4 1 2 2 2 3 1 3 3 1 2 2 2 1 1 1 1 1 2 2 2 1 3 2 2 1 3 2 2 1 1 3 2 1 1 3 2 3 2 1 2 1 2 2 2               

 



0

2

2 2 1

0

1 4 1 4 4 3 1 3 3 1 1 1 1 1 2 2 2

,

x

,

x

d

,

max

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

n n n N n N N n n n n n n n n      

 

1



1

1

13

4 1 4 4 3 1 3 3 1 1 1 1

.

.

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

n N n N N n n n n n n    

Again substituting

x

31

x

3n and

x

41

x

4n1 we obtain from the inequality (1.1.3)

3 3 1

3 1 3 3 3 2 2 3 3 2 1 1 1 3 3 3 2 1 1 3 1 3 3 3         

n n n n n N N N N n N N N n n

x

,

x

x

,

x

x

f

f

f

f

f

f

f

,

x

f

f

f

f

f

f

d

x

,

x

d

 

 

 

 

 

(6)

 

 



0

3

3 3 1

0

1

1 4 4 4 1 3 3 1 1 2 2 2 1 3 3 3

,

x

,

x

d

,

max

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

x

,

x

d

max

n n n N n N N

n n n

n n

n n

n

 

 

 

 

 



3 3 1

3 1

1 4 4 4 1 3 3 1 1 2 2 2 1 3 3 3

 

 

 

n n n

N n N N

n n

n n n

n n

n

x

,

x

d

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

2

2 21

 

1 1 11

 

4 4 41

1



max

d

x

n

,

x

n

,

d

x

n

,

x

n

,

d

x

n

,

x

n

d

N

x

Nn

,

x

N n

Again for

d

4

x

4n

,

x

4n1

we have,

 

 

1 1 1

1

1

1

14

1

1 1 1 1 1 2 2 2 1 3 3 3 1

4 4 4

.

.

x

,

x

d

,

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

d

n N n N N n

N n N N

n n n

n n

n n

n

 

 

 

 

 

1 4 1

1

1 1 1

1

1

1

15

1

1 2 2 2 1 3 3 3 1 4 4 4 1

5 5 5

.

.

x

,

x

d

,

x

,

x

d

,

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

d

n N n N N n

N n N N n n

n n n

n n

n n

n

 

 

 

 

continuing this process we obtain,

2 2 1

 

1 1 1 1



1

1

16

2

1 3 3

3 1

2 2

2 1

1 1

1

.

.

x

,

x

d

x

,

x

d

x

,

x

d

,

x

,

x

d

max

x

,

x

d

n n n

n

n N n N N n

N n N N n

N n N N

 

  

 

 

 

 

3 3 1

2

2 2 1

 

1 1 1 1

1

1

17

3

1 2 2

2 1

1 1

1 1

.

.

x

,

x

d

,

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

d

n n n

n n

N n N N

n N n N N n

N n N N n

N n N N

 

  

  

 

 

 

(7)

11 21

1

1 2 1 1 1

1 1 3

2 1 21 1 3

2 1 1 1

1 1 1

x

,

x

x

,

x

x

f

f

f

f

,

x

f

f

f

f

d

x

,

x

d

n n N n

 

 

 

 

 



 

 

n n n n n n

n N n N N n n n

n n

n

n n n

n n

n n

n

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

d

,

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

2 2 2 1 1 1 1 1 1 1

1 1

1 1 1 1

4 4 4 1 1 1 1

1 3 3 3 1 1 1 1 1 2 2 2 1 1 1 1

 

 

 

 

 

 



0

1

1 1 1

0

1

1 4 4 4 1 3 3 3 1 2 2 2 1 1 1 1

,

x

,

x

d

,

max

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

x

,

x

d

max

n n n N n N N

n n n

n n

n n

n

 

 

 

 

 

1



1

1

18

1 4 4 4 1 3 3 3 1 2 2 2

.

.

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

n N n N N

n n n

n n

n

 

Now using all inequality (1.1.1) we obtain

 

 

1 1 1

 

1



1

1

19

1

1 3 3 4 1 3 3 3 1 2 2 2 2

1 1 1 1

.

.

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

d

n N n N N n

N n N N

n n n

n n

n n

n

 

 

 

Similarly for the other inequality we have,

 

 

5 5 1

1



1

1

20

5

1 3 4 4 1 3 3 3 1 1 1

1 2

1 2 2 2

.

.

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

d

n N n N N n

n

n n n

n n

n n

n

 

 

 

(8)

 

 

5 5 1

1



1

1

21

5

1 4 4 4 1 2 2 2 1 1 1 1 2

1 3 3 3

.

.

x

,

x

d

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

d

n N n N N n

n

n n n

n n

n n

n

 

 

 

 

 

4 4 1

1

1 1 1



1

1

22

4

1 3 3 3 1 2 2 2 1 1 1 1 2

1

.

.

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

d

n N n N N n

n

n n n

n n

n n

N n N N

  

 

 

 

Now by induction, we obtain from the above inequality

 

1 2



1

1

23

2 3 1 3 3 2 2 1 2 2 12 1 1 1 1

1 1 1 1

.

.

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

d

N N N

n n

n

 

 

 

1 2



1

1

24

2 3 1 3 3 2 2 1 2 2 12 1 1 1 1

1 2 2 2

.

.

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

d

N N N

n n

n

 

1

11 12

 

2 21 22

1 2



1

1

25

1 1

3 3

3

x

,

x

max

d

x

,

x

,

d

x

,

x

d

x

,

x

.

.

d

N N N

n n

n

 

...

...

 

 

1 2



1

1

26

2 3 1 3 3 2 2 1 2 2 2 1 1 1 1 1

12 1 1 1

.

.

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

x

d

N N N n N

N N

 

 

 

1 12

 

1 2



1

1

27

1

2 3 1 3 3 2 2 1 2 2 2 1 1 1 1 1

2 1

.

.

x

,

x

d

x

,

x

d

,

x

,

x

d

,

x

,

x

d

,

x

,

x

d

max

x

,

x

d

N N N N

N N n

N N N

   

(9)

0

0

0

1 3 3

3

1 2 2

2

1 1 1

1

  

n n

n n

n n

x

,

x

d

x

,

x

d

x

,

x

d

... ... ...

0

0

1 1 1 1

1

   

n N n

N N

n N n

N N

x

,

x

d

x

,

x

d

i.e. The Sequences

       

x

1n

x

2n

x

3n

x

Nn are cauchy sequence. Since

X

1

d

1

 

,

X

2

d

2

 

,

X

3

d

3

X

N

d

N

are complete metric space. So we have

where

1

2

N

X

1

,

X

2

,

X

3

,

X

4

X

N respectively. Now substituting

n

x

x

11

1 and

x

21

2 we obtain,

1 2

1

2 1 1

1 3

2 1 2 1 3

2 1 1 1 1 2 1 3

2 1 1

,

x

,

x

x

f

f

f

f

,

f

f

f

f

d

x

,

f

f

f

f

d

n n

N N N

n

N

 

 

 



3 1 2 3

 

1 1 1 1

1 2 1 2



1

1 1 1 2 1 3

2 1 2

2 1 1 1 1

  

 

N n

N N n n n

N

n n N

N n

n

f

f

f

,

x

d

,

x

,

x

d

x

,

f

d

,

x

,

x

d

,

f

f

f

f

f

,

d

,

x

,

x

d

max

 

 

 

 

 

N n

N n

n n

N N

n N n

n n

n

n n

n

x

lim

x

;

x

lim

x

;

x

lim

x

;

x

lim

 

 

 

 

 

1 1

4 4

3 3

2 2

(10)

For

n

we get

d

1

f

1

f

2

f

3

f

4

f

N1

2

,

1

0

which is a contradiction and as

1 2 3 1 2 1

0

1

f

f

f

f

,

d

N Therefore

d

1

f

1

f

2

f

3

f

N1

2

,

1

0

1 2

1 3

2

1

f

f

f

f

N

Similarly we obtain that

2 3

2 3

2

1 N

N

f

f

f

f

f

3 4

3 2

1

1 

N N

N

f

f

f

f

f

4 5

4 2

1 1

2  

N N N

N

f

f

f

f

f

f

...

...

...

f

2

f

3

f

4

f

N1

f

N

1

N

Now we claim that,

1 is the fixed point of

f

1

f

2

f

3

f

N in

X

1

2

is the fixed point of

f

2

f

3

f

4

f

N

f

1 in

X

2

3

is the fixed point of

f

3

f

4

f

5

f

N

f

1

f

2 in

X

3

... ... ...

N is the fixed point of

f

N

f

N1

f

N2

f

2

f

1 in

X

N

Now let us take

x

21

x

2n and

x

31

f

N1

2 and substituting in (1.1.2) we obtain

N N N N n

n N

N

x

f

f

f

f

,

f

f

f

f

f

d

x

,

f

f

f

f

f

d

2 1 2

1 2

1 3 2 1 2

2 2 1 3

2 1 2

 

(11)

 



 

3 2 1 2 3 1 2



3

1 2 2 2 2 1 3

2 1 2

2

2 2 1 4

3 2

1 2 2 2 2

2 1 2

1 3

1 2 2 2 2

2 1 3

2 1 1 1 2 2

2

 

 

 

 

N N

N n

n n N

N n

n N

N

n n n

N N

n n n

N n

n

f

f

f

f

f

f

,

x

d

x

,

x

d

,

f

f

f

f

f

,

x

d

max

x

f

f

f

f

d

,

x

,

x

d

,

x

,

f

f

f

f

d

,

x

,

x

d

,

x

,

f

f

f

f

d

,

x

,

x

d

max

Now let

n

and put

f

1

f

2

f

3

f

N1

2

1 we obtain

 

1 1 3 3 2 1 2

1 2

3 2 1 3 2 1 2

1 2

2 2

2 1 2

1 2

 

 

N N N

N

N N

N N

N

f

f

,

d

,

f

f

f

f

d

max

,

f

d

,

f

f

f

f

,

d

,

f

f

f

f

d

Now

if,

max

 

d

2

2

,

f

N

f

1

f

2

f

N1

2

,

d

3

3

,

f

N1

f

N

1



2 1 2 1 2

2

d

,

f

N

f

f

f

N

Then we have

d

2

f

N

f

1

f

2

f

N1

2

,

2

d

2

f

N

1

,

2

 

 

 

 





1 1 3 3 2 1 2

1 2

2

3 2 1 3 2 1 2

1 2

2 2

2 1 2

1 2

 

 

N N N

N

N N

N N

N

f

f

,

d

,

f

f

f

f

,

d

max

,

f

d

,

f

f

f

f

,

d

max

,

f

f

f

f

d

d

3

f

N1

2

,

3

Again if

max

 

d

2

2

f

N

f

1

f

2

f

N1

2

,

d

3

3

,

f

N1

f

N

1

d

3 3

,

f

N1

f

N

Then similarly we have,

1 2 1 2 2

2

1 2

3

1 2 3

2

f

f

f

f

,

d

f

,

d

f

,

d

N

N N N

Again put

x

31

x

3n and

x

41

f

N3

3 we obtain,

1 1 2 3 2 3 3

4

2 3 3

3

f

f

f

f

f

f

,

d

f

,

d

N N

N N

References

Related documents

To further explore the role of PRP in the reg− ulation of innate response in Alzheimer’s disease patients, the release of IL−1 β , IL−6, IL−10, and TNF− α in

Мэдээлэл боловсруулалт ба үр дүн: Судалгаанд ажлын үнэт зүйлийг ажлын бодит байдал, хамт олны уур амьсгал, ажлын нийгэм дэх байр суурь, нэр хүнд, хувь хүний

DEA is a non-parametric approach for measuring relative efficiency that produces a single aggregate measure of relative efficiency among comparable units (called DMUs) that is

The anticancer potentiality of the purified pentasaccharide against both Human colon cancer (CaCo‑2) and Human breast cancer (MCF7) cell lines with its safety usage pattern

Determining cut-off values for neck circumference as a measure of the metabolic syndrome amongst a South African cohort: the SABPA study. Malan L, Hamer M, Frasure-Smith N,

Studies of adults using fMRI suggest that the experience of mal- treatment may be associated with hyperactivity of the amygdala in response to negative facial affect; such an effect

Asilids are often observed with mites on their bodies, in particular on the thorax. However, no mites were observed on the bodies of S. trifrasciatus ) of 10 species of robber flies