Quantitative continuity and Computable Analysis in Coq

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 paper can be used as an introduction to the library as it describes many of its most important features in detail. While the ability to have 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 results that provide complete computational content include that the algebraic operations and the efficient limit operator on the reals are computable, that certain countably infinite products are isomorphic to spaces 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 formalize proofs of non-computational results that support the correctness of our definitions. 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.

Reasoning about real number expressions in a proof assistant is challenging. Several problems in theorem proving can be solved by using exact real number computation. I have implemented a library for reasoning and computing with complete metric spaces in the Coq proof assistant and used this library to build a constructive real number implementation including elementary real number functions and proofs of correctness. Using this library, I have created a tactic that automatically proves strict inequalities over closed elementary real number expressions by computation.KeywordsReal NumberRational NumberTheorem ProveRegular FunctionStrict InequalityThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

It is well known that the hypothesis that all real numbers are constructible in the sense of Gödel [1] implies the existence of a Σ21well-ordering of the Baire space [1, p. 67]. We are concerned with the converse to this theorem. From the assumption of the existence of a Σ21well-ordering with total domain, we derive various consequences which in the presence of a nonconstructible real seem highly pathological. However, while several of these consequences are obviously absurd, none have as yet been disproven. Indeed some of the stranger consistency proofs of Jensen seem to indicate that there is a possibility that they may be consistent. I am referring to such results as existence of a model for ZF set theory in which the degrees of constructibility form a sequence of typeω+ 1 with the (ω+ 1)st degree being the only one which contains a nonconstructible real, and that degree being the degree of a Δ31nonconstructible real.In what follows we shall use the small Greek lettersα, β, γto range over the Baire spaceNNwhereNis the set of natural numbers. We assume that the reader is familiar with the use of trees to encode closed subsets of this space. The class Σ21is the collection of all those subsets of the Baire space which can be defined by a formula which is Σ21in a constructible parameter. Correspondingly Π21will be taken to mean Π11in a constructible parameter. The proof of the first lemma is left as an exercise. It involves nothing more than coding perfect sets by trees and then counting quantifiers.

In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there is a Turing machine M which computes f in the sense that, M accepts any rho-name of x as input and outputs a rho-name of f(x) for any x in the domain of f. By weakening the effectiveness requirement of the convergence and classifying the converging speeds of rational sequences, several interesting classes of real numbers of weak computability have been introduced in literature, e.g., in addition to the class of computable real numbers (EC), we have the classes of semi-computable (SC), weakly computable (WC), divergence bounded computable (DBC) and computably approximable real numbers (CA). In this paper, we are interested in the weak computability of continuous real functions and try to introduce an analogous classification of weakly computable real functions. We present definitions of these functions by Turing machines as well as by sequences of rational polygons and prove these two definitions are not equivalent. Furthermore, we explore the properties of these functions, and among others, show their closure properties under arithmetic operations and composition.

Contents: Introduction. §1: Computable rings and modules. §2: Ideal membership relation. §3: Effective structured domains. §4: Completion of a local ring as a domain. §5: The recursive completion. Epilogue. References.Introduction. Completion is an important general mathematical device. Often, but not always, a completion takes the following form. Let A be a topological algebraic structure whose topology is derived from a metric. For A, a topological algebra  and an embedding i: A →  are constructed such that  is a complete metric space in which A is densely embedded by i. The long list of structures for which such completions exist begins with Cantor's construction of the real number field and includes objects like the p-adic integers, Baire space, and Boolean algebras. In Bourbaki [6] a careful and thorough account of completions for arbitrary topological groups and fields is given, for which it is important to note that the topological structures need not be metrizable, but must possess a uniformity.The effectiveness of the completion process of a computable structure A cannot be readily studied using the tools of computable algebra, simply because the resulting structure  is almost invariably uncountable. However, in particular cases, it has been possible to define and study the substructure Ak of computable elements of Â; this has been done for the structures mentioned above, starting with the field of recursive real numbers.In this paper we analyse the effectivity of the completion of a local ring R. We do this using structured Scott-Ershov domains. Our study may be considered as a prototype containing methods applicable to a broad class of completions, including all the examples mentioned above, except for the real number field, which needs a generalisation of the domain concept.A Scott-Ershov domain D formalises how a set Dt of possibly “infinite” elements, called total elements, is constructed from a set Dc of “finite” elements, called compact elements. This is achieved by means of an approximation ordering which determines a topology on D and, in particular, on Dt. Our methodology is to associate to a given topological algebra A a structured domain D(A) such that the total elements D(A)t form a topological algebra topologically isomorphic to A. In such circumstances A is said to be domain definable by D(A). The theory of computability for domains is now applied to study the effectivity of the topological algebra A.

