相关论文: Computability of the Hahn-Banach Theorem Revisited

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak Konig's Lemma within the…

In this paper we study Weihrauch reducibility for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the corresponding partial order induces a lower semi-lattice…

We demonstrate that techniques of Weihrauch complexity can be used to get easy and elegant proofs of known and new results on initial value problems. Our main result is that solving continuous initial value problems is Weihrauch equivalent…

We show that, given a Banach space and a generator of an exponentially stable $C_{0}$-semigroup, a weakly admissible operator $g(A)$ can be defined for any $g$ bounded, analytic function on the left half-plane. This yields an (unbounded)…

In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…

[REVISED VERSION] The aim of this paper is to state a sharp version of the K\"onig supremum theorem, an equivalent reformulation of the Hahn--Banach theorem. We apply it to derive statements of the Lagrange multipliers, Karush-Kuhn-Tucker…

We deal with isomorphic Banach-Stone type theorems for closed subspaces of vector-valued continuous functions. Let $\mathbb{F}=\mathbb{R}$ or $\mathbb{C}$. For $i=1,2$, let $E_i$ be a reflexive Banach space over $\mathbb{F}$ with a certain…

We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly…

The Hahn-Banach Theorem, a cornerstone of modern functional analysis, is a natural companion of the Second Law of Thermodynamics. From a Kelvin-Planck version of the Second Law, the Hahn-Banach Theorem delivers, immediately and…

In [8] probabilistic methods, in particular a variant of the Weak Law of Large Numbers related to the Bernoulli distribution, have been used to show that for every infinite compact spaces K and L there exists a sequence $(\mu_n)$ of…

We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting. The properties that we study…

A simple proof of (2n)-weak amenability of the triangular Banach algebra T= [(A A) (0 A)] is given where A is a unital C*-algebra.

E. Oja, T. Viil, and D. Werner showed, in [Totally smooth renormings, Archiv der Mathematik, 112, 3, (2019), 269--281] that a weakly compactly generated Banach space $(X,\|\cdot \|)$ with the property that every linear functional on $X$ has…

The Hahn-Banach theorem states that onto each line in every normed space, there is a unitary projection, and Kadec and Snobar proved (using John's ellipsoid) that onto each $n$-dimensional subspace of any real normed space, there is a…

It is a longstanding problem whether every contractible Banach algebra is necessarily finite-dimensional. In this note, we confirm this for Banach algebras acting on Banach spaces with the uniform approximation property. This generalizes a…

We study the uniform computational content of the Vitali Covering Theorem for intervals using the tool of Weihrauch reducibility. We show that a more detailed picture emerges than what a related study by Giusto, Brown, and Simpson has…

A dual Banach algebra is a Banach algebra which is a dual space, with the multiplication being separately weak$^*$-continuous. We show that given a unital dual Banach algebra $\mc A$, we can find a reflexive Banach space $E$, and an…

We present here a simple and direct proof of the classic geometric version of Hahn-Banach Theorem from its analitic version, in the real case. The reciprocal implication, and the direct proofs of both versions, are already well kown, but…

We explore the computational content of Kronecker's lemma via the proof-theoretic perspective of proof mining and utilise the resulting finitary variant of this fundamental result to provide new rates for the Strong Law of Large Numbers for…

It is well known that in the calculus of variations and in optimization there exist many formulations of the fundamental propositions on the attainment of the infima of sequentially weakly lower semicontinuous coercive functions on…