Searcharxiv⌕ Search

arXiv subjects

Martino Lupini

Publications and source records attributed to Martino Lupini.

67 records · Page 4Linked to original sources
arXiv2015

A monad measure space for logarithmic density

We provide a framework for proofs of structural theorems about sets with positive Banach logarithmic density. For example, we prove that if $A\subseteq \mathbb{N}$ has positive Banach logarithmic density, then $A$ contains an approximate geometric progression of any length. We also prove that if $A,B\subseteq \mathbb{N}$ have positive Banach logarithmic density, then there are arbitrarily long intervals whose gaps on $A\cdot B$ are multiplicatively bounded, a multiplicative version Jin's sumset theorem. The main technical tool is the use of a quotient of a Loeb measure space with respect to a multiplicative cut.

math.LO↗
arXiv2015

Nonclassifiability of UHF $L^p$-operator algebras

We prove that simple, separable, monotracial UHF $L^{p}$-operator algebras are not classifiable up to (complete) isomorphism using countable structures, such as K-theoretic data, as invariants. The same assertion holds even if one only considers UHF $L^{p}$-operator algebras of tensor product type obtained from a diagonal system of similarities. For $p=2$, it follows that separable nonselfadjoint UHF operator algebras are not classifiable by countable structures up to (complete) isomorphism. Our results, which answer a question of N. Christopher Phillips, rely on Borel complexity theory, and particularly Hjorth's theory of turbulence.

math.OA↗
arXiv2014

Set theory and von Neumann algebras

These are the notes from Asger Törnquist's Appalachian Set Theory lectures at Carnegie Mellon University. They form a chapter in the LMS lecture notes series 406.

math.OA↗
arXiv2014

Polish groupoids and functorial complexity

We introduce and study the notion of functorial Borel complexity for Polish groupoids. Such a notion aims at measuring the complexity of classifying the objects of a category in a constructive and functorial way. In the particular case of principal groupoids such a notion coincide with the usual Borel complexity of equivalence relations. Our main result is that on one hand for Polish groupoids with essentially treeable orbit equivalence relation, functorial Borel complexity coincides with the Borel complexity of the associated orbit equivalence relation. On the other hand for every countable equivalence relation $E$ that is not treeable there are Polish groupoids with different functorial Borel complexity both having $E$ as orbit equivalence relation. In order to obtain such a conclusion we generalize some fundamental results about the descriptive set theory of Polish group actions to actions of Polish groupoids, answering a question of Arlan Ramsay. These include the Becker-Kechris results on Polishability of Borel $% G $-spaces, existence of universal Borel $G$-spaces, and characterization of Borel $G$-spaces with Borel orbit equivalence relations.

math.LO↗
arXiv2014

Logic for metric structures and the number of universal sofic and hyperlinear groups

Using the model theory of metric structures, I give an alternative proof of the following result by Thomas: If the Continuum Hypothesis fails then there are power of the continuum many universal sofic groups up to isomorphism. This method is also applicable to universal hyperlinear groups, giving a positive answer to a question posed by Thomas.

math.LO↗
arXiv2014

On a sumset conjecture of Erdős

Erdős conjectured that for any set $A\subseteq \mathbb{N}$ with positive lower asymptotic density, there are infinite sets $B,C\subseteq \mathbb{N}$ such that $B+C\subseteq A$. We verify Erdős' conjecture in the case that $A$ has Banach density exceeding $\frac{1}{2}$. As a consequence, we prove that, for $A\subseteq \mathbb{N}$ with positive Banach density (a much weaker assumption than positive lower density), we can find infinite $B,C\subseteq \mathbb{N}$ such that $B+C$ is contained in the union of $A$ and a translate of $A$. Both of the aforementioned results are generalized to arbitrary countable amenable groups. We also provide a positive solution to Erdős' conjecture for subsets of the natural numbers that are pseudorandom.

math.NT↗
arXiv2014

Borel complexity and automorphisms of C*-algebras

We show that if $A$ is $\mathcal{Z}$, $\mathcal{O}_2$, $\mathcal{O}_{\infty}$, a UHF algebra of infinite type, or the tensor product of a UHF algebra of infinite type and $\mathcal{O}_{\infty}$, then the conjugation action $\mathrm{Aut}(A) \curvearrowright \mathrm{Aut}(A)$ is generically turbulent for the point-norm topology. We moreover prove that if $A$ is either (i) a separable C*-algebra which is stable under tensoring with $\mathcal{Z}$ or $\mathcal{K}$, or (ii) a separable ${\mathrm{II}}_1$ factor which is McDuff or a free product of ${\mathrm{II}}_1$ factors, then the approximately inner automorphisms of $A$ are not classifiable by countable structures.

math.OA↗
arXiv2014

Conjugacy and cocycle conjugacy of automorphisms of $\mathcal{O}_{2}$ are not Borel

The group of automorphisms of the Cuntz algebra $\mathcal{O}_{2}$ is a Polish group with respect to the topology of pointwise convergence in norm. Our main result is that the relations of conjugacy and cocycle conjugacy of automorphisms of $\mathcal{O}_{2}$ are complete analytic sets and, in particular, not Borel. Moreover, we show that from the point of view of Borel complexity theory, classifying automorphisms of $\mathcal{O}_{2}$ up to conjugacy or cocycle conjugacy is strictly more difficult than classifying up to isomorphism any class of countable structures with Borel isomorphism relation. In fact the same conclusions hold even if one only considers automorphisms of $\mathcal{O}_{2}$ of a fixed finite order. In the course of the proof we will show that the relation of isomorphism of Kichberg algebras (with trivial $K_{1}$-group and satisfying the Universal Coefficient Theorem) is a complete anaytic set. Moreover, it is strictly more difficult to classify Kirchberg algebras (with trivial $K_{1}$-group and satisfying the Universal Coefficient Theorem) than classifying up to isomorphism any class of countable structures with Borel isomorphism relation.

math.OA↗
arXiv2013

High density piecewise syndeticity of sumsets

Renling Jin proved that if A and B are two subsets of the natural numbers with positive Banach density, then A+B is piecewise syndetic. In this paper, we prove that, under various assumptions on positive lower or upper densities of A and B, there is a high density set of witnesses to the piecewise syndeticity of A+B. Most of the result are shown to hold more generally for subsets of Z^d. The key technical tool is a Lebesgue density theorem for measure spaces induced by cuts in the nonstandard integers.

math.NT↗
arXiv2013

Nonstandard Analysis and the sumset phenomenon in arbitrary amenable groups

Beiglboeck, Bergelson and Fish proved that if subsets A,B of a countable discrete amenable group G have positive Banach densities a and b respectively, then the product set AB is piecewise syndetic, i.e. there exists k such that the union of k-many left translates of AB is thick. Using nonstandard analysis we give a shorter alternative proof of this result that does not require G to be countable, and moreover yields the explicit bound that k is not greater than 1/ab. We also prove with similar methods that if $\{A_i\}$ are finitely many subsets of G having positive Banach densities $a_i$ and G is countable, then there exists a subset B whose Banach density is at least the product of the densities $a_i$ and such that the product $BB^{-1}$ is a subset of the intersection of the product sets $A_i A_i^{-1}$. In particular, the latter set is piecewise Bohr.

math.CO↗
arXiv2013

Unitary equivalence of automorphisms of separable C*-algebras

We prove that the automorphisms of any separable C*-algebra that does not have continuous trace are not classifiable by countable structures up to unitary equivalence. This implies a dichotomy for the Borel complexity of the relation of unitary equivalence of automorphisms of a separable unital C*-algebra: Such relation is either smooth or not even classifiable by countable structures.

math.OA↗