Forcing Square Sequences

30.11.2017 15:00 - 16:30

M. Levine (U Wien)

In the 1970's, Jensen proved that Gödel's constructible universe \(L\) satisfies a combinatorial principle called \(\square_\kappa\) for every uncountable cardinal \(\kappa\). Its significance is partially in that it clashes with the reflection properties of large cardinals—for example, if \(\mu\) is supercompact and \(\kappa \ge \mu\) then \(\square_\kappa\) fails—and so it characterizes the minimality of \(L\) in an indirect way. Schimmerling devised an intermediate hierarchy of principles \(\square_\) for \(\lambda \le \kappa\) as a means of comparing a given model of set theory to \(L\), the idea being that a smaller value of \(\lambda\) yields a model that is more similar to \(L\) at \(\kappa\).

Cummings, Foreman, and Magidor proved that for any \(\lambda<\kappa\), \(\square_\) implies the existence of a PCF-theoretic object called a very good scale for \(\kappa\), but that \(\square_\) (usually denoted \(\square_\kappa\ast\)) does not. They asked whether \(\square_\) implies the existence of a very good scale for \(\kappa\), and we resolve this question in the negative.

We will discuss the technical background of the problem, provide a complete solution, and discuss further avenues of research.

Organiser:

KGRC

Location:
SR 101, 2. St., Währinger Str. 25