Peter Krautzberger · on the web

# Flat Ultrafilters (Michigan Logic Seminar Sept 21, 2011)

Remember how our about page says that Booles' Rings is about best practices for an academic homepage? Ok, let's try one: making notes to talks available.

## Some introductory remarks

Skip this section if you only want mathematics.

Wednesday, I gave a short talk about flat ultrafilters at our Logic Seminar here at the University of Michigan (as announced on Set Theory Talks, the talk was recorded and the video will be online eventually is now online).

When I visited Toronto in June, Ilijas Farah introduced me to this somewhat strange new type of utrafilter on . My talk this week was mostly about the results from a 2009 paper by Ilijas Farah, N. Christopher Philips and Juris Steprans, doi, but some of what I am going to write are insights I gained while discussing this notion with François Dorais and Andreas Blass. So, actually, this post is attempting another best practice: notes from reading a paper.

I would like to explain something about the result that P-points are not flat. When I started looking at their paper with Francois Dorais, we first re-proved that selective ultrafilters are not flat -- instead of the (possibly stronger) functional analytic result from the paper we used the combinatorial definition of flat ultrafilters. Then we worked on improving that proof and, with Andreas's help, got it to work for P-points.

Only after all of this happened did we notice that at the very end, the paper had already announced that they have a proof that P-points are not flat. Last week, Ilijas kindly send me some slides with further results on flat ultrafilters; even though the proof for P-points isn't in there I would guess from the formulation on the slides that our proofs are essentially the same.

Long story short, the proof "P-points are not flat" below is "our" proof even though the result (and most likely the proof) should be credited to at least Steprans (according to the slides).

I will focus on my own interpretation of these notions, i.e., my rephrasing of the definition of flat ultrafilters; they might look different from what you'll find in their paper even though it is formally the same notion.

Alright, nuff said. My talk was designed to first sketch the main functional analysis result of their paper. So the first two sections will be void of much explanations or proofs. But they motivate why the notion of flat ultrafilter is as strange as it is -- it simply came out of those considerations.

## Some functional analysis

Let be a (the) separable, infinite dimensional Hilbert space, i.e.,

Then is the space of bounded, linear operators, i.e.,

and the space of compact operators

Finally, the Calkin Algebra is the quotient .

Farah, Philips and Steprans were interested in the relative commutant of subalgebras :

## The relative commutant in the ultrapower

If is an ultrafilter, we can consider the norm-ultrapowers of and which I'll denote by . That is

(Similarly for .)

Kirchberg had shown that regardless of and asked it the analogous statement might be true of .

As a response, Farah, Philips and Steprans showed that depends on the choice of (under CH); the results from their paper relevant to this talk are as follows.

Theorem (Farah, Philips, Steprans)

• If is a flat ultrafilter (see below), then .

• If is selective, then ; in particular, selective ultrafilters are not flat.

• Flat ultrafilters exist under ZFC.

• It was announced that P-points are not flat.

Curious fact: under CH all ultrapowers of are isomorphic (via model theoretic arguments). Yet, by the above, if we take a flat and a selective ultrafilter, no such isomoprhism can map to (or else the relative commutants would be isomorphic). This is an odd situation.

If you look at the recording you will, as usual, see lots of confusion on my part. In particular, I remembered that the first result in the theorem was an equivalence. It turned out that the paper does not say so and this is an open question. In my defence, the slides did give it as an equivalence.

I'll only give the proofs of the last two statements as well as some further observations on flat ultrafilters.

## Flat ultrafilters

What are flat ultrafilters? Well, let's first introduce the assisting structure of a flatness scale, a set of sequences in .

Definition
A flatness scale H is a countable subset of

Addendum Nothing spectacular so far -- a flatness scale is just a bunch of sequences converging to . As such they can have some wild behavior along the way -- but flat ultrafilters tame them.

The original definition of flat ultrafilters is then phrased as follows.

Definition [Farah, Philips, Steprans]
An ultrafilter is flat if there is a flatness scale such that for every increasing with

In other words, for every as above and every , we have

We then say that is a flatness scale for p.

One of the goals was to find out how I can best think about the notion of flat ultrafilters.

Addendum What to make of this? The first observation is that flat ultrafilters have a flatness scale such that, given , almost all of the sequences (with respect to the ultrafilter) drop by at most . That's slow, but it's even slower! The functions in the definition should be thought of as vastly increasing (think: dominating family) and they code huge intervals of the form . But even given those vast intervals, still almost all sequences of the flatness scale drop only by on such long intervals. In other words, they never really drop by much, yet they converge to .

One of the things I found irritating was to think of them as ultrafilters on . Thankfully, the enumeration of does not matter much. In other words, I don't have to think of as an ultrafilter on that just happens to come with a map to a flatness scale -- I can really think of to be an ultrafilter on . So allow me to re-phrase.

Definition [reformulation] Given a flatness scale and an ultrafilter on , we say that is flat , if for every increasing with and every ,

In other words,

Here is the usual limit along the ultrafilter .

You might wonder if we're not loosing too much information -- after all, the original definition did not forbid repetitions. We'll see later that this is not a problem. For now, I will simply stick to the reformulation.

First there's an obvious question about how complicated a flatness scale can be. So let me show you their construction of flat ultrafilters.

## Constructing Flat Ultrafilters

### A simple observation

For the construction of flat ultrafilters, the key observation is as follows: all we have to do is find a flatness scale such that the sets

are infinite for every increasing with and every .

Once we have this, we get the finite intersection property for free since

In other words, any ultrafilter containing all the sets is flat -- witnessed by the flatness scale .

Luckily, It turns out that there is an extremely simple flatness scale with this property.

Proposition [Farah, Philips, Steprans] There is a flatness scale such that the set

is infinite for every increasing with and every .

Proof

• Consider the finite subsets of , .
• We can think of as encoding a simple step function, dropping by at each of the elements of ; in other words, we define by
• Clearly, is a flatness scale (starting at and converging to zero, in fact being eventually zero).
• Now imagine we're given some increasing with as well as some .
• Then we can easily find infinitely many with the following properties:
• With the natural enumeration of of ,
for each .
• But this means that for all ,
• It follows that