Square principle

In mathematical set theory, a square principle is a combinatorial principle asserting the existence of a cohering sequence of short closed unbounded (club) sets so that no one (long) club set coheres with them all. As such they may be viewed as a kind of incompactness phenomenon.^[1] They were introduced by Ronald Jensen in his analysis of the fine structure of the constructible universe L.

Definition

Define Sing to be the class of all limit ordinals which are not regular. Global square states that there is a system ${\displaystyle (C_{\beta })_{\beta \in \mathrm {Sing} }}$ satisfying:

1. ${\displaystyle C_{\beta }}$ is a club set of ${\displaystyle \beta }$.
2. ot${\displaystyle (C_{\beta })<\beta }$
3. If ${\displaystyle \gamma }$ is a limit point of ${\displaystyle C_{\beta }}$ then ${\displaystyle \gamma \in \mathrm {Sing} }$ and ${\displaystyle C_{\gamma }=C_{\beta }\cap \gamma }$

Construction of ${\displaystyle \kappa }$-Suslin trees

In the proof of construction of ${\displaystyle \kappa }$ or ${\displaystyle \kappa ^{+}}$-Suslin trees in L, one might want to construct said tree purely via recursion on the levels. On a stationary set of levels, we must have that all antichains must be "killed off", but at a limit stage ${\displaystyle \alpha }$ later in the construction, we might have ${\displaystyle T\upharpoonright \alpha }$ "resemble" being Aronszajn. To counteract this, we can use ${\displaystyle \Box _{\kappa }}$, which allows us to split up the construction of the tree into two cases. At some stages, we might kill off some antichains using ${\displaystyle \Diamond }$, but at later stages (such as ${\displaystyle \alpha }$ in the example), ${\displaystyle \Box _{\kappa }}$ is used to refine the construction.^[2]

Variant relative to a cardinal

Jensen introduced also a local version of the principle.^[3] If ${\displaystyle \kappa }$ is an uncountable cardinal, then ${\displaystyle \Box _{\kappa }}$ asserts that there is a sequence ${\displaystyle (C_{\beta }\mid \beta {\text{ a limit point of }}\kappa ^{+})}$ satisfying:

1. ${\displaystyle C_{\beta }}$ is a club set of ${\displaystyle \beta }$.
2. If ${\displaystyle cf\beta <\kappa }$, then ${\displaystyle |C_{\beta }|<\kappa }$
3. If ${\displaystyle \gamma }$ is a limit point of ${\displaystyle C_{\beta }}$ then ${\displaystyle C_{\gamma }=C_{\beta }\cap \gamma }$

Jensen proved that this principle holds in the constructible universe for any uncountable cardinal ${\displaystyle \kappa }$.

Notes

1. Cummings, James (2005), "Notes on Singular Cardinal Combinatorics", Notre Dame Journal of Formal Logic, 46 (3): 251–282, doi:10.1305/ndjfl/1125409326 Section 4.
2. Devlin, Keith (July 16, 1984). Constructibility (1st ed.). Springer-Verlag. ISBN 9780387132587.
3. Jech, Thomas (2003), Set Theory: Third Millennium Edition, Springer Monographs in Mathematics, Berlin, New York: Springer-Verlag, ISBN 978-3-540-44085-7, p. 443.

• Jensen, R. Björn (1972), "The fine structure of the constructible hierarchy", Annals of Mathematical Logic, 4 (3): 229–308, doi:10.1016/0003-4843(72)90001-0, MR 0309729