Search arXivSearch

arXiv · 2609.12916

Small masas of the Calkin algebra in the Cohen model

Abstract

We show that maximal abelian C*-subalgebras (masas) of the Calkin algebra (the algebra of all bounded operators on the separable Hilbert space modulo compact operators) may consistently have their densities strictly less than continuum and we describe many isomorphism types of such masas. Specifically, we prove that after adding any number of Cohen reals to a model of CH the algebra $C(K_{\mathcal A})$ of all complex-valued continuous functions on the Stone space $K_{\mathcal A}$ of a Boolean algebra $\mathcal A$ of cardinality $ω_1$ is $*$-isomorphic to a masa of the Calkin algebra if and only if $\mathcal A$ does not admit a countably generated ultrafilter. Moreover, for every such Boolean algebra we obtain $ω_2$ pairwise unitarily non-equivalent such masas, none of which has a commutative lift. We also show in ZFC that if a C*-algebra of the form $C(K)$ for any compact Hausdorff $K$ is $*$-isomorphic to a masa of the Calkin algebra, then no point of $K$ may have character smaller than $\mathfrak p$. Therefore, consistently, there may not be any masa of the Calkin algebra of density less than continuum.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Piotr Koszmider. 2026-09-11. Small masas of the Calkin algebra in the Cohen model. https://arxiv.org/abs/2609.12916

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