Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T08:46:00.267Z Has data issue: false hasContentIssue false

The non-compactness of square

Published online by Cambridge University Press:  12 March 2014

James Cummings
Affiliation:
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA 15213, USA, E-mail: jcumming@andrew.cmu.edu
Matthew Foreman
Affiliation:
Department of Mathematics, University of California at Irvine, Irvine CA 92697, USA, E-mail: mforeman@math.uci.edu
Menachem Magidor
Affiliation:
Institute of Mathematics, Hebrew University of Jerusalem, Jerusalem 91904, Israel, E-mail: menachem@math.huji.ac.il

Extract

This note proves two theorems. The first is that it is consistent to have for every n, but not have . This is done by carefully collapsing a supercompact cardinal and adding square sequences to each ωn. The crux of the proof is that in the resulting model every stationary subset of ℵω+1 ⋂ cof(ω) reflects to an ordinal of cofinality ω1, that is to say it has stationary intersection with such an ordinal.

This result contrasts with compactness properties of square shown in [3]. In that paper it is shown that if one has square at every ωn, then there is a square type sequence on the points of cofinality ωk, k > 1 in ℵω+1. In particular at points of cofinality greater than ω1 there is a strongly non-reflecting stationary set of points of countable cofinality.

The second result answers a question of Džamonja, by showing that there can be no squarelike sequence above a supercompact cardinal, where “squarelike” means that one replaces the requirement that the cofinal sets be closed and unbounded by the requirement that they be stationary at all points of uncountable cofinality.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable