Extension of convex semi-Lipschitz functions on quasi-metric linear spaces

Abstract

In this paper one shows that  a convex semi-Lipschitz functions defined on a convex subset of a quasi-metric linear spaces X admits an extension to the vohle spaces X, preserving both the convexity and the semi-Lipschitz constant. A similar result is proved  for starshaped  functions.

Authors

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

Keywords

Paper coordinates

C. Mustăţa, Extension of convex semi-Lipschitz Functions on quasi-metric linear spaces, Seminaire de la Théorie de la Meilleure Approximation, Convexité et Optimization, Cluj-Napoca, 29 November 2001, 85-92.

PDF

About this paper

Journal
Publisher Name
DOI
Print ISSN
Online ISSN

google scholar link

[1] Romaguera, S. , Sanchis, M, Semi-Lipschitz functions  in quasi-metric spaces, J.A.T. 103, (2000), 292-301.
[2] McShane, J.A., Extension of range of functions , Bull. Amer. Math. Soc., 40 (1934), 837-842.
[3] Cobzas, S, Mustata, C., Norm preserving extension of convex Lipschitz functions, J.A.T. 24(1978), 555-564.
[4] Mustata, C., On the extension of semi-Lipschitz functions on quasi-metric space (to appear).
[5] Wels, J.H, Williams, L.R., Embeddings and extension in analysis, Springer-Verlag , Berlin, 1975.

Paper (preprint) in HTML form

2001-Mustata-Seminar-Meilleure-Extensions-of-convex-semi-Lipschitz-functions-on-quasi-metric-linear- 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 convex semi-Lipschitz functions on quasi-metric linear spaces

Costică Mustăţa(Cluj-Napoca)

Abstract

In this paper one shows that a convex semi-Lipschitz functions defined on a convex subset of a quasi-metric linear space X X XXX admits an extension to the whole space X X XXX, preserving both the convexity and the semi-Lipschitz constant. A similar result is proved for starshaped functions.

1 Introduction

