<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">APM</journal-id><journal-title-group><journal-title>Advances in Pure Mathematics</journal-title></journal-title-group><issn pub-type="epub">2160-0368</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/apm.2021.1110052</article-id><article-id pub-id-type="publisher-id">APM-112432</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  On the Uniform and Simultaneous Approximations of Functions
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Mansour</surname><given-names>Alyazidi</given-names></name><xref ref-type="aff" rid="aff1"><sub>1</sub></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><label>1</label><addr-line>Department of Mathematics, King Saud University, Riyadh, Saudi Arabia</addr-line></aff><pub-date pub-type="epub"><day>13</day><month>10</month><year>2021</year></pub-date><volume>11</volume><issue>10</issue><fpage>785</fpage><lpage>790</lpage><history><date date-type="received"><day>9,</day>	<month>September</month>	<year>2021</year></date><date date-type="rev-recd"><day>10,</day>	<month>October</month>	<year>2021</year>	</date><date date-type="accepted"><day>13,</day>	<month>October</month>	<year>2021</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  We consider the relation between the simultaneous approximation of two functions and the uniform approximation to one of these functions. In particular, 
  <em>F</em>
  <sub>1</sub> and 
  <em>F</em>
  <sub>2</sub> are continuous functions on a closed interval [
  <em>a</em>,
  <em>b</em>], 
  <em>S</em> is an 
  <em>n</em>-dimensional Chebyshev subspace of 
  <em>C</em>
  <em> </em>[
  <em style="white-space:normal;">a</em>
  ,
  <em style="white-space:normal;">b</em>
  ] and 
  <em>s</em>
  <sub>1</sub>* &amp; 
  <em>s</em><sub>2</sub>* are the best uniform approximations to 
  <em>F</em>
  <sub>1</sub> and 
  <em>F</em>
  <sub>2</sub> from 
  <em>S</em> respectively. The characterization of the best approximation solution is used to show that, under some restrictions on the point set of alternations of 
  <em>F</em>
  <sub>1</sub>
  &amp;#8722;
  <em>s</em>
  <sub>1</sub>* and 
  <em style="white-space:normal;">F</em>
  <sub style="white-space:normal;">2</sub>&amp;#8722;
  <em style="white-space:normal;">s</em>
  <sub style="white-space:normal;">2</sub>
  *, 
  <em style="white-space:normal;">s</em>
  <sub style="white-space:normal;">1</sub>
  * or 
  <em style="white-space:normal;">s</em>
  <sub style="white-space:normal;">2</sub>
  * is also a best 
  <em>A</em>(1) simultaneous approximation to 
  <em>F</em>
  <sub>1</sub> and 
  <em>F</em>
  <sub>2</sub> from 
  <em>S</em> with 
  <em>F</em>
  <sub>1</sub>
  ≥<em>F</em><sub>2</sub> and 
  <em>n</em>=2.
 
