On the uniqueness of extension and unique best approximation in the dual of an asymmetric normed linear space

Abstract


A well known result of R. R. Phelps (1960) asserts that in order that every linear continuous functional, defined on a subspace \(Y\) of a real normed space \(X\), have a unique norm preserving extension it is necessary and sufficient that its annihilator \(Y^{\perp}\) be a Chebyshevian subspace of \(X\ast\). The aim of this note is to show that this result holds also in the case of spaces with asymmetric norm.

Authors

Costica Mustăţa
“Tiberiu Popoviciu” Institute of Numerical Analysis, Romanian Academ, Romania

Keywords

Asymmetric normed spaces; extensions preserving asymmetric norm; best approximation

Paper coordinates

C. Mustăţa, On the uniqueness of extension and unique best approximation in the dual of an asymmetric normed linear space, Rev. Anal. Numer. Theor. Approx. 32 (2003) no. 2, 187-192.

PDF

About this paper

Journal

Revue d’Analyse Numerique et de Theorie de l’Approximation

Publisher Name

Publising Romanian Academy

DOI
Print ISSN

2457-6794

Online ISSN

2501-059X

google scholar link

[1] Alegre, C., Ferrer, J.andGregori, V.,On the Hahn–Banach theorem in certainlinear quasi-uniform structures,Acta Math. Hungar,82, pp. 315–320, 1999.
[2] Borodin, P. A.,The Banach–Mazur Theorem for spaces with asymmetric norm andits applications in convex analysis, Mathematical Notes,69, no. 3, pp. 298–305, 2001.
[3] Cobzas S.,Phelps type duality results in best approximation,Rev. Anal. Numer.Theor. Approx.,31, no. 1, pp. 29–43, 2002.
[4] Dolzhenko, E. P.andSevast’yanov, E. A.,Approximation with sign-sensitiveweights, Izv. Ross. Akad. Nauk Ser. Mat. [Russian Acad. Sci. Izv. Math.], 62, no. 6,pp. 59–102, 1998 and63, no. 3, pp. 77–118, 1999.
[5] Ferrer, J., Gregori, V.andAlegre, C.,Quasi-uniform structures in linear lattices,Rocky Mountain J. Math.,23, pp. 877–884, 1993.
[6] Garcia-Raffi, L. M., Romaguera, S.and Sanchez Perez, E. A.,Extension ofasymmetric norms to linear spaces, Rend. Istit. Mat. Trieste,XXXIII, pp. 113–125,2001.
[7] Garcia-Raffi, L. M., Romaguera S.and Sanchez-Perez, E. A.,The dual space ofan asymmetric normed linear space,Quaestiones Mathematicae,26, pp. 83–96, 2003.
[8] Krein, M. G.and Nudel’man, A. A.,The Markov Moment Problem and ExtremumProblems, Nauka, Moscow, 1973 (in Russian).
[9] Kopperman, R. D.,All topologies come from generalized metrics, Amer. Math.Monthly,95, pp. 89–97, 1988.
[10] McShane, E. J.,Extension of range of functions, Bull. Amer. Math. Soc.,40, pp. 847–842, 1934.
[11] Mustata, C.,Extensions of semi-Lipschitz functions on quasi-metric spaces, Rev.Anal. Numer. Theor. Approx.,30, no. 1, pp. 61–67, 2001.
[12] Mustata, C.,Extensions of convex semi-Lipschitz functions on quasi-metric linearspaces, Seminaire de la Theorie de la Meileure Approximation Convexite et Optimiza-tion, Cluj-Napoca, le 29 novembre, pp. 85–92, 2001.
[13] Mustata, C.,A Phelps type theorem for spaces with asymmetric norms, Bul. Stiint.Univ. Baia-Mare, Ser. B,XVIII, no. 2, pp. 275–280, 2002.
[14] Phelps, R. R.,Uniqueness of Hahn–Banach extension and unique best approximation,Trans. Amer. Math. Soc.,95, pp. 238–255, 1960.
[15] Romaguera, S.and Sanchis, M.,Semi-Lipschitz functions and best approximation inquasi-metric spaces, J. Approx. Theory,103, pp. 292–301, 2000.
[16] Singer, I.,Best approximation in normed linear spaces by elements of linear subspaces,Ed. Acad. RSR, Bucharest, 1967 (in Romanian); English Translation, Springer, Berlin,1970

Paper (preprint) in HTML form

2003-Mustata-On the uniqueness of extension and unique-Jnaat 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; }

ON THE UNIQUENESS OF EXTENSION AND UNIQUE BEST APPROXIMATION IN THE DUAL OF AN ASYMMETRIC NORMED LINEAR SPACE

COSTICĂ MUSTĂTA*

Abstract

A well known result of R. R. Phelps (1960) asserts that in order that every linear continuous functional, defined on a subspace Y Y YYY of a real normed space X X XXX, have a unique norm preserving extension it is necessary and sufficient that its annihilator Y ⊥ Y ⊥ Y^(_|_)Y^{\perp}Y⊥ be a Chebyshevian subspace of X ∗ X ∗ X^(**)X^{*}X∗. The aim of this note is to show that this result holds also in the case of spaces with asymmetric norm.

MSC 2000. 41A65, 46A22, 46B20.
Keywords. Asymmetric normed spaces, extensions preserving asymmetric norm, best approximation.

1. INTRODUCTION

