Triangles in cartesian squares of quasirandom groups

We prove that triangular configurations are plentiful in large subsets of cartesian squares of finite quasirandom groups from classes having the quasirandom ultraproduct property, for example the class of finite simple groups. This is deduced from a strong double recurrence theorem for two commuting measure-preserving actions of a minimally almost periodic (not necessarily amenable or locally compact) group on a (not necessarily separable) probability space.Comment: 16 page

Mass problems and intuitionistic higher-order logic

In this paper we study a model of intuitionistic higher-order logic which we call \emph{the Muchnik topos}. The Muchnik topos may be defined briefly as the category of sheaves of sets over the topological space consisting of the Turing degrees, where the Turing cones form a base for the topology. We note that our Muchnik topos interpretation of intuitionistic mathematics is an extension of the well known Kolmogorov/Muchnik interpretation of intuitionistic propositional calculus via Muchnik degrees, i.e., mass problems under weak reducibility. We introduce a new sheaf representation of the intuitionistic real numbers, \emph{the Muchnik reals}, which are different from the Cauchy reals and the Dedekind reals. Within the Muchnik topos we obtain a \emph{choice principle} $(\forall x\,\exists y\,A(x,y))\Rightarrow\exists w\,\forall x\,A(x,wx)$ and a \emph{bounding principle} $(\forall x\,\exists y\,A(x,y))\Rightarrow\exists z\,\forall x\,\exists y\,(y\le_{\mathrm{T}}(x,z)\land A(x,y))$ where $x,y,z$ range over Muchnik reals, $w$ ranges over functions from Muchnik reals to Muchnik reals, and $A(x,y)$ is a formula not containing $w$ or $z$. For the convenience of the reader, we explain all of the essential background material on intuitionism, sheaf theory, intuitionistic higher-order logic, Turing degrees, mass problems, Muchnik degrees, and Kolmogorov's calculus of problems. We also provide an English translation of Muchnik's 1963 paper on Muchnik degrees.Comment: 44 page

Noncommutative Choquet theory

We introduce a new and extensive theory of noncommutative convexity along with a corresponding theory of noncommutative functions. We establish noncommutative analogues of the fundamental results from classical convexity theory, and apply these ideas to develop a noncommutative Choquet theory that generalizes much of classical Choquet theory. The central objects of interest in noncommutative convexity are noncommutative convex sets. The category of compact noncommutative sets is dual to the category of operator systems, and there is a robust notion of extreme point for a noncommutative convex set that is dual to Arveson's notion of boundary representation for an operator system. We identify the C*-algebra of continuous noncommutative functions on a compact noncommutative convex set as the maximal C*-algebra of the operator system of continuous noncommutative affine functions on the set. In the noncommutative setting, unital completely positive maps on this C*-algebra play the role of representing measures in the classical setting. The continuous convex noncommutative functions determine an order on the set of unital completely positive maps that is analogous to the classical Choquet order on probability measures. We characterize this order in terms of the extensions and dilations of the maps, providing a powerful new perspective on the structure of completely positive maps on operator systems. Finally, we establish a noncommutative generalization of the Choquet-Bishop-de Leeuw theorem asserting that every point in a compact noncommutative convex set has a representing map that is supported on the extreme boundary. In the separable case, we obtain a corresponding integral representation theorem.Comment: 81 pages; minor change

Baire classes of affine vector-valued functions

We investigate Baire classes of strongly affine mappings with values in Fr\'echet spaces. We show, in particular, that the validity of the vector-valued Mokobodzki's result on affine functions of the first Baire class is related to the approximation property of the range space. We further extend several results known for scalar functions on Choquet simplices or on dual balls of $L_1$-preduals to the vector-valued case. This concerns, in particular, affine classes of strongly affine Baire mappings, the abstract Dirichlet problem and the weak Dirichlet problem for Baire mappings. Some of these results have weaker conclusions than their scalar versions. We also establish an affine version of the Jayne-Rogers selection theorem.Comment: 43 pages; we added some explanations and references, corrected some misprints and simplified the proof of one lemm

Effective Choice and Boundedness Principles in Computable Analysis

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 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 and others. We also explore how existing classifications of the Hahn-Banach Theorem and Weak K"onig's Lemma fit into this picture. 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. 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

Computability and analysis: the legacy of Alan Turing

We discuss the legacy of Alan Turing and his impact on computability and analysis.Comment: 49 page