Abstract. Various quotient rings of rings B of Banach algebra A-valued continuous functions on a completely regular Hausdorff Space X are constructed in terms of continuous functions defined on dense open subsets of X taking values in the maximal quotient ring of the Banach algebra A. This extends the results proved by N. J. Fine, L., Gillman and J. Lambek (1965) for the case of A, the field of real numbers. The pattern is similar and utilizes as well as generalises the results proved for algebras of multipliers of B by C. A. Akemann, G. K. Pedersen and J. Tomiyama (1973). The techniques combine those from algebra, analysis and topology. The details of the cases when A is the normed division algebra of real quaternions or the operator algebra B(H) of a Hilbert space H are given to illustrate our results.

On the Continuity of Effective Multifunctions

Part 1 The Real Numbers: The Real Number System Upper and Lower Bounds. Part 2 Sequences and Series: Algebraic Operations on Limits Monotone Sequences Infinite Series. Part 3 Continuous Functions: Functions, Limits and Continuity The Intermediate Value Property for Continuous Functions Uniform Continuity Increasing Functions. Part 4 Differentiable Functions: Repeated Differentiation Mean Value Theorems Local Maxima and Minima Taylor's Theorem. Part 5 Further Results on Infinite Series: Tests for Convergence Series of Complex Terms Power Series Multiplication of Series. Part 6 Special Functions: The Exponential Function The Logarithm Trigonometric Functions Inverse Trigonometric Functions. Part 7 The Riemann Integral: Integral Forms of the Mean Value Theorems Integration Over Unbounded Intervals Integration of Unbounded Functions. Part 8 The Number Pi.

The investigation of computational properties of discontinuous functions is an important concern in computable analysis. One method to deal with this subject is to consider effective variants of Borel measurable functions. We introduce such a notion of Borel computability for single‐valued as well as for multi‐valued functions by a direct effectivization of the classical definition. On Baire space the finite levels of the resulting hierarchy of functions can be characterized using a notion of reducibility for functions and corresponding complete functions. We use this classification and an effective version of a Selection Theorem of Bhattacharya‐Srivastava in order to prove a generalization of the Representation Theorem of Kreitz‐Weihrauch for Borel measurable functions on computable metric spaces: such functions are Borel measurable on a certain finite level, if and only if they admit a realizer on Baire space of the same quality. This Representation Theorem enables us to introduce a realizer reducibility for functions on metric spaces and we can extend the completeness result to this reducibility. Besides being very useful by itself, this reducibility leads to a new and effective proof of the Banach‐Hausdorff‐Lebesgue Theorem which connects Borel measurable functions with the Baire functions. Hence, for certain metric spaces the class of Borel computable functions on a certain level is exactly the class of functions which can be expressed as a limit of a pointwise convergent and computable sequence of functions of the next lower level. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Game characterizations of classes of functions in descriptive set theory have their origins in the seminal work of Wadge, with further developments by several others. In this thesis we study such characterizations from several perspectives. We define modifications of Semmes's game characterization of the Borel functions, obtaining game characterizations of the Baire class $\alpha$ functions for each fixed $\alpha < \omega_1$. We also define a construction of games which transforms a game characterizing a class $\Lambda$ of functions into a game characterizing the class of functions which are piecewise $\Lambda$ on a countable partition by $\Pi^0_\alpha$ sets, for each $0 < \alpha < \omega_1$. We then define a parametrized Wadge game by using computable analysis, and show how the parameters affect the class of functions that is characterized by the game. As an application, we recast our games characterizing the Baire classes into this framework. Furthermore, we generalize our game characterizations of function classes to generalized Baire spaces, show how the notion of computability on Baire space can be transferred to generalized Baire spaces, and show that this is appropriate for computable analysis by defining a representation of Galeotti's generalized real line and analyzing the Weihrauch degree of the intermediate value theorem for that space. Finally, we show how the game characterizations of function classes discussed lead in a natural way to a stratification of each class into a hierarchy, intuitively measuring the complexity of functions in that class. This idea and the results presented open new paths for further research.

