Vol. 24, No. 1, 1968

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 290: 1  2
Vol. 289: 1  2
Vol. 288: 1  2
Vol. 287: 1  2
Vol. 286: 1  2
Vol. 285: 1  2
Vol. 284: 1  2
Vol. 283: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Editorial Board
Officers
Special Issues
Submission Guidelines
Submission Form
Subscriptions
Contacts
Author Index
To Appear
 
ISSN: 0030-8730
Interposition and approximation

Bernard Robert Kripke and Richard Bruce Holmes

Vol. 24 (1968), No. 1, 103–110
Abstract

Let (X) be the space of all bounded real-valued functions on a set X, with the norm f= sup{|f(x)| : x X}, and let K be any nonempty subset of (X). The question whether an element f of (X) has a best approximation g in K (such that f g= δ(f) = inf{∥f h: h K}) can be formulated as the problem of interposing a function g in K between two functions, L(,f) and U(,f), which are constructed out of K by certain lattice operations. If K is closed with respect to these lattice operations, or has a certain interposition property, the best approximation will always exist.

Mathematical Subject Classification
Primary: 41.40
Milestones
Received: 6 August 1966
Published: 1 January 1968
Authors
Bernard Robert Kripke
Richard Bruce Holmes