Extension of semi Lipschitz function on quasi-metric spaces

Abstract


The aim of this note is to prove an extension theorem for semi-Lipschitz real functions defined on quasi-metric spaces, similar to McShane extension theorem for real-valued Lipschitz functions defined on a metric space ([2], [4]).

Authors

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

Keywords

Paper coordinates

C. Mustăţa, Extension of semi Lipschitz function on quasi-metric spaces, Rev. Anal. Numer. Theor. Approx. 30 (2001) nr. 1, 61-67, https://ictp.acad.ro/jnaat/journal/article/view/2001-vol30-no1-art8

PDF

About this paper

Journal

Revue d’Analyse Numer. Theor. Approx.

Publisher Name

Publishing Romanian Academy

Print ISSN

2457-6794

Online ISSN

2501-059X

google scholar link

[1] S. Cobzas and C. Mustata, Norm preserving extension of convex Lipschitz functions,J. Approx. Theory,29(1978), 555–569.

[2] J. Czipserand L. Geher, Extension of functions satisfying a Lipschitz condition, ActaMath. Sci. Hungar.,6(1955), 213–220.
[3] P. Fletcherand W. F. Lindgren, Quasi-Uniform Spaces, Dekker, New York, 1982.
[4] J. A. McShane, Extension of range of functions, Bull. Amer. Math. Soc.,40(1939),837–842.
[5] C. Mustata, Best approximation and unique extension of Lipschitz functions, J. Ap-prox. Theory,19(1977), 222–230.
[6] S. Romaguera and M. Sanchis,Semi-Lipschitz functions and best approximation inquasi-metric spaces, J. Approx. Theory,103(2000), 292–301.
[7] J. H. Wellsand L. R. Williams, Embeddings and Extensions in Analysis, Springer-Verlag, Berlin, 1975

Paper (preprint) in HTML form

2001-Mustata-EXTENSIONS OF SEMI-LIPSCHITZ FUNCTIONSON QUASI-METRIC SPACES 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; }

EXTENSIONS OF SEMI-LIPSCHITZ FUNCTIONS ON QUASI-METRIC SPACES

COSTICĂ MUSTĂŢADedicated to the memory of Acad. Tiberiu Popoviciu

Abstract

The aim of this note is to prove an extension theorem for semiLipschitz real functions defined on quasi-metric spaces, similar to McShane extension theorem for real-valued Lipschitz functions defined on a metric space ([2], [4]).

MSC 2000. 46A22, 26A16, 26A48.

1. INTRODUCTION

