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
[edit | edit source]Define Sing to be the class of all limit ordinals which are not regular. Global square states that there is a system satisfying:
Construction of -Suslin trees
[edit | edit source]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 "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.[2]
Variant relative to a cardinal
[edit | edit source]Jensen introduced also a local version of the principle.[3] If is an uncountable cardinal, then asserts that there is a sequence satisfying:
- is a club set of .
- If , then
- If is a limit point of then
Jensen proved that this principle holds in the constructible universe for any uncountable cardinal .
Notes
[edit | edit source]- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). Section 4.
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)., p. 443.
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).