Let X X XXX be a set. 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,∞) is called a quasi-metric if
(i) d ( x , y ) = d ( y , x ) = 0 ⟺ x = y d ( x , y ) = d ( y , x ) = 0 ⟺ x = y d(x,y)=d(y,x)=0Longleftrightarrow x=yd(x, y)=d(y, x)=0 \Longleftrightarrow x=yd(x,y)=d(y,x)=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. If d d ddd is a quasi-metric on X X XXX then the pair ( X , d ) ( X , d ) (X,d)(X, d)(X,d) is called a quasi-metric space. If X X XXX is further a linear space and 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 linear space.
The function d − 1 : X × X → [ 0 , ∞ ) d − 1 : X × X → [ 0 , ∞ ) d^(-1):X xx X rarr[0,oo)d^{-1}: X \times X \rightarrow[0, \infty)d−1:X×X→[0,∞) defined by equality
(1) d − 1 ( x , y ) = d ( y , x ) , x , y ∈ X (1) d − 1 ( x , y ) = d ( y , x ) , x , y ∈ X {:(1)d^(-1)(x","y)=d(y","x)","quad x","y in X:}\begin{equation*} d^{-1}(x, y)=d(y, x), \quad x, y \in X \tag{1} \end{equation*}(1)d−1(x,y)=d(y,x),x,y∈X
is called the conjugate of the quasi-metric d [ 1 ] d [ 1 ] d[1]d[1]d[1].
Definition 1.1 Let ( X , d X , d X,dX, dX,d ) be a quasi-metric linear space and Y Y YYY a convex subset of X X XXX (i.e. ( ∀ ) u 1 , u 2 ∈ Y , ( ∀ ) α ∈ [ 0 , 1 ] , α u 1 + ( 1 − α ) u 2 ∈ Y ( ∀ ) u 1 , u 2 ∈ Y , ( ∀ ) α ∈ [ 0 , 1 ] , α u 1 + ( 1 − α ) u 2 ∈ Y (AA)u_(1),u_(2)in Y,(AA)alpha in[0,1],alphau_(1)+(1-alpha)u_(2)in Y(\forall) u_{1}, u_{2} \in Y,(\forall) \alpha \in[0,1], \alpha u_{1}+ (1-\alpha) u_{2} \in Y(∀)u1,u2∈Y,(∀)α∈[0,1],αu1+(1−α)u2∈Y ). The quasi-metric d d ddd is called convex on Y Y YYY if it satisfies the inequality
(2)
d ( α x 1 + ( 1 − α ) x 2 , α y 1 + ( 1 − α ) y 2 ) ≤ α d ( x 1 , y 1 ) + ( 1 − α ) d ( x 2 , y 2 ) d α x 1 + ( 1 − α ) x 2 , α y 1 + ( 1 − α ) y 2 ≤ α d x 1 , y 1 + ( 1 − α ) d x 2 , y 2 d(alphax_(1)+(1-alpha)x_(2),alphay_(1)+(1-alpha)y_(2)) <= alpha d(x_(1),y_(1))+(1-alpha)d(x_(2),y_(2))d\left(\alpha x_{1}+(1-\alpha) x_{2}, \alpha y_{1}+(1-\alpha) y_{2}\right) \leq \alpha d\left(x_{1}, y_{1}\right)+(1-\alpha) d\left(x_{2}, y_{2}\right)d(αx1+(1−α)x2,αy1+(1−α)y2)≤αd(x1,y1)+(1−α)d(x2,y2), for all x 1 , x 2 , y 1 , y 2 ∈ Y x 1 , x 2 , y 1 , y 2 ∈ Y x_(1),x_(2),y_(1),y_(2)in Yx_{1}, x_{2}, y_{1}, y_{2} \in Yx1,x2,y1,y2∈Y and all α ∈ [ 0 , 1 ] α ∈ [ 0 , 1 ] alpha in[0,1]\alpha \in[0,1]α∈[0,1].
Definition 1.2 [4]. Let ( X , d X , d X,dX, dX,d ) be a quasi-metric linear space. A function f : X → R f : X → R f:X rarrRf: X \rightarrow \mathbb{R}f:X→R is called semi-Lipschitz if there exists 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) <= K*d(x","y)",":}\begin{equation*} f(x)-f(y) \leq K \cdot d(x, y), \tag{3} \end{equation*}(3)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.
A number K ≥ 0 K ≥ 0 K >= 0K \geq 0K≥0 for which (3) holds is called a semi-Lipschitz constant for f f fff.
For Y ⊂ X Y ⊂ X Y sub XY \subset XY⊂X let
(4) ‖ f ‖ Y = sup { ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) : x , y ∈ Y , d ( x , y ) > 0 } ‖ f ‖ Y = sup ( f ( x ) − f ( y ) ) ∨ 0 d ( x , y ) : x , y ∈ Y , d ( x , y ) > 0 quad||f||_(Y)=s u p{((f(x)-f(y))vv0)/(d(x,y)):x,y in Y,d(x,y) > 0}\quad\|f\|_{Y}=\sup \left\{\frac{(f(x)-f(y)) \vee 0}{d(x, y)}: x, y \in Y, d(x, y)>0\right\}‖f‖Y=sup{(f(x)−f(y))∨0d(x,y):x,y∈Y,d(x,y)>0}.
The ‖ f ‖ Y ‖ f ‖ Y ||f||_(Y)\|f\|_{Y}‖f‖Y is the smallest semi-Lipschitz constant of the function f f fff on Y Y YYY [3, Th.1].
For Y ⊂ X Y ⊂ X Y sub XY \subset XY⊂X let
(5) S Lip Y = { f : Y → R : ‖ f ‖ Y < ∞ } (5) S Lip Y = f : Y → R : ‖ f ‖ Y < ∞ {:(5)S Lip Y={f:Y rarrR:||f||_(Y) < oo}:}\begin{equation*} S \operatorname{Lip} Y=\left\{f: Y \rightarrow \mathbb{R}:\|f\|_{Y}<\infty\right\} \tag{5} \end{equation*}(5)SLipY={f:Y→R:‖f‖Y<∞}
be the set of all real-valued semi-Lipschitz functions defined on the quasi-metric space ( Y , d ) ( Y , d ) (Y,d)(Y, d)(Y,d).
Definition 1.3 A function F ∈ S F ∈ S F in SF \in SF∈S Lip X X XXX is called an extension of a function f ∈ S f ∈ S f in Sf \in Sf∈S Lip Y Y YYY if
(i) F | Y = f F Y = f F|_(Y)=f\left.F\right|_{Y}=fF|Y=f,
(ii) ‖ F ‖ X = ‖ f ‖ Y ‖ F ‖ X = ‖ f ‖ Y ||F||_(X)=||f||_(Y)\|F\|_{X}=\|f\|_{Y}‖F‖X=‖f‖Y.
For f ∈ S Lip Y f ∈ S Lip Y f in S Lip Yf \in S \operatorname{Lip} Yf∈SLipY one denotes by
(6) E Y ( f ) = { F ∈ S Lip X : F | Y = f and ‖ F ‖ X = ‖ f ‖ Y } (6) E Y ( f ) = F ∈ S Lip X : F Y = f  and  ‖ F ‖ X = ‖ f ‖ Y {:(6)E_(Y)(f)={F in S Lip X:F|_(Y)=f" and "||F||_(X)=||f||_(Y)}:}\begin{equation*} E_{Y}(f)=\left\{F \in S \operatorname{Lip} X:\left.F\right|_{Y}=f \text { and }\|F\|_{X}=\|f\|_{Y}\right\} \tag{6} \end{equation*}(6)EY(f)={F∈SLipX:F|Y=f and ‖F‖X=‖f‖Y}
the set of all extensions of the function f f fff.
By Theorem 2 in [4] it follows that
(7) E Y ( f ) ≠ ∅ , ( ∀ ) f ∈ S Lip Y . (7) E Y ( f ) ≠ ∅ , ( ∀ ) f ∈ S Lip Y . {:(7)E_(Y)(f)!=O/","(AA)f in S Lip Y.:}\begin{equation*} E_{Y}(f) \neq \emptyset,(\forall) f \in S \operatorname{Lip} Y . \tag{7} \end{equation*}(7)EY(f)≠∅,(∀)f∈SLipY.
The following problem arises naturally: which other properties of the function f f fff (beside the semi-Lipschitz constant) are preserved by at least one of its extensions?
The aim of this paper is to show that two such properties are convexity and starshapedness.
First we prove:
Theorem 1.1 Let ( X , d X , d X,dX, dX,d ) be a quasi-metric linear space and Y Y YYY a convex subset of X X XXX. Suppose that the quasi-metric d d ddd is convex on Y Y YYY, in the sense of Definition 1.
a) If f ∈ S f ∈ S f in Sf \in Sf∈S Lip Y Y YYY is convex on Y Y YYY then there exists a convex
F ∈ E Y ( f ) . F ∈ E Y ( f ) . F inE_(Y)(f).F \in E_{Y}(f) .F∈EY(f).
b) If f ∈ S f ∈ S f in Sf \in Sf∈S Lip Y Y YYY is concave (i.e. − f − f -f-f−f is convex) on Y Y YYY then there exists a concave
G ∈ E Y ( f ) . G ∈ E Y ( f ) . G inE_(Y)(f).G \in E_{Y}(f) .G∈EY(f).
Proof. a) Let f ∈ S Lip Y f ∈ S Lip Y f in S Lip Yf \in S \operatorname{Lip} Yf∈SLipY be convex on the convex set Y Y YYY. Consider the function F : X → R F : X → R F:X rarrRF: X \rightarrow \mathbb{R}F:X→R defined by
(8) F ( x ) = inf y ∈ Y { f ( y ) + ‖ f ‖ Y ⋅ d ( x , y ) } , x ∈ X . (8) F ( x ) = inf y ∈ Y   f ( y ) + ‖ f ‖ Y ⋅ d ( x , y ) , x ∈ X . {:(8)F(x)=i n f_(y in Y){f(y)+||f||_(Y)*d(x,y)}","x in X.:}\begin{equation*} F(x)=\inf _{y \in Y}\left\{f(y)+\|f\|_{Y} \cdot d(x, y)\right\}, x \in X . \tag{8} \end{equation*}(8)F(x)=infy∈Y{f(y)+‖f‖Y⋅d(x,y)},x∈X.
Then F F FFF is well defined and F ∈ E Y ( f ) F ∈ E Y ( f ) F inE_(Y)(f)F \in E_{Y}(f)F∈EY(f) (Theorem 2 in [4]). Indeed, 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 ‖ Y d ( x , y ) = f ( z ) + ‖ f ‖ Y d ( x , y ) − ( f ( z ) − f ( y ) ) ≥ f ( z ) + ‖ f ‖ Y d ( x , y ) − ‖ f ‖ Y d ( z , y ) = f ( z ) − ‖ f ‖ Y ( d ( z , y ) − d ( x , y ) ) . f ( y ) + ‖ f ‖ Y d ( x , y ) = f ( z ) + ‖ f ‖ Y d ( x , y ) − ( f ( z ) − f ( y ) ) ≥ f ( z ) + ‖ f ‖ Y d ( x , y ) − ‖ f ‖ Y d ( z , y ) = f ( z ) − ‖ f ‖ Y ( d ( z , y ) − d ( x , y ) ) . {:[f(y)+||f||_(Y)d(x","y)=f(z)+||f||_(Y)d(x","y)-(f(z)-f(y))],[ >= f(z)+||f||_(Y)d(x","y)-||f||_(Y)d(z","y)],[=f(z)-||f||_(Y)(d(z","y)-d(x","y)).]:}\begin{aligned} f(y)+\|f\|_{Y} d(x, y) & =f(z)+\|f\|_{Y} d(x, y)-(f(z)-f(y)) \\ & \geq f(z)+\|f\|_{Y} d(x, y)-\|f\|_{Y} d(z, y) \\ & =f(z)-\|f\|_{Y}(d(z, y)-d(x, y)) . \end{aligned}f(y)+‖f‖Yd(x,y)=f(z)+‖f‖Yd(x,y)−(f(z)−f(y))≥f(z)+‖f‖Yd(x,y)−‖f‖Yd(z,y)=f(z)−‖f‖Y(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
f ( y ) + ‖ f ‖ Y d ( x , y ) ≥ f ( z ) − ‖ f ‖ Y ⋅ d − 1 ( x , z ) f ( y ) + ‖ f ‖ Y d ( x , y ) ≥ f ( z ) − ‖ f ‖ Y ⋅ d − 1 ( x , z ) f(y)+||f||_(Y)d(x,y) >= f(z)-||f||_(Y)*d^(-1)(x,z)f(y)+\|f\|_{Y} d(x, y) \geq f(z)-\|f\|_{Y} \cdot d^{-1}(x, z)f(y)+‖f‖Yd(x,y)≥f(z)−‖f‖Y⋅d−1(x,z)
showing that for every x ∈ X x ∈ X x in Xx \in Xx∈X the set { f ( y ) + ‖ f ‖ Y d ( x , y ) : y ∈ Y } f ( y ) + ‖ f ‖ Y d ( x , y ) : y ∈ Y {f(y)+||f||_(Y)d(x,y):y in Y}\left\{f(y)+\|f\|_{Y} d(x, y): y \in Y\right\}{f(y)+‖f‖Yd(x,y):y∈Y} is bounded from above by f ( z ) − ‖ f ‖ Y d − 1 ( x , z ) f ( z ) − ‖ f ‖ Y d − 1 ( x , z ) f(z)-||f||_(Y)d^(-1)(x,z)f(z)-\|f\|_{Y} d^{-1}(x, z)f(z)−‖f‖Yd−1(x,z), and the infimum (8) is finite.
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 ‖ Y d ( y , y ) = f ( y ) . F ( y ) ≤ f ( y ) + ‖ f ‖ Y d ( y , y ) = f ( y ) . F(y) <= f(y)+||f||_(Y)d(y,y)=f(y).F(y) \leq f(y)+\|f\|_{Y} d(y, y)=f(y) .F(y)≤f(y)+‖f‖Yd(y,y)=f(y).
For any v ∈ Y v ∈ Y v in Yv \in Yv∈Y we have
f ( y ) − f ( v ) ≤ ‖ f ‖ Y ⋅ d ( y , v ) f ( y ) − f ( v ) ≤ ‖ f ‖ Y ⋅ d ( y , v ) f(y)-f(v) <= ||f||_(Y)*d(y,v)f(y)-f(v) \leq\|f\|_{Y} \cdot d(y, v)f(y)−f(v)≤‖f‖Y⋅d(y,v)
so that
f ( v ) + ‖ f ‖ Y ⋅ d ( y , v ) ≥ f ( y ) f ( v ) + ‖ f ‖ Y ⋅ d ( y , v ) ≥ f ( y ) f(v)+||f||_(Y)*d(y,v) >= f(y)f(v)+\|f\|_{Y} \cdot d(y, v) \geq f(y)f(v)+‖f‖Y⋅d(y,v)≥f(y)
and
F ( y ) = inf { f ( v ) + ‖ f ‖ Y d ( y , v ) : v ∈ Y } ≥ f ( y ) F ( y ) = inf f ( v ) + ‖ f ‖ Y d ( y , v ) : v ∈ Y ≥ f ( y ) F(y)=i n f{f(v)+||f||_(Y)d(y,v):v in Y} >= f(y)F(y)=\inf \left\{f(v)+\|f\|_{Y} d(y, v): v \in Y\right\} \geq f(y)F(y)=inf{f(v)+‖f‖Yd(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).
We prove that ‖ F ‖ Y = ‖ f ‖ Y ‖ F ‖ Y = ‖ f ‖ Y ||F||_(Y)=||f||_(Y)\|F\|_{Y}=\|f\|_{Y}‖F‖Y=‖f‖Y.
Since F | Y = f F Y = f F|_(Y)=f\left.F\right|_{Y}=fF|Y=f, the definitions of ‖ F ‖ Y ‖ F ‖ Y ||F||_(Y)\|F\|_{Y}‖F‖Y and ‖ f ‖ Y ‖ f ‖ Y ||f||_(Y)\|f\|_{Y}‖f‖Y yield ‖ F ‖ Y ≥ ‖ f ‖ Y ‖ F ‖ Y ≥ ‖ f ‖ Y ||F||_(Y) >= ||f||_(Y)\|F\|_{Y} \geq \|f\|_{Y}‖F‖Y≥‖f‖Y.
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 ‖ Y d ( x 1 , y ) − ε F x 1 ≥ f ( y ) + ‖ f ‖ Y d x 1 , y − ε F(x_(1)) >= f(y)+||f||_(Y)d(x_(1),y)-epsiF\left(x_{1}\right) \geq f(y)+\|f\|_{Y} d\left(x_{1}, y\right)-\varepsilonF(x1)≥f(y)+‖f‖Yd(x1,y)−ε
we obtain
F ( x 2 ) − F ( x 1 ) ≤ f ( y ) + ‖ f ‖ Y d ( x 2 , y ) − ( f ( y ) + ‖ f ‖ Y ⋅ d ( x 1 , y ) − ε ) = ‖ f ‖ Y [ d ( x 2 , y ) − d ( x 1 , y ) ] + ε ≤ ‖ f ‖ Y ⋅ d ( x 2 , x 1 ) + ε . F x 2 − F x 1 ≤ f ( y ) + ‖ f ‖ Y d x 2 , y − f ( y ) + ‖ f ‖ Y ⋅ d x 1 , y − ε = ‖ f ‖ Y d x 2 , y − d x 1 , y + ε ≤ ‖ f ‖ Y ⋅ d x 2 , x 1 + ε . {:[F(x_(2))-F(x_(1))],[ <= f(y)+||f||_(Y)d(x_(2),y)-(f(y)+||f||_(Y)*d(x_(1),y)-epsi)],[=||f||_(Y)[d(x_(2),y)-d(x_(1),y)]+epsi],[ <= ||f||_(Y)*d(x_(2),x_(1))+epsi.]:}\begin{aligned} & F\left(x_{2}\right)-F\left(x_{1}\right) \\ \leq & f(y)+\|f\|_{Y} d\left(x_{2}, y\right)-\left(f(y)+\|f\|_{Y} \cdot d\left(x_{1}, y\right)-\varepsilon\right) \\ = & \|f\|_{Y}\left[d\left(x_{2}, y\right)-d\left(x_{1}, y\right)\right]+\varepsilon \\ \leq & \|f\|_{Y} \cdot d\left(x_{2}, x_{1}\right)+\varepsilon . \end{aligned}F(x2)−F(x1)≤f(y)+‖f‖Yd(x2,y)−(f(y)+‖f‖Y⋅d(x1,y)−ε)=‖f‖Y[d(x2,y)−d(x1,y)]+ε≤‖f‖Y⋅d(x2,x1)+ε.
Since ε > 0 ε > 0 epsi > 0\varepsilon>0ε>0 is arbitrary it follows
F ( x 2 ) − F ( x 1 ) ≤ ‖ f ‖ Y ⋅ d ( x 2 , x 1 ) F x 2 − F x 1 ≤ ‖ f ‖ Y ⋅ d x 2 , x 1 F(x_(2))-F(x_(1)) <= ||f||_(Y)*d(x_(2),x_(1))F\left(x_{2}\right)-F\left(x_{1}\right) \leq\|f\|_{Y} \cdot d\left(x_{2}, x_{1}\right)F(x2)−F(x1)≤‖f‖Y⋅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 ‖ Y ≤ ‖ f ‖ Y ‖ F ‖ Y ≤ ‖ f ‖ Y ||F||_(Y) <= ||f||_(Y)\|F\|_{Y} \leq\|f\|_{Y}‖F‖Y≤‖f‖Y. Then ‖ F ‖ X = ‖ f ‖ Y ‖ F ‖ X = ‖ f ‖ Y ||F||_(X)=||f||_(Y)\|F\|_{X}=\|f\|_{Y}‖F‖X=‖f‖Y.
Since Y Y YYY is convex and the quasi-metric d d ddd is convex (in the sense
of Definition 1) we have
F ( α x 1 + ( 1 − α ) x 2 ) ≤ f ( α y 1 + ( 1 − α ) y 2 ) + + ‖ f ‖ Y ⋅ d ( α x 1 + ( 1 − α ) x 2 , α y 1 + ( 1 − α ) y 2 ) ≤ α f ( y 1 ) + ( 1 − α ) f ( y 2 ) + + ‖ f ‖ Y [ α d ( x 1 , y 1 ) + ( 1 − α ) d ( x 2 , y 2 ) ] = α [ f ( y 1 ) + ‖ f ‖ Y d ( x 1 , y 1 ) ] + + ( 1 − α ) [ f ( y 2 ) + ( 1 − α ) d ( x 2 , y 2 ) ] , F α x 1 + ( 1 − α ) x 2 ≤ f α y 1 + ( 1 − α ) y 2 + + ‖ f ‖ Y ⋅ d α x 1 + ( 1 − α ) x 2 , α y 1 + ( 1 − α ) y 2 ≤ α f y 1 + ( 1 − α ) f y 2 + + ‖ f ‖ Y α d x 1 , y 1 + ( 1 − α ) d x 2 , y 2 = α f y 1 + ‖ f ‖ Y d x 1 , y 1 + + ( 1 − α ) f y 2 + ( 1 − α ) d x 2 , y 2 , {:[F(alphax_(1)+(1-alpha)x_(2))],[ <= f(alphay_(1)+(1-alpha)y_(2))+],[+||f||_(Y)*d(alphax_(1)+(1-alpha)x_(2),alphay_(1)+(1-alpha)y_(2))],[ <= alpha f(y_(1))+(1-alpha)f(y_(2))+],[+||f||_(Y)[alpha d(x_(1),y_(1))+(1-alpha)d(x_(2),y_(2))]],[=alpha[f(y_(1))+||f||_(Y)d(x_(1),y_(1))]+],[+(1-alpha)[f(y_(2))+(1-alpha)d(x_(2),y_(2))]","]:}\begin{aligned} & F\left(\alpha x_{1}+(1-\alpha) x_{2}\right) \\ \leq & f\left(\alpha y_{1}+(1-\alpha) y_{2}\right)+ \\ & +\|f\|_{Y} \cdot d\left(\alpha x_{1}+(1-\alpha) x_{2}, \alpha y_{1}+(1-\alpha) y_{2}\right) \\ \leq & \alpha f\left(y_{1}\right)+(1-\alpha) f\left(y_{2}\right)+ \\ & +\|f\|_{Y}\left[\alpha d\left(x_{1}, y_{1}\right)+(1-\alpha) d\left(x_{2}, y_{2}\right)\right] \\ = & \alpha\left[f\left(y_{1}\right)+\|f\|_{Y} d\left(x_{1}, y_{1}\right)\right]+ \\ & +(1-\alpha)\left[f\left(y_{2}\right)+(1-\alpha) d\left(x_{2}, y_{2}\right)\right], \end{aligned}F(αx1+(1−α)x2)≤f(αy1+(1−α)y2)++‖f‖Y⋅d(αx1+(1−α)x2,αy1+(1−α)y2)≤αf(y1)+(1−α)f(y2)++‖f‖Y[αd(x1,y1)+(1−α)d(x2,y2)]=α[f(y1)+‖f‖Yd(x1,y1)]++(1−α)[f(y2)+(1−α)d(x2,y2)],
for all x 1 , x 2 ∈ X , y 1 , y 2 ∈ Y x 1 , x 2 ∈ X , y 1 , y 2 ∈ Y x_(1),x_(2)in X,y_(1),y_(2)in Yx_{1}, x_{2} \in X, y_{1}, y_{2} \in Yx1,x2∈X,y1,y2∈Y and α ∈ [ 0 , 1 ] α ∈ [ 0 , 1 ] alpha in[0,1]\alpha \in[0,1]α∈[0,1].
Taking the infimum with respect to y 1 , y 2 ∈ Y y 1 , y 2 ∈ Y y_(1),y_(2)in Yy_{1}, y_{2} \in Yy1,y2∈Y we obtain
(9) F ( α x 1 + ( 1 − α ) x 2 ) ≤ α F ( x 1 ) + ( 1 − α ) F ( x 2 ) (9) F α x 1 + ( 1 − α ) x 2 ≤ α F x 1 + ( 1 − α ) F x 2 {:(9)F(alphax_(1)+(1-alpha)x_(2)) <= alpha F(x_(1))+(1-alpha)F(x_(2)):}\begin{equation*} F\left(\alpha x_{1}+(1-\alpha) x_{2}\right) \leq \alpha F\left(x_{1}\right)+(1-\alpha) F\left(x_{2}\right) \tag{9} \end{equation*}(9)F(αx1+(1−α)x2)≤αF(x1)+(1−α)F(x2)
for all x 1 , x 2 ∈ X x 1 , x 2 ∈ X x_(1),x_(2)in Xx_{1}, x_{2} \in Xx1,x2∈X and all α ∈ [ 0 , 1 ] α ∈ [ 0 , 1 ] alpha in[0,1]\alpha \in[0,1]α∈[0,1], showing that the function F F FFF in E Y ( f ) E Y ( f ) E_(Y)(f)E_{Y}(f)EY(f), defined by (8), is convex.
b) If f ∈ S f ∈ S f in Sf \in Sf∈S Lip Y Y YYY is concave on Y Y YYY, let G : X → R G : X → R G:X rarrRG: X \rightarrow \mathbb{R}G:X→R be defined by
(10) G ( x ) = sup y ∈ Y { f ( y ) − ‖ f ‖ Y ⋅ d ( y , x ) } , x ∈ X (10) G ( x ) = sup y ∈ Y   f ( y ) − ‖ f ‖ Y ⋅ d ( y , x ) , x ∈ X {:(10)G(x)=s u p_(y in Y){f(y)-||f||_(Y)*d(y,x)}","x in X:}\begin{equation*} G(x)=\sup _{y \in Y}\left\{f(y)-\|f\|_{Y} \cdot d(y, x)\right\}, x \in X \tag{10} \end{equation*}(10)G(x)=supy∈Y{f(y)−‖f‖Y⋅d(y,x)},x∈X
Then G G GGG is well defined and G ∈ E Y ( f ) G ∈ E Y ( f ) G inE_(Y)(f)G \in E_{Y}(f)G∈EY(f) [4, Theorem 2].
For any x 1 , x 2 ∈ X , y 1 , y 2 ∈ Y x 1 , x 2 ∈ X , y 1 , y 2 ∈ Y x_(1),x_(2)in X,y_(1),y_(2)in Yx_{1}, x_{2} \in X, y_{1}, y_{2} \in Yx1,x2∈X,y1,y2∈Y and α ∈ [ 0 , 1 ] α ∈ [ 0 , 1 ] alpha in[0,1]\alpha \in[0,1]α∈[0,1] we have
G ( α x 1 + ( 1 − α ) x 2 ) ≥ f ( α y 1 + ( 1 − α ) y 2 ) − − ‖ f ‖ Y d ( α y 1 + ( 1 − α ) y 2 , α x 1 + ( 1 − α ) x 2 ) ≥ α f ( y 1 ) + ( 1 − α ) f ( y 2 ) − − ‖ f ‖ Y [ α ⋅ d ( y 1 , x 1 ) + ( 1 − α ) d ( y 2 , x 2 ) ] = α [ f ( y 1 ) − ‖ f ‖ Y d ( y 1 , x 1 ) ] + + ( 1 − α ) [ f ( y 2 ) − ‖ f ‖ Y d ( y 2 , x 2 ) ] G α x 1 + ( 1 − α ) x 2 ≥ f α y 1 + ( 1 − α ) y 2 − − ‖ f ‖ Y d α y 1 + ( 1 − α ) y 2 , α x 1 + ( 1 − α ) x 2 ≥ α f y 1 + ( 1 − α ) f y 2 − − ‖ f ‖ Y α ⋅ d y 1 , x 1 + ( 1 − α ) d y 2 , x 2 = α f y 1 − ‖ f ‖ Y d y 1 , x 1 + + ( 1 − α ) f y 2 − ‖ f ‖ Y d y 2 , x 2 {:[G(alphax_(1)+(1-alpha)x_(2))],[ >= f(alphay_(1)+(1-alpha)y_(2))-],[-||f||_(Y)d(alphay_(1)+(1-alpha)y_(2),alphax_(1)+(1-alpha)x_(2))],[ >= alpha f(y_(1))+(1-alpha)f(y_(2))-],[-||f||_(Y)[alpha*d(y_(1),x_(1))+(1-alpha)d(y_(2),x_(2))]],[=alpha[f(y_(1))-||f||_(Y)d(y_(1),x_(1))]+],[+(1-alpha)[f(y_(2))-||f||_(Y)d(y_(2),x_(2))]]:}\begin{aligned} & G\left(\alpha x_{1}+(1-\alpha) x_{2}\right) \\ \geq & f\left(\alpha y_{1}+(1-\alpha) y_{2}\right)- \\ & -\|f\|_{Y} d\left(\alpha y_{1}+(1-\alpha) y_{2}, \alpha x_{1}+(1-\alpha) x_{2}\right) \\ \geq & \alpha f\left(y_{1}\right)+(1-\alpha) f\left(y_{2}\right)- \\ & -\|f\|_{Y}\left[\alpha \cdot d\left(y_{1}, x_{1}\right)+(1-\alpha) d\left(y_{2}, x_{2}\right)\right] \\ = & \alpha\left[f\left(y_{1}\right)-\|f\|_{Y} d\left(y_{1}, x_{1}\right)\right]+ \\ & +(1-\alpha)\left[f\left(y_{2}\right)-\|f\|_{Y} d\left(y_{2}, x_{2}\right)\right] \end{aligned}G(αx1+(1−α)x2)≥f(αy1+(1−α)y2)−−‖f‖Yd(αy1+(1−α)y2,αx1+(1−α)x2)≥αf(y1)+(1−α)f(y2)−−‖f‖Y[α⋅d(y1,x1)+(1−α)d(y2,x2)]=α[f(y1)−‖f‖Yd(y1,x1)]++(1−α)[f(y2)−‖f‖Yd(y2,x2)]
Taking the supremum with respect to y 1 , y 2 ∈ Y y 1 , y 2 ∈ Y y_(1),y_(2)in Yy_{1}, y_{2} \in Yy1,y2∈Y we get
(11) G ( α x 1 + ( 1 − α ) x 2 ) ≥ α G ( x 1 ) + ( 1 − α ) G ( x 2 ) (11) G α x 1 + ( 1 − α ) x 2 ≥ α G x 1 + ( 1 − α ) G x 2 {:(11)G(alphax_(1)+(1-alpha)x_(2)) >= alpha G(x_(1))+(1-alpha)G(x_(2)):}\begin{equation*} G\left(\alpha x_{1}+(1-\alpha) x_{2}\right) \geq \alpha G\left(x_{1}\right)+(1-\alpha) G\left(x_{2}\right) \tag{11} \end{equation*}(11)G(αx1+(1−α)x2)≥αG(x1)+(1−α)G(x2)
for all 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 , 1 ] α ∈ [ 0 , 1 ] alpha in[0,1]\alpha \in[0,1]α∈[0,1], showing that the function G G GGG from E Y ( f ) E Y ( f ) E_(Y)(f)E_{Y}(f)EY(f), defined by (10), is concave.
Definition 1.4 Let X X XXX be a real linear space and θ ∈ Z ⊂ X θ ∈ Z ⊂ X theta in Z sub X\theta \in Z \subset Xθ∈Z⊂X where θ θ theta\thetaθ denotes the null element of X X XXX. The set Z Z ZZZ is called starshaped if
(12) ( ∀ ) α , α ∈ [ 0 , 1 ] , ( ∀ ) z ∈ Z , α z ∈ Z . (12) ( ∀ ) α , α ∈ [ 0 , 1 ] , ( ∀ ) z ∈ Z , α z ∈ Z . {:(12)(AA)alpha","alpha in[0","1]","(AA)z in Z","alpha z in Z.:}\begin{equation*} (\forall) \alpha, \alpha \in[0,1],(\forall) z \in Z, \alpha z \in Z . \tag{12} \end{equation*}(12)(∀)α,α∈[0,1],(∀)z∈Z,αz∈Z.
Obviously that any convex subset of X X XXX which contains θ θ theta\thetaθ is starshaped, and the converse is not true in general.
A function f : Z → R f : Z → R f:Z rarrRf: Z \rightarrow \mathbb{R}f:Z→R, where Z Z ZZZ is a starshaped subset of a linear space X X XXX, is called starshaped if
(12a) f ( α z ) ≤ α f ( z ) . (12a) f ( α z ) ≤ α f ( z ) . {:(12a)f(alpha z) <= alpha f(z).:}\begin{equation*} f(\alpha z) \leq \alpha f(z) . \tag{12a} \end{equation*}(12a)f(αz)≤αf(z).
for all z ∈ Z z ∈ Z z in Zz \in Zz∈Z and α ∈ [ 0 , 1 ] α ∈ [ 0 , 1 ] alpha in[0,1]\alpha \in[0,1]α∈[0,1]. A convex function f : Y → R f : Y → R f:Y rarrRf: Y \rightarrow \mathbb{R}f:Y→R, defined on a convex subset Y Y YYY of X X XXX containing θ θ theta\thetaθ, and such that f ( θ ) ≤ 0 f ( θ ) ≤ 0 f(theta) <= 0f(\theta) \leq 0f(θ)≤0 is starshaped but there are starshaped functions on Y Y YYY which are not convex.
Definition 1.5 Let ( X , d X , d X,dX, dX,d ) be a quasi-metric linear space. The quasi-metric d d ddd is called starshaped on X X XXX if the inequality
(13) d ( α x , α y ) ≤ α d ( x , y ) (13) d ( α x , α y ) ≤ α d ( x , y ) {:(13)d(alpha x","alpha y) <= alpha d(x","y):}\begin{equation*} d(\alpha x, \alpha y) \leq \alpha d(x, y) \tag{13} \end{equation*}(13)d(αx,αy)≤αd(x,y)
holds for all x , y ∈ X x , y ∈ X x,y in Xx, y \in Xx,y∈X and α ∈ [ 0 , 1 ] α ∈ [ 0 , 1 ] alpha in[0,1]\alpha \in[0,1]α∈[0,1].
Remark 1.1 If ( X , d ) ( X , d ) (X,d)(X, d)(X,d) is a quasi-metric linear space with convex quasi-metric, then d d ddd is starshaped because the inequality
d ( α x + ( 1 − α ) θ ) , α y + ( 1 − α ) θ ≤ α d ( x , y ) + ( 1 − α ) d ( θ , θ ) d ( α x + ( 1 − α ) θ ) , α y + ( 1 − α ) θ ≤ α d ( x , y ) + ( 1 − α ) d ( θ , θ ) d(alpha x+(1-alpha)theta),alpha y+(1-alpha)theta <= alpha d(x,y)+(1-alpha)d(theta,theta)d(\alpha x+(1-\alpha) \theta), \alpha y+(1-\alpha) \theta \leq \alpha d(x, y)+(1-\alpha) d(\theta, \theta)d(αx+(1−α)θ),αy+(1−α)θ≤αd(x,y)+(1−α)d(θ,θ)
yields
d ( α x , α y ) ≤ α d ( x , y ) d ( α x , α y ) ≤ α d ( x , y ) d(alpha x,alpha y) <= alpha d(x,y)d(\alpha x, \alpha y) \leq \alpha d(x, y)d(αx,αy)≤αd(x,y)
for all x , y ∈ X x , y ∈ X x,y in Xx, y \in Xx,y∈X and α ∈ [ 0 , 1 ] α ∈ [ 0 , 1 ] alpha in[0,1]\alpha \in[0,1]α∈[0,1].
Now we shall prove the extension result for starshaped semiLipschitz functions.
Theorem 1.2 Let ( X , d X , d X,dX, dX,d ) be a quasi-metric linear space with starshaped quasi-metric d d ddd and let Z Z ZZZ be a starshaped subset of X X XXX.
Then every starshaped function φ ∈ S φ ∈ S varphi in S\varphi \in Sφ∈S Lip Z Z ZZZ admits at least one starshaped extension Φ ∈ E Z ( φ ) Φ ∈ E Z ( φ ) Phi inE_(Z)(varphi)\Phi \in E_{Z}(\varphi)Φ∈EZ(φ).
Proof. Let φ ∈ S φ ∈ S varphi in S\varphi \in Sφ∈S Lip Z Z ZZZ be starshaped on the starshaped set Z ⊂ X Z ⊂ X Z sub XZ \subset XZ⊂X. The function
(14) Φ ( x ) = inf z ∈ Z { φ ( z ) + ‖ φ ‖ Z d ( x , z ) } , x ∈ X (14) Φ ( x ) = inf z ∈ Z   φ ( z ) + ‖ φ ‖ Z d ( x , z ) , x ∈ X {:(14)Phi(x)=i n f_(z in Z){varphi(z)+||varphi||_(Z)d(x,z)}","x in X:}\begin{equation*} \Phi(x)=\inf _{z \in Z}\left\{\varphi(z)+\|\varphi\|_{Z} d(x, z)\right\}, x \in X \tag{14} \end{equation*}(14)Φ(x)=infz∈Z{φ(z)+‖φ‖Zd(x,z)},x∈X
belongs to E Z ( φ ) E Z ( φ ) E_(Z)(varphi)E_{Z}(\varphi)EZ(φ) (Th 2 in [4]).
We shall show that Φ Φ Phi\PhiΦ is also starshaped on X X XXX. To this end let x ∈ X , z ∈ Z x ∈ X , z ∈ Z x in X,z in Zx \in X, z \in Zx∈X,z∈Z and α ∈ [ 0 , 1 ] α ∈ [ 0 , 1 ] alpha in[0,1]\alpha \in[0,1]α∈[0,1]. We have
Φ ( α x ) = φ ( α z ) + ‖ φ ‖ Z d ( α x , α z ) ≤ α φ ( z ) + α ‖ φ ‖ Z d ( x , z ) = α [ φ ( z ) + ‖ φ ‖ Z ⋅ d ( x , z ) ] . Φ ( α x ) = φ ( α z ) + ‖ φ ‖ Z d ( α x , α z ) ≤ α φ ( z ) + α ‖ φ ‖ Z d ( x , z ) = α φ ( z ) + ‖ φ ‖ Z ⋅ d ( x , z ) . {:[Phi(alpha x)=varphi(alpha z)+||varphi||_(Z)d(alpha x","alpha z)],[ <= alpha varphi(z)+alpha||varphi||_(Z)d(x","z)],[=alpha[varphi(z)+||varphi||_(Z)*d(x,z)].]:}\begin{aligned} \Phi(\alpha x) & =\varphi(\alpha z)+\|\varphi\|_{Z} d(\alpha x, \alpha z) \\ & \leq \alpha \varphi(z)+\alpha\|\varphi\|_{Z} d(x, z) \\ & =\alpha\left[\varphi(z)+\|\varphi\|_{Z} \cdot d(x, z)\right] . \end{aligned}Φ(αx)=φ(αz)+‖φ‖Zd(αx,αz)≤αφ(z)+α‖φ‖Zd(x,z)=α[φ(z)+‖φ‖Z⋅d(x,z)].
Taking the infimum with respect to z ∈ Z z ∈ Z z in Zz \in Zz∈Z we get
Φ ( α x ) ≤ α Φ ( x ) Φ ( α x ) ≤ α Φ ( x ) Phi(alpha x) <= alpha Phi(x)\Phi(\alpha x) \leq \alpha \Phi(x)Φ(αx)≤αΦ(x)
for all x ∈ X x ∈ X x in Xx \in Xx∈X and all α ∈ [ 0 , 1 ] α ∈ [ 0 , 1 ] alpha in[0,1]\alpha \in[0,1]α∈[0,1], showing that the function Φ Φ Phi\PhiΦ defined by (14) is a starshaped extension of φ φ varphi\varphiφ.

References

[1] Romaguera, S., Sanchis, M., Semi-Lipschitz Functions in Quasi-Metric Spaces, J.A.T 103 (2000), 292-301.
[2] McShane, J.A. Extension of range of functions, Bull.Amer.Math.Soc. 40 (1934), 837-842.
[3] Cobzaş, S., Mustăţa, C., Norm Preserving Extension of Convex Lipschitz Functions J.A.T. 24(1978) 555-564.
[4] Mustăta, C., On the Extension of Semi-Lipschitz Functions on Quasi-Metric space (to appear).
[5] Wels, J.H., Williams, L.R., Embeddings and Extension in Analysis, Springer-Verlag Berlin, 1975.
"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