The Convex (\delta,L) Weak Contraction Mapping Theorem and its Non-Self Counterpart in Graphic Language

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixed point theorem for non-self mappings and its applications in the modular ‎space

‎In this paper, based on [A. Razani, V. Rako$check{c}$evi$acute{c}$ and Z. Goodarzi, Nonself mappings in modular spaces and common fixed point theorems, Cent. Eur. J. Math. 2 (2010) 357-366.] a fixed point theorem for non-self contraction mapping $T$ in the modular space $X_rho$ is presented. Moreover, we study a new version of Krasnoseleskii's fixed point theorem for $S+T$, where $T$ is a cont...

متن کامل

The Contraction Mapping Theorem

A mapping f : X → X from a set X to itself has a fixed point if there is an x ∈ X such that f(x) = x. The simplest fixed point theorem is that a continuous function f : [a, b] → [a, b] has at least one fixed point. This is a consequence of the intermediate value theorem from calculus, as follows. Since f(a) ≥ a and f(b) ≤ b, we have f(b) − b ≤ 0 ≤ f(a) − a. The difference f(x)−x is continuous, ...

متن کامل

achievement in foreign language learning contex the impacts of teachers self-disclosure on students anxiety, attitude and achievement in fireign language learning context

this study was designed to investigate the impacts of teachers self-disclosure on students foreign language classroom anxiety, attitude to english language learning and their achievement scores at the end of the term. there were 48 female learners of intermediate level. they were not randomly selected. there were one experimental group with 21 students and one control group with 27 students.the...

The Contraction Mapping Theorem and the Implicit Function Theorem

denote the open ball of radius a centred on the origin in IR. If the function ~g : Ba → IR d obeys there is a constant G < 1 such that ‖~g(~x)− ~g(~y)‖ ≤ G ‖~x− ~y‖ for all ~x, ~y ∈ Ba (H1) ‖~g(~0)‖ < (1−G)a (H2) then the equation ~x = ~g(~x) has exactly one solution. Discussion of hypothesis (H1): Hypothesis (H1) is responsible for the word “Contraction” in the name of the theorem. Because G <...

متن کامل

A Stochastic Contraction Mapping Theorem

The submartingale convergence theorem is often described as a stochastic analogue to the bounded convergence theorem for monotone sequences of real numbers. We define an alternative process which is a stochastic analogue to an iterative contraction process. A general convergence theorem is presented, with an extension to multivariate processes. The convergence theorem functions in a manner simi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Earthline Journal of Mathematical Sciences

سال: 2019

ISSN: 2581-8147

DOI: 10.34198/ejms.1219.157169