</p></abstract><kwd-group><kwd>Simultaneous Approximation</kwd><kwd> Uniform Approximation</kwd><kwd> Relation</kwd><kwd> Straddle Points</kwd><kwd> Alternation</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>The interest in the simultaneous approximation started long ago [<xref ref-type="bibr" rid="scirp.112432-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.112432-ref2">2</xref>] [<xref ref-type="bibr" rid="scirp.112432-ref3">3</xref>] [<xref ref-type="bibr" rid="scirp.112432-ref4">4</xref>]. This paper concerned with the relation between the simultaneous approximation and the uniform approximation. The setting is as follows. Let C [ a , b ] be the set of all real-valued continuous functions defined on the closed interval [ a , b ] with the uniform norm ‖   .   ‖ .</p><p>For f ∈ C [ a , b ] ,</p><p>‖ f ‖ = max { | f ( x ) | , x ∈ [ a , b ] } .</p><p>The norms ‖ F ‖ A ( p ) , 1 ≤ p ≤ ∞ , on E = C [ a , b ] &#215; C [ a , b ] are defined as follows:</p><p>For F = ( F 1 , F 2 ) ∈ E</p><p>‖ F ‖ A ( ∞ ) = max { F 1 , F 2 }</p><p>‖ F ‖ A ( p ) = [ ‖ F 1 ‖ p + ‖ F 2 ‖ p ] 1 p ,     1 ≤ p &lt; ∞ .</p><p>Now if S is an n-dimensional subspace of C [ a , b ] , then U = { ( s , s ) : s ∈ S } is an n-dimensional subspace of E and there exist u * = ( s * , s * ) and v * = ( t * , t * ) where s * , t * ∈ S such that:</p><p>‖ F − u * ‖ A ( ∞ ) = inf u ∈ U ‖ F − u ‖ A ( ∞ ) = inf s ∈ S max { ‖ F 1 − s ‖ , ‖ F 2 − s ‖ } = ‖ F k − s * ‖ ,     k = 1     or     2.</p><p>Such s * is called a best A ( ∞ ) simultaneous approximation to F = ( F 1 , F 2 ) from S. The set of all best A ( ∞ ) simultaneous approximations to F from S will be denoted by P S ( F , ∞ ) .</p><p>For 1 ≤ p &lt; ∞ ,</p><p>‖ F − v * ‖ A ( p ) = inf u ∈ U ‖ F − u ‖ A ( p ) = inf s ∈ S { [ ‖ F 1 − s ‖ p + ‖ F 2 − s ‖ p ] 1 p } = [ ‖ F 1 − t * ‖ p + ‖ F 2 − t * ‖ p ] 1 p .</p><p>t * is called a best A ( p ) simultaneous approximation to F = ( F 1 , F 2 ) from S. The set P S ( F , p ) denotes the set of all best A ( p ) simultaneous approximation to F from S. And P S ( F k ) is the set of all best uniform approximation to F k from S, k ∈ { 1 , 2 } .</p><p>We are interested in the relation between the simultaneous approximation and the uniform approximation; in section two, we will show under certain conditions, that if s k * ∈ P S ( F k ) then s k * ∈ P S ( F , 1 ) , k ∈ { 1 , 2 } .</p><p>Definition 1 A point t ∈ [ a , b ] is called a straddle point for two functions f and g in C [ a , b ] if there exists σ = &#177; 1 such that</p><p>‖ f ‖ = σ f ( t ) ,     ‖ g ‖ = − σ g ( t ) .</p><p>Definition 2 The functions f and g ∈ C [ a , b ] are said to have d alternations on [ a , b ] if there exists d + 1 distinct points x 1 &lt; ⋯ &lt; x d + 1 in [ a , b ] such that for some σ = &#177; 1 ,</p><p>f ( x i ) = σ ‖ f ‖ ,     if   i   is   odd</p><p>g ( x i ) = − σ ‖ g ‖ ,     if   i   is   even</p><p>or</p><p>g ( x i ) = σ ‖ g ‖ ,     if   i   is   odd</p><p>f ( x i ) = − σ ‖ f ‖ ,     if   i   is   even</p><p>We follow [<xref ref-type="bibr" rid="scirp.112432-ref5">5</xref>] [<xref ref-type="bibr" rid="scirp.112432-ref6">6</xref>] [<xref ref-type="bibr" rid="scirp.112432-ref7">7</xref>] [<xref ref-type="bibr" rid="scirp.112432-ref8">8</xref>] for the notations and the terminology of this section which will be used throughout this paper. The uniform approximation theory can be found in [<xref ref-type="bibr" rid="scirp.112432-ref9">9</xref>] [<xref ref-type="bibr" rid="scirp.112432-ref10">10</xref>]. Theorems 1 and 2 of this section and the remark thereafter which are needed for our analysis are direct consequences of theorems 1 and 3 of [<xref ref-type="bibr" rid="scirp.112432-ref6">6</xref>].</p><p>Theorem 1 Let S be an n-dimensional subspace of C [ a , b ] which contains a nonzero constant, F = ( F 1 , F 2 ) ∈ E then:</p><p>(a) s * ∈ P S ( F , 1 ) if and only if there exists subsets X 1 = { x i , i ∈ I 1 } , X 2 = { x i , i ∈ I 2 } of [ a , b ] and positive numbers λ i , i ∈ I 1 , μ i ∈ I 2 with</p><p>∑ i ∈ I 1 λ i = ∑ i ∈ I 2 μ i = 1</p><p>such that</p><p>θ i ( F 1 ( x i ) − s * ( x i ) ) = ‖ F 1 − s * ‖ ,     i ∈ I 1 ,</p><p>θ i ( F 2 ( x i ) − s * ( x i ) ) = ‖ F 2 − s * ‖ ,     i ∈ I 2 ,</p><p>∑ i ∈ I 1 θ i λ i s ( x i ) + ∑ i ∈ I 2 θ i μ i s ( x i ) = 0       ∀ s ∈ S ,</p><p>θ i = &#177; 1 .</p><p>(b) If s * ∈ P s ( F , 1 ) with ‖ F 1 − s * ‖ = ‖ F 2 − s * ‖ then s * ∈ P S ( F , p ) for all p,</p><p>1 &lt; p ≤ ∞ .</p><p>Theorem 2 LetS be an n-dimensional Haar subspace of C [ a , b ] , if F 1 ≥ F 2 on [ a , b ] then s * ∈ P s ( F , ∞ ) if and only if F 1 − s * &amp; F 2 − s * have a straddle point or n alternations on [ a , b ] with ‖ F 1 − s * ‖ = ‖ F 2 − s * ‖ . Furthermore, if F 1 − s * &amp; F 2 − s * have n alternations on [ a , b ] then s * is unique.</p><p>Remark If t ∈ [ a , b ] is a straddle point for F 1 − s * &amp; F 2 − s * , F 1 ≥ F 2 on [ a , b ] then</p><p>( F 1 − F 2 ) ( t ) = ( F 1 − s * ) ( t ) + ( F 2 − s * ) ( t ) = ‖ F 1 − s * ‖ + ‖ F 2 − s * ‖ ≥ ‖ F 1 − F 2 ‖ .</p><p>This implies that ( F 1 − F 2 ) ( t ) = ‖ F 1 − F 2 ‖ and</p><p>‖ F 1 − s * ‖ + ‖ F 2 − s * ‖ = ‖ F 1 − F 2 ‖ ≤ ‖ F 1 − s ‖ + ‖ F 2 − s ‖       ∀ s ∈ S .</p><p>Hence s * ∈ P S ( F , 1 ) .</p></sec><sec id="s2"><title>2. The Main Result</title><p>Theorem 3 Let s k * ∈ P S ( F k ) , where F k ∈ C [ a , b ] , k ∈ { 1 , 2 } , F 1 ≥ F 2 on [ a , b ] , F = ( F 1 , F 2 ) and S is a 2-dimensional Chebyshev subspace of C [ a , b ] containing a nonzero constant function. And let X = { a = x 1 &lt; x 2 &lt; x 3 = b } be the alternating set for F 1 − s 1 * , Y = { a = y 1 &lt; y 2 &lt; y 3 = b } be the alternating set for F 2 − s 2 * .</p><p>(i) If ( F 1 ( x 1 ) − s 1 * ( x 1 ) ) = ‖ F 1 − s 1 * ‖ and ( F 2 ( y 1 ) − s 2 * ( y 1 ) ) = ‖ F 2 − s 2 * ‖ , then s 1 * ∈ P S ( F , 1 ) .</p><p>(ii) If ( F 1 ( x 1 ) − s 1 * ( x 1 ) ) = − ‖ F 1 − s 1 * ‖ and ( F 2 ( y 1 ) − s 2 * ( y 1 ) ) = − ‖ F 2 − s 2 * ‖ , then s 2 * ∈ P S ( F , 1 ) .</p><p>Proof</p><p>(i) suppose that ( F 1 ( x 1 ) − s 1 * ( x 1 ) ) = ‖ F 1 − s 1 * ‖ and ( F 2 ( y 1 ) − s 2 * ( y 1 ) ) = ‖ F 2 − s 2 * ‖ , since − F 2 ≥ − F 1 then</p><p>( s 1 * ( x 2 ) − F 2 ( x 2 ) ) ≥ ( s 1 * ( x 2 ) − F 1 ( x 2 ) ) = ‖ F 1 − s 1 * ‖</p><p>and if x ∈ [ a , b ] is such that ( F 2 − s 1 * ) ( x ) ≥ 0 , then</p><p>‖ F 1 − s 1 * ‖ ≥ ( F 1 − s 1 * ) ( x ) ≥ ( F 2 − s 1 * ) ( x ) ≥ 0 .</p><p>Hence there exists a γ ∈ [ a , b ] such that</p><p>‖ F 2 − s 1 * ‖ = − ( F 2 − s 1 * ) ( γ ) .</p><p>If γ = a or γ = b then γ is a straddle point for F 1 − s 1 * &amp; F 2 − s 1 * which implies that s 1 * ∈ P S ( F , 1 ) .</p><p>If a &lt; γ &lt; b then taking x 1 = z 1 , γ = z 2 , x 3 = z 3 we have:</p><p>( F 1 − s 1 * ) ( z 1 ) = ( F 1 − s 1 * ) ( z 3 ) = ‖ F 1 − s 1 * ‖ ,</p><p>− ( F 2 − s 1 * ) ( z 2 ) = ‖ F 2 − s 1 * ‖ ,</p><p>a ≤ z 1 &lt; z 2 &lt; z 3 ≤ b .</p><p>Now, since S is a Chebyshev subspace of dimension 2, there exists μ i &gt; 0 , i ∈ { 1 , 2 , 3 } such that</p><p>μ 1 s ( z 1 ) − μ 2 s ( z 2 ) + μ 3 s ( z 3 ) = 0       ∀ s ∈ S</p><p>because 1 ∈ S , μ 2 = μ 1 + μ 3 and setting ω i = μ i μ 2 , i ∈ { 1 , 2 , 3 } we have ω 1 s ( z 1 ) − ω 2 s ( z 2 ) + ω 3 s ( z 3 ) = 0       ∀ s ∈ S where ω 2 = ω 1 + ω 3 = 1 and from theorem 1 s 1 * ∈ P S ( F , 1 ) .</p><p>ii) If ( F 1 ( x 1 ) − s 1 * ( x 1 ) ) = − ‖ F 1 − s 1 * ‖ and ( F 2 ( y 1 ) − s 2 * ( y 1 ) ) = − ‖ F 2 − s 2 * ‖ , since F 1 ≥ F 2 then</p><p>( F 1 ( y 2 ) − s 2 * ( y 2 ) ) ≥ ( F 2 ( y 2 ) − s 2 * ( y 2 ) ) = ‖ F 2 − s 2 * ‖</p><p>and if x ∈ [ a , b ] is such that ( s 2 * − F 1 ) ( x ) ≥ 0 , then</p><p>‖ F 2 − s 2 * ‖ ≥ ( s 2 * − F 2 ) ( x ) ≥ ( s 2 * − F 1 ) ( x ) ≥ 0 .</p><p>Hence there exists a γ ∈ [ a , b ] such that</p><p>‖ F 1 − s 2 * ‖ = ( F 1 − s 2 * ) ( γ ) .</p><p>If γ = a or γ = b then γ is a straddle point for F 1 − s 2 * &amp; F 2 − s 2 * which implies that s 2 * ∈ P S ( F , 1 ) .</p><p>If a &lt; γ &lt; b then taking y 1 = z 1 , γ = z 2 , y 3 = z 3 we have:</p><p>( F 2 − s 2 * ) ( z 1 ) = ( F 2 − s 2 * ) ( z 3 ) = − ‖ F 1 − s 1 * ‖ ,</p><p>( F 1 − s 2 * ) ( z 2 ) = ‖ F 1 − s 2 * ‖ ,</p><p>a ≤ z 1 &lt; z 2 &lt; z 3 ≤ b .</p><p>Now, since S is a Chebyshev subspace of dimension 2, there exists</p><p>μ i &gt; 0 ,   i ∈ { 1 , 2 , 3 } such that</p><p>− μ 1 s ( z 1 ) + μ 2 s ( z 2 ) − μ 3 s ( z 3 ) = 0       ∀ s ∈ S</p><p>because 1 ∈ S , μ 2 = μ 1 + μ 3 and setting ω i = μ i μ 2 , i ∈ { 1 , 2 , 3 } we have − ω 1 s ( z 1 ) + ω 2 s ( z 2 ) − ω 3 s ( z 3 ) = 0       ∀ s ∈ S where ω 2 = ω 1 + ω 3 = 1 and from theorem 1 s 2 * ∈ P S ( F , 1 ) and the theorem is proved.</p><p>The following example shows that conditions (i) &amp; (ii) in theorem 3 are necessary conditions.</p><p>Example 1 S = span { 1 , x } is a Chebyshev subspace of C [ 0 , 1 ] and</p><p>s 1 * = 1 8 + x is the best uniform approximation to F 1 = x , s 2 * = − 1 8 + x is the</p><p>best uniform approximation to F 2 = x 2 , F 1 ≥ F 2 on [ 0 , 1 ] , s 1 * ∉ P S ( F , 1 ) and s 2 * ∉ P S ( F , 1 ) .</p><p>It is possible, under the assumptions of theorem 3 that both s 1 * and s 2 * belong to the set of best A(1) simultaneous approximation as illustrated in the following example</p><p>Example 2 S = span { 1 , x } is a Chebyshev subspace of C [ 0 , 1 ] and</p><p>s 1 * = − 1 8 + x is the best uniform approximation to F 1 = x 2 , s 2 * = − 1 3 3 + x is the</p><p>best uniform approximation to F 2 = x 3 , F 1 ≥ F 2 on [ 0 , 1 ] .</p><p>s 1 * , s 2 * ∈ P S ( F , 1 ) . Furthermore s 2 * = − 1 3 3 + x is the unique best A ( ∞ )</p><p>simultaneous approximation to F = ( F 1 , F 2 ) from S.</p></sec><sec id="s3"><title>Conflicts of Interest</title><p>The author declares no conflicts of interest regarding the publication of this paper.</p></sec><sec id="s4"><title>Cite this paper</title><p>Alyazidi, M. (2021) On the Uniform and Simultaneous Approximations of Functions. Advances in Pure Mathematics, 11, 785-790. https://doi.org/10.4236/apm.2021.1110052</p></sec></body><back><ref-list><title>References</title><ref id="scirp.112432-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Dunham, C.B. (1967) Simultaneous Chebyshev Approximation of Two Functions on an Interval. Proceedings of the AMS, 18, 472-477.https://doi.org/10.1090/S0002-9939-1967-0212463-6</mixed-citation></ref><ref id="scirp.112432-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Watson, G.A. (1993) A Characterization of Best Simultaneous Approximation. Journal of Approximation Theory, 75, 175-182. https://doi.org/10.1006/jath.1993.1097</mixed-citation></ref><ref id="scirp.112432-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Huotari, R. and Shi, J. (1995) Simultaneous Approximation from Convex Sets. Computers &amp; Mathematics with Applications, 30, 197-206. https://doi.org/10.1016/0898-1221(95)00097-6</mixed-citation></ref><ref id="scirp.112432-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Pinkus, A. (1997) Uniqueness in Vector-Valued Approximation. Journal of Approximation Theory, 91, 17-92. https://doi.org/10.1006/jath.1993.1030</mixed-citation></ref><ref id="scirp.112432-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Asiry, M. and Watson, G.A. (1999) On Solution of a Class of Best Simultaneous Approximation Problems. International Journal of Computer Mathematics, 75, 413-425. https://doi.org/10.1080/00207169908804818</mixed-citation></ref><ref id="scirp.112432-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Asiry, M. and Watson, G.A. (2000) Simultaneous Approximation from Chebyshev and Weak Chebyshev Spaces. Communications in Applied Analysis, 4, No. 3.</mixed-citation></ref><ref id="scirp.112432-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Alyazidi-Asiry, M. (2016) Adjoining a Constant Function to N-Dimensional Chebyshev Space. Journal of Function Spaces, 2016, Article ID: 4813979.https://doi.org/10.1155/2016/4813979</mixed-citation></ref><ref id="scirp.112432-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Alyazidi-Asiry, M. (2017) Extending a Chebyshev Subspace to a Weak Chebyshe Subspace of Higher Dimension and Related Results. Journal of Applied and Computational Mathematics, 6, Article ID: 1000347. https://doi.org/10.4172/2168-9679.1000347</mixed-citation></ref><ref id="scirp.112432-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Cheney, E.W. (1966) Introduction to Approximation Theory. McGraw-Hill, New York, London.</mixed-citation></ref><ref id="scirp.112432-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Watson, G.A. (1980) Approximation Theory and Numerical Methods. John Wiley &amp; Sons, Chichester.</mixed-citation></ref></ref-list></back></article>