A remark on the alternating algorithm (Q1063819)

Let U,V be Chebyshev subspaces of a normed linear space \((X,\|.\|)\). Introducing the best approximation operator \(P_{\overline{\{U,V\}}}\) (in the case when \(\overline{\{U,V\}}\) is also a Chebyshev subspace) we define the mapping \(K=(I-P_ U)(I-P_ V).\) It is an interesting question whether the relation \[ I-P_{\overline{\{U,V\}}}(x)=\lim_{n\to \infty}K^ nx \] is fulfilled or or. In many special cases the problem is solved. In this paper, generalizing former results of \textit{C. Franchetti} and \textit{W. Light} [J. Lond. Math. Soc., II. Ser. 29, 545-561 (1984; Zbl 0561.41030)], we give a complete affirmative solution for uniformly convex and smooth Banach spaces.