Compactly convex sets in linear topological spaces
T. Banakh, M. Mitrofanov, O. Ravsky

TL;DR
The paper introduces the concept of compactly convex sets in linear topological spaces, proves that all convex subsets of the plane are compactly convex, and explores conditions under which such sets have metrizable closures.
Contribution
It defines compactly convex sets, characterizes their properties in various spaces, and provides examples distinguishing convex sets in different dimensions.
Findings
All convex subsets of the plane are compactly convex.
There exists a convex set in R^3 that is not compactly convex.
The closure of a compactly convex set is metrizable iff all its compact subsets are metrizable.
Abstract
A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map such that for all . We prove that each convex subset of the plane is compactly convex. On the other hand, the space contains a convex set that is not compactly convex. Each compactly convex subset of a linear topological space has locally compact closure which is metrizable if and only if each compact subset of is metrizable.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis
