On the computational content of convergence proofs via Banach limits

Abstract

This paper addresses new developments in the ongoing proof mining programme, i.e. the use of tools from proof theory to extract effective quantitative information from prima facie ineffective proofs in analysis. Very recently, the current authors developed a method of extracting rates of metastability (as defined by Tao) from convergence proofs in nonlinear analysis that are based on Banach limits and so (for all that is known) rely on the axiom of choice. In this paper, we apply this method to a proof due to Shioji and Takahashi on the convergence of Halpern iterations in spaces X with a uniformly Gâteaux differentiable norm. We design a logical metatheorem guaranteeing the extractability of highly uniform rates of metastability under the stronger condition of the uniform smoothness of X. Combined with our method of eliminating Banach limits, this yields a full quantitative analysis of the proof by Shioji and Takahashi. We also give a sufficient condition for the computability of the rate of convergence of Halpern iterations. This journal is © 2012 The Royal Society.