Characteristic inequalities of uniformly convex and uniformly smooth Banach spaces

Homotopy type theory is a new branch of mathematics that combines aspects of several different fields in a surprising way. It is based on a recently discovered connection between homotopy the- ory and type theory. Homotopy theory is an outgrowth of algebraic topology and homological algebra, with relationships to higher category theory; while type theory is a branch of mathematical logic and theoretical computer science. Although the connections between the two are currently the focus of intense investigation, it is increasingly clear that they are just the beginning of a subject that will take more time and more hard work to fully understand. It touches on topics as seemingly distant as the homotopy groups of spheres, the algorithms for type checking, and the definition of weak ∞-groupoids.

/pdf/homotopy-type-theory-univalent-foundations-of-mathematics-o5uvcyiu4m.pdf

Homotopy Type Theory: Univalent Foundations of Mathematics

It is shown that the parity game can be solved in quasipolynomial time. The parameterised parity game - with n nodes and m distinct values (aka colours or priorities) - is proven to be in the class of fixed parameter tractable (FPT) problems when parameterised over m. Both results improve known bounds, from runtime nO(√n) to O(nlog(m)+6) and from an XP-algorithm with runtime O(nΘ(m)) for fixed parameter m to an FPT-algorithm with runtime O(n5)+g(m), for some function g depending on m only. As an application it is proven that coloured Muller games with n nodes and m colours can be decided in time O((mm · n)5); it is also shown that this bound cannot be improved to O((2m · n)c), for any c, unless FPT = W[1].

Deciding parity games in quasipolynomial time

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 purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain choice principles such as co-finite choice, discrete choice, interval choice, compact choice and closed choice, which are cornerstones among Weihrauch degrees and it turns out that certain core theorems in analysis can be classified naturally in this structure. In particular, we study theorems such as the Intermediate Value Theorem, the Baire Category Theorem, the Banach Inverse Mapping Theorem, the Closed Graph Theorem and the Uniform Boundedness Theorem. We also explore how existing classifications of the Hahn–Banach Theorem and Weak Kőnig's Lemma fit into this picture. Well-known omniscience principles from constructive mathematics such as LPO and LLPO can also naturally be considered as Weihrauch degrees and they play an important role in our classification. Based on this we compare the results of our classification with existing classifications in constructive and reverse mathematics and we claim that in a certain sense our classification is finer and sheds some new light on the computational content of the respective theorems. Our classification scheme does not require any particular logical framework or axiomatic setting, but it can be carried out in the framework of classical mathematics using tools of topology, computability theory and computable analysis. We develop a number of separation techniques based on a new parallelization principle, on certain invariance properties of Weihrauch reducibility, on the Low Basis Theorem of Jockusch and Soare and based on the Baire Category Theorem. Finally, we present a number of metatheorems that allow to derive upper bounds for the classification of the Weihrauch degree of many theorems and we discuss the Brouwer Fixed Point Theorem as an example.

/pdf/effective-choice-and-boundedness-principles-in-computable-5e7yg13iqs.pdf

Effective choice and boundedness principles in computable analysis

The Foundations of Intuitionistic Mathematics. By S. C. Kleene and R. Vesley. Pp. 206. 1965. 50s. (North-Holland Publishing Co.)

We will overview the results in an informal approach to constructive reverse mathematics, that is reverse mathematics in Bishop’s constructive mathematics, especially focusing on compactness properties and continuous properties.

/pdf/reverse-mathematics-in-bishop-s-constructive-mathematics-17mwygpqxy.pdf

Reverse Mathematics in Bishop’s Constructive Mathematics

Constructive reverse mathematics: compactness properties.

The purpose of this paper is an axiomatic study of the interrelations between certain continuity properties. We deal with principles which are equivalent to the statements “every mapping is sequentially nondiscontinuous”, “every sequentially nondiscontinuous mapping is sequentially continuous”, and “every sequentially continuous mapping is continuous”. As corollaries, we show that every mapping of a complete separable space is continuous in constructive recursive mathematics (the Kreisel-Lacombe-Schoenfield-Tsejtin theorem) and in intuitionism.

https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0022481200022854

Continuity Properties in Constructive Mathematics

Many existence propositions in constructive analysis are implied by the lesser limited principle of omniscience LLPO; sometimes one can even show equivalence. It was discovered recently that some existence propositions are equivalent to Bouwer's fan theorem FAN if one additionally assumes that there exists at most one object with the desired property. We are providing a list of conditions being equivalent to FAN, such as a unique version of weak Konig's lemma. This illuminates the relation between FAN and LLPO. Furthermore, we give a short and elementary proof of the fact that FAN is equivalent to each positive valued function with compact domain having positive infimum. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

Brouwer's fan theorem and unique existence in constructive analysis

The purpose of this paper is an axiomatic study of the interrelations between certain continuity properties. We show that every mapping is sequentially continuous if and only if it is sequentially nondiscontinuous and strongly extensional, and that “every mapping is strongly extensional”, “every sequentially nondiscontinuous mapping is sequentially continuous”, and a weak version of Markov's principle are equivalent. Also, assuming a consequence of Church's thesis, we prove a version of the Kreisel-Lacombe-Shoenfield-Tseĭtin theorem.

Hajime Ishihara

Papers

Reverse Mathematics in Bishop’s Constructive Mathematics

Constructive reverse mathematics: compactness properties.

Continuity Properties in Constructive Mathematics

Brouwer's fan theorem and unique existence in constructive analysis

Continuity and nondiscontinuity in constructive mathematics