SearcharxivSearch

arXiv subjects

Asger Törnquist

Publications and source records attributed to Asger Törnquist.

16 recordsLinked to original sources

Good projective witnesses

We develop a new forcing notion for adjoining self-coding cofinitary permutations and use it to show that consistently, the minimal cardinality $\mathfrak a_{\text{g}}$ of a maximal cofinitary group (MCG) is strictly between $\aleph_1$ and $\mathfrak{c}$, and there is a $Π^1_2$-definable MCG of this cardinality. Here $Π^1_2$ is optimal, making this result a natural counterpart to the Borel MCG of Horowitz and Shelah. Our theorem has its analogue in the realm of maximal almost disjoint (MAD) families, extending a line of results regarding the definability properties of MAD families in models with large continuum.

math.LO

The Ramsey property and higher dimensional mad families

We prove that under a principle of Ramsey regularity there are no infinite maximal almost disjoint families with respect to the transfinitely iterated Fréchet ideals. The results of the present paper were announced by the authors in the Proceedings of the National Academy of Sciences of the U.S.A.

math.LO

A co-analytic Cohen indestructible maximal cofinitary group

Assuming that every set is constructible, we find a $Π^1_1$ maximal cofinitary group of permutations of $\mathbb N$ which is indestructible by Cohen forcing. Thus we show that the existence of such groups is consistent with arbitrarily large continuum. Our method also gives a new proof, inspired by the forcing method, of Kastermans' result that there exists a $Π^1_1$ maximal cofinitary group in $L$.

math.LO

Definable maximal discrete sets in forcing extensions

Let $\mathcal R$ be a $Σ^1_1$ binary relation, and recall that a set $A$ is $\mathcal R$-discrete if no two elements of $A$ are related by $\mathcal R$. We show that in the Sacks and Miller forcing extensions of $L$ there is a $Δ^1_2$ maximal $\mathcal{R}$-discrete set. We use this to answer in the negative the main question posed in \cite{Fischer2010} by showing that in the Sacks and Miller extensions there is a $Π^1_1$ maximal orthogonal family ("mof") of Borel probability measures on Cantor space. By contrast, we show that if there is a Mathias real over $L$ then there are no $Σ^1_2$ mofs.

math.LO

Set theory and a model of the mind in psychology

We investigate the mathematics of a model of the human mind which has been proposed by the psychologist Jens Mammen. Mathematical realizations of this model consist of so-called \emph{Mammen spaces}, where a Mammen space is a triple $(U,\mathcal S,\mathcal C)$, where $U$ is a non-empty set ("the universe"), $\mathcal S$ is a perfect Hausdorff topology on $U$, and $\mathcal C\subseteq\mathcal P(U)$ together with $\mathcal S$ satisfy certain axioms. We refute a conjecture put forward by J. Hoffmann-Jørgensen, who conjectured that the existence of a "complete" Mammen space implies the Axiom of Choice, by showing that in the first Cohen model, in which ZF holds but AC fails, there is a complete Mammen space. We obtain this by proving that in the first Cohen model, every perfect topology can be extended to a maximal perfect topology. On the other hand, we also show that if all sets are Lebesgue measurable, or all sets are Baire measurable, then there are no complete Mammen spaces with a countable universe. Finally, we investigate two new cardinal invariants $\mathfrak u_M$ and $\mathfrak u_T$ associated with complete Mammen spaces and maximal perfect topologies, and establish some basic inequalities that are provable in ZFC. We show $\mathfrak u_M=\mathfrak u_T=2^{\aleph_0}$ follows from Martin's Axiom, and, contrastingly, we show that $\aleph_1=\mathfrak u_M=\mathfrak u_T<2^{\aleph_0}=\aleph_2$ in the Baumgartner-Laver model.

math.LO

A short proof of Thoma's theorem on type I groups

In the theory of unitary group representations, a group is called type I if all factor representations are of type I, and by a celebrated theorem of James Glimm [Gli61b], the type I groups are precisely those groups for which the irreducible unitary representations are what descriptive set theorists now call "concretely classifiable". Elmar Thoma [Tho64] proved the following surprising characterization of the countable discrete groups of type I: They are precisely those that contain a finite index abelian subgroup. In this paper we give a new, simpler proof of Thoma's theorem, which relies only on relatively elementary methods. [Gli61b] James Glimm, Type I $C^{\ast} $-algebras, Ann. of Math. (2) 73 (1961), 572--612. MR 0124756 [Tho64] Elmar Thoma, Über unitäre Darstellungen abzählbarer, diskreter Gruppen, Math. Ann. 153 (1964), 111--138. MR 0160118

