Searcharxiv⌕ Search

arXiv subjects

Isaac Goldbring

Publications and source records attributed to Isaac Goldbring.

At least 73 records · Page 4Linked to original sources

On supra-SIM sets of natural numbers

We introduce the class of supra-SIM sets of natural numbers. We prove that this class is partition regular and closed under finite-embeddability. We also prove some results on sumsets and SIM sets motivated by their positive Banach density analogues.

math.CO↗

Spectral gap and definability

We relate the notions of spectral gap for unitary representations and subfactors with definability of certain important sets in the corresponding structures. We give several applications of this relationship.

math.LO↗

Enforceable operator algebras

We adapt the classical notion of building models by games to the setting of continuous model theory. As an application, we study to what extent canonical operator algebras are enforceable models. For example, we show that the hyperfinite II$_1$ factor is an enforceable II$_1$ factor if and only if the Connes Embedding Problem has a positive solution. We also show that the set of continuous functions on the pseudoarc is an enforceable model of the theory of unital, projectionless, abelian \cstar-algebras and use this to show that it is the prime model of its theory.

math.OA↗

Scattered Sentences have Few Separable Randomizations

In the paper "Randomizations of Scattered Sentences", Keisler showed that if Martin's axiom for aleph one holds, then every scattered sentence has few separable randomizations, and asked whether the conclusion could be proved in ZFC alone. We show here that the answer is "yes". It follows that the absolute Vaught conjecture holds if and only if every $L_{ω_1ω}$-sentence with few separable randomizations has countably many countable models.

math.LO↗

Algebraic Independence Relations in Randomizations

We study the properties of algebraic independence and pointwise algebraic independence in a class of continuous theories, the randomizations $T^R$ of complete first order theories $T$. If algebraic and definable closure coincide in $T$, then algebraic independence in $T^R$ satisfies extension and has local character with the smallest possible bound, but has neither finite character nor base monotonicity. For arbitrary $T$, pointwise algebraic independence in $T^R$ satisfies extension for countable sets, has finite character, has local character with the smallest possible bound, and satisfies base monotonicity if and only if algebraic independence in $T$ does.

math.LO↗

Definable sets containing productsets in expansions of groups

We consider the question of when sets definable in first-order expansions of groups contain the product of two infinite sets (we refer to this as the "productset property"). We first show that the productset property holds for any definable subset $A$ of an expansion of a discrete amenable group such that $A$ has positive Banach density and the formula $x\cdot y\in A$ is stable. For arbitrary expansions of groups, we consider a "$1$-sided" version of the productset property, which is characterized in various ways using coheir independence. For stable groups, the productset property is equivalent to this $1$-sided version, and behaves as a notion of largeness for definable sets, which can be characterized by a natural weakening of model-theoretic genericity. Finally, we use recent work on regularity lemmas in distal theories to prove a definable version of the productset property for sets of positive Banach density definable in certain distal expansions of amenable groups.

math.LO↗

Explicit sentences distinguishing McDuff's II$_1$ factors

Recently, Boutonnet, Chifan, and Ioana proved that McDuff's examples of continuum many pairwise non-isomorphic separable II$_1$ factors are in fact pairwise non-elementarily equivalent. Their proof proceeded by showing that any ultrapowers of any two distinct McDuff examples are not isomorphic. In a paper by the first two authors of this paper, Ehrenfeucht-Fraïsse games were used to find an upper bound on the quantifier complexity of sentences distinguishing the McDuff examples, leaving it as an open question to find concrete sentences distinguishing the McDuff factors. In this paper, we answer this question by providing such concrete sentences.

math.LO↗

Robinson forcing and the quasidiagonality problem

We introduce weakenings of two of the more prominent open problems in the classification of $\mathrm{C}^*$-algebras, namely the quasidiagonality problem and the UCT problem. We show that the a positive solution of the conjunction of the two weaker problems implies a positive solution of the original quasidiagonality problem as well as allows us to give a local, finitary criteria for the MF problem, which asks whether every stably finite $\mathrm{C}^*$-algebra is MF.

math.OA↗

Boundary amenability of groups via ultrapowers

We use $\mathrm{C}^{\ast}$-algebra ultrapowers to give a new construction of the Stone-Cech compactification of a separable, locally compact space. We use this construction to give a new proof of the fact that groups that act isometrically, properly, and transitively on trees are boundary amenable.

math.GR↗

On the axiomatizability of $\mathrm{C}^*$-algebras as operator systems