Let X X XXX be a real linear space. A function ‖ ⋅ ∣: X → [ 0 , ∞ ) ‖ ⋅ ∣: X → [ 0 , ∞ ) ||*∣:X rarr[0,oo)\| \cdot \mid: X \rightarrow[0, \infty)‖⋅∣:X→[0,∞) is called an asymmetric norm if it satisfies all the usual axioms of a norm, excepting the absolute homogeneity, which is replaced by positive homogeneity, i.e.,
‖ λ x | = λ ‖ x | , ∀ x ∈ X , ∀ λ ≥ 0 . ‖ λ x | = λ ‖ x | , ∀ x ∈ X , ∀ λ ≥ 0 . ||lambda x|=lambda||x|,quad AA x in X,AA lambda >= 0.\|\lambda x|=\lambda \| x|, \quad \forall x \in X, \forall \lambda \geq 0 .‖λx|=λ‖x|,∀x∈X,∀λ≥0.
The asymmetric norm is called with extended values if there exists x ∈ X x ∈ X x in Xx \in Xx∈X such that ‖ x ∣= + ∞ ‖ x ∣= + ∞ ||x∣=+oo\| x \mid=+\infty‖x∣=+∞. The pair ( X , ‖ ⋅ ‖ X , ‖ ⋅ ‖ X,||*||X,\|\cdot\|X,‖⋅‖ ) is called a space with asymmetric norm (see [8], [2]).
In a space with asymmetric norm it is possible that ‖ x ‖ ≠ ‖ − x ∣ ‖ x ‖ ≠ ‖ − x ∣ ||x||!=||-x∣\|x\| \neq \|-x \mid‖x‖≠‖−x∣ for some x ∈ X x ∈ X x in Xx \in Xx∈X. The asymmetric norm generates a topology having as a neighborhood base the balls B ( x , r ) = { y ∈ X : ‖ y − x ∣< r } , x ∈ X , r ≥ 0 B ( x , r ) = { y ∈ X : ‖ y − x ∣< r } , x ∈ X , r ≥ 0 B(x,r)={y in X:||y-x∣<r},x in X,r >= 0B(x, r)=\{y \in X: \| y-x \mid<r\}, x \in X, r \geq 0B(x,r)={y∈X:‖y−x∣<r},x∈X,r≥0, but the topological space ( X , τ ‖ ⋅ ∣ ) X , τ ‖ ⋅ ∣ (X,tau_(||*∣))\left(X, \tau_{\| \cdot \mid}\right)(X,τ‖⋅∣) is not a linear topological space, because the multiplication by scalars is not a continuous operation (see [2, p. 199]).
Let X # X # X^(#)X^{\#}X# be the algebraic dual of X X XXX, i.e. the space of all linear functional on X X XXX. We say that f ∈ X # f ∈ X # f inX^(#)f \in X^{\#}f∈X# is bounded on X X XXX if
(1) sup { f ( x ) : x ∈ X , ‖ x ∣≤ 1 } < ∞ (1) sup { f ( x ) : x ∈ X , ‖ x ∣≤ 1 } < ∞ {:(1)s u p{f(x):x in X","quad||x∣≤1} < oo:}\begin{equation*} \sup \{f(x): x \in X, \quad \| x \mid \leq 1\}<\infty \tag{1} \end{equation*}(1)sup{f(x):x∈X,‖x∣≤1}<∞
It is immediate that if f , g ∈ X # f , g ∈ X # f,g inX^(#)f, g \in X^{\#}f,g∈X# are bounded then their sum f + g f + g f+gf+gf+g and the product λ f λ f lambda f\lambda fλf for λ ≥ 0 λ ≥ 0 lambda >= 0\lambda \geq 0λ≥0 are bounded too. This shows that the set of all bounded linear functionals on X X XXX is a cone (see [2]), or an ac-space, according to [7].
In general, it is possible that for a bounded linear functional f f fff on ( X , ‖ ⋅ ‖ X , ‖ ⋅ ‖ X,||*||X,\|\cdot\|X,‖⋅‖ ) the linear functional − f − f -f-f−f be not bounded. Such an example is given by the functional f ( x ) = x ( 1 ) f ( x ) = x ( 1 ) f(x)=x(1)f(x)=x(1)f(x)=x(1) defined on the space
X = { x : [ 0 , 1 ] → R ∣ x continuous and ∫ 0 1 x ( t ) d t = 0 } X = x : [ 0 , 1 ] → R ∣ x  continuous and  ∫ 0 1   x ( t ) d t = 0 X={x:[0,1]rarrR∣x" continuous and "int_(0)^(1)x(t)dt=0}X=\left\{x:[0,1] \rightarrow \mathbb{R} \mid x \text { continuous and } \int_{0}^{1} x(t) \mathrm{d} t=0\right\}X={x:[0,1]→R∣x continuous and ∫01x(t)dt=0}
equipped with the asymmetric norm
‖ x ∣= max { x ( t ) : t ∈ [ 0 , 1 ] } , x ∈ X . ‖ x ∣= max { x ( t ) : t ∈ [ 0 , 1 ] } , x ∈ X . ||x∣=max{x(t):t in[0,1]},x in X.\| x \mid=\max \{x(t): t \in[0,1]\}, x \in X .‖x∣=max{x(t):t∈[0,1]},x∈X.
Taking x n ( t ) = 1 − n t n − 1 x n ( t ) = 1 − n t n − 1 x_(n)(t)=1-nt^(n-1)x_{n}(t)=1-n t^{n-1}xn(t)=1−ntn−1 it follows ‖ x n ‖ = 1 x n = 1 ||x_(n)||=1\left\|x_{n}\right\|=1‖xn‖=1 and ( − f ) ( x n ) = f ( − x n ) = ( − x n ) ( 1 ) = n − 1 ( − f ) x n = f − x n = − x n ( 1 ) = n − 1 (-f)(x_(n))=f(-x_(n))=(-x_(n))(1)=n-1(-f)\left(x_{n}\right)=f\left(-x_{n}\right)= \left(-x_{n}\right)(1)=n-1(−f)(xn)=f(−xn)=(−xn)(1)=n−1, implying
sup { ( − f ) ( x ) : ‖ x ∣≤ 1 } ≥ sup { ( − f ) ( x n ) : n ∈ N } = + ∞ . sup { ( − f ) ( x ) : ‖ x ∣≤ 1 } ≥ sup ( − f ) x n : n ∈ N = + ∞ . s u p{(-f)(x):||x∣≤1} >= s u p{(-f)(x_(n)):n inN}=+oo.\sup \{(-f)(x): \| x \mid \leq 1\} \geq \sup \left\{(-f)\left(x_{n}\right): n \in \mathbb{N}\right\}=+\infty .sup{(−f)(x):‖x∣≤1}≥sup{(−f)(xn):n∈N}=+∞.
For a bounded linear functional f f fff put
(2) ‖ f ∣= sup { f ( x ) : x ∈ X , ‖ x ∣≤ 1 } (2) ‖ f ∣= sup { f ( x ) : x ∈ X , ‖ x ∣≤ 1 } {:(2)||f∣=s u p{f(x):x in X","||x∣≤1}:}\begin{equation*} \| f \mid=\sup \{f(x): x \in X, \| x \mid \leq 1\} \tag{2} \end{equation*}(2)‖f∣=sup{f(x):x∈X,‖x∣≤1}
It follows that the function ‖ ⋅ ∣ ‖ ⋅ ∣ ||*∣\| \cdot \mid‖⋅∣ defined by (2) satisfies the axioms of an asymmetric norm on the cone of all bounded linear functionals on X X XXX (see [2]).
Observe that
f ( x ) ≤ ‖ f | ⋅ ‖ x | , x ∈ X f ( x ) ≤ ‖ f | ⋅ ‖ x | , x ∈ X f(x) <= ||f|*||x|,quad x in Xf(x) \leq\|f|\cdot \| x|, \quad x \in Xf(x)≤‖f|⋅‖x|,x∈X
and, since f ( − x ) ≤ ‖ f | ⋅ ‖ − x | f ( − x ) ≤ ‖ f | ⋅ ‖ − x | f(-x) <= ||f|*||-x|f(-x) \leq\|f|\cdot \|-x|f(−x)≤‖f|⋅‖−x|, one obtains the inequalities
− ‖ f | ⋅ ‖ − x | ≤ f ( x ) ≤ ‖ f | ⋅ ‖ x | , x ∈ X . − ‖ f | ⋅ ‖ − x | ≤ f ( x ) ≤ ‖ f | ⋅ ‖ x | , x ∈ X . -||f|*||-x| <= f(x) <= ||f|*||x|,quad x in X.-\|f|\cdot\|-x|\leq f(x) \leq\|f|\cdot \| x|, \quad x \in X .−‖f|⋅‖−x|≤f(x)≤‖f|⋅‖x|,x∈X.
The inequality | f ( x ) | ≤ ‖ f | ⋅ ‖ x | | f ( x ) | ≤ ‖ f | ⋅ ‖ x | |f(x)| <= ||f|*||x||f(x)| \leq\|f|\cdot \| x||f(x)|≤‖f|⋅‖x| is not true in general, but if we consider the symmetric norm ‖ x ‖ = max { ‖ x | , ‖ − x | } ‖ x ‖ = max { ‖ x | , ‖ − x | } ||x||=max{||x|,||-x|}\|x\|=\max \{\|x|, \|-x|\}‖x‖=max{‖x|,‖−x|} on X X XXX, then | f ( x ) | ≤ ‖ f ∣ ‖ x ‖ , x ∈ X | f ( x ) | ≤ ‖ f ∣ ‖ x ‖ , x ∈ X |f(x)| <= ||f∣||x||,x in X|f(x)| \leq\|f \mid\| x \|, x \in X|f(x)|≤‖f∣‖x‖,x∈X. This shows that a bounded linear functional is always continuous with respect to the topology generated by the symmetric norm ‖ x ‖ = max { ‖ x | , ‖ − x | } ‖ x ‖ = max { ‖ x | , ‖ − x | } ||x||=max{||x|,||-x|}\|x\|=\max \{\|x|, \|-x|\}‖x‖=max{‖x|,‖−x|} associated to an asymmetric norm ‖ ⋅ ∣ ‖ ⋅ ∣ ||*∣\| \cdot \mid‖⋅∣.
If both f f fff and − f − f -f-f−f are bounded then the linear functional f f fff is continuous with respect to the topology generated by the asymmetric norm.
Consider on R R R\mathbb{R}R the asymmetric norm u ( x ) = x ∨ 0 = max { x , 0 } u ( x ) = x ∨ 0 = max { x , 0 } u(x)=x vv0=max{x,0}u(x)=x \vee 0=\max \{x, 0\}u(x)=x∨0=max{x,0} (see [7]). A functional f : ( X , ‖ ⋅ ‖ ) → ( R , u ) f : ( X , ‖ ⋅ ‖ ) → ( R , u ) f:(X,||*||)rarr(R,u)f:(X,\|\cdot\|) \rightarrow(\mathbb{R}, u)f:(X,‖⋅‖)→(R,u) is continuous in x 0 ∈ X x 0 ∈ X x_(0)in Xx_{0} \in Xx0∈X if for every ε > 0 ε > 0 epsi > 0\varepsilon>0ε>0 there exists δ > 0 δ > 0 delta > 0\delta>0δ>0 such that for every x ∈ X x ∈ X x in Xx \in Xx∈X with ‖ x − x 0 ∣< δ ‖ x − x 0 ∣< δ ||x-x_(0)∣<delta\| x-x_{0} \mid<\delta‖x−x0∣<δ we have ( f ( x ) − f ( x 0 ) ) ∨ 0 < ε f ( x ) − f x 0 ∨ 0 < ε (f(x)-f(x_(0)))vv0 < epsi\left(f(x)-f\left(x_{0}\right)\right) \vee 0<\varepsilon(f(x)−f(x0))∨0<ε.
It is clear that a linear functional f : ( X , ‖ ⋅ ‖ ) → ( R , u ) f : ( X , ‖ ⋅ ‖ ) → ( R , u ) f:(X,||*||)rarr(R,u)f:(X,\|\cdot\|) \rightarrow(\mathbb{R}, u)f:(X,‖⋅‖)→(R,u) is continuous if and only if there exists M > 0 M > 0 M > 0M>0M>0 such that f ( x ) ∨ 0 < M ‖ x ∣ f ( x ) ∨ 0 < M ‖ x ∣ f(x)vv0 < M||x∣f(x) \vee 0<M \| x \midf(x)∨0<M‖x∣.
According to [7], the set
(3) X ∗ = { f : ( X , ‖ ⋅ ‖ ) → ( R , u ) , f linear continuous } (3) X ∗ = { f : ( X , ‖ ⋅ ‖ ) → ( R , u ) , f  linear continuous  } {:(3)X^(**)={f:(X","||*||)rarr(R","u)","f" linear continuous "}:}\begin{equation*} X^{*}=\{f:(X,\|\cdot\|) \rightarrow(\mathbb{R}, u), f \text { linear continuous }\} \tag{3} \end{equation*}(3)X∗={f:(X,‖⋅‖)→(R,u),f linear continuous }
is called the asymmetric dual of the space with asymmetric norm ( X , ‖ ⋅ ‖ X , ‖ ⋅ ‖ X,||*||X,\|\cdot\|X,‖⋅‖ ).
If ‖ x ‖ = max { ‖ x | , ‖ − x | } ‖ x ‖ = max { ‖ x | , ‖ − x | } ||x||=max{||x|,||-x|}\|x\|=\max \{\|x|, \|-x|\}‖x‖=max{‖x|,‖−x|} is the norm generated by ‖ ⋅ ∣ ‖ ⋅ ∣ ||*∣\| \cdot \mid‖⋅∣ on X X XXX and R R R\mathbb{R}R is equipped with the usual absolute-value norm | ⋅ | | ⋅ | |*||\cdot||⋅|, then the set
(4) X ∗ s = { f : ( X , ‖ ⋅ ‖ ) → ( R , | ⋅ | ) , f linear continuous } (4) X ∗ s = { f : ( X , ‖ ⋅ ‖ ) → ( R , | ⋅ | ) , f  linear continuous  } {:(4)X^(**s)={f:(X","||*||)rarr(R","|*|)","f" linear continuous "}:}\begin{equation*} X^{* s}=\{f:(X,\|\cdot\|) \rightarrow(\mathbb{R},|\cdot|), f \text { linear continuous }\} \tag{4} \end{equation*}(4)X∗s={f:(X,‖⋅‖)→(R,|⋅|),f linear continuous }
is the (symmetric) dual of ( X , ‖ ⋅ ‖ X , ‖ ⋅ ‖ X,||*||X,\|\cdot\|X,‖⋅‖ ). In other words, X ∗ s X ∗ s X^(**s)X^{* s}X∗s is the usual topological algebraic dual of the normed space ( X , ‖ ⋅ ‖ ) ( X , ‖ ⋅ ‖ ) (X,||*||)(X,\|\cdot\|)(X,‖⋅‖), where ‖ x ‖ = max { ‖ x | , ‖ − x | } ‖ x ‖ = max { ‖ x | , ‖ − x | } ||x||=max{||x|,||-x|}\|x\|=\max \{\|x|, \|-x|\}‖x‖=max{‖x|,‖−x|}.
Observe that X ∗ X ∗ X^(**)X^{*}X∗ is a cone in the linear space X ∗ s X ∗ s X^(**s)X^{* s}X∗s.
Equip the linear space X ∗ s X ∗ s X^(**s)X^{* s}X∗s with the extended asymmetric norm
‖ f | ∗ s = sup { f ( x ) : ‖ x ∣≤ 1 } ‖ f ∗ s = sup { f ( x ) : ‖ x ∣≤ 1 } ||f|^(**s)=s u p{f(x):||x∣≤1}\|\left. f\right|^{* s}=\sup \{f(x): \| x \mid \leq 1\}‖f|∗s=sup{f(x):‖x∣≤1}
whose restriction to the asymmetric dual X ∗ X ∗ X^(**)X^{*}X∗ is
‖ f | ∗ = sup { f ( x ) ∨ 0 : ‖ x ∣≤ 1 } . ‖ f ∗ = sup { f ( x ) ∨ 0 : ‖ x ∣≤ 1 } . ||f|^(**)=s u p{f(x)vv0:||x∣≤1}.\|\left. f\right|^{*}=\sup \{f(x) \vee 0: \| x \mid \leq 1\} .‖f|∗=sup{f(x)∨0:‖x∣≤1}.
It is important to remark the fact that a linear functional f f fff belongs to X ∗ X ∗ X^(**)X^{*}X∗ if and only if it is an upper semicontinuous linear functional on ( X , ‖ ⋅ ‖ X , ‖ ⋅ ‖ X,||*||X,\|\cdot\|X,‖⋅‖ ), and that X ∗ = { f ∈ X ∗ s : ‖ f | ∗ s < + ∞ } X ∗ = f ∈ X ∗ s : ‖ f ∗ s < + ∞ X^(**)={f inX^(**s):||f|^(**s) < +oo}X^{*}=\left\{f \in X^{* s}: \|\left. f\right|^{* s}<+\infty\right\}X∗={f∈X∗s:‖f|∗s<+∞} (see [7]).
Let ( Y , ‖ ⋅ ‖ ) ( Y , ‖ ⋅ ‖ ) (Y,||*||)(Y,\|\cdot\|)(Y,‖⋅‖) be a subspace of the space with asymmetric norm ( X , ‖ ⋅ ‖ X , ‖ ⋅ ‖ X,||*||X,\|\cdot\|X,‖⋅‖ ), and let Y ∗ Y ∗ Y^(**)Y^{*}Y∗ and Y ∗ s Y ∗ s Y^(**s)Y^{* s}Y∗s be the dual cone and the (symmetric) dual of Y Y YYY, respectively.
The following Hahn-Banach type theorem holds:
Theorem 1. Let ( X , ‖ ⋅ ‖ X , ‖ ⋅ ‖ X,||*||X,\|\cdot\|X,‖⋅‖ ) be a real space with asymmetric norm and ( Y , ‖ ⋅ ‖ Y , ‖ ⋅ ‖ Y,||*||Y,\|\cdot\|Y,‖⋅‖ ) a subspace of it. Then for every f ∈ Y ∗ f ∈ Y ∗ f inY^(**)f \in Y^{*}f∈Y∗ there exists F ∈ X ∗ F ∈ X ∗ F inX^(**)F \in X^{*}F∈X∗ such that
F | Y = f and ‖ F | ∗ = ‖ f | ∗ . F Y = f  and  F ∗ = f ∗ . F|_(Y)=f quad" and " quad||F|^(**)=||f|^(**).\left.F\right|_{Y}=f \quad \text { and }\left.\quad\left\|\left.F\right|^{*}=\right\| f\right|^{*} .F|Y=f and ‖F|∗=‖f|∗.
Proof. For f ∈ Y ∗ f ∈ Y ∗ f inY^(**)f \in Y^{*}f∈Y∗ let p : X → R p : X → R p:X rarrRp: X \rightarrow \mathbb{R}p:X→R be defined by p ( x ) = ‖ f | ∗ ⋅ ‖ x ∣ , x ∈ X p ( x ) = f ∗ ⋅ x ∣ , x ∈ X p(x)=||f|^(**)*||x∣,x in Xp(x)=\left\|\left.f\right|^{*} \cdot\right\| x \mid, x \in Xp(x)=‖f|∗⋅‖x∣,x∈X.
The functional p p ppp is convex, positively homogeneous and f ( y ) ≤ ‖ f | ∗ ⋅ ‖ y ∣ f ( y ) ≤ f ∗ ⋅ y ∣ f(y) <= ||f|^(**)*||y∣f(y) \leq\left\|\left.f\right|^{*} \cdot\right\| y \midf(y)≤‖f|∗⋅‖y∣, for every y ∈ Y y ∈ Y y in Yy \in Yy∈Y. By the Hahn-Banach extension theorem ([8, p. 484]) there exists a linear functional F : X → R F : X → R F:X rarrRF: X \rightarrow \mathbb{R}F:X→R such that F | Y = f F Y = f F|_(Y)=f\left.F\right|_{Y}=fF|Y=f and F ( x ) ≤ ‖ f | ∗ ‖ x ∣ F ( x ) ≤ f ∗ x ∣ F(x) <= ||f|^(**)||x∣F(x) \leq\left\|\left.f\right|^{*}\right\| x \midF(x)≤‖f|∗‖x∣, for every x ∈ X x ∈ X x in Xx \in Xx∈X. It follows
‖ F | ∗ = sup { F ( x ) ∨ 0 : ‖ x ∣≤ 1 } ≤ ‖ f | ∗ . F ∗ = sup { F ( x ) ∨ 0 : ‖ x ∣≤ 1 } ≤ f ∗ . ||F|^(**)=s u p{F(x)vv0:||x∣≤1} <= ||f|^(**).\left.\left\|\left.F\right|^{*}=\sup \{F(x) \vee 0: \| x \mid \leq 1\} \leq\right\| f\right|^{*} .‖F|∗=sup{F(x)∨0:‖x∣≤1}≤‖f|∗.
On the other hand
‖ F | ∗ = sup { F ( x ) ∨ 0 : ‖ x ∣≤ 1 , x ∈ X } ≥ sup { F ( y ) ∨ 0 : ‖ y ∣≤ 1 , y ∈ Y } = sup { f ( y ) ∨ 0 : ‖ y ∣≤ 1 , y ∈ Y } = ‖ f | ∗ , ‖ F ∗ = sup { F ( x ) ∨ 0 : ‖ x ∣≤ 1 , x ∈ X } ≥ sup { F ( y ) ∨ 0 : ‖ y ∣≤ 1 , y ∈ Y } = sup { f ( y ) ∨ 0 : ‖ y ∣≤ 1 , y ∈ Y } = ‖ f ∗ , {:[||F|^(**)=s u p{F(x)vv0:||x∣≤1","x in X}],[ >= s u p{F(y)vv0:||y∣≤1","y in Y}],[=s u p{f(y)vv0:||y∣≤1","y in Y}],[=||f|^(**)","]:}\begin{aligned} \|\left. F\right|^{*} & =\sup \{F(x) \vee 0: \| x \mid \leq 1, x \in X\} \\ & \geq \sup \{F(y) \vee 0: \| y \mid \leq 1, y \in Y\} \\ & =\sup \{f(y) \vee 0: \| y \mid \leq 1, y \in Y\} \\ & =\|\left. f\right|^{*}, \end{aligned}‖F|∗=sup{F(x)∨0:‖x∣≤1,x∈X}≥sup{F(y)∨0:‖y∣≤1,y∈Y}=sup{f(y)∨0:‖y∣≤1,y∈Y}=‖f|∗,
showing that ‖ F ‖ ∗ = ‖ f | ∗ ‖ F ‖ ∗ = ‖ f ∗ ||F||^(**)=||f|^(**)\|F\|^{*}=\|\left. f\right|^{*}‖F‖∗=‖f|∗.
For f ∈ Y ∗ f ∈ Y ∗ f inY^(**)f \in Y^{*}f∈Y∗ denote by
E ( f ) = { F ∈ X ∗ : F | Y = f and ‖ F | ∗ = ‖ f | ∗ } E ( f ) = F ∈ X ∗ : F Y = f  and  F ∗ = f ∗ E(f)={F inX^(**):F|_(Y)=f" and "||F|^(**)=||f|^(**)}\mathcal{E}(f)=\left\{F \in X^{*}:\left.F\right|_{Y}=f \text { and }\left.\left\|\left.F\right|^{*}=\right\| f\right|^{*}\right\}E(f)={F∈X∗:F|Y=f and ‖F|∗=‖f|∗}
the set of all extensions that preserve the asymmetric norm.
By Theorem 1, the set E ( f ) E ( f ) E(f)\mathcal{E}(f)E(f) is always nonempty.
The problem of finding necessary or/and sufficient conditions in order that every f ∈ Y ∗ f ∈ Y ∗ f inY^(**)f \in Y^{*}f∈Y∗ have a unique norm preserving extension is closely related to a best approximation problem in the space X ∗ s X ∗ s X^(**s)X^{* s}X∗s equipped with the asymmetric norm ‖ F | ∗ s = sup { F ( x ) : ‖ x ∣≤ 1 } ‖ F ∗ s = sup { F ( x ) : ‖ x ∣≤ 1 } ||F|^(**s)=s u p{F(x):||x∣≤1}\|\left. F\right|^{* s}=\sup \{F(x): \| x \mid \leq 1\}‖F|∗s=sup{F(x):‖x∣≤1}.
Concerning the following notions, in the case of usual spaces, one can consult Singer's book [16].
Let ( Y , ‖ ⋅ ‖ ) ( Y , ‖ ⋅ ‖ ) (Y,||*||)(Y,\|\cdot\|)(Y,‖⋅‖) be subspace of ( X , ‖ ⋅ ‖ ) ( X , ‖ ⋅ ‖ ) (X,||*||)(X,\|\cdot\|)(X,‖⋅‖) and let
Y ⊥ = { G ∈ X ∗ s : G | Y = 0 } Y ⊥ = G ∈ X ∗ s : G Y = 0 Y^(_|_)={G inX^(**s):G|_(Y)=0}Y^{\perp}=\left\{G \in X^{* s}:\left.G\right|_{Y}=0\right\}Y⊥={G∈X∗s:G|Y=0}
the annihilator of Y Y YYY in the space ( X ∗ s , ‖ ⋅ | ∗ s X ∗ s , ‖ ⋅ ∗ s X^(**s),||*|^(**s)X^{* s}, \|\left.\cdot\right|^{* s}X∗s,‖⋅|∗s ).
For F ∈ X ∗ s F ∈ X ∗ s F inX^(**s)F \in X^{* s}F∈X∗s, an element G 0 ∈ Y ⊥ G 0 ∈ Y ⊥ G_(0)inY^(_|_)G_{0} \in Y^{\perp}G0∈Y⊥ is called a best approximation element for F F FFF in Y ⊥ Y ⊥ Y^(_|_)Y^{\perp}Y⊥ if
‖ F − G 0 ‖ ∗ s = inf { ‖ F − g | ∗ s : G ∈ Y ⊥ } = d ( F , Y ⊥ ) F − G 0 ∗ s = inf ‖ F − g ∗ s : G ∈ Y ⊥ = d F , Y ⊥ ||F-G_(0)||^(**s)=i n f{||F-g|^(**s):G inY^(_|_)}=d(F,Y^(_|_))\left\|F-G_{0}\right\|^{* s}=\inf \left\{\| F-\left.g\right|^{* s}: G \in Y^{\perp}\right\}=d\left(F, Y^{\perp}\right)‖F−G0‖∗s=inf{‖F−g|∗s:G∈Y⊥}=d(F,Y⊥)
The set of all best approximation elements for F F FFF in Y ⊥ Y ⊥ Y^(_|_)Y^{\perp}Y⊥ is denoted by P Y ⊥ ( F ) P Y ⊥ ( F ) P_(Y^(_|_))(F)P_{Y^{\perp}}(F)PY⊥(F). If P Y ⊥ ( F ) ≠ ∅ P Y ⊥ ( F ) ≠ ∅ P_(Y^(_|_))(F)!=O/P_{Y^{\perp}}(F) \neq \emptysetPY⊥(F)≠∅ for every F ∈ X ∗ s F ∈ X ∗ s F inX^(**s)F \in X^{* s}F∈X∗s one says that Y ⊥ Y ⊥ Y^(_|_)Y^{\perp}Y⊥ is proximinal, and if card P Y ⊥ ( F ) = 1 card P Y ⊥ ( F ) = 1 cardP_(Y^(_|_))(F)=1\operatorname{card} P_{Y^{\perp}}(F)=1cardPY⊥(F)=1 for every F ∈ X ∗ s F ∈ X ∗ s F inX^(**s)F \in X^{* s}F∈X∗s, then one says that Y ⊥ Y ⊥ Y^(_|_)Y^{\perp}Y⊥ is Chebyshevian.
Theorem 2. Let ( X , ‖ ⋅ ‖ X , ‖ ⋅ ‖ X,||*||X,\|\cdot\|X,‖⋅‖ ) be a space with asymmetric norm and ( Y , ‖ ⋅ ‖ Y , ‖ ⋅ ‖ Y,||*||Y,\|\cdot\|Y,‖⋅‖ ) a subspace of it. Then
a) The annihilator Y ⊥ Y ⊥ Y^(_|_)Y^{\perp}Y⊥ of Y Y YYY is a proximinal subspace of X ∗ s X ∗ s X^(**s)X^{* s}X∗s and, for every F ∈ X ∗ F ∈ X ∗ F inX^(**)F \in X^{*}F∈X∗ we have
d ( F , Y ⊥ ) = ‖ F | Y | ∗ d F , Y ⊥ = ‖ F Y ∗ d(F,Y^(_|_))=||F|_(Y)|^(**)d\left(F, Y^{\perp}\right)=\|\left.\left. F\right|_{Y}\right|^{*}d(F,Y⊥)=‖F|Y|∗
b) An element G ∈ Y ⊥ G ∈ Y ⊥ G inY^(_|_)G \in Y^{\perp}G∈Y⊥ is in P Y ⊥ ( F ) P Y ⊥ ( F ) P_(Y^(_|_))(F)P_{Y^{\perp}}(F)PY⊥(F) if and only if G = F − H G = F − H G=F-HG=F-HG=F−H for some H ∈ E ( F | Y ) H ∈ E F Y H inE(F|_(Y))H \in \mathcal{E}\left(\left.F\right|_{Y}\right)H∈E(F|Y), i.e.,
P Y ⊥ ( F ) = F − E ( F | Y ) . P Y ⊥ ( F ) = F − E F Y . P_(Y^(_|_))(F)=F-E(F|_(Y)).P_{Y^{\perp}}(F)=F-\mathcal{E}\left(\left.F\right|_{Y}\right) .PY⊥(F)=F−E(F|Y).
c) The subspace Y ⊥ Y ⊥ Y^(_|_)Y^{\perp}Y⊥ is Chebyshevian in X ∗ s X ∗ s X^(**s)X^{* s}X∗s if and only if every functional f ∈ Y ∗ f ∈ Y ∗ f inY^(**)f \in Y^{*}f∈Y∗ has a unique norm preserving extension in X ∗ s X ∗ s X^(**s)X^{* s}X∗s.
Proof. a) Let F ∈ X ∗ F ∈ X ∗ F inX^(**)F \in X^{*}F∈X∗. Then F | Y ∈ Y ∗ F Y ∈ Y ∗ F|_(Y)inY^(**)\left.F\right|_{Y} \in Y^{*}F|Y∈Y∗ and, by Theorem 1, E ( F | Y ) ≠ ∅ E F Y ≠ ∅ E(F|_(Y))!=O/\mathcal{E}\left(\left.F\right|_{Y}\right) \neq \emptysetE(F|Y)≠∅. If H ∈ E ( F | Y ) H ∈ E F Y H inE(F|_(Y))H \in \mathcal{E}\left(\left.F\right|_{Y}\right)H∈E(F|Y) then
F | Y = H | Y and ‖ F | Y | ∗ = ‖ H | ∗ , F Y = H Y  and  F Y ∗ = H ∗ , F|_(Y)=H|_(Y)quad" and " quad||F|_(Y)|^(**)=||H|^(**),\left.F\right|_{Y}=\left.H\right|_{Y} \quad \text { and }\left.\quad\left\|\left.\left.F\right|_{Y}\right|^{*}=\right\| H\right|^{*},F|Y=H|Y and ‖F|Y|∗=‖H|∗,
so that F − H ∈ Y ⊥ F − H ∈ Y ⊥ F-H inY^(_|_)F-H \in Y^{\perp}F−H∈Y⊥. We have
‖ F | Y | ∗ = ‖ H | ∗ = ‖ H | ∗ s = ‖ F − ( F − H ) | ∗ s ≥ d ( F , Y ⊥ ) F Y ∗ = H ∗ = H ∗ s = F − ( F − H ) ∗ s ≥ d F , Y ⊥ ||F|_(Y)|^(**)=||H|^(**)=||H|^(**s)=||F-(F-H)|^(**s) >= d(F,Y^(_|_))\left.\left\|\left.\left.F\right|_{Y}\right|^{*}=\right\| H\right|^{*}=\left\|\left.H\right|^{* s}=\right\| F-\left.(F-H)\right|^{* s} \geq d\left(F, Y^{\perp}\right)‖F|Y|∗=‖H|∗=‖H|∗s=‖F−(F−H)|∗s≥d(F,Y⊥)
and, for any G ∈ Y ⊥ G ∈ Y ⊥ G inY^(_|_)G \in Y^{\perp}G∈Y⊥,
‖ F | Y | ∗ = ‖ F | Y − G | Y | ∗ ≤ ‖ F − G | ∗ s . F Y ∗ = F Y − G Y ∗ ≤ ‖ F − G ∗ s . ||F|_(Y)|^(**)=||F|_(Y)-G|_(Y)|^(**) <= ||F-G|^(**s).\left.\left\|\left.\left.F\right|_{Y}\right|^{*}=\right\| F\right|_{Y}-\left.\left.G\right|_{Y}\right|^{*} \leq \| F-\left.G\right|^{* s} .‖F|Y|∗=‖F|Y−G|Y|∗≤‖F−G|∗s.
Taking the infimum with respect to G ∈ Y ⊥ G ∈ Y ⊥ G inY^(_|_)G \in Y^{\perp}G∈Y⊥ we get
‖ F | Y | ∗ ≤ d ( F , Y ⊥ ) ‖ F Y ∗ ≤ d F , Y ⊥ ||F|_(Y)|^(**) <= d(F,Y^(_|_))\|\left.\left. F\right|_{Y}\right|^{*} \leq d\left(F, Y^{\perp}\right)‖F|Y|∗≤d(F,Y⊥)
It follows that d ( F , Y ⊥ ) = ‖ F | Y | ∗ d F , Y ⊥ = ‖ F Y ∗ d(F,Y^(_|_))=||F|_(Y)|^(**)d\left(F, Y^{\perp}\right)=\|\left.\left. F\right|_{Y}\right|^{*}d(F,Y⊥)=‖F|Y|∗.
b) If G ∈ P Y ⊥ ( F ) G ∈ P Y ⊥ ( F ) G inP_(Y^(_|_))(F)G \in P_{Y^{\perp}}(F)G∈PY⊥(F) then
‖ F − G | ∗ s = ‖ F | Y | ∗ F − G ∗ s = F Y ∗ ||F-G|^(**s)=||F|_(Y)|^(**)\left.\left.\left\|F-\left.G\right|^{* s}=\right\| F\right|_{Y}\right|^{*}‖F−G|∗s=‖F|Y|∗
and
( F − G ) | Y = F | Y ( F − G ) Y = F Y (F-G)|_(Y)=F|_(Y)\left.(F-G)\right|_{Y}=\left.F\right|_{Y}(F−G)|Y=F|Y
which shows that F − G ∈ E ( F | Y ) F − G ∈ E F Y F-G inE(F|_(Y))F-G \in \mathcal{E}\left(\left.F\right|_{Y}\right)F−G∈E(F|Y). The conclusion holds with H = F − G H = F − G H=F-GH=F-GH=F−G.
c) Follows from b).
Remark. 1 ∘ 1 ∘ 1^(@)1^{\circ}1∘ Let X ∗ X ∗ X^(**)X^{*}X∗ be the usual topological algebraic dual of the normed space ( X , ‖ ⋅ ‖ X , ‖ ⋅ ‖ X,||*||X,\|\cdot\|X,‖⋅‖ ), and Y ∗ Y ∗ Y^(**)Y^{*}Y∗ the topological algebraic dual of ( Y , ‖ ⋅ ‖ Y , ‖ ⋅ ‖ Y,||*||Y,\|\cdot\|Y,‖⋅‖ ), where Y Y YYY is a subspace of X X XXX. R. R. Phelps [14] showed that Y ⊥ Y ⊥ Y^(_|_)Y^{\perp}Y⊥ (the annihilator of Y Y YYY in X ∗ ) X ∗ {:X^(**))\left.X^{*}\right)X∗) is Chebyshevian if and only if every f ∈ Y ∗ f ∈ Y ∗ f inY^(**)f \in Y^{*}f∈Y∗ has a unique norm-preserving extension F ∈ X ∗ F ∈ X ∗ F inX^(**)F \in X^{*}F∈X∗.
2 ∘ 2 ∘ 2^(@)2^{\circ}2∘ Some Phelps type duality results and applications can be found in [3], and in the bibliography quoted there.

