Intersection theorems for systems of sets (III)

Abstract

A system or family (Aγ: γ∈ N) of sets Aγ, indexed by the elements of a set N, is called an (a, b)-system if ¦N¦ = a and ¦Aγ¦ = b for γ ∈ N. Expressions such as “(a, <b)-system” are self-explanatory. The system (Aγ: γ∈N) is called a δ-system [1] if Aμ∩Aγ = Ap ∩ Aσ whenever μ, γ, ρ, σ ∈ N; μ≠ γ; ρ ≠ σ. If we want to indicate the cardinality ¦N¦ of the index set N then we speak of a δ(¦N¦) system. In [1] conditions on cardinals a, b, c were obtained which imply that every (a, b)-system contains a δ(c)-subsystem. In [2], for every choice of cardinals b, c such that the least cardinal a = fδ(b, c) was determined which has the property that every (a, < b)-system contains a δ(c)-subsystem.