Solving the farthest point problem in finite codimensional subspaces of C(\(\Omega\) ) (Q1108540): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: R. B. Burckel / rank | |||
Property / reviewed by | |||
Property / reviewed by: R. B. Burckel / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convexity of Chebyshev sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5604711 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4110115 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Remarks on the unique farthest point problem in some subspaces ofC / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A remark on the farthest point problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Jung's constant and related constants in normed linear spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sets with unique farthest points / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01903628 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1973408625 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:05, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving the farthest point problem in finite codimensional subspaces of C(\(\Omega\) ) |
scientific article |
Statements
Solving the farthest point problem in finite codimensional subspaces of C(\(\Omega\) ) (English)
0 references
1988
0 references
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).]
0 references
uniquely remotal
0 references
farthest point problem
0 references
singleton
0 references