REFERENCES

[1] Alegre, C., Ferrer, J. and Gregori, V., On the Hahn-Banach theorem in certain linear quasi-uniform structures, Acta Math. Hungar, 82, pp. 315-320, 1999.
[2] Borodin, P. A., The Banach-Mazur Theorem for spaces with asymmetric norm and its applications in convex analysis, Mathematical Notes, 69, no. 3, pp. 298-305, 2001.
[3] Cobzaş, S., Phelps type duality results in best approximation, Rev. Anal. Numér. Théor. Approx., 31, no. 1, pp. 29-43, 2002. △ △ /_\\triangle△
[4] Dolzhenko, E. P. and Sevast'yanov, E. A., Approximation with sign-sensitive weights, Izv. Ross. Akad. Nauk Ser. Mat. [Russian Acad. Sci. Izv. Math.], 62, no. 6, pp. 59-102, 1998 and 63, no. 3, pp. 77-118, 1999.
[5] Ferrer, J., Gregori, V. and Alegre, C., Quasi-uniform structures in linear lattices, Rocky Mountain J. Math., 23, pp. 877-884, 1993.
[6] Garćia-Raffi, L. M., Romaguera, S. and Sanchez Pérez, E. A., Extension of asymmetric norms to linear spaces, Rend. Istit. Mat. Trieste, XXXIII, pp. 113-125, 2001.
[7] Garćia-Raffi, L. M., Romaguera S. and Sánchez-Pérez, E. A., The dual space of an asymmetric normed linear space, Quaestiones Mathematicae, 26, pp. 83-96, 2003.
[8] Krein, M. G. and Nudel'man, A. A., The Markov Moment Problem and Extremum Problems, Nauka, Moscow, 1973 (in Russian).
[9] Kopperman, R. D., All topologies come from generalized metrics, Amer. Math. Monthly, 95, pp. 89-97, 1988.
[10] McShane, E. J., Extension of range of functions, Bull. Amer. Math. Soc., 40, pp. 847842, 1934.
[11] Mustăţa, C., Extensions of semi-Lipschitz functions on quasi-metric spaces, Rev. Anal. Numér. Théor. Approx., 30, no. 1, pp. 61-67, 2001. ©
[12] Mustăţa, C., Extensions of convex semi-Lipschitz functions on quasi-metric linear spaces, Séminaire de la Théorie de la Meileure Approximation Convexité et Optimization, Cluj-Napoca, le 29 novembre, pp. 85-92, 2001.
[13] Mustăţa, C., A Phelps type theorem for spaces with asymmetric norms, Bul. Ştiint. Univ. Baia-Mare, Ser. B, XVIII, no. 2, pp. 275-280, 2002.
[14] Phelps, R. R., Uniqueness of Hahn-Banach extension and unique best approximation, Trans. Amer. Math. Soc., 95, pp. 238-255, 1960.
[15] Romaguera, S. and Sanchis, M., Semi-Lipschitz functions and best approximation in quasi-metric spaces, J. Approx. Theory, 103, pp. 292-301, 2000.
[16] Singer, I., Best approximation in normed linear spaces by elements of linear subspaces, Ed. Acad. RSR, Bucharest, 1967 (in Romanian); English Translation, Springer, Berlin, 1970.
Received by the editors: February 3, 2003.

  1. *"T. Popoviciu" Institute of Numerical Analysis, P.O. Box 68-1, 3400 Cluj-Napoca, Romania, e-mail: cmustata@ictp.acad.ro, cmustata2001@yahoo.com.
2003

Related Posts