Uniqueness of extension of semi-Lipschitz functions on quasi-metric spaces

Abstract

Authors

Costica Mustata
“Tiberiu Popoviciu” Institute of Numerical Analysis, Romanian Academy, Romania

Keywords

Paper coordinates

C. Mustăţa, Uniqueness of extension of semi-Lipschitz functions on quasi-metric spaces, Bul. Ştiinţ. Univ. Baia Mare, Seria B, Fascicola matematică-informatică, 16 (2000) no. 2, pp. 207-212.

PDF

About this paper

Journal

Bul. Stiint. Univ. Baia Mare

Publisher Name
Print ISSN
Online ISSN

google scholar link

[1] Cobzas, S., Mustata, C., Norm Preserving Extension of Convex Lipschitz Functions , J. Approx. Theory, 24 (1978), 555-564.
[2] Fletcher, P., Lindgren, W.F., Quasi-Uniform Spaces, Dekker, York, 1982.
[3] McShane, J. A,, Extension of range of functions, Bull. Amer. Math. Soc. 40(1934) 837-842.
[4] Mustata, C., Best Approximation and Unique Extension of Lipschitz Functions, J. Approx. Theory 19(1977), 222-230.
[5] Mustata, C., On the Extension of Semi-Lipschitz Functions on Quasi-Metric Space (to appear).
[6] Romaguera, S., Sanchis, M., Semi-Lipschitz Functions and Best Approximation in Quasi-Metric Spaces, J. Approx. Theory 103 (2000) 292-301.
[7] Wells, J.H., Williams, L.R., Embeddings and Extensions in Analysis, Springer- Verlag, Berlin 1975.

Paper (preprint) in HTML form

2000-Mustata-Bul.-Stiint.-Univ.-Baia-Mare-Uniqueness-of-the-extension-of-semi-Lipschitz 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; }

Dedicated to Maria S. Pop on her 60 th 60 th  60^("th ")60^{\text {th }}60th  anniversary

UNIQUENESS OF THE EXTENSION OF SEMI-LIPSCHITZ FUNCTIONS ON QUASI - METRIC SPACES

Costică MUSTĂTA

