On the best coapproximation problem in 1n
Abstract
We study the best coapproximation problem in the Banach space 1n, by using Birkhoff-James orthogonality techniques. Given a subspace Y of 1n, we completely identify the elements x in 1n, for which best coapproximations to x out of Y exist. The methods developed in this article are computationally effective and it allows us to present an algorithmic approach to the concerned problem. We also identify the coproximinal subspaces and co-Chebyshev subspaces of 1n.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.