A classification of Lipschitz functions

Original title (in Romanian)

O clasificare a funcțiilor Lipschitziene

Abstract

Authors

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

Keywords

Paper coordinates

C. Mustăţa, A classification of Lipschitz functions, Rev. Anal. Numer. Teoria Approximatiei 3 (1974) 1, 107-111 (in Romanian).

PDF

About this paper

Print ISSN
Online ISSN

MR 52 #670

google scholar link

[1] Czipser, J. si Geher, L., Extension of funcitons satisfying a Lipschitz condition, Acta Math. Acad. Sci. Hungar, 6 213-220 (1955)
[2] Mustăța, C., Asupra unor spații cebîșeviene din spațiul normat al funcțiilor lipschitiziene, Revista de analiză numerică și teopria aproximației, 2, 1, 81-87, 1973.

Paper (preprint) in HTML form

1974-Mustata-RANTA-O-clasificare-a-functiilor-Lipschitziene 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; }

O CLASIFICARE A FUNCTIILOR LIPSCHITZIENE

de
COSTICA MUSTATA
(Cluj)
  1. Fie X X XXX un spatiu metric cu metrica d d ddd. Pe X X XXX se defineşte următoatéa multime de functii:
(1) X 0 # = { f : X → R , sup x ≠ y x , y ∈ X | f ( x ) − f ( y ) | d ( x , y ) < ∞ , f ( 0 ) = 0 } (1) X 0 # = f : X → R , sup x ≠ y x , y ∈ X   | f ( x ) − f ( y ) | d ( x , y ) < ∞ , f ( 0 ) = 0 {:(1)X_(0)^(#)={f:X rarr R,s u p_({:[x!=y],[x","y in X]:})(|f(x)-f(y)|)/(d(x,y)) < oo,f(0)=0}:}\begin{equation*} X_{0}^{\#}=\left\{f: X \rightarrow R, \sup _{\substack{x \neq y \\ x, y \in X}} \frac{|f(x)-f(y)|}{d(x, y)}<\infty, f(0)=0\right\} \tag{1} \end{equation*}(1)X0#={f:X→R,supx≠yx,y∈X|f(x)−f(y)|d(x,y)<∞,f(0)=0}
unde „o" este un element fixat al spatiului metric X X XXX.
Pentru Y ⊂ X Y ⊂ X Y sub XY \subset XY⊂X, care contine cel puţin două puncte distincte se defineşte funcţionala:
(2) K Y ( f ) = sup x ≠ y x , y ∈ Y | f ( x ) − f ( y ) | d ( x , y ) , f ∈ X 0 # . (2) K Y ( f ) = sup x ≠ y x , y ∈ Y   | f ( x ) − f ( y ) | d ( x , y ) , f ∈ X 0 # . {:(2)K_(Y)(f)=s u p_({:[x!=y],[x","y inY]:})(|f(x)-f(y)|)/(d(x,y))","quad f inX_(0)^(#).:}\begin{equation*} K_{Y}(f)=\sup _{\substack{x \neq y \\ x, y \in \mathcal{Y}}} \frac{|f(x)-f(y)|}{d(x, y)}, \quad f \in X_{0}^{\#} . \tag{2} \end{equation*}(2)KY(f)=supx≠yx,y∈Y|f(x)−f(y)|d(x,y),f∈X0#.
Dacă Y = { o } Y = { o } Y={o}Y=\{\mathrm{o}\}Y={o} punem K Y ( f ) = 0 K Y ( f ) = 0 K_(Y)(f)=0K_{Y}(f)=0KY(f)=0 pentru orice f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0#.
Mulțimea X 0 # X 0 # X_(0)^(#)X_{0}^{\#}X0#, înzestrată cú operatiile obişnuite de adunare a două functii şi inmulţirea unei funcţii cu. un scalar real devine un spaţiu vectorial real.
Dacă Y = X Y = X Y=XY=XY=X, atunci functionalà (2) este o normă pe X 0 # X 0 # X_(0)^(#)X_{0}^{\#}X0# şi pentru orice f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0# scriem
(3) ∴ ‖ f ‖ X = sup x ≠ y x , y ∈ X | f ( x ) − f ( y ) | d ( x , y ) . (3) ∴ ‖ f ‖ X = sup x ≠ y x , y ∈ X   | f ( x ) − f ( y ) | d ( x , y ) . {:(3):.quad||f||_(X)=s u p_({:[x!=y],[x","y in X]:})(|f(x)-f(y)|)/(d(x,y)).:}\begin{equation*} \therefore \quad\|f\|_{X}=\sup _{\substack{x \neq y \\ x, y \in X}} \frac{|f(x)-f(y)|}{d(x, y)} . \tag{3} \end{equation*}(3)∴‖f‖X=supx≠yx,y∈X|f(x)−f(y)|d(x,y).
Spatiul vectorial X 0 # X 0 # X_(0)^(#)X_{0}^{\#}X0#, înzestrat cu norma (3) îl numim spafiul normat al functiilor lipschitziene cu valori reale [2].
Fie Y ⊂ X Y ⊂ X Y sub XY \subset XY⊂X cu o ∈ Y o ∈ Y o in Yo \in Yo∈Y. Notăm
(4) K Y ( f ) = ‖ f ‖ Y pentru orice f ∈ X 0 # , (4) K Y ( f ) = ‖ f ‖ Y  pentru orice  f ∈ X 0 # , {:(4)K_(Y)(f)=||f||_(Y)" pentru orice "f inX_(0)^(#)",":}\begin{equation*} K_{Y}(f)=\|f\|_{Y} \text { pentru orice } f \in X_{0}^{\#}, \tag{4} \end{equation*}(4)KY(f)=‖f‖Y pentru orice f∈X0#,
Y ⊥ = { f ∈ X 0 # , f | Y = 0 } , (6) d ( f , Y ⊥ ) = inf g ∈ Y ⊥ ‖ f − g ‖ X . Y ⊥ = f ∈ X 0 # , f Y = 0 , (6) d f , Y ⊥ = inf g ∈ Y ⊥   ‖ f − g ‖ X . {:[Y^(_|_)={f inX_(0)^(#),f|_(Y)=0}","],[(6)d(f,Y^(_|_))=i n f_(g in Y _|_)||f-g||_(X).]:}\begin{gather*} Y^{\perp}=\left\{f \in X_{0}^{\#},\left.f\right|_{Y}=0\right\}, \\ d\left(f, Y^{\perp}\right)=\inf _{g \in Y \perp}\|f-g\|_{X} . \tag{6} \end{gather*}Y⊥={f∈X0#,f|Y=0},(6)d(f,Y⊥)=infg∈Y⊥‖f−g‖X.
Un element g 0 ∈ Y ⊥ g 0 ∈ Y ⊥ g_(0)inY^(_|_)g_{0} \in Y^{\perp}g0∈Y⊥ pentru care infimumul din (6) este atins se numeste element de cea mai bună aproximare a lui f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0# prin elementele lui Y ⊥ Y ⊥ Y^(_|_)Y^{\perp}Y⊥.
In lucrarea [2] sînt demonstrate următoarele:
Lema 1. Fie Y ⊂ X Y ⊂ X Y sub XY \subset XY⊂X cu o ∈ Y o ∈ Y o in Yo \in Yo∈Y. Atunci pentru orice f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0# are loc egalitatea:
(7)
‖ f ‖ Y = d ( f , Y ⊥ ) ‖ f ‖ Y = d f , Y ⊥ ||f||_(Y)=d(f,Y^(_|_))\|f\|_{Y}=d\left(f, Y^{\perp}\right)‖f‖Y=d(f,Y⊥)
teorema 1. Fie Y ⊂ X c u o ∈ Y Y ⊂ X c u o ∈ Y Y sub Xcuo in YY \subset X c u o \in YY⊂Xcuo∈Y. Atunci pentru orice f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0# există cel putin o functie F ∈ X 0 # F ∈ X 0 # F inX_(0)^(#)F \in X_{0}^{\#}F∈X0# astfel ca
(8)
f | Y = F | Y si ‖ f ‖ Y = ‖ F ‖ X . f Y = F Y  si  ‖ f ‖ Y = ‖ F ‖ X . f|_(Y)=F|_(Y)quad" si "quad||f||_(Y)=||F||_(X).\left.f\right|_{Y}=\left.F\right|_{Y} \quad \text { si } \quad\|f\|_{Y}=\|F\|_{X} .f|Y=F|Y si ‖f‖Y=‖F‖X.
O functie F ∈ X 0 # # F ∈ X 0 # # F inX_(0)^(##)F \in X_{0}^{\# \#}F∈X0## cu proprietăţile (8) se numeşte o prelungire a lui f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0# de pe Y Y YYY pe X X XXX.
Două dintre prelungirile lui f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0#, în conditiile teoremei 1 sînt:
(9) F 1 ( x ) = inf y ∈ Y [ f ( y ) + ‖ f ‖ Y d ( x , y ) ] F 2 ( x ) = sup y ∈ Y [ f ( y ) − ‖ f ‖ Y d ( x , y ) ] (9) F 1 ( x ) = inf y ∈ Y   f ( y ) + ‖ f ‖ Y d ( x , y ) F 2 ( x ) = sup y ∈ Y   f ( y ) − ‖ f ‖ Y d ( x , y ) {:[(9)F_(1)(x)=i n f_(y in Y)[f(y)+||f||_(Y)d(x,y)]],[F_(2)(x)=s u p_(y in Y)[f(y)-||f||_(Y)d(x,y)]]:}\begin{align*} & F_{1}(x)=\inf _{y \in Y}\left[f(y)+\|f\|_{Y} d(x, y)\right] \tag{9}\\ & F_{2}(x)=\sup _{y \in Y}\left[f(y)-\|f\|_{Y} d(x, y)\right] \end{align*}(9)F1(x)=infy∈Y[f(y)+‖f‖Yd(x,y)]F2(x)=supy∈Y[f(y)−‖f‖Yd(x,y)]
şi din felul cum sînt construite [1, pag. 214] rezultă că ele sînt respectiv cea mai mare şı cea mai mică dintre prelungirile lui f f fff, în sensul că orice altă prelungire F F FFF a lui f f fff verifică inegalitatea
(10)
F 2 ( x ) ≦ F ( x ) ≦ F 1 ( x ) , x ∈ X . F 2 ( x ) ≦ F ( x ) ≦ F 1 ( x ) , x ∈ X . F_(2)(x) <= F(x) <= F_(1)(x),quad x in X.F_{2}(x) \leqq F(x) \leqq F_{1}(x), \quad x \in X .F2(x)≦F(x)≦F1(x),x∈X.
Lema 2. Fie Y ⊂ X Y ⊂ X Y sub XY \subset XY⊂X cu o ∈ Y o ∈ Y o in Yo \in Yo∈Y şi f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0#. Atunci orice element de cea mai bună aproximare a lui f f fff prin elementele lui Y ⊥ Y ⊥ Y^(_|_)Y^{\perp}Y⊥ este de forma f − F f − F f-Ff-Ff−F, unde F F FFF este o prelungire a lui f f fff de pe Y Y YYY pe X X XXX.
Demonstratie. Oricare ar fi o prelungire F F FFF a lui f f fff de pe Y Y YYY pe X X XXX, în baza lemei 1 şi a teoremei 1 avem:
‖ f − ( f − F ) ‖ X = ‖ F ‖ X = ‖ f ‖ Y = d ( f , Y ⊥ ) , ‖ f − ( f − F ) ‖ X = ‖ F ‖ X = ‖ f ‖ Y = d f , Y ⊥ , ||f-(f-F)||_(X)=||F||_(X)=||f||_(Y)=d(f,Y^(_|_)),\|f-(f-F)\|_{X}=\|F\|_{X}=\|f\|_{Y}=d\left(f, Y^{\perp}\right),‖f−(f−F)‖X=‖F‖X=‖f‖Y=d(f,Y⊥),
deci f − F ∈ Y ⊥ f − F ∈ Y ⊥ f-F inY^(_|_)f-F \in Y^{\perp}f−F∈Y⊥ este de cea mai bună aproximare pentru f f fff.
Fie h ∈ Y ⊥ h ∈ Y ⊥ h inY^(_|_)h \in Y^{\perp}h∈Y⊥ un element de cea mai bună aproximare a lui f f fff şi să presupunem că h ≠ f − F h ≠ f − F h!=f-Fh \neq f-Fh≠f−F pentru orice prelungire F F FFF. Aceasta înseamnă că
‖ f − h ‖ X = d ( f , Y ⊥ ) = ‖ f ‖ Y ‖ f − h ‖ X = d f , Y ⊥ = ‖ f ‖ Y ||f-h||_(X)=d(f,Y^(_|_))=||f||_(Y)\|f-h\|_{X}=d\left(f, Y^{\perp}\right)=\|f\|_{Y}‖f−h‖X=d(f,Y⊥)=‖f‖Y si deoarece h ∈ Y ⊥ , ( f − h ) | Y = f | Y h ∈ Y ⊥ , ( f − h ) Y = f Y h inY^(_|_), quad(f-h)|_(Y)=f|_(Y)h \in Y^{\perp},\left.\quad(f-h)\right|_{Y}=\left.f\right|_{Y}h∈Y⊥,(f−h)|Y=f|Y. Prin urmare sînt îndeplinite conditiile (8) din Teorema 1 , adică f − h f − h f-hf-hf−h este o prelungire a lui f f fff de pe Y Y YYY pe X X XXX. Deoarece h ≠ f − F h ≠ f − F h!=f-Fh \neq f-Fh≠f−F pentru orice F F FFF, atunci există cel puţin un punct x 0 ∈ X x 0 ∈ X x_(0)in Xx_{0} \in Xx0∈X pentru care, de exemplu
h ( x 0 ) > ( f − F ) ( x 0 ) h x 0 > ( f − F ) x 0 h(x_(0)) > (f-F)(x_(0))h\left(x_{0}\right)>(f-F)\left(x_{0}\right)h(x0)>(f−F)(x0)
adică
( f − h ) ( x 0 ) < F ( x 0 ) pentru orice F . ( f − h ) x 0 < F x 0  pentru orice  F .  (f-h)(x_(0)) < F(x_(0))" pentru orice "F". "(f-h)\left(x_{0}\right)<F\left(x_{0}\right) \text { pentru orice } F \text {. }(f−h)(x0)<F(x0) pentru orice F. 
In particular
( f − h ) ( x 0 ) < F 2 ( x 0 ) ( f − h ) x 0 < F 2 x 0 (f-h)(x_(0)) < F_(2)(x_(0))(f-h)\left(x_{0}\right)<F_{2}\left(x_{0}\right)(f−h)(x0)<F2(x0)
ceea ce contrazice inegalitatea (10).
Analog, dacă h ( x 0 ) < ( f − F ) ( x 0 ) h x 0 < ( f − F ) x 0 h(x_(0)) < (f-F)(x_(0))h\left(x_{0}\right)<(f-F)\left(x_{0}\right)h(x0)<(f−F)(x0) pentru orice F F FFF, atunci în particular
( f − h ) ( x 0 ) > F 1 ( x 0 ) ( f − h ) x 0 > F 1 x 0 (f-h)(x_(0)) > F_(1)(x_(0))(f-h)\left(x_{0}\right)>F_{1}\left(x_{0}\right)(f−h)(x0)>F1(x0)
aeea ce, din nou contrazice inegalitatea (10). Deci pentru orice x ∈ X x ∈ X x in Xx \in Xx∈X avem h ( x ) = ( f − F ) ( x ) h ( x ) = ( f − F ) ( x ) h(x)=(f-F)(x)h(x)=(f-F)(x)h(x)=(f−F)(x).
2. În cele ce urmează vom da o clasificare a funcţiilor din X 0 # X 0 # X_(0)^(#)X_{0}^{\#}X0#, în raport cu comportarea unei astfel de functii faţă de prelungirile ei, în i poteza că X X XXX este un spatiu metric liniar real. Drept element fixat „o" luăm aici elementul nul θ θ theta\thetaθ al spatiului liniar X X XXX.
Fie Y ⊂ X Y ⊂ X Y sub XY \subset XY⊂X cu θ ∈ Y θ ∈ Y theta in Y\theta \in Yθ∈Y. Fie x ∈ Y x ∈ Y x in Yx \in Yx∈Y. Notăm
(11) C x = [ − x , x ] = { y ∈ X : y = − λ x + ( 1 − λ ) x , λ ∈ [ 0 , 1 ] } , (11) C x = [ − x , x ] = { y ∈ X : y = − λ x + ( 1 − λ ) x , λ ∈ [ 0 , 1 ] } , {:(11)C_(x)=[-x","x]={y in X:y=-lambda x+(1-lambda)x","lambda in[0","1]}",":}\begin{equation*} C_{x}=[-x, x]=\{y \in X: y=-\lambda x+(1-\lambda) x, \lambda \in[0,1]\}, \tag{11} \end{equation*}(11)Cx=[−x,x]={y∈X:y=−λx+(1−λ)x,λ∈[0,1]},
(12) Γ x = Y − C x . (12) Γ x = Y − C x . {:(12)Gamma_(x)=Y-C_(x).:}\begin{equation*} \Gamma_{x}=Y-C_{x} . \tag{12} \end{equation*}(12)Γx=Y−Cx.
Definiția 1. Fie Y ⊂ X ˙ Y ⊂ X ˙ Y subX^(˙)Y \subset \dot{X}Y⊂X˙ cu θ ∈ Y θ ∈ Y theta in Y\theta \in Yθ∈Y şi f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0#. Spunem că f f fff este inferior prelungibilă ((IP)) (respectiv superior prelungibilă ((SP))) pe Y Y YYY, dacă pentru orice x ∈ Y x ∈ Y x in Yx \in Yx∈Y si pentru orice prelungire F F FFF a lui f f fff de pe C x C x C_(x)C_{x}Cx pe X X XXX are loc inegalitatea:
(13) f ( y ) ≧ F ( y ) ( respectiv f ( y ) ≦ F ( y ) ) (13) f ( y ) ≧ F ( y ) (  respectiv  f ( y ) ≦ F ( y ) ) {:(13)f(y) >= F(y)(" respectiv "f(y) <= F(y)):}\begin{equation*} f(y) \geqq F(y)(\text { respectiv } f(y) \leqq F(y)) \tag{13} \end{equation*}(13)f(y)≧F(y)( respectiv f(y)≦F(y))
pentru orice y ∈ Γ x y ∈ Γ x y inGamma_(x)y \in \Gamma_{x}y∈Γx.
Următoarea teoremă dă o caracterizare a functiilor (IP) ((SP)) pe Y ⊂ X cu θ ∈ Y Y ⊂ X cu θ ∈ Y Ysub Xcutheta in Y\mathbb{Y} \subset X \mathrm{cu} \theta \in YY⊂Xcuθ∈Y.
((SP)) pe Y Y YYY dacă si numai dacă pentru orice x ∈ Y x ∈ Y x in Yx \in Yx∈Y, multimea elementelor de cea mai bună aproximare ale lui f f fff prin elementele lui C 1 x C 1 x C_((1)/(x))C_{\frac{1}{x}}C1x este formată din elemente nenegative (nepozitive) pe Y Y YYY.
Demonstrație. Rezultă din definiția 1 şi lema 2.
O proprietate a funcţiilor (IP) ((SP)) este cuprinsă în
Lema 3. Fie Y ⊂ X , θ ∈ Y Y ⊂ X , θ ∈ Y Y sub X,theta in YY \subset X, \theta \in YY⊂X,θ∈Y şi Y ≠ { θ } Y ≠ { θ } Y!={theta}Y \neq\{\theta\}Y≠{θ}. Dacă f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0# este (IP) ((SP)) pe Y Y YYY, atunci f ≧ Φ ( f ≦ Φ ) f ≧ Φ ( f ≦ Φ ) f >= Phi(f <= Phi)f \geqq \Phi(f \leqq \Phi)f≧Φ(f≦Φ) pe Y Y YYY, unde Φ Φ Phi\PhiΦ este elementul nul al spatiului X 0 # X 0 # X_(0)^(#)X_{0}^{\#}X0#.
Demonstrafie. Dacă f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0# este (IP) pe Y ⊂ X Y ⊂ X Y sub XY \subset XY⊂X cu proprietătile din enunţ, luînd C 0 = { θ } C 0 = { θ } C_(0)={theta}C_{0}=\{\theta\}C0={θ}, deoarece f | { θ } = Φ | { θ } f { θ } = Φ { θ } f|_({theta})= Phi|_({theta})\left.f\right|_{\{\theta\}}=\left.\Phi\right|_{\{\theta\}}f|{θ}=Φ|{θ}, rezultă că ‖ f ‖ c 0 = 0 ‖ f ‖ c 0 = 0 ||f||_(c_(0))=0\|f\|_{c_{0}}=0‖f‖c0=0. In acest caz, prelungirea lui f f fff de pe { θ } { θ } {theta}\{\theta\}{θ} pe X X XXX este unică si anume este Φ Φ Phi\PhiΦ; deoarece f f fff este (IP) pe Y Y YYY avem f | Y ≧ Φ | Y f Y ≧ Φ Y f|_(Y) >= Phi|_(Y)\left.f\right|_{Y} \geqq\left.\Phi\right|_{Y}f|Y≧Φ|Y. Pentru functiile (SP) pe Y Y YYY, demonstratia este analogă.
teorema 3. Fie Y ⊂ X Y ⊂ X Y sub XY \subset XY⊂X inchisă, Y ≠ { θ } , θ ∈ Y Y ≠ { θ } , θ ∈ Y Y!={theta},theta in YY \neq\{\theta\}, \theta \in YY≠{θ},θ∈Y și f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0#, (IP) pe Y. Dacă există x 0 ∈ Y , x 0 ≠ θ x 0 ∈ Y , x 0 ≠ θ x_(0)in Y,x_(0)!=thetax_{0} \in Y, x_{0} \neq \thetax0∈Y,x0≠θ, astfel ca f ( x 0 ) = 0 f x 0 = 0 f(x_(0))=0f\left(x_{0}\right)=0f(x0)=0, alunci f = Φ f = Φ f=Phif=\Phif=Φ pe [ − x 0 , x 0 ] ∩ Y − x 0 , x 0 ∩ Y [-x_(0),x_(0)]nn Y\left[-x_{0}, x_{0}\right] \cap Y[−x0,x0]∩Y.
Demonstrafie. Dacă f ∈ X 0 # f ∈ X 0 # f inX_(0)^(#)f \in X_{0}^{\#}f∈X0# este (IP) pe Y Y YYY, conform lemei 3 avem că f ≧ Φ f ≧ Φ f >= Phif \geqq \Phif≧Φ pe Y Y YYY. Fie x 0 ∈ Y , x 0 ≠ θ x 0 ∈ Y , x 0 ≠ θ x_(0)in Y,x_(0)!=thetax_{0} \in Y, x_{0} \neq \thetax0∈Y,x0≠θ şi astfel că f ( x 0 ) = 0 f x 0 = 0 f(x_(0))=0f\left(x_{0}\right)=0f(x0)=0. Considerăm multimea H = [ − x 0 , x 0 ] ∩ Y H = − x 0 , x 0 ∩ Y H=[-x_(0),x_(0)]nn YH=\left[-x_{0}, x_{0}\right] \cap YH=[−x0,x0]∩Y. Deoarece Y Y YYY este o multime închisă și [ − x 0 , x 0 − x 0 , x 0 -x_(0),x_(0)-x_{0}, x_{0}−x0,x0 ] este o muļime compactă, rezultă că multimea H H HHH este compactă ; atunci funcţia f | H f H f|_(H)\left.f\right|_{H}f|H işi atinge marginile pe H H HHH. Fie y 0 ∈ H y 0 ∈ H y_(0)in Hy_{0} \in Hy0∈H astfel că
f ( y 0 ) = max y ∈ H f ( y ) ≧ 0 f y 0 = max y ∈ H   f ( y ) ≧ 0 f(y_(0))=max_(y in H)f(y) >= 0f\left(y_{0}\right)=\max _{y \in H} f(y) \geqq 0f(y0)=maxy∈Hf(y)≧0
Dacă f ( y 0 ) = 0 f y 0 = 0 f(y_(0))=0f\left(y_{0}\right)=0f(y0)=0 atunci, evident f ≡ Φ f ≡ Φ f-=Phif \equiv \Phif≡Φ pe H H HHH. Să presupunem deci că f ( y 0 ) > 0 f y 0 > 0 f(y_(0)) > 0f\left(y_{0}\right)>0f(y0)>0, Atunci considerăm segmentul C y 0 = [ − y 0 , y 0 ] C y 0 = − y 0 , y 0 C_(y_(0))=[-y_(0),y_(0)]C_{y_{0}}=\left[-y_{0}, y_{0}\right]Cy0=[−y0,y0]. Evident
In punctul x 0 x 0 x_(0)x_{0}x0 avem
‖ f ‖ C y 0 ≧ | f ( 0 ) − f ( y 0 ) | d ( 0 , y 0 ) > 0 ‖ f ‖ C y 0 ≧ f ( 0 ) − f y 0 d 0 , y 0 > 0 ||f||_(C_(y_(0))) >= (|f(0)-f(y_(0))|)/(d(0,y_(0))) > 0\|f\|_{C_{y_{0}}} \geqq \frac{\left|f(0)-f\left(y_{0}\right)\right|}{d\left(0, y_{0}\right)}>0‖f‖Cy0≧|f(0)−f(y0)|d(0,y0)>0
f ( x 0 ) − inf z ∈ C y 0 [ f ( z ) + ‖ f ‖ C y 0 d ( x 0 , z ) ] ≦ ≦ − min z ∈ C y 0 f ( z ) − ‖ f ‖ C y 0 ⋅ inf z ∈ C y 0 d ( x 0 , z ) = = − ‖ f ‖ C y 0 ⋅ inf z ∈ C x 0 d ( x 0 , z ) < 0 f x 0 − inf z ∈ C y 0   f ( z ) + ‖ f ‖ C y 0 d x 0 , z ≦ ≦ − min z ∈ C y 0   f ( z ) − ‖ f ‖ C y 0 ⋅ inf z ∈ C y 0   d x 0 , z = = − ‖ f ‖ C y 0 ⋅ inf z ∈ C x 0   d x 0 , z < 0 {:[f(x_(0))-i n f_(z inC_(y_(0)))[f(z)+||f||_(C_(y_(0)))d(x_(0),z)] <= ],[ <= -min_(z inC_(y_(0)))f(z)-||f||_(C_(y_(0)))*i n f_(z inC_(y_(0)))d(x_(0),z)=],[=-||f||_(C_(y_(0)))*i n f_(z inC_(x_(0)))d(x_(0),z) < 0]:}\begin{gathered} f\left(x_{0}\right)-\inf _{z \in C_{y_{0}}}\left[f(z)+\|f\|_{C_{y_{0}}} d\left(x_{0}, z\right)\right] \leqq \\ \leqq-\min _{z \in C_{y_{0}}} f(z)-\|f\|_{C_{y_{0}}} \cdot \inf _{z \in C_{y_{0}}} d\left(x_{0}, z\right)= \\ =-\|f\|_{C_{y_{0}}} \cdot \inf _{z \in C_{x_{0}}} d\left(x_{0}, z\right)<0 \end{gathered}f(x0)−infz∈Cy0[f(z)+‖f‖Cy0d(x0,z)]≦≦−minz∈Cy0f(z)−‖f‖Cy0⋅infz∈Cy0d(x0,z)==−‖f‖Cy0⋅infz∈Cx0d(x0,z)<0
Deci 0 = f ( x 0 ) < F 1 ( x 0 ) 0 = f x 0 < F 1 x 0 0=f(x_(0)) < F_(1)(x_(0))0=f\left(x_{0}\right)<F_{1}\left(x_{0}\right)0=f(x0)<F1(x0), ceea ce contrazice faptul că f f fff este (IP) pe Y Y YYY. Pentru functiile (SP) pe Y Y YYY demonstratia este analogă.

UNE CLASSIFICATION DES FONCTIONS LIPSCHITZIENNES

RÁSUMÊ
Dans cette note on présente une classification des fonctions lipschitziennes à valeurs réelles définies sur un espace métrique linéaire réel, par rapport au comportement d'une telle fonction envers ses prolongements. On définit les fonctions prolongeables inférieurement (IP) et prolongeables supérieurement ( SP ) sur un sousensemble Y Y YYY de X X XXX avec θ ∈ Y θ ∈ Y theta in Y\theta \in Yθ∈Y. On présente un théorème de caractérisation des fonctions (IP) ((SP)) et deux propriétés dont ces fonctions jouissent.

BIBLIOGRAFIE;

[1] Czipser J. şi Gehér L., Extension of functions satisfying a Lipschitz condilion. Acta Math. Acad. Sci. Hungar, 6, 213 − 220 213 − 220 213-220213-220213−220 (1955).
[2] Mustăţa C., Asupra unor subspatii cebîseviene din spatiul normat al functiilor lipschitziene, Revista de analiză numerică şi teoria aproximației, 2, 1, 81-87 (1973).
Primit la 2. IV. 1973.
Institutul de calcul din Cluj
al Academiei Republicii Socialiste România
1974

Related Posts