Slide 40
Slide 40 text
Strong systems
Definition
Let κ be a regular, uncountable cardinal. S = Sα | α < κ , R
is a strong κ-system if:
1 For all α < κ, 0 < |Sα| < κ and, if α = β < κ, then
Sα ∩ Sβ = ∅.
2 R (sometimes denoted RS) is a set of binary, transitive,
tree-like relations on α<κ
Sα.
3 For all R ∈ R, α, β < κ, u ∈ Sα, and v ∈ Sβ, if uRv, then
α < β.
4 For all α < β < κ and v ∈ Sβ, there is R ∈ R and u ∈ Sα
such that uRv.
A branch through S is a set b ⊆ {{α} × λα | α < κ} such that,
for some R ∈ R, b is linearly ordered by R. b is a cofinal branch
if, for cofinally many α < κ, b ∩ {α} × λα = ∅.