Finite choice, convex choice and finding roots

DOI10.2168/LMCS-11(4:6)2015zbMATH Open1448.03052arXiv1302.0380OpenAlexW2252992943MaRDI QIDQ3460409FDOQ3460409

Authors: Stéphane Le Roux, Arno Pauly 

Publication date: 7 January 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Abstract: 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. Furthermore we consider searching for zeros of continuous functions. We provide an algorithm producing 3n real numbers containing all zeros of a continuous function with up to n local minima. This demonstrates that having finitely many zeros is a strictly weaker condition than having finitely many local extrema. We can prove 3n to be optimal.

Full work available at URL: https://arxiv.org/abs/1302.0380

Recommendations

• Closed choice for finite and for convex sets
• Connected choice and the Brouwer fixed point theorem
• On the computational content of the Brouwer fixed point theorem
• Effective Choice and Boundedness Principles in Computable Analysis
• Effective choice and boundedness principles in computable analysis

zbMATH Keywords

reverse mathematicsWeihrauch reducibilityclosed choice

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Other degrees and reducibilities in computability and recursion theory (03D30) Constructive and recursive analysis (03F60)

Cited In (13)

• Completion of choice
• Closed choice for finite and for convex sets
• Computability of Subsets of Metric Spaces
• Notes on overt choice
• FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
• The Dyck and the Preiss separation uniformly
• Comparing representations for function spaces in computable analysis
• Representations of analytic functions and Weihrauch degrees
• How constructive is constructing measures?
• The Brouwer fixed point theorem revisited
• Weihrauch Complexity in Computable Analysis
• Connected choice and the Brouwer fixed point theorem
• On the algebraic structure of Weihrauch degrees

This page was built for publication: Finite choice, convex choice and finding roots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460409)