Solving the farthest point problem in finite codimensional subspaces of C(\(\Omega\) ) (Q1108540)

Let \((X,\| \cdot \|)\) be a real normed linear space, \(\emptyset \neq K\subset X\) a bounded set. let us define the mapping \(Q_ K:X\to 2^ K\) by \[ Q_ K(x)=\{y\in K;\| x-y\| =\sup_{k\in K}\| x-k\| \}. \] We call K a uniquely remotal set, if for all \(x\in X\), \(Q_ K(x)\) consists of exactly one element. In this case we denote by \(Q_ K(x)\) this element of K. The following problem is called the farthest point problem. The problem - as far as we know - is open. Let K be a uniquely remotal set in \((X,\| \cdot \|)\). Is K a singleton? There are many special cases in which the problem is solved affirmatively. This is the case for finite dimensional X, for norm-compact K, for norm- continuous \(Q_ K\), in the Banach spaces \(c_ 0,c\), and with a suitable renorming in all normed linear spaces. Earlier in this same journal [ibid. 37, 471-497 (1981; Zbl 0472.41028)] we have given a positive answer in many special finite codimensional subspaces of C[0,1], including C. In this note we give a general solution for all finite codimensional subspaces of C(\(\Omega)\), where \(\Omega\) is a compact metric space. [See also \textit{B. B. Panda}, Indian J. Pure Appl. Math. 19, No.3, 277-283 (1988; Zbl 0643.46017).]