Notices
Results 1 to 1 of 1

Thread: On Best Approximation Problems In Normed Spaces With S-prope

  1. #1 On Best Approximation Problems In Normed Spaces With S-prope 
    Forum Freshman
    Join Date
    Dec 2009
    Posts
    10
    Abstract

    The problem of best approximation is the problem of finding, for a given point xX and a given set G in a normed linear space ( X, ), a point g G which should be nearest to x among all points of the set G.

    This thesis contains properties of best approximations in spaces with the S-property. We provide original results about Orlicz subspaces, and about subspaces with the S-property.

    As a major result we prove that: if G is a closed subspace of X and has the S-property. Then the following are equivalent:

    1. G is a Chebyshev subspace of X.

    2. L (m,G) is a Chebyshev subspace of L (m,X).

    3. L (m,G) is a Chebyshev subspace of L (m,X), 1 p <.

    Full Article

    http://www.najah.edu/modules/graduat...=2&id=759&l=en


    Reply With Quote  
     

  2.  
     

Bookmarks
Bookmarks
Posting Permissions
  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •