Search arXivSearch

arXiv · 2006.06886

Can you take Akemann--Weaver's $\diamondsuit_{\aleph_1}$ away?

Abstract

By Glimm's dichotomy, a separable, simple $\textrm{C}^*$-algebra has continuum-many unitarily inequivalent irreducible representations if, and only if, it is non-type I while all of its irreducible representations are unitarily equivalent if, and only if, it is type I. Naimark asked whether the latter equivalence holds for all $\textrm{C}^*$-algebras. In 2004, Akemann and Weaver gave a negative answer to Naimark's problem, using Jensen's diamond axiom $\diamondsuit_{\aleph_1}$, a powerful diagonalization principle that implies the Continuum Hypothesis ($\mathsf{CH}$). By a result of Rosenberg, a separably represented simple $\textrm{C}^*$-algebra with a unique irreducible representation is necessarily of type I. We show that this result is sharp by constructing an example of a separably represented, simple $\textrm{C}^*$-algebra that has exactly two inequivalent irreducible representations, and therefore does not satisfy the conclusion of Glimm's dichotomy. Our construction uses a weakening of Jensen's $\diamondsuit_{\aleph_1}$, denoted $\diamondsuit^\mathsf{Cohen}$, that holds in the original Cohen's model for the negation of $\mathsf{CH}$. We also prove that $\diamondsuit^\mathsf{Cohen}$ suffices to give a negative answer to Naimark's problem. Our main technical tool is a forcing notion that generically adds an automorphism of a given $\textrm{C}^*$-algebra with a prescribed action on its space of pure states.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel Calderón, Ilijas Farah. 2022-11-13. Can you take Akemann--Weaver's $\diamondsuit_{\aleph_1}$ away?. https://arxiv.org/abs/2006.06886

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO