Abstract
We shall prove the following partition theorems:
-
(1)
For every setS and for each cardinal ϰ ≥ ω, |S| ≥ ϰ there exists a partitionT: [S]ϰ → 2ϰ such that for every pairwise disjoint familie
and everyα < 2ϰ there exists a set
-
(2)
Suppose ϰ ≥ ω, 2<ϰ andS an arbitrary set, 2|S| ≤ (2ϰ)+ω Then there exists a partitionT: P(S) → 2ϰ such that for every pairwise disjoint family
and everyα < 2ϰ there exists a set
Both theorems will give partial answers to an Erdős problem.
Similar content being viewed by others
Literaturverzeichnis
G. Elekes, P. Erdős undA. Hajnal, On some partition properties of families of sets,Studia Sci. Math. Hungar. 13 (1978), 151–155.Zbl 474. 04002
P. Erdős, Problems and results on finite and infinite combinatorial analysis,Infinite and finite sets, I (Colloq., Keszthely, 1973), North-Holland, Amsterdam, 1975; 403–424.MR 52 # 10438
F. Galvin undK. Prikry, Borel sets and Ramsey's theorem,J. Symbolic Logic 38 (1973), 193–198.MR 49 # 2399
T. Jech,Set theory, Academic Press, New York, 1978.MR 80a: 03062
B. Voigt undK. Wolfsdorf, Ein Zerlegungssatz für [ϰ]<ϰ.J. Combin. Theory Ser. A 33 (1982), 195–200.
K. Wolfsdorf, Über Partitionen endlicher Teilmengen,J. Combin. Theory Ser. A 28 (1980), 1–6.MR 81h: 04005
K. Wolfsdorf,A remark on an Erdős problem (1980). (Unveröffentlichte Note)
K. Wolfsdorf, Eine Färbung großer Potenzmengen mit □. (To appear)
Author information
Authors and Affiliations
Additional information
Partial support received by the first-named author from the NSF Grant MCS 77–02046. Partial support received by the second-named author from the NSF Grant 78–01525. Die Arbeit des dritt-genannten Verfassers wurde von der DFG unterstützt, WO 287/1.
Rights and permissions
About this article
Cite this article
Galvin, F., Prikry, K. & Wolfsdorf, K. Ein zerlegungssatz für P(ϰ). Period Math Hung 15, 21–40 (1984). https://doi.org/10.1007/BF02109369
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02109369