Based on a closed formula for a star product of Wick type on CPn, which has been discovered in an earlier article of the authors, we explicitly construct a subalgebra of the formal star algebra (with coefficients contained in the uniformly dense subspace of representative functions with respect to the canonical action of the unitary group) that consists of converging power series in the formal parameter, thereby giving an elementary algebraic proof of a convergence result already obtained by Cahen, Gutt, and Rawnsley. In this subalgebra the formal parameter can be substituted by a real number α: the resulting associative algebras are infinite dimensional, except for the case α=1/K, K a positive integer, where they turn out to be isomorphic to the finite-dimensional algebra of linear operators in the Kth energy eigen- space of an isotropic harmonic oscillator with n+1 degrees of freedom. Other examples like the 2n torus and the Poincaré disk are discussed.

The mathematical concept of real numbers is much richer than the double precision numbers widely used as their implementation on a computer. The field of ‘exact real arithmetic' tries to combine the elegance and correctness of the mathematical theories with the speed of double precision hardware, as far as possible. In this paper, we describe an ongoing approach using the specification language ACSL, the tool suite Frama-C (with why and jessie) and the proof assistant Coq to verify central aspects of the iRRAM software package, which is known to be a fast C++ implementation of 'exact' reals numbers.

The pathologies associated with finite basis-set approximations to the Dirac Hamiltonian HDirac are avoided by applying the variational principle to the bounded operator 1 / (H Dirac – W) where W is a real number that is not in the spectrum of HDirac. Methods of calculating upper and lower bounds to eigenvalues, and bounds to the wave-function error as measured by the L2 norm, are described. Convergence is proven. The rate of convergence is analyzed. Boundary conditions are discussed. Benchmark energies and expectation values for the Yukawa potential, and for the Coulomb plus Yukawa potential, are tabulated. The convergence behavior of the energy-weighted dipole sum rules, which have traditionally been used to assess the quality of basis sets, and the convergence behavior of the solutions to the inhomogeneous problem, are analyzed analytically and explored numerically. It is shown that a basis set that exhibits rapid convergence when used to evaluate energy-weighted dipole sum rules can nevertheless exhibit slow convergence when used to solve the inhomogeneous problem and calculate a polarizability. A numerically stable method for constructing projection operators, and projections of the Hamiltonian, onto positive and negative energy states is given. PACS Nos.: 31.15Pf, 31.30Jv, 31.15-p

For many years, vector space models have been used in information retrieval and computational linguistics to represent terms, queries, and documents, using vector addition as a simple operator to model semantic composition. Though surprisingly successful, many aspects of meaning including word order, typed relationships, and nested structures are not captured by this modelling process.

Two methods of digital spectral analysis of unevenly sampled data are developed and illustrated here. One method uses a linear function of time (or space), the other uses circular functions. The circular method turns out to be essentially equivalent to a least-squares sine-wave analysis. The linear, anharmonic method uses only the field of real numbers and elementary algebraic operations, and hence it can be made computationally very fast and accurate. Both methods are very general, properly handling all kinds of time series ranging from simple series consisting only of the times of events to complicated series consisting of pulses with long duty cycles. The two methods are here applied to the analysis of annual mean relative sunspot numbers.