On multivalued mappings satisfying the condition T(F_T)=F_T

Abstract

Authors

Mira-Cristiana Anisiu
Institutul de Matematica, Cluj-Napoca, Romania

Keywords

?

Paper coordinates

M.-C. Anisiu, On multivalued mappings satisfying the condition T(F_T)=F_T, Seminar on Fixed Point Theory, 1-8, Preprint, 85-3, Univ. Babeş-Bolyai, Cluj-Napoca, 1985 (pdf file here)

PDF

About this paper

Journal
Publisher Name
DOI
Print ISSN
Online ISSN

google scholar link

[1] Purdea, I., Pic, Gh., Treatise of modern algebra, vol.1, Ed. Acad. R.S.R., 1977 (in Romanian)
[2] Rus, I.A., Fixed and strict fixed points for multivalued  mappings, this Preprint

1985-Anisiu-OnMultivaluedMappings 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; }

"BABES-BOLYAI" UNIVERSITIT
FACULTY OF MATHEMATICS
RESEARGH SEMINARIRS
SEMINAR ON FIXED POINT THEORY
Preprint ar. 3, 1985, pp. A − B A − B A-BA-BA−B

ON MULTIVALUED MAPPINGSSATISFYING THE CONDITION T ( F T ) = F T T F T = F T T(F_(T))=F_(T)T\left(F_{T}\right)=F_{T}T(FT)=FTMira-Cristiana Anisiu

