Convex sets and Axiom of Choice
Logic
2026-03-18 v2
Abstract
Under , we show that the statement that every subset of every -vector space has a maximal convex subset is equivalent to the Axiom of Choice. We also study the strength of the same statement restricted to some specific -vector spaces. In particular, we show that the statement for is equivalent to the Axiom of Countable Choice for reals, whereas the statement for is equivalent to the Axiom of Uniformization. We discuss the statement for some spaces of higher dimensions as well.
Cite
@article{arxiv.2602.01739,
title = {Convex sets and Axiom of Choice},
author = {Yasuo Yoshinobu},
journal= {arXiv preprint arXiv:2602.01739},
year = {2026}
}
Comments
29 pages, 1 figure. Proposition 8.4, Corollary 8.5, 8.6, Question 9.5 added, References added in section 1. A few more minor revisions