Let X X XXX be a nonvoid set. A quasi-metric on X X XXX is a function 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,∞) satisfying the conditions
(i) d ( x , y ) = d ( y , x ) = 0 ⟺ x = y ; x , y ∈ X , (i) d ( x , y ) = d ( y , x ) = 0 ⟺ x = y ; x , y ∈ X , {:(i)d(x","y)=d(y","x)=0Longleftrightarrow x=y;quad x","y in X",":}\begin{equation*} d(x, y)=d(y, x)=0 \Longleftrightarrow x=y ; \quad x, y \in X, \tag{i} \end{equation*}(i)d(x,y)=d(y,x)=0⟺x=y;x,y∈X,
(ii)
d ( x , y ) ≤ d ( x , z ) + d ( z , y ) , x , y , z ∈ X . d ( x , y ) ≤ d ( x , z ) + d ( z , y ) , x , y , z ∈ X . d(x,y) <= d(x,z)+d(z,y),quad x,y,z in X.d(x, y) \leq d(x, z)+d(z, y), \quad x, y, z \in X .d(x,y)≤d(x,z)+d(z,y),x,y,z∈X.
If d d ddd is a quasi-metric on X X XXX, then the pair ( X , d X , d X,dX, dX,d ) is called a quasi-metric space.
The conjugate of quasi-metric d d ddd, denoted by d − 1 d − 1 d^(-1)d^{-1}d−1 is defined by d − 1 ( x , y ) = d ( y , x ) , x , y ∈ X d − 1 ( x , y ) = d ( y , x ) , x , y ∈ X d^(-1)(x,y)=d(y,x),x,y in Xd^{-1}(x, y)= d(y, x), x, y \in Xd−1(x,y)=d(y,x),x,y∈X.
Obviously the function 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
d s ( x , y ) = max { d ( x , y ) , d − 1 ( x , y ) } ; x , y ∈ X d s ( x , y ) = max d ( x , y ) , d − 1 ( x , y ) ; x , y ∈ X d^(s)(x,y)=max{d(x,y),d^(-1)(x,y)};quad x,y in Xd^{s}(x, y)=\max \left\{d(x, y), d^{-1}(x, y)\right\} ; \quad x, y \in Xds(x,y)=max{d(x,y),d−1(x,y)};x,y∈X
is a metric on X X XXX.
If the quasi-metric d d ddd can take the value + ∞ + ∞ +oo+\infty+∞, then it is called an extended quasi-metric.
Let ( X , d X , d X,dX, dX,d ) be a quasi-metric space. A function f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R is called semiLipschitz if there exists a constant K ≥ 0 K ≥ 0 K >= 0K \geq 0K≥0 so that
(1) f ( x ) − f ( y ) ≤ K ⋅ d ( x , y ) (1) f ( x ) − f ( y ) ≤ K ⋅ d ( x , y ) {:(1)f(x)-f(y) <= K*d(x","y):}\begin{equation*} f(x)-f(y) \leq K \cdot d(x, y) \tag{1} \end{equation*}(1)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. The number K ≥ 0 K ≥ 0 K >= 0K \geq 0K≥0 in (1) is called a semi-Lipschitz constant for f f fff.
For a quasi-metric space ( X , d X , d X,dX, dX,d ) the real-valued function f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R is said to be ≤ d ≤ d <= _(d)\leq_{d}≤d-increasing if
(2) d ( x , y ) = 0 implies f ( x ) − f ( y ) ≤ 0 , x , y ∈ X (2) d ( x , y ) = 0  implies  f ( x ) − f ( y ) ≤ 0 , x , y ∈ X {:(2)d(x","y)=0quad" implies "quad f(x)-f(y) <= 0","quad x","y in X:}\begin{equation*} d(x, y)=0 \quad \text { implies } \quad f(x)-f(y) \leq 0, \quad x, y \in X \tag{2} \end{equation*}(2)d(x,y)=0 implies f(x)−f(y)≤0,x,y∈X
or equivalently,
(3) f ( x ) − f ( y ) > 0 implies d ( x , y ) > 0 , x , y ∈ X . (3) f ( x ) − f ( y ) > 0  implies  d ( x , y ) > 0 , x , y ∈ X . {:(3)f(x)-f(y) > 0quad" implies "quad d(x","y) > 0","quad x","y in X.:}\begin{equation*} f(x)-f(y)>0 \quad \text { implies } \quad d(x, y)>0, \quad x, y \in X . \tag{3} \end{equation*}(3)f(x)−f(y)>0 implies d(x,y)>0,x,y∈X.
Note that every semi-Lipschitz function on quasi-metric space ( X , d ) ( X , d ) (X,d)(X, d)(X,d) is ≤ d − ≤ d − <= _(d^(-))\leq_{d^{-}}≤d− increasing (see (1)).
For a semi-Lipschitz function f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R, where ( X , d X , d X,dX, dX,d ) is a quasi-metric space, denote by ‖ f ‖ d ‖ f ‖ d ||f||_(d)\|f\|_{d}‖f‖d the constant:
(4) ‖ f ‖ d = sup { ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) : d ( x , y ) > 0 , x , y ∈ X } (4) ‖ f ‖ d = sup ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) : d ( x , y ) > 0 , x , y ∈ X {:(4)||f||_(d)=s u p{((f(x)-f(y))vv0)/(d(x,y)):d(x,y) > 0,quad x,y in X}:}\begin{equation*} \|f\|_{d}=\sup \left\{\frac{(f(x)-f(y)) \vee 0}{d(x, y)}: d(x, y)>0, \quad x, y \in X\right\} \tag{4} \end{equation*}(4)‖f‖d=sup{(f(x)−f(y))∨0d(x,y):d(x,y)>0,x,y∈X}
Theorem 1. Let ( X , d X , d X,dX, dX,d ) a quasi-metric space and f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R a semiLipschitz function. Then ‖ f ‖ d ‖ f ‖ d ||f||_(d)\|f\|_{d}‖f‖d defined by (4) is the smallest semi-Lipschitz constant for f f fff.
Proof. If f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R is semi-Lipschitz, then f f fff is ≤ d ≤ d <= _(d)\leq_{d}≤d-increasing, and then 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. It follows that
( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) = f ( x ) − f ( y ) d ( x , y ) > 0 ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) = f ( x ) − f ( y ) d ( x , y ) > 0 ((f(x)-f(y))vv0)/(d(x,y))=(f(x)-f(y))/(d(x,y)) > 0\frac{(f(x)-f(y)) \vee 0}{d(x, y)}=\frac{f(x)-f(y)}{d(x, y)}>0(f(x)−f(y))∨0d(x,y)=f(x)−f(y)d(x,y)>0
The inequalities f ( x ) − f ( y ) ≤ 0 f ( x ) − f ( y ) ≤ 0 f(x)-f(y) <= 0f(x)-f(y) \leq 0f(x)−f(y)≤0 and d ( x , y ) > 0 d ( x , y ) > 0 d(x,y) > 0d(x, y)>0d(x,y)>0 imply
( 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
Consequently ‖ f ‖ d ≥ 0 ‖ f ‖ d ≥ 0 ||f||_(d) >= 0\|f\|_{d} \geq 0‖f‖d≥0.
For f ( x ) − f ( y ) < 0 f ( x ) − f ( y ) < 0 f(x)-f(y) < 0f(x)-f(y)<0f(x)−f(y)<0 it follows ( f ( x ) − f ( y ) ) / d ( x , y ) ≤ ‖ f ‖ d ( f ( x ) − f ( y ) ) / d ( x , y ) ≤ ‖ f ‖ d (f(x)-f(y))//d(x,y) <= ||f||_(d)(f(x)-f(y)) / d(x, y) \leq\|f\|_{d}(f(x)−f(y))/d(x,y)≤‖f‖d and obviously for f ( x ) − f ( y ) ≤ 0 f ( x ) − f ( y ) ≤ 0 f(x)-f(y) <= 0f(x)-f(y) \leq 0f(x)−f(y)≤0 we have f ( x ) − f ( y ) ≤ 0 ≤ ‖ f ‖ d ⋅ d ( x , y ) f ( x ) − f ( y ) ≤ 0 ≤ ‖ f ‖ d ⋅ d ( x , y ) f(x)-f(y) <= 0 <= ||f||_(d)*d(x,y)f(x)-f(y) \leq 0 \leq\|f\|_{d} \cdot d(x, y)f(x)−f(y)≤0≤‖f‖d⋅d(x,y).
Consequently
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)
for all x , y ∈ X x , y ∈ X x,y in Xx, y \in Xx,y∈X.
Now let K ≥ 0 K ≥ 0 K >= 0K \geq 0K≥0 such that
f ( x ) − f ( y ) ≤ K ⋅ d ( x , y ) , for all x , y ∈ X . f ( x ) − f ( y ) ≤ K ⋅ d ( x , y ) ,  for all  x , y ∈ X . f(x)-f(y) <= K*d(x,y),quad" for all "x,y in X.f(x)-f(y) \leq K \cdot d(x, y), \quad \text { for all } x, y \in X .f(x)−f(y)≤K⋅d(x,y), for all x,y∈X.
The function f f fff is ≤ d ≤ d <= _(d)\leq_{d}≤d-increasing, and then
( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) = { f ( x ) − f ( y ) d ( x , y ) ≤ K , if f ( x ) − f ( y ) > 0 , 0 ≤ 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 , 0 ≤ K ,       if  f ( x ) − f ( y ) ≤ 0 , ((f(x)-f(y))vv0)/(d(x,y))={[(f(x)-f(y))/(d(x,y)) <= K","," if "f(x)-f(y) > 0","],[0 <= K","," if "f(x)-f(y) <= 0","]:}\frac{(f(x)-f(y)) \vee 0}{d(x, y)}= \begin{cases}\frac{f(x)-f(y)}{d(x, y)} \leq K, & \text { if } f(x)-f(y)>0, \\ 0 \leq K, & \text { if } f(x)-f(y) \leq 0,\end{cases}(f(x)−f(y))∨0d(x,y)={f(x)−f(y)d(x,y)≤K, if f(x)−f(y)>0,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.
For a quasi-metric ( X , d X , d X,dX, dX,d ) let us consider the set:
(5) S Lip X = { f : X → R ∣ f is ≤ d -increasing, sup d ( x , y ) ≠ 0 ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) < ∞ } . (5) S Lip X = f : X → R ∣ f  is  ≤ d -increasing,  sup d ( x , y ) ≠ 0   ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) < ∞ . {:(5)S Lip X={f:X rarrR∣f" is " <= _(d)"-increasing, "s u p_(d(x,y)!=0)((f(x)-f(y))vv0)/(d(x,y)) < oo}.:}\begin{equation*} S \operatorname{Lip} X=\left\{f: X \rightarrow \mathbb{R} \mid f \text { is } \leq_{d} \text {-increasing, } \sup _{d(x, y) \neq 0} \frac{(f(x)-f(y)) \vee 0}{d(x, y)}<\infty\right\} . \tag{5} \end{equation*}(5)SLipX={f:X→R∣f is ≤d-increasing, supd(x,y)≠0(f(x)−f(y))∨0d(x,y)<∞}.
It is straightforward to see that S S SSS Lip X X XXX is exactly the set of all semiLipschitz functions on ( X , d ) ( X , d ) (X,d)(X, d)(X,d) (see [6]).