Let X X XXX be a nonvoid set and d : X × X → [ 0 , ∞ ) d : X × X → [ 0 , ∞ ) d:X xx X rarr[0,oo)d: X \times X \rightarrow[0, \infty)d:X×X→[0,∞) a function satisfying the following conditions:
(i) d ( x , y ) = 0 ⟺ x = y d ( x , y ) = 0 ⟺ x = y d(x,y)=0Longleftrightarrow x=yd(x, y)=0 \Longleftrightarrow x=yd(x,y)=0⟺x=y
(ii) d ( x , y ) ≤ d ( x , z ) + d ( z , y ) d ( x , y ) ≤ d ( x , z ) + d ( z , y ) d(x,y) <= d(x,z)+d(z,y)d(x, y) \leq d(x, z)+d(z, y)d(x,y)≤d(x,z)+d(z,y)
for all x , y , z ∈ X x , y , z ∈ X x,y,z in Xx, y, z \in Xx,y,z∈X. We call d d ddd a quasi-metric on X X XXX and the pair ( X , d X , d X,dX, dX,d ), a quasimetric space. Remark that the main difference with respect to a metric is the symmetry condition, d ( x , y ) = d ( y , x ) d ( x , y ) = d ( y , x ) d(x,y)=d(y,x)d(x, y)=d(y, x)d(x,y)=d(y,x), which is not satisfied by a quasimetric.
The conjugate of a quasi-metric d d ddd,denoted by d − 1 d − 1 d^(-1)d^{-1}d−1 is defined by
(1) d − 1 ( x , y ) = d ( y , x ) (1) d − 1 ( x , y ) = d ( y , x ) {:(1)d^(-1)(x","y)=d(y","x):}\begin{equation*} d^{-1}(x, y)=d(y, x) \tag{1} \end{equation*}(1)d−1(x,y)=d(y,x)
for all x , y ∈ X x , y ∈ X x,y in Xx, y \in Xx,y∈X. Obviously, that the mapping d s : X × X → [ 0 , ∞ ) d s : X × X → [ 0 , ∞ ) d^(s):X xx X rarr[0,oo)d^{s}: X \times X \rightarrow[0, \infty)ds:X×X→[0,∞) defined by
(2) d s ( x , y ) = max { d ( x , y ) , d − 1 ( x , y ) } , x , y ∈ X (2) d s ( x , y ) = max d ( x , y ) , d − 1 ( x , y ) , x , y ∈ X {:(2)d^(s)(x","y)=max{d(x,y),d^(-1)(x,y)}","x","y in X:}\begin{equation*} d^{s}(x, y)=\max \left\{d(x, y), d^{-1}(x, y)\right\}, x, y \in X \tag{2} \end{equation*}(2)ds(x,y)=max{d(x,y),d−1(x,y)},x,y∈X
is a metric on X X XXX, i.e. d s d s d^(s)d^{s}ds satisfies the conditions (i), (ii) and the symmetry condition:
(iii) d s ( x , y ) = d s ( y , x ) , x , y ∈ X (iii) d s ( x , y ) = d s ( y , x ) , x , y ∈ X {:(iii)d^(s)(x","y)=d^(s)(y","x)","quad x","y in X:}\begin{equation*} d^{s}(x, y)=d^{s}(y, x), \quad x, y \in X \tag{iii} \end{equation*}(iii)ds(x,y)=ds(y,x),x,y∈X
A function f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R,defined on a quasi-metric space ( X , d X , d X,dX, dX,d ) is called semi-Lipschitz provided there exists a number K ≥ 0 K ≥ 0 K >= 0K \geq 0K≥0 such that
(3) f ( x ) − f ( y ) ≤ K d ( x , y ) (3) f ( x ) − f ( y ) ≤ K d ( x , y ) {:(3)f(x)-f(y) <= Kd(x","y):}\begin{equation*} f(x)-f(y) \leq K d(x, y) \tag{3} \end{equation*}(3)f(x)−f(y)≤Kd(x,y)
for all x , y ∈ X x , y ∈ X x,y in Xx, y \in Xx,y∈X. A function f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R is called ≤ d − ≤ d − <= _(d^(-))\leq_{d^{-}}≤d−increasing if
(3a) d ( x , y ) = 0 ⟹ f ( x ) − f ( y ) ≤ 0 (3a) d ( x , y ) = 0 ⟹ f ( x ) − f ( y ) ≤ 0 {:(3a)d(x","y)=0Longrightarrow f(x)-f(y) <= 0:}\begin{equation*} d(x, y)=0 \Longrightarrow f(x)-f(y) \leq 0 \tag{3a} \end{equation*}(3a)d(x,y)=0⟹f(x)−f(y)≤0
for all x , y ∈ X x , y ∈ X x,y in Xx, y \in Xx,y∈X.
The definition of ≤ d ≤ d <= _(d)\leq_{d}≤d - increasing function f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R is consistent for T 0 T 0 T_(0)T_{0}T0 - separated quasi-metric space ( X , d ) ( X , d ) (X,d)(X, d)(X,d) (see [6]). In this note the quasi-metric space ( X . d X . d X.dX . dX.d ) is T 1 T 1 T_(1)T_{1}T1 - separated (see the condition (i) and (ii)).
Since d ( x , y ) = 0 ⟺ x = y d ( x , y ) = 0 ⟺ x = y d(x,y)=0Longleftrightarrow x=yd(x, y)=0 \Longleftrightarrow x=yd(x,y)=0⟺x=y, it follows that f ( x ) ≤ f ( y ) f ( x ) ≤ f ( y ) f(x) <= f(y)f(x) \leq f(y)f(x)≤f(y) for any function f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R i.e. any real - valued function on a quasi - metric space X X XXX is ≤ d ≤ d <= _(d)\leq_{d}≤d - increasing.
Theorem 1 Let f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R be such that
(4) ‖ f ‖ d = sup { ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) : x , y ∈ X , d ( x , y ) > 0 } < ∞ (4) ‖ f ‖ d = sup ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) : x , y ∈ X , d ( x , y ) > 0 < ∞ {:(4)||f||_(d)=s u p{((f(x)-f(y))vv0)/(d(x,y)):x,y in X,d(x,y) > 0} < oo:}\begin{equation*} \|f\|_{d}=\sup \left\{\frac{(f(x)-f(y)) \vee 0}{d(x, y)}: x, y \in X, d(x, y)>0\right\}<\infty \tag{4} \end{equation*}(4)‖f‖d=sup{(f(x)−f(y))∨0d(x,y):x,y∈X,d(x,y)>0}<∞
Then f f fff satisfies the inequality
(5) f ( x ) − f ( y ) ≤ ‖ f ‖ d ⋅ d ( x , y ) , ∀ x , y ∈ X (5) f ( x ) − f ( y ) ≤ ‖ f ‖ d ⋅ d ( x , y ) , ∀ x , y ∈ X {:(5)f(x)-f(y) <= ||f||_(d)*d(x","y)","AA x","y in X:}\begin{equation*} f(x)-f(y) \leq\|f\|_{d} \cdot d(x, y), \forall x, y \in X \tag{5} \end{equation*}(5)f(x)−f(y)≤‖f‖d⋅d(x,y),∀x,y∈X
and ‖ f ‖ d ‖ f ‖ d ||f||_(d)\|f\|_{d}‖f‖d is the smallest constant for which the inequality (3) holds.
P roof. nce f f fff is ≤ d ≤ d <= _(d)\leq_{d}≤d - increasing (see (3a)) it follows that f ( x ) − f ( y ) > 0 f ( x ) − f ( y ) > 0 f(x)-f(y) > 0f(x)-f(y)>0f(x)−f(y)>0 implies d ( x , y ) > 0 d ( x , y ) > 0 d(x,y) > 0d(x, y)>0d(x,y)>0. But then
f ( x ) − f ( y ) d ( x , y ) > 0 and ‖ f ‖ d = sup d ( x , y ) > 0 ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) ≥ f ( x ) − f ( y d ( x , y ) f ( x ) − f ( y ) d ( x , y ) > 0  and  ‖ f ‖ d = sup d ( x , y ) > 0   ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) ≥ f ( x ) − f ( y d ( x , y ) (f(x)-f(y))/(d(x,y)) > 0" and "||f||_(d)=s u p_(d(x,y) > 0)((f(x)-f(y))vv0)/(d(x,y)) >= (f(x)-f(y)/(d(x,y))\frac{f(x)-f(y)}{d(x, y)}>0 \text { and }\|f\|_{d}=\sup _{d(x, y)>0} \frac{(f(x)-f(y)) \vee 0}{d(x, y)} \geq \frac{f(x)-f(y}{d(x, y)}f(x)−f(y)d(x,y)>0 and ‖f‖d=supd(x,y)>0(f(x)−f(y))∨0d(x,y)≥f(x)−f(yd(x,y)
implying
f ( x ) − f ( y ) ≤ ‖ f ‖ d ⋅ d ( x , y ) . f ( x ) − f ( y ) ≤ ‖ f ‖ d ⋅ d ( x , y ) . f(x)-f(y) <= ||f||_(d)*d(x,y).f(x)-f(y) \leq\|f\|_{d} \cdot d(x, y) .f(x)−f(y)≤‖f‖d⋅d(x,y).
If f ( x ) − f ( y ) ≤ 0 f ( x ) − f ( y ) ≤ 0 f(x)-f(y) <= 0f(x)-f(y) \leq 0f(x)−f(y)≤0 then
( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) = 0 ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) = 0 ((f(x)-f(y))vv0)/(d(x,y))=0\frac{(f(x)-f(y)) \vee 0}{d(x, y)}=0(f(x)−f(y))∨0d(x,y)=0
implying f ( x ) − f ( y ) ≤ ‖ f ‖ d ⋅ d ( x , y ) f ( x ) − f ( y ) ≤ ‖ f ‖ d ⋅ d ( x , y ) f(x)-f(y) <= ||f||_(d)*d(x,y)f(x)-f(y) \leq\|f\|_{d} \cdot d(x, y)f(x)−f(y)≤‖f‖d⋅d(x,y).
Let now K ≥ 0 K ≥ 0 K >= 0K \geq 0K≥0 be such that
f ( x ) − f ( y ) ≤ K ⋅ d ( x , y ) f ( x ) − f ( y ) ≤ K ⋅ d ( x , y ) f(x)-f(y) <= K*d(x,y)f(x)-f(y) \leq K \cdot d(x, y)f(x)−f(y)≤K⋅d(x,y)
for all x , y ∈ X x , y ∈ X x,y in Xx, y \in Xx,y∈X. Then f f fff is ≤ d ≤ d <= _(d)\leq_{d}≤d - increasing and
( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) = f ( x ) − f ( y ) d ( x , y ) ≤ K if f ( x ) − f ( y ) > 0 ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) = f ( x ) − f ( y ) d ( x , y ) ≤ K  if  f ( x ) − f ( y ) > 0 ((f(x)-f(y))vv0)/(d(x,y))=(f(x)-f(y))/(d(x,y)) <= K quad" if "quad f(x)-f(y) > 0\frac{(f(x)-f(y)) \vee 0}{d(x, y)}=\frac{f(x)-f(y)}{d(x, y)} \leq K \quad \text { if } \quad f(x)-f(y)>0(f(x)−f(y))∨0d(x,y)=f(x)−f(y)d(x,y)≤K if f(x)−f(y)>0
and
( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) = 0 ≤ K if f ( x ) − f ( y ) ≤ 0 . ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) = 0 ≤ K  if  f ( x ) − f ( y ) ≤ 0 . ((f(x)-f(y))vv0)/(d(x,y))=0 <= K quad" if "quad f(x)-f(y) <= 0.\frac{(f(x)-f(y)) \vee 0}{d(x, y)}=0 \leq K \quad \text { if } \quad f(x)-f(y) \leq 0 .(f(x)−f(y))∨0d(x,y)=0≤K if f(x)−f(y)≤0.
Consequently, ‖ f ‖ d ≤ K ‖ f ‖ d ≤ K ||f||_(d) <= K\|f\|_{d} \leq K‖f‖d≤K.
Denoting by SLip X X XXX the set of all real - valued semi - Lipschitz functions defined on a quasi - metric space ( X , d X , d X,dX, dX,d ) we have
(6) SLip X = { f : X → R , sup d ( x , y ) > 0 ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) < ∞ } (6)  SLip  X = f : X → R , sup d ( x , y ) > 0   ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) < ∞ {:(6)" SLip "X={f:X rarrR,s u p_(d(x,y) > 0)((f(x)-f(y))vv0)/(d(x,y)) < oo}:}\begin{equation*} \text { SLip } X=\left\{f: X \rightarrow \mathbb{R}, \sup _{d(x, y)>0} \frac{(f(x)-f(y)) \vee 0}{d(x, y)}<\infty\right\} \tag{6} \end{equation*}(6) SLip X={f:X→R,supd(x,y)>0(f(x)−f(y))∨0d(x,y)<∞}
Let Y ⊂ X , Y ≠ ∅ Y ⊂ X , Y ≠ ∅ Y sub X,Y!=O/Y \subset X, Y \neq \emptysetY⊂X,Y≠∅, where ( X , d ) ( X , d ) (X,d)(X, d)(X,d) is a quasi - metric space. It follows that ( Y , d Y , d Y,dY, dY,d ) is a quasi - metric space, too, and let's denote by SLip Y Y YYY the set of all semi - Lipschitz functions on Y Y YYY.
The following extension problem arises naturally: for f ∈ S L i p Y f ∈ S L i p Y f in SLipYf \in S L i p Yf∈SLipY find F ∈ F ∈ F inF \inF∈ SLip X X XXX such that
(7) F | Y = f and ‖ F ‖ d = ‖ f ‖ d (7) F Y = f  and  ‖ F ‖ d = ‖ f ‖ d {:(7)F|_(Y)=f" and "||F||_(d)=||f||_(d):}\begin{equation*} \left.F\right|_{Y}=f \text { and }\|F\|_{d}=\|f\|_{d} \tag{7} \end{equation*}(7)F|Y=f and ‖F‖d=‖f‖d
The answer is affirmative. In [5] it was shown that the functions
(8) F ( x ) = inf y ∈ Y [ f ( y ) + ‖ f ‖ d ⋅ d ( x , y ) ] , x ∈ X (8) F ( x ) = inf y ∈ Y   f ( y ) + ‖ f ‖ d ⋅ d ( x , y ) , x ∈ X {:(8)F(x)=i n f_(y in Y)[f(y)+||f||_(d)*d(x,y)]","x in X:}\begin{equation*} F(x)=\inf _{y \in Y}\left[f(y)+\|f\|_{d} \cdot d(x, y)\right], x \in X \tag{8} \end{equation*}(8)F(x)=infy∈Y[f(y)+‖f‖d⋅d(x,y)],x∈X
(9) G ( x ) = sup y ∈ Y [ f ( y ) − ‖ f ‖ d ⋅ d − 1 ( x , y ) ] , x ∈ X (9) G ( x ) = sup y ∈ Y   f ( y ) − ‖ f ‖ d ⋅ d − 1 ( x , y ) , x ∈ X {:(9)G(x)=s u p_(y in Y)[f(y)-||f||_(d)*d^(-1)(x,y)]","x in X:}\begin{equation*} G(x)=\sup _{y \in Y}\left[f(y)-\|f\|_{d} \cdot d^{-1}(x, y)\right], x \in X \tag{9} \end{equation*}(9)G(x)=supy∈Y[f(y)−‖f‖d⋅d−1(x,y)],x∈X
satisfy the equalities
F | Y = G | Y = f and ‖ F ‖ d = ‖ G ‖ d = ‖ f ‖ d . F Y = G Y = f  and  ‖ F ‖ d = ‖ G ‖ d = ‖ f ‖ d . F|_(Y)=G|_(Y)=f quad" and "quad||F||_(d)=||G||_(d)=||f||_(d).\left.F\right|_{Y}=\left.G\right|_{Y}=f \quad \text { and } \quad\|F\|_{d}=\|G\|_{d}=\|f\|_{d} .F|Y=G|Y=f and ‖F‖d=‖G‖d=‖f‖d.
In other words, for any f ∈ S L i p Y f ∈ S L i p Y f in SLipYf \in S L i p Yf∈SLipY the set
(10) E Y d ( f ) := { H ∈ S Lip X : H | Y = f and ‖ H ‖ d = ‖ f ‖ d } (10) E Y d ( f ) := H ∈ S Lip X : H Y = f  and  ‖ H ‖ d = ‖ f ‖ d {:(10)E_(Y)^(d)(f):={H in S Lip X:H|_(Y)=f quad" and "quad||H||_(d)=||f||_(d)}:}\begin{equation*} E_{Y}^{d}(f):=\left\{H \in S \operatorname{Lip} X:\left.H\right|_{Y}=f \quad \text { and } \quad\|H\|_{d}=\|f\|_{d}\right\} \tag{10} \end{equation*}(10)EYd(f):={H∈SLipX:H|Y=f and ‖H‖d=‖f‖d}
of all extensions of f f fff which preserve the smallest Lipschitz constant is nonvoid.
Concerning the unicity of the extension ( card E Y d ( f ) = 1 card E Y d ( f ) = 1 cardE_(Y)^(d)(f)=1\operatorname{card} E_{Y}^{d}(f)=1cardEYd(f)=1 ) one can prove:
Theorem 2 Let ( X , d ) ( X , d ) (X,d)(X, d)(X,d) be a quasi-metric space, Y ⊂ X Y ⊂ X Y sub XY \subset XY⊂X and f ∈ S L i p Y f ∈ S L i p Y f in SLipYf \in S L i p Yf∈SLipY. Then
a) For every H ∈ E Y d ( f ) H ∈ E Y d ( f ) H inE_(Y)^(d)(f)H \in E_{Y}^{d}(f)H∈EYd(f) the following inequalities hold:
(11) G ( x ) ≤ H ( x ) ≤ F ( x ) , x ∈ X (11) G ( x ) ≤ H ( x ) ≤ F ( x ) , x ∈ X {:(11)G(x) <= H(x) <= F(x)","quad x in X:}\begin{equation*} G(x) \leq H(x) \leq F(x), \quad x \in X \tag{11} \end{equation*}(11)G(x)≤H(x)≤F(x),x∈X
where the functions F , G F , G F,GF, GF,G are defined by (8), (9);
b) card E Y d ( f ) = 1 E Y d ( f ) = 1 E_(Y)^(d)(f)=1E_{Y}^{d}(f)=1EYd(f)=1 if and only if
(12) sup y ∈ Y [ f ( y ) − ‖ f ‖ d d − 1 ( x , y ) ] = inf y ∈ Y [ f ( y ) + ‖ f ‖ d d ( x , y ) ] (12) sup y ∈ Y   f ( y ) − ‖ f ‖ d d − 1 ( x , y ) = inf y ∈ Y   f ( y ) + ‖ f ‖ d d ( x , y ) {:(12)s u p_(y in Y)[f(y)-||f||_(d)d^(-1)(x,y)]=i n f_(y in Y)[f(y)+||f||_(d)d(x,y)]:}\begin{equation*} \sup _{y \in Y}\left[f(y)-\|f\|_{d} d^{-1}(x, y)\right]=\inf _{y \in Y}\left[f(y)+\|f\|_{d} d(x, y)\right] \tag{12} \end{equation*}(12)supy∈Y[f(y)−‖f‖dd−1(x,y)]=infy∈Y[f(y)+‖f‖dd(x,y)]
for all x ∈ X x ∈ X x in Xx \in Xx∈X.
P roof. t H ∈ E Y d ( f ) H ∈ E Y d ( f ) H inE_(Y)^(d)(f)H \in E_{Y}^{d}(f)H∈EYd(f). Then we have for every x ∈ X x ∈ X x in Xx \in Xx∈X and y ∈ Y y ∈ Y y in Yy \in Yy∈Y :
H ( x ) − H ( y ) ≤ ‖ f ‖ d d ( x , y ) H ( y ) − H ( x ) ≤ ‖ f ‖ d d ( y , x ) = ‖ f ‖ d ⋅ d − 1 ( x , y ) . H ( x ) − H ( y ) ≤ ‖ f ‖ d d ( x , y ) H ( y ) − H ( x ) ≤ ‖ f ‖ d d ( y , x ) = ‖ f ‖ d ⋅ d − 1 ( x , y ) . {:[H(x)-H(y) <= ||f||_(d)d(x","y)],[H(y)-H(x) <= ||f||_(d)d(y","x)=||f||_(d)*d^(-1)(x","y).]:}\begin{aligned} & H(x)-H(y) \leq\|f\|_{d} d(x, y) \\ & H(y)-H(x) \leq\|f\|_{d} d(y, x)=\|f\|_{d} \cdot d^{-1}(x, y) . \end{aligned}H(x)−H(y)≤‖f‖dd(x,y)H(y)−H(x)≤‖f‖dd(y,x)=‖f‖d⋅d−1(x,y).
The first inequality implies
H ( x ) ≤ H ( y ) + ‖ f ‖ d ⋅ d ( x , y ) = f ( y ) + ‖ f ‖ d d ( x , y ) H ( x ) ≤ H ( y ) + ‖ f ‖ d ⋅ d ( x , y ) = f ( y ) + ‖ f ‖ d d ( x , y ) H(x) <= H(y)+||f||_(d)*d(x,y)=f(y)+||f||_(d)d(x,y)H(x) \leq H(y)+\|f\|_{d} \cdot d(x, y)=f(y)+\|f\|_{d} d(x, y)H(x)≤H(y)+‖f‖d⋅d(x,y)=f(y)+‖f‖dd(x,y)
and, taking the infimum with respect to y ∈ Y y ∈ Y y in Yy \in Yy∈Y, we have
H ( x ) ≤ F ( x ) , x ∈ X . H ( x ) ≤ F ( x ) , x ∈ X . H(x) <= F(x),quad x in X.H(x) \leq F(x), \quad x \in X .H(x)≤F(x),x∈X.
Similarly, we get
H ( x ) ≥ H ( y ) − ‖ f ‖ d d − 1 ( x , y ) = f ( y ) − ‖ f ‖ d d − 1 ( x , y ) . H ( x ) ≥ H ( y ) − ‖ f ‖ d d − 1 ( x , y ) = f ( y ) − ‖ f ‖ d d − 1 ( x , y ) . H(x) >= H(y)-||f||_(d)d^(-1)(x,y)=f(y)-||f||_(d)d^(-1)(x,y).H(x) \geq H(y)-\|f\|_{d} d^{-1}(x, y)=f(y)-\|f\|_{d} d^{-1}(x, y) .H(x)≥H(y)−‖f‖dd−1(x,y)=f(y)−‖f‖dd−1(x,y).
Taking the supremum with respect to y ∈ Y y ∈ Y y in Yy \in Yy∈Y one obtains
H ( x ) ≥ G ( x ) , x ∈ X . H ( x ) ≥ G ( x ) , x ∈ X . H(x) >= G(x),quad x in X.H(x) \geq G(x), \quad x \in X .H(x)≥G(x),x∈X.
The assertion b) is a direct consequence of the inequalities (11).
Remark. 1 0 1 0 1^(0)1^{0}10. If the function f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R is constant on X X XXX then ‖ f ‖ d = 0 ‖ f ‖ d = 0 ||f||_(d)=0\|f\|_{d}=0‖f‖d=0, and the equality (12) holds.
Consider on R R R\mathbb{R}R de quasi-metric
d ( x , y ) = { x − y , x ≥ y 0 , x < y d ( x , y ) = x − y , x ≥ y 0 , x < y d(x,y)={[x-y",",x >= y],[0",",x < y]:}d(x, y)=\left\{\begin{array}{cc} x-y, & x \geq y \\ 0, & x<y \end{array}\right.d(x,y)={x−y,x≥y0,x<y
and let Y = [ 0 , 1 ] Y = [ 0 , 1 ] Y=[0,1]Y=[0,1]Y=[0,1] and f ( y ) = 2 y , y ∈ Y f ( y ) = 2 y , y ∈ Y f(y)=2y,y in Yf(y)=2 y, y \in Yf(y)=2y,y∈Y.Then ‖ f ‖ d = 2 ‖ f ‖ d = 2 ||f||_(d)=2\|f\|_{d}=2‖f‖d=2 and the extremal extensions F , G F , G F,GF, \mathrm{G}F,G are
F ( x ) = { 2 x < 0 2 x x ≥ 0 and G ( x ) = { 2 x x ≤ 1 0 x > 1 F ( x ) = 2 x < 0 2 x x ≥ 0  and  G ( x ) = 2 x x ≤ 1 0 x > 1 F(x)={[2,x < 0],[2x,x >= 0]quad" and "quad G(x)={[2x,x <= 1],[0,x > 1]:}F(x)=\left\{\begin{array}{cc} 2 & x<0 \\ 2 x & x \geq 0 \end{array} \quad \text { and } \quad G(x)=\left\{\begin{array}{cc} 2 x & x \leq 1 \\ 0 & x>1 \end{array}\right.\right.F(x)={2x<02xx≥0 and G(x)={2xx≤10x>1
which are distinct.
2 0 2 0 2^(0)2^{0}20. By Theorem 2, if f ∈ S L i p Y f ∈ S L i p Y f in SLipYf \in S L i p Yf∈SLipY has a unique extension then the equality (12) holds and, since
inf y ∈ Y [ f ( y ) + ‖ f ‖ d ⋅ d ( x , y ) ] ≥ inf y ∈ Y f ( y ) + ‖ f ‖ d ⋅ d ( x , Y ) sup y ∈ Y [ f ( y ) − ‖ f ‖ d ⋅ d − 1 ( x , y ) ] ≤ sup y ∈ Y f ( y ) − ‖ f ‖ d ⋅ d − 1 ( x , Y ) inf y ∈ Y   f ( y ) + ‖ f ‖ d ⋅ d ( x , y ) ≥ inf y ∈ Y   f ( y ) + ‖ f ‖ d ⋅ d ( x , Y ) sup y ∈ Y   f ( y ) − ‖ f ‖ d ⋅ d − 1 ( x , y ) ≤ sup y ∈ Y   f ( y ) − ‖ f ‖ d ⋅ d − 1 ( x , Y ) {:[i n f_(y in Y)[f(y)+||f||_(d)*d(x,y)] >= i n f_(y in Y)f(y)+||f||_(d)*d(x","Y)],[s u p_(y in Y)[f(y)-||f||_(d)*d^(-1)(x,y)] <= s u p_(y in Y)f(y)-||f||_(d)*d^(-1)(x","Y)]:}\begin{aligned} \inf _{y \in Y}\left[f(y)+\|f\|_{d} \cdot d(x, y)\right] & \geq \inf _{y \in Y} f(y)+\|f\|_{d} \cdot d(x, Y) \\ \sup _{y \in Y}\left[f(y)-\|f\|_{d} \cdot d^{-1}(x, y)\right] & \leq \sup _{y \in Y} f(y)-\|f\|_{d} \cdot d^{-1}(x, Y) \end{aligned}infy∈Y[f(y)+‖f‖d⋅d(x,y)]≥infy∈Yf(y)+‖f‖d⋅d(x,Y)supy∈Y[f(y)−‖f‖d⋅d−1(x,y)]≤supy∈Yf(y)−‖f‖d⋅d−1(x,Y)
where
d ( x , Y ) = inf { d ( x , y ) : y ∈ Y } d ( x , Y ) = inf { d ( x , y ) : y ∈ Y } d(x,Y)=i n f{d(x,y):y in Y}d(x, Y)=\inf \{d(x, y): y \in Y\}d(x,Y)=inf{d(x,y):y∈Y}
and
d − 1 ( x , Y ) = inf { d ( y , x ) : y ∈ Y } d − 1 ( x , Y ) = inf { d ( y , x ) : y ∈ Y } d^(-1)(x,Y)=i n f{d(y,x):y in Y}d^{-1}(x, Y)=\inf \{d(y, x): y \in Y\}d−1(x,Y)=inf{d(y,x):y∈Y}
we obtain the inequality
(13) d ( x , Y ) + d − 1 ( x , Y ) ≤ 1 ‖ f ‖ d ( sup y ∈ Y f ( y ) − inf y ∈ Y f ( y ) ) (13) d ( x , Y ) + d − 1 ( x , Y ) ≤ 1 ‖ f ‖ d sup y ∈ Y   f ( y ) − inf y ∈ Y   f ( y ) {:(13)d(x","Y)+d^(-1)(x","Y) <= (1)/(||f||_(d))(s u p_(y in Y)f(y)-i n f_(y in Y)f(y)):}\begin{equation*} d(x, Y)+d^{-1}(x, Y) \leq \frac{1}{\|f\|_{d}}\left(\sup _{y \in Y} f(y)-\inf _{y \in Y} f(y)\right) \tag{13} \end{equation*}(13)d(x,Y)+d−1(x,Y)≤1‖f‖d(supy∈Yf(y)−infy∈Yf(y))
Theorem 3 Let ( X , d ) ( X , d ) (X,d)(X, d)(X,d) be a quasi-metric space and Y ⊂ X , Y ≠ X Y ⊂ X , Y ≠ X Y sub X,Y!=XY \subset X, Y \neq XY⊂X,Y≠X, containing at least one cluster point. If each function f ∈ S L i p Y f ∈ S L i p Y f in SLipYf \in S L i p Yf∈SLipY has a unique extension then Y ¯ = X Y ¯ = X bar(Y)=X\bar{Y}=XY¯=X.
P P P\mathbf{P}P roof. t y 0 ∈ Y t y 0 ∈ Y ty_(0)in Y\mathrm{t} y_{0} \in Yty0∈Y be a cluster point of the set Y Y YYY and let y n ∈ Y ∖ { y 0 } y n ∈ Y ∖ y 0 y_(n)in Y\\{y_(0)}y_{n} \in Y \backslash\left\{y_{0}\right\}yn∈Y∖{y0}, n = 1 , 2 … n = 1 , 2 … n=1,2dotsn=1,2 \ldotsn=1,2…, be such that lim n → ∞ d ( y n , y 0 ) = 0 lim n → ∞   d y n , y 0 = 0 lim_(n rarr oo)d(y_(n),y_(0))=0\lim _{n \rightarrow \infty} d\left(y_{n}, y_{0}\right)=0limn→∞d(yn,y0)=0.
Claim: There exists x 0 ∈ X x 0 ∈ X x_(0)in Xx_{0} \in Xx0∈X such that d ( x 0 , y 0 ) > 0 d x 0 , y 0 > 0 d(x_(0),y_(0)) > 0d\left(x_{0}, y_{0}\right)>0d(x0,y0)>0 and d ( x 0 , y n ) > 0 d x 0 , y n > 0 d(x_(0),y_(n)) > 0d\left(x_{0}, y_{n}\right)>0d(x0,yn)>0, n = 1 , 2 , … n = 1 , 2 , … n=1,2,dotsn=1,2, \ldotsn=1,2,….
Indeed, if contrary, then for every x ∈ X , d ( x , y 0 ) = 0 x ∈ X , d x , y 0 = 0 x in X,d(x,y_(0))=0x \in X, d\left(x, y_{0}\right)=0x∈X,d(x,y0)=0 or d ( x , y n ) = 0 d x , y n = 0 d(x,y_(n))=0d\left(x, y_{n}\right)=0d(x,yn)=0 for all n ∈ N n ∈ N n inNn \in \mathbb{N}n∈N.In the first case x = y 0 ∈ Y x = y 0 ∈ Y x=y_(0)in Yx=y_{0} \in Yx=y0∈Y and in the second x = y n ∈ Y x = y n ∈ Y x=y_(n)in Yx=y_{n} \in Yx=yn∈Y.It follows Y = X Y = X Y=XY=XY=X, a contradiction.
Consider the function f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R defined by
f ( x ) = d ( x , y 0 ) − d ( x 0 , y 0 ) , x ∈ X f ( x ) = d x , y 0 − d x 0 , y 0 , x ∈ X f(x)=d(x,y_(0))-d(x_(0),y_(0)),x in Xf(x)=d\left(x, y_{0}\right)-d\left(x_{0}, y_{0}\right), x \in Xf(x)=d(x,y0)−d(x0,y0),x∈X
We have
f ( y 0 ) = d ( y 0 , y 0 ) − d ( x 0 , y 0 ) = − d ( x 0 , y 0 ) < 0 f ( y n ) = d ( y n , y 0 ) − d ( x 0 , y 0 ) > − d ( x 0 , y 0 ) f y 0 = d y 0 , y 0 − d x 0 , y 0 = − d x 0 , y 0 < 0 f y n = d y n , y 0 − d x 0 , y 0 > − d x 0 , y 0 {:[f(y_(0))=d(y_(0),y_(0))-d(x_(0),y_(0))=-d(x_(0),y_(0)) < 0],[f(y_(n))=d(y_(n),y_(0))-d(x_(0),y_(0)) > -d(x_(0),y_(0))]:}\begin{aligned} & f\left(y_{0}\right)=d\left(y_{0}, y_{0}\right)-d\left(x_{0}, y_{0}\right)=-d\left(x_{0}, y_{0}\right)<0 \\ & f\left(y_{n}\right)=d\left(y_{n}, y_{0}\right)-d\left(x_{0}, y_{0}\right)>-d\left(x_{0}, y_{0}\right) \end{aligned}f(y0)=d(y0,y0)−d(x0,y0)=−d(x0,y0)<0f(yn)=d(yn,y0)−d(x0,y0)>−d(x0,y0)
for all n = 1 , 2 , … n = 1 , 2 , … n=1,2,dotsn=1,2, \ldotsn=1,2,…. Define the sequence of functions φ n : f ( X ) → [ 0 , 1 ] φ n : f ( X ) → [ 0 , 1 ] varphi_(n):f(X)rarr[0,1]\varphi_{n}: f(X) \rightarrow[0,1]φn:f(X)→[0,1] by
φ n ( t ) = { 1 if t < f ( y 0 ) f ( y n ) − t f ( y n ) − f ( y 0 ) t ∈ [ f ( y 0 ) , f ( y n ) ] 0 t > f ( y n ) φ n ( t ) = 1       if  t < f y 0 f y n − t f y n − f y 0      t ∈ f y 0 , f y n 0      t > f y n varphi_(n)(t)={[1," if "t < f(y_(0))],[(f(y_(n))-t)/(f(y_(n))-f(y_(0))),t in[f(y_(0)),f(y_(n))]],[0,t > f(y_(n))]:}\varphi_{n}(t)= \begin{cases}1 & \text { if } t<f\left(y_{0}\right) \\ \frac{f\left(y_{n}\right)-t}{f\left(y_{n}\right)-f\left(y_{0}\right)} & t \in\left[f\left(y_{0}\right), f\left(y_{n}\right)\right] \\ 0 & t>f\left(y_{n}\right)\end{cases}φn(t)={1 if t<f(y0)f(yn)−tf(yn)−f(y0)t∈[f(y0),f(yn)]0t>f(yn)
The function Ψ n = φ n ∘ f : X → R , n = 1 , 2 , … Ψ n = φ n ∘ f : X → R , n = 1 , 2 , … Psi_(n)=varphi_(n)@f:X rarrR,n=1,2,dots\Psi_{n}=\varphi_{n} \circ f: X \rightarrow \mathbb{R}, n=1,2, \ldotsΨn=φn∘f:X→R,n=1,2,…, satisfy
‖ Ψ n ‖ d ≥ ( φ n ( f ( y 0 ) ) − φ n ( f ( y n ) ) ) ∨ 0 d ( y 0 , y n ) = 1 d ( y 0 , y n ) → ∞ Ψ n d ≥ φ n f y 0 − φ n f y n ∨ 0 d y 0 , y n = 1 d y 0 , y n → ∞ ||Psi_(n)||_(d) >= ((varphi_(n)(f(y_(0)))-varphi_(n)(f(y_(n))))vv0)/(d(y_(0),y_(n)))=(1)/(d(y_(0),y_(n)))rarr oo\left\|\Psi_{n}\right\|_{d} \geq \frac{\left(\varphi_{n}\left(f\left(y_{0}\right)\right)-\varphi_{n}\left(f\left(y_{n}\right)\right)\right) \vee 0}{d\left(y_{0}, y_{n}\right)}=\frac{1}{d\left(y_{0}, y_{n}\right)} \rightarrow \infty‖Ψn‖d≥(φn(f(y0))−φn(f(yn)))∨0d(y0,yn)=1d(y0,yn)→∞
for n → ∞ n → ∞ n rarr oon \rightarrow \inftyn→∞.
By the inequality (12)
d ( x , Y ) + d − 1 ( x , Y ) ≤ 1 − 0 ‖ Ψ n ‖ d → 0 d ( x , Y ) + d − 1 ( x , Y ) ≤ 1 − 0 Ψ n d → 0 d(x,Y)+d^(-1)(x,Y) <= (1-0)/(||Psi_(n)||_(d))rarr0d(x, Y)+d^{-1}(x, Y) \leq \frac{1-0}{\left\|\Psi_{n}\right\|_{d}} \rightarrow 0d(x,Y)+d−1(x,Y)≤1−0‖Ψn‖d→0
for n → ∞ n → ∞ n rarr oon \rightarrow \inftyn→∞,showing that Y Y YYY is dense in X X XXX, with respect to the quasi-metric d d ddd and with respect to d − 1 d − 1 d^(-1)d^{-1}d−1, as well.

References

[1] Cobzas, S., Mustăta, C., Norm Preserving Extension of Convex Lipschitz Functions, J.A.T. 24(1978), 555-564.
[2] Fletcher, P., Lindgren, W.F., "Quasi-Uniform Spaces" Dekken, New York, 1982.
[3] McShane, J.A., Extension of range of functions, Bull.Amer.Math.Soc. 40(1934) 837-842.
[4] Mustăţa, C., Best Approximation and Unique Extension of Lipschitz Functions, J.A.T. 19(1977), 222-230.
[5] Mustăţa, C., On the Extension of Semi-Lipschitz Functions on QuasiMetric Space (to appear).
[6] Romaguera, S., Sanchis, M., Semi-Lipschitz Functions and Best Approximation in Quasi-Metric Spaces, J.A.T. 103 (2000) 292-301.
[7] Wells, J.H., Williams, L.R., Embeddings and Extensions in Analysis, Springer-Verlag, Berlin 1975.
Received 19.10.2000
"T. Popoviciu" Institute of Numerical Analysis str. Gh. Bilaşcu nr. 37
C.P. 68, O.P. 1
3400 Cluj-Napoca
2000

Related Posts