We show that the class of unital $\mathrm{C}^*$-algebras is an elementary class in the language of operator systems. As a result, we have that there is a definable predicate in the language of operator systems that defines the multiplication in any $\mathrm{C}^*$-algebra. Moreover, we prove that the aforementioned class is $\forall\exists\forall$-axiomatizable but not $\forall\exists$-axiomatizable nor $\exists\forall$-axiomatizable.

math.OA↗

The pseudoarc is a co-existentially closed continuum

Answering a question of P. Bankston, we show that the pseudoarc is a co-existentially closed continuum. We also show that $C(X)$, for $X$ a nondegenerate continuum, can never have quantifier elimination, answering a question of the the first and third named authors and Farah and Kirchberg.

math.LO↗

On the theories of McDuff's II$_1$ factors

Recently, Boutonnet, Chifan, and Ioana proved that McDuff's family of continuum many pairwise nonisomorphic separable II$_1$ factors are in fact pairwise non-elementarily equivalent by proving that any ultrapowers of two distinct members of the family are nonsiomorphic. We use Ehrenfeucht-Fraisse games to provide an upper bound on the quantifier-depth of sentences which distinguish these theories.

math.LO↗

Omitting types in operator systems

We show that the class of 1-exact operator systems is not uniformly definable by a sequence of types. We use this fact to show that there is no finitary version of Arveson's extension theorem. Next, we show that WEP is equivalent to a certain notion of existential closedness for C$^*$ algebras and use this equivalence to give a simpler proof of Kavruk's result that WEP is equivalent to the complete tight Riesz interpolation property. We then introduce a variant of the space of n-dimensional operator systems and connect this new space to the Kirchberg Embedding Problem, which asks whether every C$^*$ algebra embeds into an ultrapower of the Cuntz algebra $\mathcal{O}_2$. We end with some results concerning the question of whether or not the local lifting property (in the sense of Kirchberg) is uniformly definable by a sequence of types in the language of C$^*$ algebras.

math.OA↗

Model theory and the QWEP conjecture

We observe that Kirchberg's QWEP conjecture is equivalent to the statement that $C^*(\mathbb{F})$ is elementarily equivalent to a QWEP C$^*$ algebra. We also make a few other model-theoretic remarks about WEP and LLP C$^*$ algebras.

math.OA↗

Hindman's theorem and idempotent types

Motivated by a question of Di Nasso, we prove that Hindman's theorem is equivalent to the existence of idempotent types in countable complete extensions of Peano Arithmetic.

math.LO↗

Approximate polynomial structure in additively large sets

We show that any subset of the natural numbers with positive logarithmic Banach density contains a set that is within a factor of two of a geometric progression, improving the bound on a previous result of the authors. Density conditions on subsets of the natural numbers that imply the existence of approximate powers of arithmetic progressions are developed and explored.

math.CO↗

High density piecewise syndeticity of product sets in amenable groups

M. Beiglböck, V. Bergelson, and A. Fish proved that if $G$ is a countable amenable group and $A$ and $B$ are subsets of $G$ with positive Banach density, then the product set $AB$ is piecewise syndetic. This means that there is a finite subset $E$ of $G$ such that $EAB$ is thick, that is, $EAB$ contains translates of any finite subset of $G$. When $G=\mathbb{Z}$, this was first proven by R. Jin. We prove a quantitative version of the aforementioned result by providing a lower bound on the density (with respect to a Følner sequence) of the set of witnesses to the thickness of $% EAB$. When $G=\mathbb{Z}^d$, this result was first proven by the current set of authors using completely different techniques.

math.CO↗

Model-theoretic aspects of the Gurarij operator system

We establish some of the basic model theoretic facts about the Gurarij operator system $\mathbb{GS}$ recently constructed by the second-named author. In particular, we show: (1) $\mathbb{GS}$ is the unique separable 1-exact existentially closed operator system; (2) $\mathbb{GS}$ is the unique separable nuclear model of its theory; (3) every embedding of $\mathbb{GS}$ into its ultrapower is elementary; (4) $\mathbb{GS}$ is the prime model of its theory; and (5) $\mathbb{GS}$ does not have quantifier-elimination, whence the theory of operator systems does not have a model companion. We also show that, for any $q\in \mathbb{N}$, the theories of $M_q$-spaces and $M_q$-systems do have a model companion, namely the Fraïssé limit of the class of finite-dimensional $M_q$-spaces and $M_q$-systems respectively; moreover we show that the model companion is separably categorical. We conclude the paper by showing that no C$^*$ algebra can be existentially closed as an operator system.

math.LO↗