Abstract
We give a number of formal proofs of theorems from the field of computable analysis. Many of our results specify executable algorithms that work on infinite inputs by means of operating on finite approximations and are proven correct in the sense of computable analysis. The development is done in the proof assistant Coq and heavily relies on the Incone library for information theoretic continuity. This library is developed by one of the authors and the results of this paper extend the library. While full executability in a formal development of mathematical statements about real numbers and the like is not a feature that is unique to the Incone library, its original contribution is to adhere to the conventions of computable analysis to provide a general purpose interface for algorithmic reasoning on continuous structures. The paper includes a brief description of the most important concepts of Incone and its sub libraries mf and Metric.
The results that provide complete computational content include that the algebraic operations and the efficient limit operator on the reals are computable, that the countably infinite product of a space with itself is isomorphic to a space of functions, compatibility of the enumeration representation of subsets of natural numbers with the abstract definition of the space of open subsets of the natural numbers, and that continuous realizability implies sequential continuity. We also describe many noncomputational results that support the correctness of definitions from the library. These include that the information theoretic notion of continuity used in the library is equivalent to the metric notion of continuity on Baire space, a complete comparison of the different concepts of continuity that arise from metric and represented space structures and the discontinuity of the unrestricted limit operator on the real numbers and the task of selecting an element of a closed subset of the natural numbers.
BibTeX  Entry
@InProceedings{steinberg_et_al:LIPIcs:2019:11083,
author = {Florian Steinberg and Laurent Th{\'e}ry and Holger Thies},
title = {{Quantitative Continuity and Computable Analysis in Coq}},
booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)},
pages = {28:128:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959771221},
ISSN = {18688969},
year = {2019},
volume = {141},
editor = {John Harrison and John O'Leary and Andrew Tolmach},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11083},
URN = {urn:nbn:de:0030drops110830},
doi = {10.4230/LIPIcs.ITP.2019.28},
annote = {Keywords: computable analysis, Coq, contionuous functionals, discontinuity, closed choice on the naturals}
}
Keywords: 

computable analysis, Coq, contionuous functionals, discontinuity, closed choice on the naturals 
Seminar: 

10th International Conference on Interactive Theorem Proving (ITP 2019) 
Issue Date: 

2019 
Date of publication: 

06.09.2019 