\documentclass[11pt]{amsart}
\usepackage{latexsym}
\usepackage{palatino}
\usepackage{amsmath, amssymb}
\usepackage{color}
\usepackage[all]{xy}
\newtheorem{dfs}{Definition}[section]
\newtheorem{lms}[dfs]{Lemma}
\newtheorem{thms}[dfs]{Theorem}
\newtheorem{props}[dfs]{Proposition}
\newtheorem{qus}[dfs]{Question}
\newtheorem{cors}[dfs]{Corollary}
\newtheorem{rems}[dfs]{Remark}
\newtheorem{uprops}[dfs]{Universal Property}
\newtheorem{conjs}[dfs]{Conjecture}
\newtheorem{probs}[dfs]{Problem}
\newtheorem{exs}[dfs]{Example}
\newtheorem{blank}[dfs]{}
\newtheorem*{thm*}{Theorem}

\addtolength{\textwidth}{2.5cm}
\addtolength{\oddsidemargin}{-1.25cm}
\addtolength{\evensidemargin}{-1.25cm}

\renewcommand{\baselinestretch}{1.03}


\begin{document}

\begin{center}
{\bf Appalachian Set Theory Workshop on \\
C*-algebras, classification, and descriptive set theory}
\end{center}


\vspace{10mm}

The theme of these lectures will be that there are at least two quite different ideas of what it means to ``classify" the objects of a category up to isomorphism.  One of these is classification by invariants with good computational properties, while the other, surely familiar to regular attendees of the AST series, is the notion of Borel reducibility.  We will examine how they both contrast and complement each other through the lens of C*-algebra theory.  What follows is a rough outline of the lecture series.


\vspace{5mm}
\noindent
{\bf Lectures I. and II. (Caleb Eckhardt)}  These lectures will introduce the basic theory of C*-algebras.  Topics will include the basic abstract and concrete definitions of C*-algebras, the GNS construction of representations which shows these definitions to be equivalent, examples coming from several kinds of basic mathematical structures, and and introduction to some basic invariants such as K-theory and the tracial state space.    

%He'll then talk about local approximation (nuclearity, exactness, maybe 
%nuclear dimension), and introduce some invariants as time permits 
%(K-theory, traces, Cuntz semigroup).  I expect this might spill over 
%into my first talk.

\vspace{5mm}
\noindent
{\bf Lecture III. (Andrew Toms)} In this lecture we will introduce Elliott's program to classify separable nuclear C*-algebras via K-theoretic data.  We'll trace the history of the program from the earliest results of Glimm to the present, and give some idea of how classification theorems of this type are proved.  Stepping back, we'll also mention Elliott's classification functor formalism.

\vspace{5mm}
\noindent
{\bf Lectures IV. and V. (Andrew Toms)} These lectures will focus on the Borel complexity of isomorphism for simple separable nuclear C*-algebras.  We'll introduce several parameterizations of separable C*-algebras and see that most basic C*-algebra constructions are Borel.  The primary result here are lower and upper bounds for the Borel complexity of isomorphism for these algebras:  it is turbulent, yet below a group action.  This result depends intimately on two important theorems from Elliott's program, a satisfying interplay.

\vspace{5mm}
\noindent
{\bf Lecture VI. (Andrew Toms)} This lecture will consider the Borel computability of several C*-algebra invariants including Elliott's invariant and the Cuntz semigroup.  Open problems and future directions will also be discussed.


% Introduction to Elliott's program: classification by 
%invariants.  I'll discuss Elliott's formalism of a classification 
%functor, and his idea of what a "good" classification might be.  I'll 
%then introduce the Elliott conjecture and mention some successes.  I 
%might even do a baby version of the AF classification, since the idea of 
%intertwining will come up again later.

%4. + 5. (Me) Descriptive set theory and the classification of nuclear 
%simple C*-algebras parts I and II.  As you might expect.

%6. The descriptive set theory of C*-algebra invariants and open 
%questions.  Again, as you might expect.





\end{document}