math.GR

The Ramsey property implies no mad families

We show that if all collections of infinite subsets of $\N$ have the Ramsey property, then there are no infinite maximal almost disjoint (mad) families. This solves a long-standing problem going back to Mathias \cite{mathias}. The proof exploits an idea which has its natural roots in ergodic theory, topological dynamics, and invariant descriptive set theory: We use that a certain function associated to a purported mad family is invariant under the equivalence relation $E_0$, and thus is constant on a "large" set. Furthermore we announce a number of additional results about mad families relative to more complicated Borel ideals.

math.LO

Non-classification of free Araki-Woods factors and $τ$-invariants

We define the standard Borel space of free Araki-Woods factors and prove that their isomorphism relation is not classifiable by countable structures. We also prove that equality of $τ$-topologies, arising as invariants of type III factors, as well as coycle and outer conjugacy of actions of abelian groups on free product factors are not classifiable by countable structures.

math.OA

Maximal almost disjoint families, determinacy, and forcing

We study the notion of $\mathcal J$-MAD families where $\mathcal J$ is a Borel ideal on $ω$. We show that if $\mathcal J$ is an arbitrary $F_σ$ ideal, or is any finite or countably iterated Fubini product of $F_σ$ ideals, then there are no analytic infinite $\mathcal J$-MAD families, and assuming Projective Determinacy there are no infinite projective $\mathcal J$-MAD families; and under the full Axiom of Determinacy + $V=\mathbf{L}(\mathbb{R})$ there are no infinite $\mathcal J$-mad families. These results apply in particular when $\mathcal J$ is the ideal of finite sets $\mathrm{Fin}$, which corresponds to the classical notion of MAD families. The proofs combine ideas from invariant descriptive set theory and forcing.

math.LO

Unitarizability, Maurey--Nikishin factorization, and Polish groups of finite type

Let $Γ$ be a countable discrete group, and let $π\colon Γ\to {\rm{GL}}(H)$ be a representation of $Γ$ by invertible operators on a separable Hilbert space $H$. We show that the semidirect product group $G=H\rtimes_πΓ$ is SIN ($G$ admits a two-sided invariant metric compatible with its topology) and unitarily representable ($G$ embeds into the unitary group $\mathcal{U}(\ell^2(\mathbb N))$), if and only if $π$ is uniformly bounded, and that $π$ is unitarizable if and only if $G$ is of finite type: that is, $G$ embeds into the unitary group of a II$_1$-factor. Consequently, we show that a unitarily representable Polish SIN groups need not be of finite type, answering a question of Sorin Popa. The key point in our argument is an equivariant version of the Maurey--Nikishin factorization theorem for continuous maps from a Hilbert space to the space $L^0(X,m)$ of all measurable maps on a probability space.

math.OA

Definable maximal cofinitary groups

Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary group with a $Π^1_2$-definable set of generators.

math.LO

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

Template iterations and maximal cofinitary groups

The main result of the present paper is that $\mathfrak a_g$, the minimal size of maximal cofinitary group, can be of countable cofinality. To prove this we define a natural poset for adding a maximal cofinitary group of a given cardinality, which enjoys certain combinatorial properties allowing it to be used within a similar template forcing construction. Additionally we obtain that $\mathfrak a_p$, the minimal size of a maximal family of almost disjoint permutations, and $\mathfrak a_e$, the minimal size of a maximal eventually different family, can be of countable cofinality.

math.LO

$Σ^1_2$ and $Π^1_1$ mad families

We answer in the affirmative the following question of Jörg Brendle: If there is a $Σ^1_2$ mad family, is there then a $Π^1_1$ mad family?

math.LO

The isomorphism relation for separable C*-algebras

We prove that the isomorphism relation for separable C$^*$-algebras, and also the relations of complete and $n$-isometry for operator spaces and systems, are Borel reducible to the orbit equivalence relation of a Polish group action on a standard Borel space.

math.OA

The descriptive set theory of C$^*$-algebra invariants

We establish the Borel computability of various C$^*$-algebra invariants, including the Elliott invariant and the Cuntz semigroup. As applications we deduce that AF algebras are classifiable by countable structures, and that a conjecture of Winter and the second author for nuclear separable simple C*-algebras cannot be disproved by appealing to known standard Borel structures on these algebras.

math.OA