This paper proves the approximate intermediate value theorem, constructively and from notably weak hypotheses: from pointwise rather than uniform continuity, without assuming that reals are presented with rational approximants, and without using countable choice. The theorem is that if a pointwise continuous function has both a negative and a positive value, then it has values arbitrarily close to 0. The proof builds on the usual classical proof by bisection, which repeatedly selects the left or right half of an interval; the algorithm here selects an interval of half the size in a continuous way, interpolating between those two possibilities.

Source : oai:arXiv.org:1701.02227

Volume: Volume 16, Issue 3

Published on: July 14, 2020

Submitted on: January 10, 2017

Keywords: Mathematics - Logic,Computer Science - Logic in Computer Science,03F60, 03D78, 03E25, 26A15, 26E40,G.1.5

This page has been seen 102 times.

This article's PDF has been downloaded 52 times.