SearcharxivSearch

arXiv subjects

Christopher J. Eagle

Publications and source records attributed to Christopher J. Eagle.

15 recordsLinked to original sources

The computable functional calculus

We show that the continuous functional calculus is computable. As consequences we obtain the computable compactness of the spectrum of any computable normal element of a computably presented $\mathrm{C}^*$-algebra, the existence of effective approximate units for computably presented $\mathrm{C}^*$-algebras, and an effective version of the Spectral Theorem for compact operators on separable Hilbert spaces.

math.LO

Computable $K$-theory for C*-algebras II: AF algebras

We continue the study of the effective content of $K$-theory for C*-algebras, with a focus on AF algebras. We show that from a c.e. presentation of an AF algebra it is possible to compute a representation of the algebra as an inductive limit of finite-dimensional algebras. Using this, and an analogous result for dimension groups, we show that the computable $K_0$ functor provides a computable equivalence of categories between c.e. presentations of AF algebras and c.e. presentations of unital (scaled) dimension groups, giving an effective version of Elliott's classification theorem. We use our results to determine the complexity of the index set and isomorphism problems for various classes of AF algebras.

math.OA

Computable Gelfand Duality

We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras.

math.LO

$K$-theory of co-existentially closed continua

We describe the possible values of $K$-theory for $C(X)$ when $X$ is a co-existentially closed continuum. As a consequence we also show that all pseudo-solenoids, except perhaps the universal one, are not co-existentially closed.

math.LO

An undecidable extension of Morley's theorem on the number of countable models

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of $σ$-projective equivalence relations in several models of set theory. Our methods include random and Cohen forcing, Woodin cardinals and Inner Model Theory.

math.LO

Model theoretic properties of dynamics on the Cantor set

We examine topological dynamical systems on the Cantor set from the point of view of the continuous model theory of commutative C*-algebras. After some general remarks we focus our attention on the generic homeomorphism of the Cantor set, as constructed by Akin, Glasner, and Weiss. We show that this homeomorphism is the prime model of its theory. We also show that the notion of "generic" used by Akin, Glasner, and Weiss is distinct from the notion of "generic" encountered in Fraisse theory.

math.LO

Concrete Barriers to Quantifier Elimination in Finite-Dimensional C*-algebras

Work of Eagle, Farah, Goldbring, Kirchberg, and Vignati shows that the only separable C*-algebras that admit quantifier elimination in continuous logic are $\mathbb{C},$ $\mathbb{C}^2,$ $M_2(\mathbb{C}),$ and the continuous functions on the Cantor set. We show that, among finite dimensional C*-algebras, quantifier elimination does hold if the language is expanded to include two new predicate symbols: One for minimal projections, and one for pairs of unitarily conjugate projections. Both of these predicates are definable, but not quantifier-free definable, in the usual language of C*-algebras. We also show that adding just the predicate for minimal projections is sufficient in the case of full matrix algebras, but that in general both new predicate symbols are required.

math.LO

Omitting types for infinitary [0, 1]-valued logic

We describe an infinitary logic for metric structures which is analogous to $L_{ω_1, ω}$. We show that this logic is capable of expressing several concepts from analysis that cannot be expressed in finitary continuous logic. Using topological methods, we prove an omitting types theorem for countable fragments of our infinitary logic. We use omitting types to prove a two-cardinal theorem, which yields a strengthening of a result of Ben Yaacov and Iovino concerning separable quotients of Banach spaces.

math.LO

Omitting Types and the Baire Category Theorem

The Omitting Types Theorem in model theory and the Baire Category Theorem in topology are known to be closely linked. We examine the precise relation between these two theorems. Working with a general notion of logic we show that the classical Omitting Types Theorem holds for a logic if a certain associated topological space has all closed subspaces Baire. We also consider stronger Baire category conditions, and hence stronger Omitting Types Theorems, including a game version. We use examples of spaces previously studied in set-theoretic topology to produce abstract logics showing that the game Omitting Types statement is consistently not equivalent to the classical one.

math.LO

Expressive power of infinitary [0, 1]-valued logics

We consider model-theoretic properties related to the expressive power of three analogues of $L_{ω_1, ω}$ for metric structures. We give an example showing that one of these infinitary logics is strictly more expressive than the other two, but also show that all three have the same elementary equivalence relation for complete separable metric structures. We then prove that a continuous function on a complete separable metric structure is automorphism invariant if and only if it is definable in the more expressive logic. Several of our results are related to the existence of Scott sentences for complete separable metric structures.

math.LO

Fraïssé limits of C*-algebras

We realize the Jiang-Su algebra, all UHF algebras, and the hyperfinite II$_{1}$ factor as Fraïssé limits of suitable classes of structures. Moreover by means of Fraïssé theory we provide new examples of AF algebras with strong homogeneity properties. As a consequence of our analysis we deduce Ramsey-theoretic results about the class of full-matrix algebras.

math.LO

Quantifier elimination in C*-algebras

The only C*-algebras that admit elimination of quantifiers in continuous logic are $\mathbb{C}, \mathbb{C}^2$, $C($Cantor space$)$ and $M_2(\mathbb{C})$. We also prove that the theory of C*-algebras does not have model companion and show that the theory of $M_n(\mathcal {O_{n+1}})$ is not $\forall\exists$-axiomatizable for any $n\geq 2$.

math.LO

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

Saturation and elementary equivalence of C*-algebras

We study the saturation properties of several classes of $C^*$-algebras. Saturation has been shown by Farah and Hart to unify the proofs of several properties of coronas of $σ$-unital $C^*$-algebras; we extend their results by showing that some coronas of non-$σ$-unital $C^*$-algebras are countably degree-$1$ saturated. We then relate saturation of the abelian $C^*$-algebra $C(X)$, where $X$ is $0$-dimensional, to topological properties of $X$, particularly the saturation of $CL(X)$.

math.LO