2. EXTENSIONS OF SEMI-LIPSCHITZ FUNCTIONS

Let Y ⊂ X Y ⊂ X Y sub XY \subset XY⊂X where ( X , d X , d X,dX, dX,d ) is a quasi-metric space. Then ( Y , d Y , d Y,dY, dY,d ) is a quasimetric space with the quasi-metric induced by d d ddd (denoted by d d ddd too). Let us denote by S S SSS Lip Y Y YYY the set of all semi-Lipschitz functions defined on Y Y YYY and let
(6) ‖ f ‖ d = sup { ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) : x , y ∈ Y , d ( x , y ) ≠ 0 } (6) ‖ f ‖ d = sup ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) : x , y ∈ Y , d ( x , y ) ≠ 0 {:(6)||f||_(d)=s u p{((f(x)-f(y))vv0)/(d(x,y)):x,y in Y,d(x,y)!=0}:}\begin{equation*} \|f\|_{d}=\sup \left\{\frac{(f(x)-f(y)) \vee 0}{d(x, y)}: x, y \in Y, d(x, y) \neq 0\right\} \tag{6} \end{equation*}(6)‖f‖d=sup{(f(x)−f(y))∨0d(x,y):x,y∈Y,d(x,y)≠0}
be the smallest semi-Lipschitz constant for f ∈ S f ∈ S f in Sf \in Sf∈S Lip Y Y YYY.
If f ∈ S f ∈ S f in Sf \in Sf∈S Lip Y Y YYY, a function F ∈ S F ∈ S F in SF \in SF∈S Lip X X XXX is called an extension (preserving the smallest semi-Lipschitz constant) of f f fff if:
(7) F | Y = f and ‖ F ‖ d = ‖ f ‖ d . (7) F Y = f  and  ‖ F ‖ d = ‖ f ‖ d . {:(7)F|_(Y)=f quad" and "quad||F||_(d)=||f||_(d).:}\begin{equation*} \left.F\right|_{Y}=f \quad \text { and } \quad\|F\|_{d}=\|f\|_{d} . \tag{7} \end{equation*}(7)F|Y=f and ‖F‖d=‖f‖d.
Denote by E Y ( f ) E Y ( f ) E_(Y)(f)E_{Y}(f)EY(f) the set of all extensions of the function f ∈ S f ∈ S f in Sf \in Sf∈S Lip Y Y YYY, i.e.
(8) E Y ( f ) = { F ∈ S Lip X : F | Y = f and ‖ F ‖ d = ‖ f ‖ d } (8) E Y ( f ) = F ∈ S Lip X : F Y = f  and  ‖ F ‖ d = ‖ f ‖ d {:(8)E_(Y)(f)={F in S Lip X:F|_(Y)=f" and "||F||_(d)=||f||_(d)}:}\begin{equation*} E_{Y}(f)=\left\{F \in S \operatorname{Lip} X:\left.F\right|_{Y}=f \text { and }\|F\|_{d}=\|f\|_{d}\right\} \tag{8} \end{equation*}(8)EY(f)={F∈SLipX:F|Y=f and ‖F‖d=‖f‖d}
Theorem 2. Let ( X , d X , d X,dX, dX,d ) be a quasi-metric space and Y Y YYY a nonvoid subset of X X XXX. Then for every f ∈ S f ∈ S f in Sf \in Sf∈S Lip Y Y YYY the set E Y ( f ) E Y ( f ) E_(Y)(f)E_{Y}(f)EY(f) is nonvoid.
Proof. Let f ∈ S f ∈ S f in Sf \in Sf∈S Lip Y Y YYY and the constant ‖ f ‖ d ‖ f ‖ d ||f||_(d)\|f\|_{d}‖f‖d defined by (6).
Consider the function
(9) F ( x ) = inf y ∈ Y { f ( y ) + ‖ f ‖ d d ( x , y ) } , x ∈ X (9) F ( x ) = inf y ∈ Y   f ( y ) + ‖ f ‖ d d ( x , y ) , x ∈ X {:(9)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} d(x, y)\right\}, x \in X \tag{9} \end{equation*}(9)F(x)=infy∈Y{f(y)+‖f‖dd(x,y)},x∈X
a) First we show that F F FFF is well defined.
Let z ∈ Y z ∈ Y z in Yz \in Yz∈Y and x ∈ X x ∈ X x in Xx \in Xx∈X. For any y ∈ Y y ∈ Y y in Yy \in Yy∈Y we have
f ( y ) + ‖ f ‖ d d ( x , y ) = f ( z ) + ‖ f ‖ d d ( x , y ) − ( f ( z ) − f ( y ) ) ≥ f ( z ) + ‖ f ‖ d d ( x , y ) − ‖ f ‖ d d ( z , y ) = f ( z ) − ‖ f ‖ d ( d ( z , y ) − d ( x , y ) ) f ( y ) + ‖ f ‖ d d ( x , y ) = f ( z ) + ‖ f ‖ d d ( x , y ) − ( f ( z ) − f ( y ) ) ≥ f ( z ) + ‖ f ‖ d d ( x , y ) − ‖ f ‖ d d ( z , y ) = f ( z ) − ‖ f ‖ d ( d ( z , y ) − d ( x , y ) ) {:[f(y)+||f||_(d)d(x","y)=f(z)+||f||_(d)d(x","y)-(f(z)-f(y))],[ >= f(z)+||f||_(d)d(x","y)-||f||_(d)d(z","y)],[=f(z)-||f||_(d)(d(z","y)-d(x","y))]:}\begin{aligned} f(y)+\|f\|_{d} d(x, y) & =f(z)+\|f\|_{d} d(x, y)-(f(z)-f(y)) \\ & \geq f(z)+\|f\|_{d} d(x, y)-\|f\|_{d} d(z, y) \\ & =f(z)-\|f\|_{d}(d(z, y)-d(x, y)) \end{aligned}f(y)+‖f‖dd(x,y)=f(z)+‖f‖dd(x,y)−(f(z)−f(y))≥f(z)+‖f‖dd(x,y)−‖f‖dd(z,y)=f(z)−‖f‖d(d(z,y)−d(x,y))
The inequality d ( z , y ) − d ( x , y ) ≤ d ( z , x ) = d − 1 ( x , z ) d ( z , y ) − d ( x , y ) ≤ d ( z , x ) = d − 1 ( x , z ) d(z,y)-d(x,y) <= d(z,x)=d^(-1)(x,z)d(z, y)-d(x, y) \leq d(z, x)=d^{-1}(x, z)d(z,y)−d(x,y)≤d(z,x)=d−1(x,z) implies
(10) f ( y ) + ‖ f ‖ d d ( x , y ) ≥ f ( z ) − ‖ f ‖ d ⋅ d − 1 ( x , z ) (10) f ( y ) + ‖ f ‖ d d ( x , y ) ≥ f ( z ) − ‖ f ‖ d ⋅ d − 1 ( x , z ) {:(10)f(y)+||f||_(d)d(x","y) >= f(z)-||f||_(d)*d^(-1)(x","z):}\begin{equation*} f(y)+\|f\|_{d} d(x, y) \geq f(z)-\|f\|_{d} \cdot d^{-1}(x, z) \tag{10} \end{equation*}(10)f(y)+‖f‖dd(x,y)≥f(z)−‖f‖d⋅d−1(x,z)
showing that for every x ∈ X x ∈ X x in Xx \in Xx∈X the set { f ( y ) + ‖ f ‖ d d ( x , y ) : y ∈ Y } f ( y ) + ‖ f ‖ d d ( x , y ) : y ∈ Y {f(y)+||f||_(d)d(x,y):y in Y}\left\{f(y)+\|f\|_{d} d(x, y): y \in Y\right\}{f(y)+‖f‖dd(x,y):y∈Y} is bounded from above by f ( z ) − ‖ f ‖ d d − 1 ( x , z ) f ( z ) − ‖ f ‖ d d − 1 ( x , z ) f(z)-||f||_(d)d^(-1)(x,z)f(z)-\|f\|_{d} d^{-1}(x, z)f(z)−‖f‖dd−1(x,z), and the infimum (9) is finite.
b) We show now that F ( y ) = f ( y ) F ( y ) = f ( y ) F(y)=f(y)F(y)=f(y)F(y)=f(y) for all y ∈ Y y ∈ Y y in Yy \in Yy∈Y.
Let y ∈ Y y ∈ Y y in Yy \in Yy∈Y. Then
F ( y ) ≤ f ( y ) + ‖ f ‖ d d ( y , y ) = f ( y ) . F ( y ) ≤ f ( y ) + ‖ f ‖ d d ( y , y ) = f ( y ) . F(y) <= f(y)+||f||_(d)d(y,y)=f(y).F(y) \leq f(y)+\|f\|_{d} d(y, y)=f(y) .F(y)≤f(y)+‖f‖dd(y,y)=f(y).
For any v ∈ Y v ∈ Y v in Yv \in Yv∈Y we have
f ( y ) − f ( v ) ≤ ‖ f ‖ d ⋅ d ( y , v ) f ( y ) − f ( v ) ≤ ‖ f ‖ d ⋅ d ( y , v ) f(y)-f(v) <= ||f||_(d)*d(y,v)f(y)-f(v) \leq\|f\|_{d} \cdot d(y, v)f(y)−f(v)≤‖f‖d⋅d(y,v)
so that
f ( v ) + ‖ f ‖ d ⋅ d ( y , v ) ≥ f ( y ) f ( v ) + ‖ f ‖ d ⋅ d ( y , v ) ≥ f ( y ) f(v)+||f||_(d)*d(y,v) >= f(y)f(v)+\|f\|_{d} \cdot d(y, v) \geq f(y)f(v)+‖f‖d⋅d(y,v)≥f(y)
and
F ( y ) = inf { f ( v ) + ‖ f ‖ d d ( y , v ) : v ∈ Y } ≥ f ( y ) F ( y ) = inf f ( v ) + ‖ f ‖ d d ( y , v ) : v ∈ Y ≥ f ( y ) F(y)=i n f{f(v)+||f||_(d)d(y,v):v in Y} >= f(y)F(y)=\inf \left\{f(v)+\|f\|_{d} d(y, v): v \in Y\right\} \geq f(y)F(y)=inf{f(v)+‖f‖dd(y,v):v∈Y}≥f(y)
It follows F ( y ) = f ( y ) F ( y ) = f ( y ) F(y)=f(y)F(y)=f(y)F(y)=f(y).
c) We prove that ‖ F ‖ d = ‖ f ‖ d ‖ F ‖ d = ‖ f ‖ d ||F||_(d)=||f||_(d)\|F\|_{d}=\|f\|_{d}‖F‖d=‖f‖d.
Since F | Y = f F Y = f F|_(Y)=f\left.F\right|_{Y}=fF|Y=f, the definitions of ‖ F ‖ d ‖ F ‖ d ||F||_(d)\|F\|_{d}‖F‖d and ‖ f ‖ d ‖ f ‖ d ||f||_(d)\|f\|_{d}‖f‖d yield ‖ F ‖ d ≥ ‖ f ‖ d ‖ F ‖ d ≥ ‖ f ‖ d ||F||_(d) >= ||f||_(d)\|F\|_{d} \geq\|f\|_{d}‖F‖d≥‖f‖d.
Let x 1 , x 2 ∈ X x 1 , x 2 ∈ X x_(1),x_(2)in Xx_{1}, x_{2} \in Xx1,x2∈X and ε > 0 ε > 0 epsi > 0\varepsilon>0ε>0. Choosing y ∈ Y y ∈ Y y in Yy \in Yy∈Y such that
F ( x 1 ) ≥ f ( y ) + ‖ f ‖ d d ( x 1 , y ) − ε F x 1 ≥ f ( y ) + ‖ f ‖ d d x 1 , y − ε F(x_(1)) >= f(y)+||f||_(d)d(x_(1),y)-epsiF\left(x_{1}\right) \geq f(y)+\|f\|_{d} d\left(x_{1}, y\right)-\varepsilonF(x1)≥f(y)+‖f‖dd(x1,y)−ε
we obtain
F ( x 2 ) − F ( x 1 ) ≤ f ( y ) + ‖ f ‖ d d ( x 2 , y ) − ( f ( y ) + ‖ f ‖ d ⋅ d ( x 1 , y ) − ε ) = ‖ f ‖ d [ d ( x 2 , y ) − d ( x 1 , y ) ] + ε ≤ ‖ f ‖ d ⋅ d ( x 2 , x 1 ) + ε . F x 2 − F x 1 ≤ f ( y ) + ‖ f ‖ d d x 2 , y − f ( y ) + ‖ f ‖ d ⋅ d x 1 , y − ε = ‖ f ‖ d d x 2 , y − d x 1 , y + ε ≤ ‖ f ‖ d ⋅ d x 2 , x 1 + ε . {:[F(x_(2))-F(x_(1)) <= f(y)+||f||_(d)d(x_(2),y)-(f(y)+||f||_(d)*d(x_(1),y)-epsi)],[=||f||_(d)[d(x_(2),y)-d(x_(1),y)]+epsi],[ <= ||f||_(d)*d(x_(2),x_(1))+epsi.]:}\begin{aligned} F\left(x_{2}\right)-F\left(x_{1}\right) & \leq f(y)+\|f\|_{d} d\left(x_{2}, y\right)-\left(f(y)+\|f\|_{d} \cdot d\left(x_{1}, y\right)-\varepsilon\right) \\ & =\|f\|_{d}\left[d\left(x_{2}, y\right)-d\left(x_{1}, y\right)\right]+\varepsilon \\ & \leq\|f\|_{d} \cdot d\left(x_{2}, x_{1}\right)+\varepsilon . \end{aligned}F(x2)−F(x1)≤f(y)+‖f‖dd(x2,y)−(f(y)+‖f‖d⋅d(x1,y)−ε)=‖f‖d[d(x2,y)−d(x1,y)]+ε≤‖f‖d⋅d(x2,x1)+ε.
Since ε > 0 ε > 0 epsi > 0\varepsilon>0ε>0 is arbitrary, it follows
F ( x 2 ) − F ( x 1 ) ≤ ‖ f ‖ d ⋅ d ( x 2 , x 1 ) F x 2 − F x 1 ≤ ‖ f ‖ d ⋅ d x 2 , x 1 F(x_(2))-F(x_(1)) <= ||f||_(d)*d(x_(2),x_(1))F\left(x_{2}\right)-F\left(x_{1}\right) \leq\|f\|_{d} \cdot d\left(x_{2}, x_{1}\right)F(x2)−F(x1)≤‖f‖d⋅d(x2,x1)
for any x 1 , x 2 ∈ X x 1 , x 2 ∈ X x_(1),x_(2)in Xx_{1}, x_{2} \in Xx1,x2∈X and ‖ F ‖ d ≤ ‖ f ‖ d ‖ F ‖ d ≤ ‖ f ‖ d ||F||_(d) <= ||f||_(d)\|F\|_{d} \leq\|f\|_{d}‖F‖d≤‖f‖d.
d) The function F F FFF is ≤ d ≤ d <= _(d)\leq_{d}≤d-increasing.
Indeed, let be u , v ∈ X u , v ∈ X u,v in Xu, v \in Xu,v∈X and d ( u , v ) = 0 d ( u , v ) = 0 d(u,v)=0d(u, v)=0d(u,v)=0. We have d ( u , y ) ≤ d ( u , v ) + d ( v , y ) d ( u , y ) ≤ d ( u , v ) + d ( v , y ) d(u,y) <= d(u,v)+d(v,y)d(u, y) \leq d(u, v)+d(v, y)d(u,y)≤d(u,v)+d(v,y). Consequently
d ( u , y ) ≤ d ( v , y ) d ( u , y ) ≤ d ( v , y ) d(u,y) <= d(v,y)d(u, y) \leq d(v, y)d(u,y)≤d(v,y)
Then
f ( y ) + ‖ f ‖ d d ( u , y ) ≤ f ( y ) + ‖ f ‖ d d ( v , y ) . f ( y ) + ‖ f ‖ d d ( u , y ) ≤ f ( y ) + ‖ f ‖ d d ( v , y ) . f(y)+||f||_(d)d(u,y) <= f(y)+||f||_(d)d(v,y).f(y)+\|f\|_{d} d(u, y) \leq f(y)+\|f\|_{d} d(v, y) .f(y)+‖f‖dd(u,y)≤f(y)+‖f‖dd(v,y).
It follows that
F ( u ) ≤ F ( v ) , F ( u ) ≤ F ( v ) , F(u) <= F(v),F(u) \leq F(v),F(u)≤F(v),
and consequently d ( u , v ) = 0 d ( u , v ) = 0 d(u,v)=0d(u, v)=0d(u,v)=0 implies F ( u ) ≤ F ( v ) F ( u ) ≤ F ( v ) F(u) <= F(v)F(u) \leq F(v)F(u)≤F(v).
It follows that F ∈ E Y d ( f ) F ∈ E Y d ( f ) F inE_(Y)^(d)(f)F \in E_{Y}^{d}(f)F∈EYd(f) so that E Y d ( t ) ≠ ∅ E Y d ( t ) ≠ ∅ E_(Y)^(d)(t)!=O/E_{Y}^{d}(t) \neq \emptysetEYd(t)≠∅.
Remarks 1. 1 0 1 0 1^(0)1^{0}10 Similarly, the function
(11) G ( x ) = sup y ∈ Y { f ( y ) − ‖ f ‖ d d − 1 ( x , y ) } (11) G ( x ) = sup y ∈ Y   f ( y ) − ‖ f ‖ d d − 1 ( x , y ) {:(11)G(x)=s u p_(y in Y){f(y)-||f||_(d)d^(-1)(x,y)}:}\begin{equation*} G(x)=\sup _{y \in Y}\left\{f(y)-\|f\|_{d} d^{-1}(x, y)\right\} \tag{11} \end{equation*}(11)G(x)=supy∈Y{f(y)−‖f‖dd−1(x,y)}
is ≤ d ≤ d <= _(d)\leq_{d}≤d-increasing, and G G GGG belongs to E Y d ( f ) E Y d ( f ) E_(Y)^(d)(f)E_{Y}^{d}(f)EYd(f) too.
2 0 2 0 2^(0)2^{0}20 The inequality
(12) G ( x ) ≤ F ( x ) , (12) G ( x ) ≤ F ( x ) , {:(12)G(x) <= F(x)",":}\begin{equation*} G(x) \leq F(x), \tag{12} \end{equation*}(12)G(x)≤F(x),
holds for every x ∈ X x ∈ X x in Xx \in Xx∈X.
Indeed, taking the infimum with respect to z ∈ Y z ∈ Y z in Yz \in Yz∈Y and then the supremum with respect to y ∈ Y y ∈ Y y in Yy \in Yy∈Y in (10) we find
G ( x ) = sup y ∈ Y { f ( y ) − ‖ f ‖ d d − 1 ( x , y ) } ≤ inf z ∈ Y { f ( z ) + ‖ f ‖ d d ( x , z ) } = F ( x ) G ( x ) = sup y ∈ Y   f ( y ) − ‖ f ‖ d d − 1 ( x , y ) ≤ inf z ∈ Y   f ( z ) + ‖ f ‖ d d ( x , z ) = F ( x ) G(x)=s u p_(y in Y){f(y)-||f||_(d)d^(-1)(x,y)} <= i n f_(z in Y){f(z)+||f||_(d)d(x,z)}=F(x)G(x)=\sup _{y \in Y}\left\{f(y)-\|f\|_{d} d^{-1}(x, y)\right\} \leq \inf _{z \in Y}\left\{f(z)+\|f\|_{d} d(x, z)\right\}=F(x)G(x)=supy∈Y{f(y)−‖f‖dd−1(x,y)}≤infz∈Y{f(z)+‖f‖dd(x,z)}=F(x)
In fact, the following theorem holds:
Theorem 3. Let ( X , d X , d X,dX, dX,d ) be a quasi-metric space, Y Y YYY a nonvoid subset of X X XXX and f ∈ S f ∈ S f in Sf \in Sf∈S Lip Y Y YYY.
Then for any H ∈ E Y d ( f ) H ∈ E Y d ( f ) H inE_(Y)^(d)(f)H \in E_{Y}^{d}(f)H∈EYd(f) we have
(13) G ( x ) ≤ H ( x ) ≤ F ( x ) , x ∈ X . (13) G ( x ) ≤ H ( x ) ≤ F ( x ) , x ∈ X . {:(13)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{13} \end{equation*}(13)G(x)≤H(x)≤F(x),x∈X.
Proof. Let H ∈ E Y d ( f ) H ∈ E Y d ( f ) H inE_(Y)^(d)(f)H \in E_{Y}^{d}(f)H∈EYd(f). For arbitrary x ∈ X x ∈ X x in Xx \in Xx∈X and y ∈ Y y ∈ Y y in Yy \in Yy∈Y we have
H ( x ) − H ( y ) ≤ ‖ f ‖ d d ( x , y ) H ( x ) − H ( y ) ≤ ‖ f ‖ d d ( x , y ) H(x)-H(y) <= ||f||_(d)d(x,y)H(x)-H(y) \leq\|f\|_{d} d(x, y)H(x)−H(y)≤‖f‖dd(x,y)
implying
H ( x ) ≤ H ( y ) + ‖ f ‖ d d ( x , y ) = f ( y ) + ‖ f ‖ d ( x , y ) H ( x ) ≤ H ( y ) + ‖ f ‖ d d ( x , y ) = f ( y ) + ‖ f ‖ d ( x , y ) H(x) <= H(y)+||f||_(d)d(x,y)=f(y)+||f||_(d)(x,y)H(x) \leq H(y)+\|f\|_{d} d(x, y)=f(y)+\|f\|_{d}(x, y)H(x)≤H(y)+‖f‖dd(x,y)=f(y)+‖f‖d(x,y)
Taking the imfimum with respect to y ∈ Y y ∈ Y y in Yy \in Yy∈Y we get
H ( x ) ≤ inf y ∈ Y { f ( y ) + ‖ f ‖ d d ( x , y ) } = F ( x ) H ( x ) ≤ inf y ∈ Y   f ( y ) + ‖ f ‖ d d ( x , y ) = F ( x ) H(x) <= i n f_(y in Y){f(y)+||f||_(d)d(x,y)}=F(x)H(x) \leq \inf _{y \in Y}\left\{f(y)+\|f\|_{d} d(x, y)\right\}=F(x)H(x)≤infy∈Y{f(y)+‖f‖dd(x,y)}=F(x)
The inequality H ( x ) ≥ G ( x ) , x ∈ X H ( x ) ≥ G ( x ) , x ∈ X H(x) >= G(x),x in XH(x) \geq G(x), x \in XH(x)≥G(x),x∈X can be proved similarly.
Corollary 4. A function f ∈ S f ∈ S f in Sf \in Sf∈S Lip Y Y YYY has a unique extension in S S SSS Lip X X XXX if and only if the following relation
(14) inf y ∈ Y { f ( y ) + ‖ f ‖ d d ( x , y ) } = sup y ∈ Y { f ( y ) − ‖ f ‖ d ( y , x ) } (14) inf y ∈ Y   f ( y ) + ‖ f ‖ d d ( x , y ) = sup y ∈ Y   { f ( y ) − ‖ f ‖ d ( y , x ) } {:(14)i n f_(y in Y){f(y)+||f||_(d)d(x,y)}=s u p_(y in Y){f(y)-||f||d(y","x)}:}\begin{equation*} \inf _{y \in Y}\left\{f(y)+\|f\|_{d} d(x, y)\right\}=\sup _{y \in Y}\{f(y)-\|f\| d(y, x)\} \tag{14} \end{equation*}(14)infy∈Y{f(y)+‖f‖dd(x,y)}=supy∈Y{f(y)−‖f‖d(y,x)}
holds for every x ∈ X x ∈ X x in Xx \in Xx∈X.
Example.
Let R R R\mathbb{R}R be the real axis and d : R × R → [ 0 , ∞ ) d : R × R → [ 0 , ∞ ) d:RxxRrarr[0,oo)d: \mathbb{R} \times \mathbb{R} \rightarrow[0, \infty)d:R×R→[0,∞) the quasi-metric defined by
d ( x , y ) = { x − y , if x ≥ y 1 , if x < y d ( x , y ) = x − y ,  if  x ≥ y 1 ,  if  x < y d(x,y)={[x-y","," if "quad x >= y],[1","," if "quad x < y]:}d(x, y)=\left\{\begin{array}{cc} x-y, & \text { if } \quad x \geq y \\ 1, & \text { if } \quad x<y \end{array}\right.d(x,y)={x−y, if x≥y1, if x<y
Let Y Y YYY be given by Y = [ 0 , 1 ] ⊂ R Y = [ 0 , 1 ] ⊂ R Y=[0,1]subRY=[0,1] \subset \mathbb{R}Y=[0,1]⊂R and f : Y → R , f ( y ) = 2 y f : Y → R , f ( y ) = 2 y f:Y rarrR,f(y)=2yf: Y \rightarrow \mathbb{R}, f(y)=2 yf:Y→R,f(y)=2y. Then f f fff is semi-Lipschitz on Y Y YYY and ‖ f ‖ d = 2 ‖ f ‖ d = 2 ||f||_(d)=2\|f\|_{d}=2‖f‖d=2. The extension F F FFF defined by (9) is
F ( x ) = { 2 , if x < 0 2 x , if x ≥ 0 F ( x ) = 2 ,  if  x < 0 2 x ,  if  x ≥ 0 F(x)={[2","," if ",x < 0],[2x","," if ",x >= 0]:}F(x)=\left\{\begin{array}{cll} 2, & \text { if } & x<0 \\ 2 x, & \text { if } & x \geq 0 \end{array}\right.F(x)={2, if x<02x, if x≥0
and the extension G G GGG defined by (11) is
G ( x ) = { 2 x , x ≤ 1 0 , x > 1 G ( x ) = 2 x , x ≤ 1 0 , x > 1 G(x)={[2x",",x <= 1],[0",",x > 1]:}G(x)=\left\{\begin{array}{cl} 2 x, & x \leq 1 \\ 0, & x>1 \end{array}\right.G(x)={2x,x≤10,x>1
Obviously, G ( x ) ≤ F ( x ) , x ∈ R G ( x ) ≤ F ( x ) , x ∈ R G(x) <= F(x),x inRG(x) \leq F(x), x \in \mathbb{R}G(x)≤F(x),x∈R.

REFERENCES

[1] S. Cobzas and C. Mustăţa, Norm preserving extension of convex Lipschitz functions, J. Approx. Theory, 29 (1978), 555-569.
[2] J. Czipser and L. Gehér, Extension of functions satisfying a Lipschitz condition, Acta Math. Sci. Hungar., 6 (1955), 213-220.
[3] P. Fletcher and W. F. Lindgren, Quasi-Uniform Spaces, Dekker, New York, 1982.
[4] J. A. McShane, Extension of range of functions, Bull. Amer. Math. Soc., 40 (1939), 837-842.
[5] C. Mustăţa, Best approximation and unique extension of Lipschitz functions, J. Approx. Theory, 19 (1977), 222-230.
[6] S. Romaguera and M. Sanchis, Semi-Lipschitz functions and best approximation in quasi-metric spaces, J. Approx. Theory, 103 (2000), 292-301.
[7] J. H. WellS and L. R. Williams, Embeddings and Extensions in Analysis, SpringerVerlag, Berlin, 1975.
Received: August 8, 2000.

  1. "T. Popoviciu" Institute of Numerical Analysis, P.O. Box 68-1, 3400 Cluj-Napoca, Romania, e-mail: cmustata@ictp-acad.math.ubbcluj.ro.
2001

Related Posts