Real Analysis in Reverse

Many of the theorems of real analysis, against the background of the ordered field axioms, are equivalent to Dedekind completeness, and hence can serve as completeness axioms for the reals. In the course of demonstrating this, the article offers a tour of some less-familiar ordered fields, provides some of the relevant history, and considers pedagogical implications.Comment: To appear in the May 2013 issue of the American Mathematical Monthl

Some Banach spaces added by a Cohen real

We study certain Banach spaces that are added in the extension by one Cohen real. Specifically, we show that adding just one Cohen real to any model adds a Banach space of density $\aleph_1$ which does not embed into any such space in the ground model such a Banach space can be chosen to be UG This has consequences on the the isomorphic universality number for Banach spaces of density $\aleph_1$, which is hence equal to $\aleph_2$ in the standard Cohen model and the same is true for UG spaces. Analogous universality results for Banach spaces are true for other cardinals, by a different proof.Comment: The version to appear in Topology and Its Applications arXiv admin note: substantial text overlap with arXiv:1308.364

Noncommutative geometry of algebraic curves

A covariant functor from the category of generic complex algebraic curves to a category of the AF-algebras is constructed. The construction is based on a representation of the Teichmueller space of a curve by the measured foliations due to Douady, Hubbard, Masur and Thurston. The functor maps isomorphic algebraic curves to the stably isomorphic AF-algebras.Comment: 10 pages, final version; to appear Proc. Amer. Math. So

Compactness and finite forcibility of graphons

Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are referred to as finitely forcible. Following the intuition that such graphons should have finitary structure, Lovasz and Szegedy conjectured that the topological space of typical vertices of a finitely forcible graphon is always compact. We disprove the conjecture by constructing a finitely forcible graphon such that the associated space is not compact. The construction method gives a general framework for constructing finitely forcible graphons with non-trivial properties

Randomness on computable probability spaces - A dynamical point of view

We extend the notion of randomness (in the version introduced by Schnorr) to computable probability spaces and compare it to a dynamical notion of randomness: typicality. Roughly, a point is typical for some dynamic, if it follows the statistical behavior of the system (Birkhoff’s pointwise ergodic theorem). We prove that a point is Schnorr random if and only if it is typical for every mixing computable dynamics. To prove the result we develop some tools for the theory of computable probability spaces (for example, morphisms) that are expected to have other applications