English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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.

philosophical transactions - royal society. mathematical, physical and engineering sciences/philosophical transactions - royal society. mathematical, physical and engineering sciences

On the computational content of convergence proofs via Banach limits