Fixed Point Thorem
Fixed Point Thorem
Entitled
BACHELOR OF SCIENCE
Submitted by
Anusha Sahu
Under the Guidance of
School of Science
OP Jindal University, Raigarh(C.G.)
June 2023
Certificate
This is to certify that the thesis work entitled “Fixed Point Theorem”, is a
bonafide work carried out by Anusha Sahu, in partial fulfillment of the
requirements for the award of the degree of Bachelor of Science in Physics from
OP Jindal University, Raigarh. This work is carried out under our supervision and
guidance of Prof. Shrikant Chaini during the academic year 2022-2023. The
results embedded in this report have not been submitted to any other university or
institute for the award of any other degree or diploma
.
Declaration
“I hereby declare that this submission is my own work and that, to the best of my
knowledge and belief, it contains no material previously published or written by
another person nor material which has been accepted for the award of any other
degree or diploma of the university or other institute of higher learning, except
where due acknowledgment has been made in the text."
Place: OPJU,Raigarh
Date Anusha Sahu
ACKNOWLEDGEMNET
This work would not have the spirit without the valuable academic, educational,
psychological and human support. So, I would like to acknowledge the support
of the people who made it possible. I would like to express the deepest
appreciation to my supervisor, Mr. Shrikant Chaini for guiding me into this
research field and for their constant help, encouragement, and endless support
on my research work. Their care and enlightenment strengthen every progress in
this work.
Place:OPJU,Raigarh
Date: 05/06/2021 Anusha Sahu
ABSTRACT
2.1Definition
2.2Example
2.3How to find Fixed point geographically
3.1 Definition
3.2 Example
3.3 Converse
3.4 Weak contraction
Chapter 7: References
Complete metric space-
A metric space M is said to be complete metric space if every Cauchy Sequence
in M is convergent and the point (on which the Cauchy sequence is convergent)
should lie in M.
1 if x≠y}
Cauchy sequence
A sequence <𝑋𝑛 > is said to be Cauchy sequence if given ∈ > 0 then ∋ a positive
number no s.t. |𝑋𝑚 − 𝑋𝑛 | < 𝜖
∀ n,m > 𝑛0
1
Example: Sequence <𝑋𝑛 > where 𝑋𝑛 = ∀ n 𝜖 N is a Cauchy sequence.
𝑛
Fixed point Theory-
Fixed point: definition
Let us consider ‘T’ a self mapping.So the points which remains unchanged after
going through the transformation ‘T’ is called a fixed point.
i.e. T:X→X (self map) where X is non empty set a point ‘p’is called fixed point
of a function ‘T’ if T(p)=p.
T(p) = p² defined on R. Then we will get two fixed point of 'T' because
If T(p) = 8+p. then there will be no point of domain that will be called as
a fixed point of T because no p will be equal to 8+p for any real number.
HOW TO FIND FIXED POINT GRAPHICALLY
Let us take ‘T’ as a function whose fixed point needs to be determined. so the
intersection of function T and diagonal line (y=x) gives us the required fixed
point.
i.e T(x)=x^3+4x²-3x-16
T(2)=8+16-6-16
=2
T(-2)=-8+16+6-16
=-2
T(-4)=-64+64+12-16
=-4
function intersect diagonal line at three points that are 2.-2 and -4.so we have 2.-
2 and-4 as its fixed point through graphically.
CONTRACTION MAPPING PRINCIPLE-
Banach’s Contraction Principle is a very important tool in theory of metric
spaces.It provides sufficient conditions for the existence of uniqueness of fixed
points of certain classes of self mapping.
It is a very important tool in solving the existence problems in pure and applied
sciences.
A self mapping ‘T’ from a metric space (X,d) to itself i.e. T: (X,d) →(X,d)
having a condition d(T(x),T(y))≤ 𝛼 d(x,y).
If
hence f is contraction on 𝑅2
Now,
𝑥 𝑥 1 1
d[f(x).f(y)] = d( , ) = d[ (𝑥1, 𝑦1 ), (𝑥2, 𝑦2 )]
4 4 4 4
𝑥 𝑦 𝑥 𝑦
= d[( 1 , 1) , ( 2 , 2)]
4 4 4 4
𝑥1 𝑥2 2 𝑦 𝑦2 2
=√ ( − ) + ( 41 − )
4 4 4
1
= √(𝑥1 − 𝑥2 )2 + (𝑦1 − 𝑦2 )2
4
1
= d(x,y)
4
1
d[f(x),f(y)] = d(x,y)
4
1
Hence. d[ f(x),f(y)]≤ 𝛼d(x,y) where =𝛼 <1
4
Assume we are given a set Y and a map C:Y→Y. We are interested to find a
metric d on Y such that (Y,d) is a complete metric space and C is a contraction
on Y.
Definition:
Example :Consider the complete metric space X = [1,+∞), and let f:X →X be
defined as
f(x) = x + 1/x.
case 1- if T(p) =p and T(q)=q,then result is true and there is nothing to prove
Case2- if T(p)≠p and T(q) ≠q for all c belongs to [p,q] Therefore, p<T(p) and
T(q)<q
Since S(p)=T(p)-p>0
S(q)=T(q)-q<0
S(p)>0>S(q)
S(c)=0
T(c)-c=0
T(c)=c
.
STATEMENT: Every contraction mapping “T” defined on complete metric
space (X,d), has a fixed point i.e. x ∈ X s.t. T(x)=x.
we have,
Similarly, for n
Define 𝑥1 = T(𝑥0 )
…………
……………
……………………
𝑥𝑛 = T(𝑥𝑛−1 ) =𝑇 𝑛 (𝑥0 )
………………..(3)
next we prove that <𝑥𝑛 > is cauchy sequence
let m,n be any positive integer s.t. n>m and let n=m+p
then,
So, ∃𝑥 ∈ 𝑋
s.t. 𝑥𝑛 →→ 𝑥 𝑎𝑠 𝑛 → ∞
d( 𝑥𝑛 , 𝑥) → 0 𝑎𝑠 𝑛 → ∞
Suppose that ‘x’ and ‘y’ are the two fixed point of T
T(x)=x
T(y)=y
(1-𝛼) d(x,y) ≤0
But 0 ≤a <1
→ 1-𝛼>0
⇒x=y
Hence proved
Then B has a unique fixed point ‘z’∈ 𝑋. Moreover, for any 𝑥0 ∈ 𝑋 the sequence
𝐵𝑛 𝑥0 converges to ‘z’.
In simple words. Boyd-Wong replaced 𝛼 by the right continuous function 𝜑
Caristi's theorem
The Caristi fixed-point theorem (also known as the Caristi-Kirk fixed-point
theorem) generalizes the Banach fixed-point theorem for maps of a complete
metric space into itself.
Let X be a complete metric space, and let C: X → X. Suppose a lower semi
continuous function : 𝜑 [0, ∞)
𝑑(𝑥,𝐶(𝑥))
Remark: Banach space is a particular case, obtained for 𝜑(x) =( )
1−λ
(C need not be continuous).
To understand the situation, we first remember that for solving such a system
there are various direct methods (methods that would yield the exact solution
after finitely many arithmetical operations if the precision-the word length of
our computer-were unlimited);a familiar example is Gauss' elimination method
(roughly, a systematic version of the elimination taught in school). However, an
iteration, or indirect method, may be more efficient if the system is special, for
instance, if it is sparse, that is, if it consists of many equations but has only a
small number of nonzero coefficients. (Vibrational problems, networks and
difference approximations of partial differential equations often lead to sparse
systems.) Moreover, the usual direct methods require about n³/3 arithmetical
operations (n = number of equations = number of unknowns), and for large n,
rounding errors may become quite large, whereas in an iteration, errors due to
roundoff (or even blunders) may be damped out eventually. In fact, iteration
methods are frequently used to improve "solutions" obtained by direct methods.
We shall use Banach's theorem to prove the famous Picard's theorem which,
while not the strongest of its type that is known, plays a vital role in the theory
of ordinary differential equations. The idea of approach is quite simple: (1) will
be converted to an integral equation, which defines a mappingT, and the
conditions of the theorem will imply that T is a contraction such that its fixed
point becomes the solution of our problem.
R={(t, x) |𝑡 − 𝑡0 | ≤ 𝑎, |𝑥 − 𝑥0 | ≤ 𝑏}
We finally consider the Banach fixed point theorem as a source of existence and
uniqueness theorems for integral equations. An integral equation of the form
𝑏
𝑢(𝑥) = ℎ(𝑥) + λ ∫ 𝑘(𝑥, 𝑦)𝑢(𝑦)𝑑𝑦
𝑎
is called a Fredholm equation of the second kind. Here, [a, b] is a given interval.
𝑢 is a function on [a, b] which is unknown. λ is a parameter. The kernel 𝑘 of the
equation is a given function on the square G =[a, b]x[a, b] shown in Fig, and v
is a given function on [a, b].
The presence of the term x(t) enables us to apply iteration, as Theorem shows.
An equation without that term is of the form
𝑏
∫ 𝑘(𝑥, 𝑦)𝑢(𝑦)𝑑𝑦 = ℎ(𝑥)
𝑎