Posts by Mira Anisiu

Abstract

Authors

Mira-Cristiana Anisiu
Institute of Mathematics, Cluj-Napoca, Romania

Keywords

?

Paper coordinates

M.-C. Anisiu, On fixed point theorems for mappings defined on spheres in metric spaces, Seminar on Mathematical Analysis, 1-6, Preprint, 91-7, Univ. Babeş-Bolyai Cluj-Napoca, 1991

PDF

About this paper

Journal
Publisher Name
DOI
Print ISSN
Online ISSN

google scholar link

[1] J. Lopez-Gomez, |A fixed point therem for discontinuous operators, Glasnik Mat. 23 (1988) , 115-118
[2] L. Nova, G., Fixed point theorems for some discontinuous operators, Pacific, J. Math. 123 (1983), 189-196.
[3] I.A. Rus, Metrical fixed point theorems, University of Cluj-Napoca, Department of Mathematics, 1979 (mineographed)

1991-Anisiu-On fixed point html,body { width: 100%; height: 100%; } *, *::before,*::after { box-sizing: border-box; } body { margin: 0; color: #1E2029; font-size: 14px; line-height: normal; } hr { box-sizing: content-box; height: 0; overflow: visible; } h1, h2, h3, h4, h5, h6 { margin-top: 0; margin-bottom: 0.5em; color: rgba(0, 0, 0, 0.85); font-weight: 500; } p { margin-top: 0; margin-bottom: 1em; } ol, ul, dl { margin-top: 0; margin-bottom: 1em; } ol ol, ul ul, ol ul, ul ol { margin-bottom: 0; } dt { font-weight: 500; } dd { margin-bottom: 0.5em; margin-left: 0; } blockquote { margin: 0 0 1em; } dfn { font-style: italic; } b, strong { font-weight: bolder; } small { font-size: 80%; } sub, sup { position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } sub { bottom: -0.25em; } sup { top: -0.5em; } a { color: #0B93ff; text-decoration: none; background-color: transparent; outline: none; cursor: pointer; transition: color 0.3s; } a:hover { color: #33aaff; } a:active { color: #0070d9; } a:active, a:hover { text-decoration: none; outline: 0; } a[disabled] { color: rgba(0, 0, 0, 0.25); cursor: not-allowed; pointer-events: none; } pre, code, kbd, samp { font-size: 1em; } pre { margin-top: 0; margin-bottom: 1em; overflow: auto; } figure { margin: 0 0 1em; } img { vertical-align: middle; border-style: none; } svg:not(:root) { overflow: hidden; } table { border-collapse: collapse; } caption { padding-top: 0.75em; padding-bottom: 0.3em; color: rgba(0, 0, 0, 0.45); text-align: left; caption-side: bottom; } th { text-align: inherit; } mjx-container[jax="SVG"] { direction: ltr; } mjx-container[jax="SVG"] > svg { overflow: visible; min-height: 1px; min-width: 1px; } mjx-container[jax="SVG"] > svg a { fill: blue; stroke: blue; } mjx-assistive-mml { position: absolute !important; top: 0px; left: 0px; clip: rect(1px, 1px, 1px, 1px); padding: 1px 0px 0px 0px !important; border: 0px !important; display: block !important; width: auto !important; overflow: hidden !important; -webkit-touch-callout: none; -webkit-user-select: none; -khtml-user-select: none; -moz-user-select: none; -ms-user-select: none; user-select: none; } mjx-assistive-mml[display="block"] { width: 100% !important; } mjx-container[jax="SVG"][display="true"] { display: block; text-align: center; margin: 1em 0; } mjx-container[jax="SVG"][display="true"][width="full"] { display: flex; } mjx-container[jax="SVG"][justify="left"] { text-align: left; } mjx-container[jax="SVG"][justify="right"] { text-align: right; } g[data-mml-node="merror"] > g { fill: red; stroke: red; } g[data-mml-node="merror"] > rect[data-background] { fill: yellow; stroke: none; } g[data-mml-node="mtable"] > line[data-line], svg[data-table] > g > line[data-line] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > rect[data-frame], svg[data-table] > g > rect[data-frame] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > .mjx-dashed, svg[data-table] > g > .mjx-dashed { stroke-dasharray: 140; } g[data-mml-node="mtable"] > .mjx-dotted, svg[data-table] > g > .mjx-dotted { stroke-linecap: round; stroke-dasharray: 0,140; } g[data-mml-node="mtable"] > g > svg { overflow: visible; } [jax="SVG"] mjx-tool { display: inline-block; position: relative; width: 0; height: 0; } [jax="SVG"] mjx-tool > mjx-tip { position: absolute; top: 0; left: 0; } mjx-tool > mjx-tip { display: inline-block; padding: .2em; border: 1px solid #888; font-size: 70%; background-color: #F8F8F8; color: black; box-shadow: 2px 2px 5px #AAAAAA; } g[data-mml-node="maction"][data-toggle] { cursor: pointer; } mjx-status { display: block; position: fixed; left: 1em; bottom: 1em; min-width: 25%; padding: .2em .4em; border: 1px solid #888; font-size: 90%; background-color: #F8F8F8; color: black; } foreignObject[data-mjx-xml] { font-family: initial; line-height: normal; overflow: visible; } mjx-container[jax="SVG"] path[data-c], mjx-container[jax="SVG"] use[data-c] { stroke-width: 3; } #setText > div { justify-content: inherit; margin-top: 0; margin-bottom: 1em; } #setText div:last-child { margin-bottom: 0 !important; } #setText > br, #preview-content br { line-height: 1.2; } #preview-content > div { margin-top: 0; margin-bottom: 1em; } .proof > div, .theorem > div { margin-top: 1rem; } #preview-content table { margin-bottom: 1em; } #setText table { margin-bottom: 1em; } #preview-content .sub-table table, #setText .sub-table table { margin-bottom: 0; } mjx-container { text-indent: 0; overflow-y: hidden; overflow-x: auto; padding-top: 1px; padding-bottom: 1px; } .math-inline mjx-container { display: inline-block !important; page-break-inside: avoid; max-width: 100%; padding: 0; line-height: 0; } .math-inline[data-overflow="visible"] mjx-container { overflow: visible; } .math-inline mjx-container mjx-assistive-mml { max-width: 100%; } .math-block { align-items: center; page-break-after: auto; page-break-inside: avoid; margin: 0; display: block; /* mjx-container has block */ } .math-inline { display: inline-flex; /* mjx-container has inline-block. To prevent displacement during use overflow-x: auto;*/ max-width: 100%; } .math-block[data-width="full"] { overflow-x: auto; display: flex; /* mjx-container has flex */ } svg .math-inline { display: initial; max-width: initial; } svg .math-inline mjx-container { max-width: initial; } svg mjx-container { overflow: visible; padding: 0; } svg math-block[data-width="full"] { overflow: visible; } .math-block,.math-inline { --mmd-highlight-color: rgba(0, 147, 255, 0.25); --mmd-highlight-text-color: #1e2029; } .math-block[data-highlight-color] mjx-container[jax="SVG"] > svg { background-color: var(--mmd-highlight-color); } .math-block[data-highlight-text-color] mjx-container[jax="SVG"] > svg { color: var(--mmd-highlight-text-color); } .math-inline[data-highlight-color] mjx-container[jax="SVG"] { background-color: var(--mmd-highlight-color); } .math-inline[data-highlight-text-color] mjx-container[jax="SVG"] { color: var(--mmd-highlight-text-color); } .math-block p { flex-shrink: 1; } .math-block mjx-container { margin: 0 !important; } .math-error { background-color: yellow; color: red; } #preview-content img, #setText img { max-width: 100%; } #preview-content blockquote, #setText blockquote { page-break-inside: avoid; color: #666; margin: 0 0 1em 0; padding-left: 3em; border-left: .5em solid #eee; } #preview-content pre, #setText pre { border: none; padding: 0; overflow: auto; font-size: 85%; line-height: 1.45; border-radius: 6px; box-sizing: border-box; background: #f8f8fa; } #preview-content pre code, #setText pre code{ padding: 1rem; display: block; overflow-x: auto; line-height: 24px; } .empty { text-align: center; font-size: 18px; padding: 50px 0 !important; } #setText table, #preview-content table { display: table; overflow: auto; max-width: 100%; border-collapse: collapse; page-break-inside: avoid; } #setText table th, #preview-content table th { text-align: center; font-weight: bold; } #setText table td, #preview-content table td, #setText table th, #preview-content table th { border: 1px solid #dfe2e5; padding: 6px 13px; } #setText table tr, #preview-content table tr { background-color: #fff; border-top: 1px solid #c6cbd1; } #setText table tr:nth-child(2n), #preview-content table tr:nth-child(2n) { background-color: #f6f8fa; } #preview-content .main-title, #setText .main-title { text-align: center; line-height: 1.2; margin: 0 auto 1em auto; } #preview-content .author, #setText .author { text-align: center; margin: 0 auto; display: flex; justify-content: center; flex-wrap: wrap; } #preview-content .author p, #setText .author p { min-width: 30%; max-width: 50%; padding: 0 7px; } #preview-content .author > p > span, #setText .author > p > span { display: block; text-align: center; } #preview-content .section-title, #setText .section-title { margin-top: 1.5em; } #preview-content .abstract, #setText .abstract { text-align: justify; margin-bottom: 1em; } #preview-content .abstract p, #setText .abstract p { margin-bottom: 0; } @media print { #preview { font-size: 10pt!important; } svg { shape-rendering: crispEdges; } .math-block svg, math-inline svg { margin-top: 1px; } #preview-content img, #setText img { display: block; } #preview-content .figure_img img, #setText .figure_img img { display: inline; } .preview-right { word-break: break-word; } #preview-content h1, #setText h1 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h1::after, #setText h1::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h2, #setText h2 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h2::after, #setText h2::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h3, #setText h3 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h3::after, #setText h3::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h4, #setText h4 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h4::after, #setText h4::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h5, #setText h5 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h5::after, #setText h5::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h6, #setText h6 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h6::after, #setText h6::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } } #preview-content sup, #setText sup { top: -.5em; position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } #preview-content .text-url, #setText .text-url { color: #0B93ff; cursor: text; pointer-events: none; } #preview-content .text-url a:hover, #setText .text-url a:hover { color: #0B93ff; } mark { background-color: #feffe6; } span[data-underline-type] mark { background: inherit; background-color: #feffe6; padding-top: 0; padding-bottom: 0; } *[data-has-dotfill] { position: relative; overflow: hidden; } *[data-has-dotfill] .dotfill::after { position: absolute; padding-left: .25ch; content: " . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . "; text-align: right; } .smiles { text-align: center; } div.svg-container, #setText > div.svg-container { display: flex; justify-content: center; } #preview-content code, #setText code { font-family: Inconsolata; font-size: inherit; display: initial; background: #f8f8fa; } #preview-content .mmd-highlight code, #setText .mmd-highlight code, #preview-content pre.mmd-highlight code, #setText pre.mmd-highlight code { background-color: transparent; } #preview-content pre code, #setText pre code { font-family: 'DM Mono', Inconsolata, monospace; color: #333; font-size: 15px; } .hljs-comment, .hljs-quote { color: #998; font-style: italic; } .hljs-command { color: #005cc5; } .hljs-keyword, .hljs-selector-tag, .hljs-subst { color: #d73a49; font-weight: bold; } .hljs-number, .hljs-literal, .hljs-variable, .hljs-template-variable, .hljs-tag .hljs-attr { color: #005cc5; } .hljs-string, .hljs-doctag { color: #24292e; } .hljs-title, .hljs-section, .hljs-selector-id { color: #6f42c1; font-weight: bold; } .hljs-subst { font-weight: normal; } .hljs-type, .hljs-class .hljs-title { color: #458; font-weight: bold; } .hljs-tag, .hljs-name, .hljs-attribute { color: #000080; font-weight: normal; } .hljs-regexp, .hljs-link { color: #009926; } .hljs-symbol, .hljs-bullet { color: #990073; } .hljs-built_in, .hljs-builtin-name { color: #24292e; } .hljs-meta { color: #999; font-weight: bold; } .hljs-meta-keyword { color: #d73a49; } .hljs-meta-string { color: #032f62; } .hljs-deletion { background: #fdd; } .hljs-addition { background: #dfd; } .hljs-emphasis { font-style: italic; } .hljs-strong { font-weight: bold; } .table_tabular table th, .table_tabular table th { border: none !important; padding: 6px 13px; } .tabular tr, .tabular tr { border-top: none !important; border-bottom: none !important; } .tabular td, .tabular td { border-style: none !important; background-color: #fff; border-color: #000 !important; word-break: keep-all; padding: 0.1em 0.5em !important; } .tabular { display: inline-table !important; height: fit-content; } .tabular td > p { margin-bottom: 0; margin-top: 0; } .tabular td._empty { height: 1.3em; } .tabular td .f { opacity: 0; } html[data-theme="dark"] .tabular tr, html[data-theme="dark"] .tabular td { background-color: #202226; border-color: #fff !important; } .table_tabular { overflow-x: auto; padding: 0 2px 0.5em 2px; } .figure_img { margin-bottom: 0.5em; overflow-x: auto; } ol.enumerate, ul.itemize { padding-inline-start: 40px; } /* It's commented because counter not supporting to change value ol.enumerate.lower-alpha { counter-reset: item ; list-style-type: none !important; } .enumerate.lower-alpha > li { position: relative; } .enumerate.lower-alpha > li:before { content: "("counter(item, lower-alpha)")"; counter-increment: item; position: absolute; left: -47px; width: 47px; display: flex; justify-content: flex-end; padding-right: 7px; flex-wrap: nowrap; word-break: keep-all; } */ .itemize > li { position: relative; } .itemize > li > span.li_level, .li_enumerate.not_number > span.li_level { position: absolute; right: 100%; white-space: nowrap; width: max-content;; display: flex; justify-content: flex-end; padding-right: 10px; box-sizing: border-box; } .li_enumerate.not_number { position: relative; display: inline-block; list-style-type: none; } #preview { font-family: 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; font-size: 17px; visibility: visible; word-break: break-word; padding: 2.5em; max-width: 800px; margin: auto; box-sizing: content-box; } #preview h1, #preview h2, #preview h3, #preview h4, #preview h5, #preview strong { font-family: 'CMU Serif Bold', 'Georgia', Helvetica, Arial, sans-serif; } #preview i, #preview em { font-family: 'CMU Serif Italic', 'Georgia', Helvetica, Arial, sans-serif; } .mmd-menu { max-width: 320px; position: absolute; background-color: white; color: black; width: auto; padding: 5px 0px; border: 1px solid #E5E6EB; margin: 0; cursor: default; font: menu; text-align: left; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; z-index: 201; border-radius: 5px; -webkit-border-radius: 5px; -moz-border-radius: 5px; -khtml-border-radius: 5px; box-shadow: 0px 10px 20px #808080; -webkit-box-shadow: 0px 10px 20px #808080; -moz-box-shadow: 0px 10px 20px #808080; -khtml-box-shadow: 0px 10px 20px #808080; } .mmd-menu:focus { outline: none; } .mmd-menu.mmd-menu-sm { max-width: 100vw; padding-bottom: 34px; border-radius: 0; -webkit-border-radius: 0; -moz-border-radius: 0; -khtml-border-radius: 0; } .mmd-menu-item-icon { color: #1e2029; margin-left: auto; align-items: center; display: flex; flex-shrink: 0; display: none; } .mmd-menu-item { padding-bottom: 8px; padding-top: 8px; padding-left: 1.25rem; padding-right: 1.25rem; display: flex; background: transparent; height: 52px; max-height: 52px; } .mmd-menu-item:focus { outline: none; } .mmd-menu-item.active { background-color: #e1e0e5; } .mmd-menu-item.active .mmd-menu-item-icon { display: flex; } .mmd-menu-item-container { overflow: hidden; } .mmd-menu-item-title { color: #1e2029; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 14px; line-height: 20px; } .mmd-menu-item-value { color: #7d829c; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 12px; line-height: 16px; } html[data-theme="dark"] .mmd-menu-item-title { color: #ebefe7; } html[data-theme="dark"] .mmd-menu-item.active .mmd-menu-item-title { color: #1e2029; } html[data-theme="dark"] .mmd-menu { background-color: #33363a; } .mmd-context-menu-overlay{ background: rgba(0, 0, 0, 0.56); } .ClipboardButton { padding: 0; margin: 0.5rem; display: inline-block; cursor: pointer; color: rgb(36, 41, 47); background: rgb(246, 248, 250); border-radius: 6px; border: 1px solid rgba(31, 35, 40, 0.15); box-shadow: rgba(31, 35, 40, 0.04) 0 1px 0 0, rgba(255, 255, 255, 0.25) 0 1px 0 0 inset; position: relative; } .ClipboardButton:hover { background-color: rgb(243, 244, 246); border-color: rgba(31, 35, 40, 0.15); transition-duration: .1s; } .mmd-clipboard-icon { fill: currentColor; vertical-align: text-bottom; } .mmd-clipboard-copy-icon { color: rgb(101, 109, 118); } .mmd-clipboard-check-icon { color: rgb(26, 127, 55); } .mmd-tooltipped-no-delay:hover::before, .mmd-tooltipped-no-delay:hover::after { animation-delay: 0s; } .mmd-tooltipped:hover::before, .mmd-tooltipped:hover::after { display: inline-block; text-decoration: none; animation-name: tooltip-appear; animation-duration: .1s; animation-fill-mode: forwards; animation-timing-function: ease-in; animation-delay: .4s; } .mmd-tooltipped-w::before { top: 50%; bottom: 50%; left: -7px; margin-top: -6px; border-left-color: rgb(36, 41, 47); } .mmd-tooltipped::before { position: absolute; z-index: 1000001; display: none; width: 0; height: 0; color: rgb(36, 41, 47); pointer-events: none; content: ""; border: 6px solid transparent; opacity: 0; } .mmd-tooltipped-w::after { right: 100%; bottom: 50%; margin-right: 6px; transform: translateY(50%); } .mmd-tooltipped::after { position: absolute; z-index: 1000000; display: none; padding: 0.5em 0.75em; font: normal normal 11px/1.5 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; -webkit-font-smoothing: subpixel-antialiased; color: rgb(255, 255, 255); text-align: center; text-decoration: none; text-shadow: none; text-transform: none; letter-spacing: normal; word-wrap: break-word; white-space: pre; pointer-events: none; content: attr(aria-label); background: rgb(36, 41, 47); border-radius: 6px; opacity: 0; }
"BABEŞ -- BOLYAI" UNIVERSITY
Faculty of Mathematics
Re search Seminars
Seminar on Mathematical Analysis
Preprint Nr.7, 1991, pp.95 - 100

ON FIXED POINT THEOREMS FOR MAPPINGS DEFINED ON BPHERES IN NETRIC SPACES

Mira-Cristina Anisiu

In the last years, the interest in metric fixed point theorems appeared again. New proofs were given [1, 2] for theorems of Hardy-Rogers, Ćirić - Reich - Rus.
In this note we study the case of mappings defined only on spheres, not on the entire metric space, following the well-known theorem:
THEOREM 1. Let ( X , d X , d X,d\mathrm{X}, \mathrm{d}X,d ) be a complete metric space, f : B ― ( 2 , r ) → X f : B ¯ ( 2 , r ) → X f: bar(B)(2,r)rarr X\mathrm{f}: \overline{\mathrm{B}}(2, \mathrm{r}) \rightarrow Xf:B―(2,r)→X a k k kkk-contraction, k ∈ [ 0 , 1 ) k ∈ [ 0 , 1 ) k in[0,1)k \in[0,1)k∈[0,1), i.e.
(1) d ( f x , f y ) ≤ k d ( x , y ) for all x , y in B ¯ ( z , r ) = = { x ∈ X : d ( x , z ) ≤ r } . (1) d ( f x , f y ) ≤ k d ( x , y )  for all  x , y  in  B ¯ ( z , r ) = = { x ∈ X : d ( x , z ) ≤ r } . {:[(1)d(fx","fy) <= kd(x","y)" for all "x","y" in " bar(B)(z","r)=],[={x in X:d(x","z) <= r}.]:}\begin{align*} & d(f x, f y) \leq k d(x, y) \text { for all } x, y \text { in } \bar{B}(z, r)= \tag{1}\\ & =\{x \in X: d(x, z) \leq r\} . \end{align*}(1)d(fx,fy)≤kd(x,y) for all x,y in B¯(z,r)=={x∈X:d(x,z)≤r}.
If
(2) d ( z , f z ) ≤ Γ ( 1 − k ) , (2) d ( z , f z ) ≤ Γ ( 1 − k ) , {:(2)d(z","fz) <= Gamma(1-k)",":}\begin{equation*} d(z, f z) \leq \Gamma(1-k), \tag{2} \end{equation*}(2)d(z,fz)≤Γ(1−k),
then f f fff has a unique fixed point u ∈ B ¯ ( z , r ) u ∈ B ¯ ( z , r ) u in bar(B)(z,r)u \in \bar{B}(z, r)u∈B¯(z,r).
Proof. The condition on f z f z fzf zfz implies the fact that f ( B ¯ ( z , r ) ) = B ¯ ( z , r ) f ( B ¯ ( z , r ) ) = B ¯ ( z , r ) f( bar(B)(z,r))= bar(B)(z,r)f(\bar{B}(z, r)) =\bar{B}(z, r)f(B¯(z,r))=B¯(z,r). Indeed, let x ∈ B ¯ ( z , r ) x ∈ B ¯ ( z , r ) x in bar(B)(z,r)x \in \bar{B}(z, r)x∈B¯(z,r). We estimate d ( z , f x ) d ( z , f x ) d(z,fx)d(z, f x)d(z,fx) :
d ( z , f x ) ≤ d ( z , f z ) + d ( f z , f x ) ≤ r ( 1 − k ) + k d ( z , x ˙ ) ≤ r . d ( z , f x ) ≤ d ( z , f z ) + d ( f z , f x ) ≤ r ( 1 − k ) + k d ( z , x ˙ ) ≤ r . d(z,fx) <= d(z,fz)+d(fz,fx) <= r(1-k)+kd(z,x^(˙)) <= r.d(z, f x) \leq d(z, f z)+d(f z, f x) \leq r(1-k)+k d(z, \dot{x}) \leq r .d(z,fx)≤d(z,fz)+d(fz,fx)≤r(1−k)+kd(z,x˙)≤r.
It follows that f ( B ¯ ( z , x ) ) ⊆ B ¯ ( z , r ) f ( B ¯ ( z , x ) ) ⊆ B ¯ ( z , r ) f( bar(B)(z,x))sube bar(B)(z,r)f(\bar{B}(z, x)) \subseteq \bar{B}(z, r)f(B¯(z,x))⊆B¯(z,r) and Banach theorem applies in this complete metric space.
This theorem extends easily to Hardy - Rogers contractions.
THEOREM 2. Let ( X , d X , d X,dX, dX,d ) be a complete metric space, f : B ¯ ( z , r ) → X f : B ¯ ( z , r ) → X f: bar(B)(z,r)rarr X\mathbf{f}: \bar{B}(\mathbf{z}, \mathbf{r}) \rightarrow Xf:B¯(z,r)→X a Hardy - Rogers contraction, i.e. there exists a i ≥ 0 a i ≥ 0 a_(i) >= 0a_{i} \geq 0ai≥0, i = 1 , 5 ― , A = ∑ i = 1 5 a i < 1 i = 1 , 5 ¯ , A = ∑ i = 1 5   a i < 1 i= bar(1,5),A=sum_(i=1)^(5)a_(i) < 1i=\overline{1,5}, A=\sum_{i=1}^{5} a_{i}<1i=1,5―,A=∑i=15ai<1 such that
(3) d ( f x , f y ) ≤ a 1 d ( x , y ) + a 2 d ( x , f x ) + a 3 d ( y , f y ) + a 4 d ( x y , f y ) + + a 5 d ( y , f x ) d ( f x , f y ) ≤ a 1 d ( x , y ) + a 2 d ( x , f x ) + a 3 d ( y , f y ) + a 4 d x y , f y + + a 5 d ( y , f x ) d(fx,fy) <= a_(1)d(x,y)+a_(2)d(x,fx)+a_(3)d(y,fy)+a_(4)d(x_(y),fy)++a_(5)d(y,fx)d(f x, f y) \leq a_{1} d(x, y)+a_{2} d(x, f x)+a_{3} d(y, f y)+a_{4} d\left(x_{y}, f y\right)+ +a_{5} d(y, f x)d(fx,fy)≤a1d(x,y)+a2d(x,fx)+a3d(y,fy)+a4d(xy,fy)++a5d(y,fx) for all x , y x , y x,yx, yx,y in B ¯ ( z , r ) B ¯ ( z , r ) bar(B)(z,r)\bar{B}(z, r)B¯(z,r).
If
(4) d ( z , f z ) ≤ 2 ( 1 − A ) 2 + A − a 1 r d ( z , f z ) ≤ 2 ( 1 − A ) 2 + A − a 1 r d(z,fz) <= (2(1-A))/(2+A-a_(1))rd(z, f z) \leq \frac{2(1-A)}{2+A-a_{1}} rd(z,fz)≤2(1−A)2+A−a1r,
then f f fff has a unique fixed point u ∈ B ¯ ( 2 , r ) u ∈ B ¯ ( 2 , r ) u in bar(B)(2,r)u \in \bar{B}(2, r)u∈B¯(2,r).
Proof. To prove that f ( B ¯ ( z , r ) ) ⊂ B ¯ ( z , r ) f ( B ¯ ( z , r ) ) ⊂ B ¯ ( z , r ) f( bar(B)(z,r))sub bar(B)(z,r)f(\bar{B}(z, r)) \subset \bar{B}(z, r)f(B¯(z,r))⊂B¯(z,r), we use a symmetric form of (3) which is obtained evaluating also d ( f y , f x ) d ( f y , f x ) d(fy,fx)d(f y, f x)d(fy,fx) and adding,
(5) d ( f x , f y ) ≤ a 1 d ( x y ) + a 2 + a 3 2 [ d ( x , f x ) + d ( y , f y ) ] + d ( f x , f y ) ≤ a 1 d ( x y ) + a 2 + a 3 2 [ d ( x , f x ) + d ( y , f y ) ] + d(fx,fy) <= a_(1)d(xy)+(a_(2)+a_(3))/(2)[d(x,fx)+d(y,fy)]+d(f x, f y) \leq a_{1} d(x y)+\frac{a_{2}+a_{3}}{2}[d(x, f x)+d(y, f y)]+d(fx,fy)≤a1d(xy)+a2+a32[d(x,fx)+d(y,fy)]+
+ a 4 + a 5 2 [ d ( x , f y ) + d ( y , f x ) ] for each x , y in + a 4 + a 5 2 [ d ( x , f y ) + d ( y , f x ) ]  for each  x , y  in  +(a_(4)+a_(5))/(2)[d(x,fy)+d(y,fx)]" for each "x,y" in "+\frac{a_{4}+a_{5}}{2}[d(x, f y)+d(y, f x)] \text { for each } x, y \text { in }+a4+a52[d(x,fy)+d(y,fx)] for each x,y in 
B ¯ ( z , I ) B ¯ ( z , I ) bar(B)(z,I)\bar{B}(z, I)B¯(z,I).
Let x x xxx be in B ¯ ( z , r ) B ¯ ( z , r ) bar(B)(z,r)\bar{B}(z, r)B¯(z,r), hence d ( x , z ) ≤ r d ( x , z ) ≤ r d(x,z) <= rd(x, z) \leq rd(x,z)≤r. We estimate
d ( z , f x ) ≤ d ( z , f z ) + d ( f z , f x ) ≤ ≤ d ( z , f z ) + a 1 d ( z , x ) + a 2 + a 3 2 [ d ( z , f z ) + d ( x , z ) + + d ( z , f x ) ] + a 4 + a 5 2 [ d ( z , f x ) + d ( x , z ) + d ( z , f z ) ] = = ( 1 + a 2 + a 3 + a 4 + a 5 2 ) d ( z , f z ) + ( a 1 + a 2 + a 3 + a 4 + a 5 2 ) ⋅ d ( x , z ) + a 2 + a 3 + a 4 + a 5 2 d ( z , f x ) = = ( 1 + A − a 1 2 ) d ( z , f z ) + A + a 1 2 d ( x , z ) + A − a 1 2 d ( z , f x ) d ( z , f x ) ≤ d ( z , f z ) + d ( f z , f x ) ≤ ≤ d ( z , f z ) + a 1 d ( z , x ) + a 2 + a 3 2 [ d ( z , f z ) + d ( x , z ) + + d ( z , f x ) ] + a 4 + a 5 2 [ d ( z , f x ) + d ( x , z ) + d ( z , f z ) ] = = 1 + a 2 + a 3 + a 4 + a 5 2 d ( z , f z ) + a 1 + a 2 + a 3 + a 4 + a 5 2 ⋅ d ( x , z ) + a 2 + a 3 + a 4 + a 5 2 d ( z , f x ) = = 1 + A − a 1 2 d ( z , f z ) + A + a 1 2 d ( x , z ) + A − a 1 2 d ( z , f x ) {:[d(z","fx) <= d(z","fz)+d(fz","fx) <= ],[ <= d(z","fz)+a_(1)d(z","x)+(a_(2)+a_(3))/(2)[d(z","fz)+d(x","z)+],[+d(z","fx)]+(a_(4)+a_(5))/(2)[d(z","fx)+d(x","z)+d(z","fz)]=],[=(1+(a_(2)+a_(3)+a_(4)+a_(5))/(2))d(z","fz)+(a_(1)+(a_(2)+a_(3)+a_(4)+a_(5))/(2))],[*d(x","z)+(a_(2)+a_(3)+a_(4)+a_(5))/(2)d(z","fx)=],[=(1+(A-a_(1))/(2))d(z","fz)+(A+a_(1))/(2)d(x","z)+(A-a_(1))/(2)d(z","fx)]:}\begin{aligned} & d(z, f x) \leq d(z, f z)+d(f z, f x) \leq \\ & \leq d(z, f z)+a_{1} d(z, x)+\frac{a_{2}+a_{3}}{2}[d(z, f z)+d(x, z)+ \\ & +d(z, f x)]+\frac{a_{4}+a_{5}}{2}[d(z, f x)+d(x, z)+d(z, f z)]= \\ & =\left(1+\frac{a_{2}+a_{3}+a_{4}+a_{5}}{2}\right) d(z, f z)+\left(a_{1}+\frac{a_{2}+a_{3}+a_{4}+a_{5}}{2}\right) \\ & \cdot d(x, z)+\frac{a_{2}+a_{3}+a_{4}+a_{5}}{2} d(z, f x)= \\ & =\left(1+\frac{A-a_{1}}{2}\right) d(z, f z)+\frac{A+a_{1}}{2} d(x, z)+\frac{A-a_{1}}{2} d(z, f x) \end{aligned}d(z,fx)≤d(z,fz)+d(fz,fx)≤≤d(z,fz)+a1d(z,x)+a2+a32[d(z,fz)+d(x,z)++d(z,fx)]+a4+a52[d(z,fx)+d(x,z)+d(z,fz)]==(1+a2+a3+a4+a52)d(z,fz)+(a1+a2+a3+a4+a52)⋅d(x,z)+a2+a3+a4+a52d(z,fx)==(1+A−a12)d(z,fz)+A+a12d(x,z)+A−a12d(z,fx)
It follows
( 1 − A − a 1 2 ) d ( z , f x ) ≤ ( 1 + A − a 1 2 ) d ( z , f z ) + A + a 1 2 d ( x , z ) ≤ 1 − A − a 1 2 d ( z , f x ) ≤ 1 + A − a 1 2 d ( z , f z ) + A + a 1 2 d ( x , z ) ≤ (1-(A-a_(1))/(2))d(z,fx) <= (1+(A-a_(1))/(2))d(z,fz)+(A+a_(1))/(2)d(x,z) <=\left(1-\frac{A-a_{1}}{2}\right) d(z, f x) \leq\left(1+\frac{A-a_{1}}{2}\right) d(z, f z)+\frac{A+a_{1}}{2} d(x, z) \leq(1−A−a12)d(z,fx)≤(1+A−a12)d(z,fz)+A+a12d(x,z)≤
≤ ( 1 − A ) r + A + a 1 2 r = ( 1 − A − a 1 2 ) r ≤ ( 1 − A ) r + A + a 1 2 r = 1 − A − a 1 2 r <= (1-A)r+(A+a_(1))/(2)r=(1-(A-a_(1))/(2))r\leq(1-A) r+\frac{A+a_{1}}{2} r=\left(1-\frac{A-a_{1}}{2}\right) r≤(1−A)r+A+a12r=(1−A−a12)r.
Dividing by 1 − A − a 1 2 > 0 1 − A − a 1 2 > 0 1-(A-a_(1))/(2) > 01-\frac{A-a_{1}}{2}>01−A−a12>0 we obtain d ( z , f x ) ≤ r d ( z , f x ) ≤ r d(z,fx) <= rd(z, f x) \leq rd(z,fx)≤r and Hardy
  • Rogers theorem applies and it assures the existence and uniqueness of the fixed point u u uuu.
Ramark 1. For the Ciric - Reich - Rus contractions ( a 1 = a 1 , a 2 ′ = a 3 ′ = b 1 , a 4 = a 5 = 0 , a + 2 b < 1 a 1 = a 1 , a 2 ′ = a 3 ′ = b 1 , a 4 = a 5 = 0 , a + 2 b < 1 a_(1)=a_(1),a_(2)^(')=a_(3)^(')=b_(1),a_(4)=a_(5)=0,a+2b < 1a_{1}=a_{1}, a_{2}^{\prime}=a_{3}^{\prime}=b_{1}, a_{4}=a_{5}=0, a+2 b<1a1=a1,a2′=a3′=b1,a4=a5=0,a+2b<1 ), condition (4) becomes:
d ( z , f z ) ≤ 1 − a − 2 b 1 + b r d ( z , f z ) ≤ 1 − a − 2 b 1 + b r d(z,fz) <= (1-a-2b)/(1+b)rd(z, f z) \leq \frac{1-a-2 b}{1+b} rd(z,fz)≤1−a−2b1+br
For the Kannan contractions ( a 1 = a 4 = a 5 = 0 , a 2 = a 3 = b < < 1 2 a 1 = a 4 = a 5 = 0 , a 2 = a 3 = b < < 1 2 (a_(1)=a_(4)=a_(5)=0,a_(2)=a_(3)=b < :} < (1)/(2)\left(a_{1}=a_{4}=a_{5}=0, a_{2}=a_{3}=b<\right. <\frac{1}{2}(a1=a4=a5=0,a2=a3=b<<12 ), condition (4) writes
d ( z , f z ) ≤ 1 − 2 b 1 + b r . d ( z , f z ) ≤ 1 − 2 b 1 + b r . d(z,fz) <= (1-2b)/(1+b)r.d(z, f z) \leq \frac{1-2 b}{1+b} r .d(z,fz)≤1−2b1+br.
For the Banach contractions ( a 1 = k , a i = 0 , i = 2 , 5 ― a 1 = k , a i = 0 , i = 2 , 5 ¯ a_(1)=k,a_(i)=0,i= bar(2,5)a_{1}=k, a_{i}=0, i=\overline{2,5}a1=k,ai=0,i=2,5― ),
condition (4) becomes (2).
Similar results hold for the more general contractions defined by Rus [3].
Let : R + 5 → R + : R + 5 → R + :R_(+)^(5)rarrR_(+): \mathbf{R}_{+}^{5} \rightarrow \mathbf{R}_{+}:R+5→R+be a continuous function such that
(a) if r i ≤ s i , i = 1 , 5 ― r i ≤ s i , i = 1 , 5 ¯ r_(i) <= s_(i),i= bar(1,5)r_{i} \leq s_{i}, i=\overline{1,5}ri≤si,i=1,5―, then φ ( r ) ≤ φ ( s ) φ ( r ) ≤ φ ( s ) varphi(r) <= varphi(s)\varphi(r) \leq \varphi(s)φ(r)≤φ(s);
(b) ϕ ( r ) < r ϕ ( r ) < r phi(r) < r\phi(r)<rϕ(r)<r for each r > 0 r > 0 r > 0r>0r>0, where ϕ ( r ) = φ ( r , r , r , r , r ) ϕ ( r ) = φ ( r , r , r , r , r ) phi(r)=varphi(r,r,r,r,r)\phi(r)=\varphi(r, r, r, r, r)ϕ(r)=φ(r,r,r,r,r);
(c) r − ϕ ( r ) → ∞ r − ϕ ( r ) → ∞ r-phi(r)rarr oor-\phi(r) \rightarrow \inftyr−ϕ(r)→∞ for r → ∞ r → ∞ r rarr oor \rightarrow \inftyr→∞.
For ( X , d X , d X,dX, dX,d ) a metric space, a function f : B ¯ ( z , r ) → X f : B ¯ ( z , r ) → X f: bar(B)(z,r)rarr Xf: \bar{B}(z, r) \rightarrow Xf:B¯(z,r)→X is a p p ppp -
contraction if
(6) d ( f x , f y ) ≤ φ ( d ( x , y ) ) , d ( x , f x ) , d ( y , f y ) , d ( x , f y ) , d ( y , f x ) ) d ( f x , f y ) ≤ φ ( d ( x , y ) ) , d ( x , f x ) , d ( y , f y ) , d ( x , f y ) , d ( y , f x ) ) d(fx,fy) <= varphi(d(x,y)),d(x,fx),d(y,fy),d(x,fy),d(y,fx))d(f x, f y) \leq \varphi(d(x, y)), d(x, f x), d(y, f y), d(x, f y), d(y, f x))d(fx,fy)≤φ(d(x,y)),d(x,fx),d(y,fy),d(x,fy),d(y,fx)) for all x , y ∈ B ¯ ( z , r ) x , y ∈ B ¯ ( z , r ) x,y in bar(B)(z,r)x, y \in \bar{B}(z, r)x,y∈B¯(z,r).
Let r z r z r_(z)r_{z}rz be equal to sup { r ∈ R + : r − ϕ ( r ) ≤ d ( z , f z ) } r ∈ R + : r − ϕ ( r ) ≤ d ( z , f z ) {r inR_(+):r-phi(r) <= d(z,fz)}\left\{r \in R_{+}: r-\phi(r) \leq d(z, f z)\right\}{r∈R+:r−ϕ(r)≤d(z,fz)} which is finite because r = 0 r = 0 r=0r=0r=0 is in the considered set (which is hence nonvoid) and φ φ varphi\varphiφ is continuous. We obtain a generalization of the fixed point theorem of Rus [3] which is given for. contractions defined on the entire space X X XXX.
THEOREM 3. Let ( X , d ) ( X , d ) (X,d)(X, d)(X,d) be a complete metric space and f f fff : B ― ( Z , r ) → X B ¯ ( Z , r ) → X bar(B)(Z,r)rarrX\overline{\mathrm{B}}(\mathrm{Z}, \mathrm{r}) \rightarrow \mathrm{X}B―(Z,r)→X be a - contraction. If
(7) d ( z , f z ) ≤ r − ϕ ( r z ) d ( z , f z ) ≤ r − ϕ r z quad d(z,fz) <= r-phi(r_(z))\quad d(z, f z) \leq r-\phi\left(r_{z}\right)d(z,fz)≤r−ϕ(rz),
then f f fff has a unique fixed point u ∈ B ¯ ( z , x ) , u = lim n → ∞ f n z u ∈ B ¯ ( z , x ) , u = lim n → ∞   f n z u in bar(B)(z,x),u=lim_(n rarr oo)f^(n)zu \in \bar{B}(z, x), u=\lim _{n \rightarrow \infty} f^{n} zu∈B¯(z,x),u=limn→∞fnz and d ( f n z , x ) ≤ ϕ n ( r z ) d f n z , x ≤ ϕ n r z d(f^(n)z,x) <= phi^(n)(r_(z))d\left(f^{n} z, x\right) \leq \phi^{n}\left(r_{z}\right)d(fnz,x)≤ϕn(rz).
Proof. If f z = z f z = z fz=zf z=zfz=z, the conclusion is obvious.
Let f z ≠ z f z ≠ z fz!=zf z \neq zfz≠z; one has then r z > 0 r z > 0 r_(z) > 0r_{z}>0rz>0. Let z 0 = z ; z 1 = f z z 0 = z ; z 1 = f z z_(0)=z;z_(1)=fzz_{0}=z ; z_{1}=f zz0=z;z1=fz satisfies
d ( z 0 , z 1 ) ≤ r − ϕ ( r 2 ) ≤ r 1 d z 0 , z 1 ≤ r − ϕ r 2 ≤ r 1 d(z_(0),z_(1)) <= r-phi(r_(2)) <= r_(1)d\left(z_{0}, z_{1}\right) \leq r-\phi\left(r_{2}\right) \leq r_{1}d(z0,z1)≤r−ϕ(r2)≤r1
hence z 1 ∈ B ¯ ( z , r ) z 1 ∈ B ¯ ( z , r ) z_(1)in bar(B)(z,r)z_{1} \in \bar{B}(z, r)z1∈B¯(z,r). Suppose z n = f n z ∈ B ¯ ( z , r ) z n = f n z ∈ B ¯ ( z , r ) z_(n)=f^(n)z in bar(B)(z,r)z_{n}=f^{n} z \in \bar{B}(z, r)zn=fnz∈B¯(z,r). Then
d ( z , z n + 1 ) ≤ d ( z , f z ) + d ( f z , f n + 1 z ) ≤ . d z , z n + 1 ≤ d ( z , f z ) + d f z , f n + 1 z ≤ . d(z,z_(n+1)) <= d(z,fz)+d(fz,f^(n+1)z) <= .d\left(z, z_{n+1}\right) \leq d(z, f z)+d\left(f z, f^{n+1} z\right) \leq .d(z,zn+1)≤d(z,fz)+d(fz,fn+1z)≤.
≤ d ( z , f z ) + φ ( d ( z , f n z ) , d ( z , f z ) , d ( f n z , f n + 1 z ) , d ¯ ( z , f n + 1 z ) , d ( f n z , f z ) ) ≤≤ d ( z , f z ) + ϕ ( diam O f ( z , n + 1 ) ) , O f ( z , n + 1 ) = { z , f z , … , f n + 1 z } ≤ d ( z , f z ) + φ d z , f n z , d ( z , f z ) , d f n z , f n + 1 z , d ¯ z , f n + 1 z , d f n z , f z ≤≤ d ( z , f z ) + ϕ diam O f ( z , n + 1 ) , O f ( z , n + 1 ) = z , f z , … , f n + 1 z <= d(z,fz)+varphi(d(z,f^(n)z),d(z,fz),d(f^(n)z,f^(n+1)z),( bar(d))(z,f^(n+1)z),d(f^(n)z,fz))≤≤d(z,fz)+phi(diamO_(f)(z,n+1)),O_(f)(z,n+1)={z,fz,dots,f^(n+1)z}\leq d(z, f z)+\varphi\left(d\left(z, f^{n} z\right), d(z, f z), d\left(f^{n} z, f^{n+1} z\right), \bar{d}\left(z, f^{n+1} z\right), d\left(f^{n} z, f z\right)\right) \leq \leq d(z, f z)+\phi\left(\operatorname{diam} O_{f}(z, n+1)\right), O_{f}(z, n+1)=\left\{z, f z, \ldots, f^{n+1} z\right\}≤d(z,fz)+φ(d(z,fnz),d(z,fz),d(fnz,fn+1z),d¯(z,fn+1z),d(fnz,fz))≤≤d(z,fz)+ϕ(diamOf(z,n+1)),Of(z,n+1)={z,fz,…,fn+1z}.
Because of (6), diam o f ( z , n + 1 ) o f ( z , n + 1 ) o_(f)(z,n+1)o_{f}(z, n+1)of(z,n+1) is larger than d ( f i z , f j z ) d f i z , f j z d(f^(i)z,f^(j)z)d\left(f^{i} z, f^{j} z\right)d(fiz,fjz), i , j ≥ 1 i , j ≥ 1 i,j >= 1i, j \geq 1i,j≥1, so there exists p ≤ n + 1 p ≤ n + 1 p <= n+1p \leq n+1p≤n+1 such that diam O f ( z , n + 1 ) == d ( z , f P z ) O f ( z , n + 1 ) == d z , f P z O_(f)(z,n+1)==d(z,f^(P)z){O_{f}}(z, n+1)= =d\left(z, f^{P} z\right)Of(z,n+1)==d(z,fPz).
Then
diam O f ( z , n + 1 ) = d ( z , f P z ) ≤ d ( z , f z ) + d ( f z , f P z ) ≤ diam O f ( z , n + 1 ) = d z , f P z ≤ d ( z , f z ) + d f z , f P z ≤ diamO_(f)(z,n+1)=d(z,f^(P)z) <= d(z,fz)+d(fz,f^(P)z) <=\operatorname{diam} O_{f}(z, n+1)=d\left(z, f^{P} z\right) \leq d(z, f z)+d\left(f z, f^{P} z\right) \leqdiamOf(z,n+1)=d(z,fPz)≤d(z,fz)+d(fz,fPz)≤
≤ d ( z , f z ) + ϕ ( dian ρ f ( z , n + 1 ) ) ≤ d ( z , f z ) + ϕ dian ρ f ( z , n + 1 ) <= d(z,fz)+phi(dianrho_(f)(z,n+1))quad\leq d(z, f z)+\phi\left(\operatorname{dian} \rho_{f}(z, n+1)\right) \quad≤d(z,fz)+ϕ(dianρf(z,n+1)) and
diam O f ( z , n + 1 ) − ϕ ( diam O f ( z , n + 1 ) ) ≤ d ( z , f z ) diam O f ( z , n + 1 ) − ϕ diam O f ( z , n + 1 ) ≤ d ( z , f z ) diamO_(f)(z,n+1)-phi(diamO_(f)(z,n+1)) <= d(z,fz)\operatorname{diam} O_{f}(z, n+1)-\phi\left(\operatorname{diam} O_{f}(z, n+1)\right) \leq d(z, f z)diamOf(z,n+1)−ϕ(diamOf(z,n+1))≤d(z,fz),
hence diam ρ f ( z , n + 1 ) ≤ r z ρ f ( z , n + 1 ) ≤ r z rho_(f)(z,n+1) <= r_(z)\rho_{f}(z, n+1) \leq r_{z}ρf(z,n+1)≤rz.
It follows d ( z , z n + 1 ) ≤ d ( z , f z ) + ϕ ( x z ) ≤ r d z , z n + 1 ≤ d ( z , f z ) + ϕ x z ≤ r d(z,z_(n+1)) <= d(z,fz)+phi(x_(z)) <= rd\left(z, z_{n+1}\right) \leq d(z, f z)+\phi\left(x_{z}\right) \leq rd(z,zn+1)≤d(z,fz)+ϕ(xz)≤r.
The sequence { z n } n ∈ N z n n ∈ N {z_(n)}_(n in N)\left\{z_{n}\right\}_{n \in N}{zn}n∈N is well-defined for f : B ¯ ( z , r ) → X f : B ¯ ( z , r ) → X f: bar(B)(z,r)rarr Xf: \bar{B}(z, r) \rightarrow Xf:B¯(z,r)→X.
We shall prove now that this sequence converges. Let n ≥ 1 n ≥ 1 n >= 1n \geq 1n≥1.
We estimate:
d ( z n , z n + p ) ≤ Φ ( d ( z n − 1 , z n + p − 1 ) , d ( z n − 1 , z n ) , d ( z n + p − 1 , z n + p ) d ( z n − 1 , z n + p ) , d ( z n + p − 1 , z n ) ) ≤ ϕ ( diam o f ( z n − 1 , p + 1 ) ) ≤ ≤ ϕ 2 ( diam o f ( z n − 2 , p + 2 ) ) ≤ … ≤ ϕ n ( diam o f ( z , p + n ) ) ≤ ϕ n ( r z ) d z n , z n + p ≤ Φ d z n − 1 , z n + p − 1 , d z n − 1 , z n , d z n + p − 1 , z n + p d z n − 1 , z n + p , d z n + p − 1 , z n ≤ ϕ  diam  o f z n − 1 , p + 1 ≤ ≤ ϕ 2  diam  o f z n − 2 , p + 2 ≤ … ≤ ϕ n  diam  o f ( z , p + n ) ≤ ϕ n r z {:[d(z_(n),z_(n+p)) <= Phi(d(z_(n-1),z_(n+p-1)),d(z_(n-1),z_(n)),d(z_(n+p-1),z_(n+p)):}],[{:d(z_(n-1),z_(n+p)),d(z_(n+p-1),z_(n))) <= phi(" diam "o_(f)(z_(n-1),p+1)) <= ],[ <= phi^(2)(" diam "o_(f)(z_(n-2),p+2)) <= dots <= phi^(n)(" diam "o_(f)(z,p+n)) <= phi^(n)(r_(z))]:}\begin{aligned} & d\left(z_{n}, z_{n+p}\right) \leq \Phi\left(d\left(z_{n-1}, z_{n+p-1}\right), d\left(z_{n-1}, z_{n}\right), d\left(z_{n+p-1}, z_{n+p}\right)\right. \\ & \left.d\left(z_{n-1}, z_{n+p}\right), d\left(z_{n+p-1}, z_{n}\right)\right) \leq \phi\left(\text { diam } o_{f}\left(z_{n-1}, p+1\right)\right) \leq \\ & \leq \phi^{2}\left(\text { diam } o_{f}\left(z_{n-2}, p+2\right)\right) \leq \ldots \leq \phi^{n}\left(\text { diam } o_{f}(z, p+n)\right) \leq \phi^{n}\left(r_{z}\right) \end{aligned}d(zn,zn+p)≤Φ(d(zn−1,zn+p−1),d(zn−1,zn),d(zn+p−1,zn+p)d(zn−1,zn+p),d(zn+p−1,zn))≤ϕ( diam of(zn−1,p+1))≤≤ϕ2( diam of(zn−2,p+2))≤…≤ϕn( diam of(z,p+n))≤ϕn(rz)
But r z > 0 r z > 0 r_(z) > 0r_{z}>0rz>0, so ϕ n ( r z ) → 0 ( n → ∞ ) ϕ n r z → 0 ( n → ∞ ) phi^(n)(r_(z))rarr0(n rarr oo)\phi^{n}\left(r_{z}\right) \rightarrow 0(n \rightarrow \infty)ϕn(rz)→0(n→∞); indeed, the sequence is descreasing and bounded and if its limit were a * 0 , from the continuity of ϕ ϕ phi\phiϕ it would follow a = ϕ ( a ) a = ϕ ( a ) a=phi(a)a=\phi(a)a=ϕ(a), contradicting the property (b).
It follows that { z n } ⊏ B ¯ ( z , r ) z n ⊏ B ¯ ( z , r ) {z_(n)}⊏ bar(B)(z,r)\left\{z_{n}\right\} \sqsubset \bar{B}(z, r){zn}⊏B¯(z,r) is a cauchy sequence, hence it converges to a limit u u uuu in B ¯ ( z , r ) B ¯ ( z , r ) bar(B)(z,r)\bar{B}(z, r)B¯(z,r), which is a fixed point for f. Indeed, suppose u ∗ u ∗ u**u *u∗ fu. Then, for n ∈ N n ∈ N n in Nn \in Nn∈N
d ( u , f u ) ≤ d ( u , f n z ) + d ( f n z , f u ) ≤ d ( u , f u ) ≤ d u , f n z + d f n z , f u ≤ d(u,fu) <= d(u,f^(n)z)+d(f^(n)z,fu) <=d(u, f u) \leq d\left(u, f^{n} z\right)+d\left(f^{n} z, f u\right) \leqd(u,fu)≤d(u,fnz)+d(fnz,fu)≤
≤ d ( u , f n z ) + φ ( d ( f n − 1 z , u ) , d ( f n − 1 z , f n z ) , d ( u , f u ) , d ( f n − 1 z , f u ) ≤ d u , f n z + φ d f n − 1 z , u , d f n − 1 z , f n z , d ( u , f u ) , d f n − 1 z , f u <= d(u,f^(n)z)+varphi(d(f^(n-1)z,u),d(f^(n-1)z,f^(n)z),d(u,fu),d(f^(n-1)z,fu):}\leq d\left(u, f^{n} z\right)+\varphi\left(d\left(f^{n-1} z, u\right), d\left(f^{n-1} z, f^{n} z\right), d(u, f u), d\left(f^{n-1} z, f u\right)\right.≤d(u,fnz)+φ(d(fn−1z,u),d(fn−1z,fnz),d(u,fu),d(fn−1z,fu), d ( u , f n z ) } d u , f n z {:d(u,f^(n)z)}\left.d\left(u, f^{n} z\right)\right\}d(u,fnz)}
and for n → ∞ n → ∞ n rarr oon \rightarrow \inftyn→∞
d ( u , f u ) ≤ φ ( 0 , 0 , d ( u , f u ) , d ( u , f u ) , 0 ) ≤ ϕ ( d ( u , f u ) ) < d ( u , f u ) d ( u , f u ) ≤ φ ( 0 , 0 , d ( u , f u ) , d ( u , f u ) , 0 ) ≤ ϕ ( d ( u , f u ) ) < d ( u , f u ) d(u,fu) <= varphi(0,0,d(u,fu),d(u,fu),0) <= phi(d(u,fu)) < d(u,fu)d(u, f u) \leq \varphi(0,0, d(u, f u), d(u, f u), 0) \leq \phi(d(u, f u))<d(u, f u)d(u,fu)≤φ(0,0,d(u,fu),d(u,fu),0)≤ϕ(d(u,fu))<d(u,fu),
which im a contradiction.
The uniquaness of the fixed point can be aasily established
in a similar way.
mamark 2. Condition (3) in Theorem 2 corresponds to a φ φ varphi\varphiφ contraction with
φ ( x 1 , … , x 5 ) = ∑ i = 1 5 a i x i , a i ≥ 0 , i 1 = 1 , 5 ― , λ = ∑ i = 1 5 a i < 1 . φ x 1 , … , x 5 = ∑ i = 1 5   a i x i , a i ≥ 0 , i 1 = 1 , 5 ¯ , λ = ∑ i = 1 5   a i < 1 . varphi(x_(1),dots,x_(5))=sum_(i=1)^(5)a_(i)x_(i),quada_(i) >= 0,i bar(1=1,5),lambda=sum_(i=1)^(5)a_(i) < 1.\varphi\left(x_{1}, \ldots, x_{5}\right)=\sum_{i=1}^{5} a_{i} x_{i}, \quad a_{i} \geq 0, i \overline{1=1,5}, \lambda=\sum_{i=1}^{5} a_{i}<1 .φ(x1,…,x5)=∑i=15aixi,ai≥0,i1=1,5―,λ=∑i=15ai<1.
In this case r z = sup { r ≥ 0 ; r − A r ≤ d ( z , f z ) } = 1 1 − A d ( z , f z ) r z = sup { r ≥ 0 ; r − A r ≤ d ( z , f z ) } = 1 1 − A d ( z , f z ) r_(z)=s u p{r >= 0;r-Ar <= d(z,fz)}=(1)/(1-A)d(z,fz)r_{z}=\sup \{r \geq 0 ; r-A r \leq d(z, f z)\}=\frac{1}{1-A} d(z, f z)rz=sup{r≥0;r−Ar≤d(z,fz)}=11−Ad(z,fz) and condition (7) in Theorem 3 becomes
d ( z , f z ) ≤ r − A 1 − A d ( z , f z ) , i.e. d ( z , f z ) ≤ ( 1 − A ) r . d ( z , f z ) ≤ r − A 1 − A d ( z , f z ) ,  i.e.  d ( z , f z ) ≤ ( 1 − A ) r . {:[d(z","fz) <= r-(A)/(1-A)d(z","fz)","" i.e. "],[d(z","fz) <= (1-A)r.]:}\begin{aligned} & d(z, f z) \leq r-\frac{A}{1-A} d(z, f z), \text { i.e. } \\ & d(z, f z) \leq(1-A) r . \end{aligned}d(z,fz)≤r−A1−Ad(z,fz), i.e. d(z,fz)≤(1−A)r.
This condition is less restrictive than (4), but when condition (4) is applicable the sequence of succesive approximations starting from each x x xxx in B ¯ ( z , r ) B ¯ ( z , r ) bar(B)(z,r)\bar{B}(z, r)B¯(z,r) converges to the fixed point u u uuu.

REFEREWCES

  1. J.Lopez - Gomez, A fixed point theorem for discontinuous operators, Glasnik Mat. 23 (1988), 115-118.
  2. L.Nova, G., Fixed point theorems for some discontinuous operators, Pacific J. Math. 123 (1986), 189-196.
  3. I.A.Rus, Metrical fixed point theorems, University of Cluj Napoca, Department of Mathematics, 1979 (mimeographed).
Institute of Mathematics
P.O. Box 68
3400 Cluf - Mapoca
Romania
This paper is in final form and no varaion of it is or will be submitted for publication elsewhere.

Related Posts

On the Legendre transform and its applications

Abstract AuthorsArpad Pal Babes-Bolyai University, Cluj-Napoca, Romania Mira-Cristiana Anisiu Tiberiu Popoviciu Institute of Numerical analysis Romanian Academy, Romania Keywords? Paper…