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. 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 (Cβ)β∈Sing satisfying:
Cβ is a club set of β. ot(Cβ)<β If γ is a limit point of Cβ then γ∈Sing and Cγ=Cβ∩γ
== Construction of κ-Suslin trees == In the proof of construction of κ or κ+-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 α later in the construction, we might have T↾α "resemble" being Aronszajn. To counteract this, we can use ◻κ, which allows us to split up the construction of the tree into two cases. At some stages, we might kill off some antichains using ◊, but at later stages (such as α in the example), ◻κ is used to refine the construction.
== Variant relative to a cardinal == Jensen introduced also a local version of the principle. If κ is an uncountable cardinal, then ◻κ asserts that there is a sequence (Cβ∣β a limit point of κ+) satisfying:
Cβ is a club set of β. If cfβ<κ, then |Cβ|<κ If γ is a limit point of Cβ then Cγ=Cβ∩γ Jensen proved that this principle holds in the constructible universe for any uncountable cardinal κ.
== Notes ==
Wikipedia contributors, "Square principle", Wikipedia, revision 1312507403, retrieved 21 November 2026, source, CC BY-SA 4.0.