Comparing Representations for Function Spaces in Computable Analysis

Abstract

This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared to more natural representations for these spaces. The formal framework for the comparisons is provided by Weihrauch reducibility. The centrepiece of the paper considers several representations of the analytic functions on the unit disk and their mutual translations. All translations that are not already computable are shown to be Weihrauch equivalent to closed choice on the natural numbers. Subsequently some similar considerations are carried out for representations of polynomials. In this case in addition to closed choice the Weihrauch degree LPO * shows up as the difficulty of finding the degree or the zeros. As a final example, the smooth functions are contrasted with functions with bounded support and Schwartz functions. Here closed choice on the natural numbers and the lim degree appear.

Decision problems for linear recurrences involving arbitrary real numbers

“…Since the above decision problems pertain to extensional properties of the sequences themselves, it may seem more natural to consider them on the quotient of the space n∈N R 2n under the identification of linear recurrences that encode the same sequence. Such identifications are commonly performed in the computable analysis literature in analogous situations, such as in the definition of the space of polynomials [CH20, Hoy20, dBPS20] or the space of analytic functions [PS18].…”

The Weihrauch degree of finding Nash equilibria in multiplayer games

“…If we were demanding to know the exact degree, we could no longer compute multiplication and addition of polynomials, which would be clearly unsatisfactory. This matter is discussed in detail in [38,Section 3]. We denote the represented space of real univariate polynomials as R[X] and the space of real multivariate polynomials as R[X * ].…”

Computer-assisted proofs for Lyapunov stability via Sums of Squares certificates and Constructive Analysis

“…Usually when working with polynomials, one has to provide a proper representation of polynomials which encodes the coefficients and degree. Note that in the case of real number coefficients the degree of the polynomial is not computable [55]. In this work, the polynomials are given directly as the continuous functions with polynomial mapping h f with rational coefficients and by the modulus of convergence α(p) = 0.…”