Let X X XXX be a nonvold set and T : X → X T : X → X T:X rarr XT: X \rightarrow XT:X→X a multivalued mapping. Let
F T = { x ∈ X : x ∈ T ( x ) } , respectively ( S F ) T = { x ∈ X : T ( x ) = { x } } F T = { x ∈ X : x ∈ T ( x ) } ,  respectively  ( S F ) T = { x ∈ X : T ( x ) = { x } } {:[F_(T)={x in X:x in T(x)}","" respectively "],[(SF)_(T)={x in X:T(x)={x}}]:}\begin{aligned} & F_{T}=\{x \in X: x \in T(x)\}, \text { respectively } \\ & (S F)_{T}=\{x \in X: T(x)=\{x\}\} \end{aligned}FT={x∈X:x∈T(x)}, respectively (SF)T={x∈X:T(x)={x}}
denote the fixed point set, respectively the strict fixed point set of T.
For the multivalued mapping T : X → X T : X → X T:X rarr XT: X \rightarrow XT:X→X we consider the graph
G ( T ) = { ( x , y ) ∈ X : X : y ∈ T ( x ) } G ( T ) = { ( x , y ) ∈ X : X : y ∈ T ( x ) } G(T)={(x,y)in X:X:y in T(x)}G(T)=\{(x, y) \in X: X: y \in T(x)\}G(T)={(x,y)∈X:X:y∈T(x)}
which may be regarded as a relation on X X XXX. The properties of the relations are exposed, for example, in [1].
It is obvious that any function f : X → X f : X → X f:X rarr Xf: X \rightarrow Xf:X→X satisfies the equality f ( F f ) = F f f F f = F f f(F_(f))=F_(f)f\left(F_{f}\right)=F_{f}f(Ff)=Ff. In the paper [2], I.A. Rus shows that there are multivalued mappings which have not this property, but any multivalued mapping having only strict fixed points ( F T = ( S F ) T F T = ( S F ) T F_(T)=(SF)_(T)\mathrm{F}_{T}=(S F)_{T}FT=(SF)T ) verifies the condition T ( F T ) = F T T F T = F T T(F_(T))=F_(T)T\left(F_{T}\right)=F_{T}T(FT)=FT ( Lemma 4.1). The Problem 4.1[2] asks what are the conditions under which the set F T F T F_(T)F_{T}FT is fixed for a multivalued mapping T.
In the sequel we give sufficient conditions for the equality T ( F T ) = F T T F T = F T T(F_(T))=F_(T)T\left(F_{T}\right)=F_{T}T(FT)=FT holds and then we study some properties of a multivalued mapping T ~ T ~ tilde(T)\tilde{T}T~ induced by the given T T TTT.
For the set X ≠ ∅ X ≠ ∅ X!=O/X \neq \varnothingX≠∅ we denote
I X : X → X , I X ( x ) = { x } for any x ∈ X I X : X → X , I X ( x ) = { x }  for any  x ∈ X I_(X):X rarr X,I_(X)(x)={x}" for any "x in XI_{X}: X \rightarrow X, I_{X}(x)=\{x\} \text { for any } x \in XIX:X→X,IX(x)={x} for any x∈X
Δ X = G ( I X ) = { ( x , x ) ∈ X × X : x ∈ X } Δ X = G I X = { ( x , x ) ∈ X × X : x ∈ X } Delta_(X)=G(I_(X))={(x,x)in X xx X:x in X}\Delta_{X}=G\left(I_{X}\right)=\{(x, x) \in X \times X: x \in X\}ΔX=G(IX)={(x,x)∈X×X:x∈X},
and for the multivalued mapping T : X → X T : X → X T:X rarr XT: X \rightarrow XT:X→X
dom T = { x ∈ X : T ( x ) ≠ ∅ } dom T = { x ∈ X : T ( x ) ≠ ∅ } dom T={x in X:T(x)!=O/}\operatorname{dom} T=\{x \in X: T(x) \neq \varnothing\}domT={x∈X:T(x)≠∅}
Im T = { y ∈ X T = { y ∈ X T={y in XT=\{y \in XT={y∈X : there is x ∈ X x ∈ X x in Xx \in Xx∈X such that y ∈ T ( x ) } y ∈ T ( x ) } y in T(x)}y \in T(x)\}y∈T(x)}
T − 1 : X → X , T − 1 ( y ) = { x ∈ X : y ∈ T ( x ) } T − 1 : X → X , T − 1 ( y ) = { x ∈ X : y ∈ T ( x ) } T^(-1):X rarr X,T^(-1)(y)={x in X:y in T(x)}T^{-1}: X \rightarrow X, T^{-1}(y)=\{x \in X: y \in T(x)\}T−1:X→X,T−1(y)={x∈X:y∈T(x)}.
For a multivalued mapping T : X → X T : X → X T:X rarr XT: X \rightarrow XT:X→X the following theorem holds.
THHOREM 1. Let the below conditions be given
(a) T ( F T ) ⊆ F T T F T ⊆ F T T(F_(T))subeF_(T)T\left(F_{T}\right) \subseteq F_{T}T(FT)⊆FT
(a') T ( F T ) = F T T F T = F T T(F_(T))=F_(T)T\left(F_{T}\right)=F_{T}T(FT)=FT
(a") T ( dom ( I X ∩ T ) ) ⊆ dom ( I X ∩ T ) T dom I X ∩ T ⊆ dom I X ∩ T T(dom(I_(X)nn T))sube dom(I_(X)nn T)T\left(\operatorname{dom}\left(I_{X} \cap T\right)\right) \subseteq \operatorname{dom}\left(I_{X} \cap T\right)T(dom(IX∩T))⊆dom(IX∩T)
(b) for any x ∈ F T T ( x ) ⊆ ⋂ y ∈ T ( x ) T ( y ) x ∈ F T T ( x ) ⊆ ⋂ y ∈ T ( x )   T ( y ) x inF_(T)T(x)subennn_(y in T(x))T(y)x \in \mathbb{F}_{T} T(x) \subseteq \bigcap_{y \in T(x)} T(y)x∈FTT(x)⊆⋂y∈T(x)T(y)
(b') for any x ∈ F T x ∈ F T x inF_(T)x \in F_{T}x∈FT and z ∈ T ( x ) z ∈ T ( x ) z in T(x)z \in T(x)z∈T(x), it follows T ( x ) ⊆ T ( z ) T ( x ) ⊆ T ( z ) T(x)sube T(z)T(x) \subseteq T(z)T(x)⊆T(z)
(c) G ( T ) G ( T ) G(T)G(T)G(T) is a symmetrical and transitive relation
(d) G ( T ) G ( T ) G(T)G(T)G(T) is a reflexive relation
(e) F T = ( S F ) T F T = ( S F ) T F_(T)=(SF)_(T)F_{T}=(S F)_{T}FT=(SF)T
The following implications are true
( a ) ⇒ ( a ) ⇔ ( a ′ ) ⇔ ( a ′ ′ ) ( a ) ⇒ ( a ) ⇔ a ′ ⇔ a ′ ′ (a)=>(a)<=>(a^('))<=>(a^(''))(\mathrm{a}) \Rightarrow(\mathrm{a}) \Leftrightarrow\left(\mathrm{a}^{\prime}\right) \Leftrightarrow\left(\mathrm{a}^{\prime \prime}\right)(a)⇒(a)⇔(a′)⇔(a′′)
n ^ n ^ hat(n)\hat{n}n^
(e) ⇒ ( b ) ⟺ ( b ′ ) ⇒ ( b ) ⟺ b ′ =>(b)Longleftrightarrow(b^('))\Rightarrow(b) \Longleftrightarrow\left(b^{\prime}\right)⇒(b)⟺(b′)
n ^ n ^ hat(n)\hat{n}n^
(c)
Proof. (a) ⇒ ( a ′ ) ⇒ a ′ =>(a^('))\Rightarrow\left(a^{\prime}\right)⇒(a′). It is obvious that ( a ′ ) ⇒ ( a ) a ′ ⇒ ( a ) (a^('))=>(a)\left(a^{\prime}\right) \Rightarrow(a)(a′)⇒(a); if ( a ) ( a ) (a)(a)(a) is true, we obtain ( a ′ a ′ a^(')a^{\prime}a′ ) because from x ∈ F T x ∈ F T x inF_(T)x \in F_{T}x∈FT we deduce x ∈ T ( x ) x ∈ T ( x ) x in T(x)x \in T(x)x∈T(x), so x ∈∈ T ( F T ) x ∈∈ T F T x∈∈T(F_(T))x \in \in T\left(F_{T}\right)x∈∈T(FT).
( a ) ⇔ ( a ′ ′ ) ⋅ dom ( I X ∩ T ) = { x ∈ X : I X ( x ) ∩ T ( x ) ≠ ∅ } == { x ∈ X : x ∈ T ( x ) } = F T ( a ) ⇔ a ′ ′ ⋅ dom I X ∩ T = x ∈ X : I X ( x ) ∩ T ( x ) ≠ ∅ == { x ∈ X : x ∈ T ( x ) } = F T (a)<=>(a^(''))*dom(I_(X)nn T)={x in X:I_(X)(x)nn T(x)!=O/}=={x in X:x in T(x)}=F_(T)(\mathrm{a}) \Leftrightarrow\left(\mathrm{a}^{\prime \prime}\right) \cdot \operatorname{dom}\left(I_{\mathrm{X}} \cap T\right)=\left\{x \in X: I_{\mathrm{X}}(x) \cap T(x) \neq \emptyset\right\}= =\{x \in X: x \in T(x)\}=F_{T}(a)⇔(a′′)⋅dom(IX∩T)={x∈X:IX(x)∩T(x)≠∅}=={x∈X:x∈T(x)}=FT and the equivalence holds.
(b) ⇒ ⇒ =>\Rightarrow⇒ (b'). Let x ∈ F T x ∈ F T x inF_(T)x \in F_{T}x∈FT and z ∈ T ( x ) z ∈ T ( x ) z in T(x)z \in T(x)z∈T(x). We prove that T ( x ) ⊆ T ( z ) T ( x ) ⊆ T ( z ) T(x)sube T(z)T(x) \subseteq T(z)T(x)⊆T(z). For any y ∈ T ( x ) y ∈ T ( x ) y in T(x)y \in T(x)y∈T(x), we obtain y ∈ T ( x ) ⊆ ⋂ y ∈ T ( x ) T ( y ) ⊆ TV 3 ( ∉ so T ( x ) y ∈ T ( x ) ⊆ ⋂ y ∈ T ( x )   T ( y ) ⊆ TV 3 ( ∉ so T ( x ) y in T(x)subennn_(y in T(x))T(y)subeTV_(3)(!in so T(x)y \in T(x) \subseteq \bigcap_{y \in T(x)} T(y) \subseteq \operatorname{TV}_{3}(\notin \operatorname{so} T(x)y∈T(x)⊆⋂y∈T(x)T(y)⊆TV3(∉soT(x)
⊆ T ( z ) ⊆ T ( z ) sube T(z)\subseteq T(z)⊆T(z).
(b') ⇒ ⇒ =>\Rightarrow⇒ (B). Let x ∈ F T x ∈ F T x inF_(T)x \in F_{T}x∈FT and z ∈ T ( x ) z ∈ T ( x ) z in T(x)z \in T(x)z∈T(x); by (b') we have T ( x ) ⊆ T ( B ) T ( x ) ⊆ T ( B ) T(x)sube T(B)T(x) \subseteq T(\mathbf{B})T(x)⊆T(B), hence T ( x ) ⊆ ⋂ z ∈ T ( x ) T ( z ) T ( x ) ⊆ ⋂ z ∈ T ( x )   T ( z ) T(x)subennn_(z in T(x))T(z)T(x) \subseteq \bigcap_{z \in T(x)} T(z)T(x)⊆⋂z∈T(x)T(z).
(b) ⇒ ⇒ =>\Rightarrow⇒ (a). Let y ∈ T ( F T ) y ∈ T F T y in T(F_(T))y \in T\left(F_{T}\right)y∈T(FT), i.e. there exists x ∈ F T x ∈ F T x inF_(T)x \in F_{T}x∈FT such that y ∈∈ T ( x ) y ∈∈ T ( x ) y∈∈T(x)y \in \in T(x)y∈∈T(x). The condition (b) implies T ( x ) ⊆ ⋂ z ∈ T ( x ) T ( z ) ⊆ T ( y ) T ( x ) ⊆ ⋂ z ∈ T ( x )   T ( z ) ⊆ T ( y ) T(x)subennn_(z in T(x))T(z)sube T(y)T(x) \subseteq \bigcap_{z \in T(x)} T(z) \subseteq T(y)T(x)⊆⋂z∈T(x)T(z)⊆T(y); but y ∈∈ T ( x ) y ∈∈ T ( x ) y∈∈T(x)y \in \in T(x)y∈∈T(x) and it follows y ∈ T ( y ) y ∈ T ( y ) y in T(y)y \in T(y)y∈T(y), hence y ∈ F T y ∈ F T y inF_(T)y \in F_{T}y∈FT.
(c) ⇒ ⇒ =>\Rightarrow⇒ (B). Let x ∈ F T x ∈ F T x inF_(T)x \in F_{T}x∈FT and z ∈ T ( x ) z ∈ T ( x ) z in T(x)z \in T(x)z∈T(x). We prove that for any y ∈ X y ∈ X y in Xy \in Xy∈X such that y ∈ T ( x ) y ∈ T ( x ) y in T(x)y \in T(x)y∈T(x) we have y ∈ T ( z ) y ∈ T ( z ) y in T(z)y \in T(z)y∈T(z). The symmetry of G ( T ) G ( T ) G(T)G(T)G(T) implies x ∈ T ( y ) x ∈ T ( y ) x in T(y)x \in T(y)x∈T(y); but z ∈ T ( x ) z ∈ T ( x ) z in T(x)z \in T(x)z∈T(x) and from the transitivity of G ( T ) G ( T ) G(T)G(T)G(T) we obtain z ∈ f ( y ) z ∈ f ( y ) z in f(y)z \in \boldsymbol{f}(y)z∈f(y). Applying again the symmetry, we have y ∈ T ( z ) y ∈ T ( z ) y in T(z)y \in T(z)y∈T(z) and T ( x ) ⊆⊆ ⋂ z ∈ T ( x ) T ( z ) T ( x ) ⊆⊆ ⋂ z ∈ T ( x )   T ( z ) T(x)⊆⊆nnn_(z in T(x))T(z)T(x) \subseteq \subseteq \bigcap_{z \in T(x)} T(z)T(x)⊆⊆⋂z∈T(x)T(z).
( e ) ⇒ ( b ) ( e ) ⇒ ( b ) (e)=>(b)(e) \Rightarrow(b)(e)⇒(b). Let x ∈ F T = ( S F ) T x ∈ F T = ( S F ) T x inF_(T)=(SF)_(T)x \in F_{T}=(S F)_{T}x∈FT=(SF)T so T ( x ) = { x } = ⋂ y ∈ T ( x ) T ( y ) T ( x ) = { x } = ⋂ y ∈ T ( x )   T ( y ) T(x)={x}=nnn_(y in T(x))T(y)T(x)=\{x\}=\bigcap_{y \in T(x)} T(y)T(x)={x}=⋂y∈T(x)T(y) and (b) holds.
( d ) ⇒ ( a ) . G ( T ) ( d ) ⇒ ( a ) . G ( T ) (d)=>(a).G(T)(d) \Rightarrow(a) . G(T)(d)⇒(a).G(T) being reflexive, we have Δ X ⊆ G ( T ) Δ X ⊆ G ( T ) Delta_(X)sube G(T)\Delta_{X} \subseteq G(T)ΔX⊆G(T) and it follows F T = X F T = X F_(T)=XF_{T}=XFT=X; it is obvious that T ( F T ) ⊆ F T T F T ⊆ F T T(F_(T))subeF_(T)T\left(F_{T}\right) \subseteq F_{T}T(FT)⊆FT.
We mention now some connections between the classes of multivalued mappings satisfying the conditions in Theorem. 1.
THEOREM 2. If the graph of the multivalued mapping T T TTT satisfying (b) is a reflexive relation, it is also symmetrical and transitive.
Proof. G ( T ) G ( T ) G(T)G(T)G(T) being reflexive, the condition (b) is satisfied for any x ∈ X x ∈ X x in Xx \in Xx∈X. Let x ¯ ∈ X x ¯ ∈ X bar(x)in X\bar{x} \in Xx¯∈X be arbitrary and y ∈ T ( x ) y ∈ T ( x ) y in T(x)y \in T(x)y∈T(x). Using ( b ) , x ∈ T ( x ) ⊆ ( b ) , x ∈ T ( x ) ⊆ (b),x in T(x)sube(b), x \in T(x) \subseteq(b),x∈T(x)⊆ 里 ⊆ T ( y ) ⊆ T ( y ) sube T(y)\subseteq T(y)⊆T(y), so x ∈ T ( y ) x ∈ T ( y ) x in T(y)x \in T(y)x∈T(y) and the symmetry is proved.
For the transitivity, we consider x ∈ X , y ∈ T ( x ) x ∈ X , y ∈ T ( x ) x in X,y in T(x)x \in X, y \in T(x)x∈X,y∈T(x) and z ∈ T ( y ) z ∈ T ( y ) z in T(y)z \in T(y)z∈T(y). It follows by (b) that x ∈ T ( x ) ⊆ T ( y ) ⊆ T ( z ) x ∈ T ( x ) ⊆ T ( y ) ⊆ T ( z ) x in T(x)sube T(y)sube T(z)x \in T(x) \subseteq T(y) \subseteq T(z)x∈T(x)⊆T(y)⊆T(z), so x ∈ T ( z ) x ∈ T ( z ) x in T(z)x \in T(z)x∈T(z). Applying the symmetry of G ( T ) G ( T ) G(T)G(T)G(T) we obtain z ∈ T ( x ) z ∈ T ( x ) z in T(x)z \in T(x)z∈T(x) and the proof is over.
REMARK 1. There is only one mailhytrod mapping which has only strict fixed points and a reflexive graph, namely I X I X I_(X)I_{X}IX, whose graph Δ X Δ X Delta_(X)\Delta_{X}ΔX is also symmetrical and transitive.
We are able now to present the relative position of the classes
of multivalued mappings involved in Theorem 1 using the diagram in Fig. 1; rectangles having the basas on the same line and the top vertexes marked with a letter stand for the classes denoted by that letter. All the regions marked by a number are nonvoid, as the following examples show.
a a aaa 1 b b bbb c c ccc
d d ddd c c ccc b 2 b 2 b^(2)b^{2}b2 8 c c ccc
2 e e eee 3
5 7 4
a 1 b c d c b^(2) 8 c 2 e 3 5 7 4 | $a$ | 1 | $b$ | | $c$ | | | :---: | :---: | :---: | :---: | :---: | :---: | | $d$ | | $c$ | $b^{2}$ | 8 | $c$ | | | 2 | $e$ | | 3 | | | | | 5 | 7 | 4 | |
Fig. 1
EXAMPLIES.
  1. I satisfies (a), but none of (b) and (d).
X = R , T ( x ) = { { 0 , x } , x ∈ [ − 1 , 1 ] { 1 } , x ∈ R ∖ [ − 1 , 1 ] X = R , T ( x ) = { 0 , x } , x ∈ [ − 1 , 1 ] { 1 } , x ∈ R ∖ [ − 1 , 1 ] X=R,T(x)={[{0","x}","x in[-1","1]],[{1}","x in R\\[-1","1]]:}X=R, T(x)=\left\{\begin{array}{l} \{0, x\}, x \in[-1,1] \\ \{1\}, x \in R \backslash[-1,1] \end{array}\right.X=R,T(x)={{0,x},x∈[−1,1]{1},x∈R∖[−1,1]
  1. T T TTT satisfies (d), but it does not satisfy (b).
X = R , T ( x ) = { { x } , x ≠ 0 { 0 , 1 } , x = 0 X = R , T ( x ) = { x } , x ≠ 0 { 0 , 1 } , x = 0 X=R,T(x)={[{x}",",x!=0],[{0","1}",",x=0]:}X=R, T(x)= \begin{cases}\{x\}, & x \neq 0 \\ \{0,1\}, & x=0\end{cases}X=R,T(x)={{x},x≠0{0,1},x=0
  1. I satisfies (b), but none of (c), (e) and (d).
X = R , T ( x ) = { { 2 } , x = 0 { − x , x } , x ∈ [ − 1 , 1 ] ∖ { 0 } { 0 } , x ∈ R ∖ [ − 1 , 1 ] X = R , T ( x ) = { 2 } , x = 0 { − x , x } , x ∈ [ − 1 , 1 ] ∖ { 0 } { 0 } , x ∈ R ∖ [ − 1 , 1 ] X=R,T(x)={[{2}",",x=0],[{-x","x}",",x in[-1","1]\\{0}],[{0}",",x in R\\[-1","1]]:}X=R, T(x)= \begin{cases}\{2\}, & x=0 \\ \{-x, x\}, & x \in[-1,1] \backslash\{0\} \\ \{0\}, & x \in R \backslash[-1,1]\end{cases}X=R,T(x)={{2},x=0{−x,x},x∈[−1,1]∖{0}{0},x∈R∖[−1,1]
  1. T satisfies (e), but none of (c) and (d).
X = R , T ( x ) = { 0 , − x } X = R , T ( x ) = { 0 , − x } X=R,T(x)={0,-x}X=R, T(x)=\{0,-x\}X=R,T(x)={0,−x}
  1. T satisfies (c), (d) and (e).
By Remark 1, the only multivalued mapping satisfying these conditions is I X I X I_(X)I_{X}IX.
6. I satisfies (c) and (d), but it does not satisfy (e).
X = R , T ( x ) = { { x } , x ∈ R ∖ { 1 , 2 } { 1 , 2 } , x ∈ { 1 , 2 } X = R , T ( x ) = { x } , x ∈ R ∖ { 1 , 2 } { 1 , 2 } , x ∈ { 1 , 2 } X=R,T(x)={[{x}",",x in R\\{1","2}],[{1","2}",",x in{1","2}]:}X=R, T(x)= \begin{cases}\{x\}, & x \in R \backslash\{1,2\} \\ \{1,2\}, & x \in\{1,2\}\end{cases}X=R,T(x)={{x},x∈R∖{1,2}{1,2},x∈{1,2}
  1. I satisfies (c) and (e), but it does not satisfy (d).
X = R U { ∞ } , I ( x ) = { { x } , x ∈ R ϕ ; x = ∞ X = R U { ∞ } , I ( x ) = { x } , x ∈ R ϕ ; x = ∞ X=RU{oo},I(x)={[{x}","x in R],[phi;x=oo]:}X=R U\{\infty\}, I(x)=\left\{\begin{array}{c} \{x\}, x \in R \\ \phi ; x=\infty \end{array}\right.X=RU{∞},I(x)={{x},x∈Rϕ;x=∞
  1. T satisfies (c), but none of (d) and (e).
X = R ∪ { ∞ } , T ( x ) = { { − x , x } , x ∈ R ϕ , x = ∞ X = R ∪ { ∞ } , T ( x ) = { − x , x } , x ∈ R ϕ , x = ∞ X=R uu{oo},T(x)={[{-x","x}","x in R],[phi","x=oo]:}X=R \cup\{\infty\}, T(x)=\left\{\begin{array}{l} \{-x, x\}, x \in R \\ \phi, x=\infty \end{array}\right.X=R∪{∞},T(x)={{−x,x},x∈Rϕ,x=∞
REMARK 2. If we consider only multivalued mappings T : X → X T : X → X T:X rarr XT: X \rightarrow XT:X→X such that X = dom T X = dom T X=dom TX=\operatorname{dom} TX=domT (all the values of T T TTT are nonvidid), the condition (c) implies (d.).
Indeed, for any x ∈ X x ∈ X x in Xx \in Xx∈X we have T ( x ) ≠ ϕ T ( x ) ≠ ϕ T(x)!=phiT(x) \neq \phiT(x)≠ϕ and we can choose y ∈ T ( x ) y ∈ T ( x ) y in T(x)y \in T(x)y∈T(x); from the symmetry we obtain x ∈ T ( y ) x ∈ T ( y ) x in T(y)x \in T(y)x∈T(y) and the transitivity of G ( x ) G ( x ) G(x)G(x)G(x) imp plies x ∈ T ( x ) x ∈ T ( x ) x in T(x)x \in T(x)x∈T(x), i.e. G ( T ) G ( T ) G(T)G(T)G(T) is reflexive.
If this is the case, the regions denoted by 7 and 8 in Fig. 1 an are void and the diagram looks like this
[ a b a , b 1 a c c , d 3 2 6 e 5 4 a b a , b 1 a c c , d 3 2 6 e 5 4 [[a,,b,,a","b],[,1,,,],[a,,c,c","d,3],[,2,(6)/(e),,],[,,,5,4]:}\left[\begin{array}{cccc|c}a & & b & & a, b \\ & 1 & & & \\ \hline a & & c & c, d & 3 \\ & 2 & \frac{6}{e} & & \\ & & & 5 & 4\end{array}\right.[aba,b1acc,d326e54
Fig. 2
It follows that a multivalued mapping Ψ : X → X Ψ : X → X Psi:X rarr X\Psi: X \rightarrow XΨ:X→X with X = dom X X = dom X X=dom XX=\operatorname{dom} XX=domX has a symmetrical and transitive graph ( satisfies the condition (c) ) if and only if T T TTT satisfies the condition (b) and G ( T ) G ( T ) G(T)G(T)G(T) is a reflexive relation.
The condition (b) leeds us to the definition of a multivalued mapping attached to T T TTT.
Let X X XXX be a nonvoid set and T : X → X T : X → X T:X rarr XT: X \rightarrow XT:X→X a multivalued mapping. We define T ~ : X → X T ~ : X → X tilde(T):X rarr X\tilde{T}: X \rightarrow XT~:X→X given by
T ~ ( x ) = { ⋂ ∈ T ( x ) y , for x ∈ X ∖ dom T T ~ ( x ) = ⋂ ∈ T ( x ) y ,  for  x ∈ X ∖ dom T tilde(T)(x)={[nnn in T(x)],[y","" for "x in X\\dom T]:}\tilde{T}(x)=\left\{\begin{array}{l} \bigcap \in T(x) \\ y, \text { for } x \in X \backslash \operatorname{dom} T \end{array}\right.T~(x)={⋂∈T(x)y, for x∈X∖domT
The the termes of T ~ T ~ tilde(T)\tilde{T}T~, the conditione (6) becomes T | F T ⊆ T | F T T F T ⊆ T F T T|_(F_(T))sube T|_(F_(T))\left.\left.T\right|_{F_{T}} \subseteq T\right|_{F_{T}}T|FT⊆T|FT.
If we consider a new condition
(P) T ⊆ T ~ T ⊆ T ~ T sube tilde(T)T \subseteq \tilde{T}T⊆T~
we obtain obviously that (f) implies (b).
If T = G : X → X T = G : X → X T=G:X rarr XT=G: X \rightarrow XT=G:X→X is a function, we have g N ( x ) = ( g ∘ g ) ( x ) g N ( x ) = ( g ∘ g ) ( x ) g^(N)(x)=(g@g)(x)g^{N}(x)=(g \circ g)(x)gN(x)=(g∘g)(x) for any x ∈ X x ∈ X x in Xx \in Xx∈X; the condition ( f ) ( f ) (f)(f)(f) is equivalent to g ( x ) = ( g ∘ g ) ( x ) g ( x ) = ( g ∘ g ) ( x ) g(x)=(g@g)(x)g(x)=(g \circ g)(x)g(x)=(g∘g)(x) for an any x ∈ X x ∈ X x in Xx \in Xx∈X, i.e. to Im g = F g Im g = F g Im g=F_(g)\operatorname{Im} g=F_{g}Img=Fg.
RMARK 3. If T T TTT is a multivalued mapping, we have only T ⊆ T ∘ T T ⊆ T ∘ T T sube T@TT \subseteq T \circ TT⊆T∘T on dom T T TTT, the inclusion being generally strict, as the following example shows. Let T : R → R T : R → R T:R rarr RT: R \rightarrow RT:R→R be given by T ( x ) = { 0 , x } T ( x ) = { 0 , x } T(x)={0,x}T(x)=\{0, x\}T(x)={0,x}; then T ⋅ T ( x ) == { 0 , x } ⇌ T ~ ( x ) = { 0 } T ⋅ T ( x ) == { 0 , x } ⇌ T ~ ( x ) = { 0 } T*T(x)=={0,x}⇌ tilde(T)(x)={0}T \cdot T(x)= =\{0, x\} \rightleftharpoons \tilde{T}(x)=\{0\}T⋅T(x)=={0,x}⇌T~(x)={0}, for any x ≠ 0 x ≠ 0 x!=0x \neq 0x≠0.
THEOREM 3. If T : X → X T : X → X T:X rarr XT: X \rightarrow XT:X→X satisfles the condition ( f ) ( f ) (f)(f)(f) we have Im T = F T ∗ T = F T ∗ T=F_(T)^(**)T=F_{T}{ }^{*}T=FT∗
Procif. We have obviously F T ⊆ Im T F T ⊆ Im T F_(T)sube Im TF_{T} \subseteq \operatorname{Im} TFT⊆ImT. Let y ∈ Im T y ∈ Im T y in Im Ty \in \operatorname{Im} Ty∈ImT and x ∈ X x ∈ X x in Xx \in Xx∈X such that y ∈ T ( x ) y ∈ T ( x ) y in T(x)y \in T(x)y∈T(x). Applying ( f ) ( f ) (f)(f)(f), we get y ∈ T ( x ) ⊆ T ~ ( x ) ≤ T ( y ) y ∈ T ( x ) ⊆ T ~ ( x ) ≤ T ( y ) y in T(x)sube tilde(T)(x) <= T(y)y \in T(x) \subseteq \tilde{T}(x) \leq T(y)y∈T(x)⊆T~(x)≤T(y) and y ∈ F T y ∈ F T y inF_(T)y \in F_{T}y∈FT. It follows that In T ⊆ F T T ⊆ F T T subeF_(T)T \subseteq \mathbb{F}_{T}T⊆FT, so Im T = F T Im T = F T Im T=F_(T)\operatorname{Im} T=\mathbb{F}_{T}ImT=FT holds.
REMARK 4. The reverse implication is not true. For the multivalued mapping T T TTT from Example 1 we have Im T = F T = [ − 1 , 1 ] Im T = F T = [ − 1 , 1 ] Im T=F_(T)=[-1,1]\operatorname{Im} T=F_{T}=[-1,1]ImT=FT=[−1,1], but T ( x ) = { { 0 } , x ∈ [ − 1 , 1 ] { 0 , 1 } , x ∈ R ∖ [ − 1 , 1 ] T ( x ) = { 0 } , x ∈ [ − 1 , 1 ] { 0 , 1 } , x ∈ R ∖ [ − 1 , 1 ] T(x)={[{0}","x in[-1","1]],[{0","1}","x in R\\[-1","1]]:}T(x)=\left\{\begin{array}{l}\{0\}, x \in[-1,1] \\ \{0,1\}, x \in R \backslash[-1,1]\end{array}\right.T(x)={{0},x∈[−1,1]{0,1},x∈R∖[−1,1], so T ⊈ T ~ T ⊈ T ~ T⊈ tilde(T)T \nsubseteq \tilde{T}T⊈T~.
The next theorem gives a condition for a point x ∈ X x ∈ X xinX\mathbf{x} \in \mathbf{X}x∈X be a fixed point for T.
THEOREM 4. The element x ∈ X x ∈ X x in Xx \in Xx∈X is a fixed point for T T TTT if and only if T ( x ) ⊆ T − 1 ( x ) T ( x ) ⊆ T − 1 ( x ) T(x)subeT^(-1)(x)T(x) \subseteq T^{-1}(x)T(x)⊆T−1(x).
Proof. Let x ∈ X x ∈ X x in Xx \in Xx∈X be a fixed point for T ~ T ~ tilde(T)\tilde{T}T~; if x ∈ dom T x ∈ dom T x in dom Tx \in \operatorname{dom} Tx∈domT, we have T ( x ) = ϕ ⊆ T − 1 ( x ) T ( x ) = ϕ ⊆ T − 1 ( x ) T(x)=phi subeT^(-1)(x)T(x)=\phi \subseteq T^{-1}(x)T(x)=ϕ⊆T−1(x). In the case that x ∈ x ∈ x inx \inx∈ dom T , T ( x ) T , T ( x ) T,T(x)T, T(x)T,T(x) is a nonvoid set; let y ∈ T ( x ) y ∈ T ( x ) y in T(x)y \in T(x)y∈T(x). It follows that x ∈ T ~ ( x ) ⊆ T ( y ) x ∈ T ~ ( x ) ⊆ T ( y ) x in tilde(T)(x)sube T(y)x \in \tilde{T}(x) \subseteq T(y)x∈T~(x)⊆T(y), i.e. y ∈ T − 1 ( x ) y ∈ T − 1 ( x ) y inT^(-1)(x)y \in T^{-1}(x)y∈T−1(x) and we obtain again T ( x ) ⊆ T − 1 ( x ) T ( x ) ⊆ T − 1 ( x ) T(x)subeT^(-1)(x)T(x) \subseteq T^{-1}(x)T(x)⊆T−1(x).
Let now x ∈ X x ∈ X x in Xx \in Xx∈X be a point such that T ( x ) ⊆ T − 1 ( x ) T ( x ) ⊆ T − 1 ( x ) T(x)subeT^(-1)(x)T(x) \subseteq T^{-1}(x)T(x)⊆T−1(x). If T ( x ) = ∅ T ( x ) = ∅ T(x)=O/T(x)=\emptysetT(x)=∅, we have T ( x ) = X T ( x ) = X T(x)=XT(x)=XT(x)=X and x x xxx is obviously a fixed point for T ~ T ~ tilde(T)\tilde{T}T~. But y y yyy was
arbitrary in T ( x ) T ( x ) T(x)T(x)T(x), so x ∈ ⋂ y ∈ T ( x ) T ( y ) = T ( x ) x ∈ ⋂ y ∈ T ( x )   T ( y ) = T ( x ) x innnn_(y in T(x))T(y)=T(x)x \in \underset{y \in T(x)}{\bigcap} T(y)=T(x)x∈⋂y∈T(x)T(y)=T(x), hence x ∈ F T x ∈ F T x inF_(T)x \in F_{T}x∈FT.
COROILARY. The fixed point set for T ~ T ~ tilde(T)\tilde{T}T~ is the largest subset of X X XXX on which G ( T ) G ( T ) G(T)G(T)G(T) is symmetrical.
Propf. F T = { x ∈ X : T ( x ) ⊆ T − 1 ( x ) } F T = x ∈ X : T ( x ) ⊆ T − 1 ( x ) F_(T)={x in X:T(x)subeT^(-1)(x)}F_{T}=\left\{x \in X: T(x) \subseteq T^{-1}(x)\right\}FT={x∈X:T(x)⊆T−1(x)}.
REMARK 5. Any strict fixed point for T T TTT is also a strict fixed point for T ~ T ~ widetilde(T)\widetilde{T}T~. The reverse implication is not true. Indeed, for T : R → R T : R → R T:R rarr RT: R \rightarrow RT:R→R given by
T ( x ) = { { − 1 , 1 } , x = 0 { 0 , − 2 } , x = − 1 { 0 , 2 } , x = 1 { x } , x ∈ R ∖ { 0 , − 1 , 1 } T ( x ) = { − 1 , 1 } , x = 0 { 0 , − 2 } , x = − 1 { 0 , 2 } , x = 1 { x } , x ∈ R ∖ { 0 , − 1 , 1 } T(x)={[{-1","1}","x=0],[{0","-2}","x=-1],[{0","2}","x=1],[{x}","x in R\\{0","-1","1}]:}T(x)=\left\{\begin{array}{l} \{-1,1\}, x=0 \\ \{0,-2\}, x=-1 \\ \{0,2\}, x=1 \\ \{x\}, x \in R \backslash\{0,-1,1\} \end{array}\right.T(x)={{−1,1},x=0{0,−2},x=−1{0,2},x=1{x},x∈R∖{0,−1,1}
we have T ~ ( 0 ) = T ( − 1 ) ∩ T ( 1 ) = { 0 } T ~ ( 0 ) = T ( − 1 ) ∩ T ( 1 ) = { 0 } tilde(T)(0)=T(-1)nn T(1)={0}\tilde{T}(0)=T(-1) \cap T(1)=\{0\}T~(0)=T(−1)∩T(1)={0}, so 0 ∈ ( S F ) T ~ 0 ∈ ( S F ) T ~ 0in(SF)_( tilde(T))0 \in(S F)_{\tilde{T}}0∈(SF)T~, but 0 ∉ ( S F ) T 0 ∉ ( S F ) T 0!in(SF)_(T)0 \notin(S F)_{T}0∉(SF)T.

REFWRENOES

  1. Purdea, I., Pic,Gh., Treatise of modern algebra, Vol. I, ED. Acad. R.S.R. 1977 (in Romanian)
  2. Rus, I.A., Fixed and strict fixed points for multivalued mappings, this Preprint
1985

Related Posts