The Nature of Computation. Logic, Algorithms, Applications

Volume 7921 of the series Lecture Notes in Computer Science pp 294-305

Closed Choice for Finite and for Convex Sets

  • Stéphane Le RouxAffiliated withDepartment of Mathematics, Technische Universität Darmstadt
  • , Arno PaulyAffiliated withClare College, University of Cambridge

* Final gross prices may vary according to local VAT.

Get Access


We investigate choice principles in the Weihrauch lattice for finite sets on the one hand, and convex sets on the other hand. Increasing cardinality and increasing dimension both correspond to increasing Weihrauch degrees. Moreover, we demonstrate that the dimension of convex sets can be characterized by the cardinality of finite sets encodable into them. Precisely, choice from an n + 1 point set is reducible to choice from a convex set of dimension n, but not reducible to choice from a convex set of dimension n − 1.