Splitting families of sets in ZFC

DOI10.1016/J.AIM.2014.10.015zbMATH Open1343.03037arXiv1209.1307OpenAlexW2964171406MaRDI QIDQ475276FDOQ475276

Authors: Menachem Kojman 

Publication date: 26 November 2014

Published in: Advances in Mathematics (Search for Journal in Brave)

Abstract: Miller's 1937 splitting theorem was proved for pairs of cardinals $(,ho)$ in which $n$ is finite and $ho$ is infinite. An extension of Miller's theorem is proved here in ZFC for pairs of cardinals $(u,ho)$ in which $u$ is arbitrary and $$. The proof uses a new general method that is based on Shelah's revises Generalized Continuum Hypothesis theorem. Upper bounds on conflict-free coloring numbers of families of sets and a general comparison theorem follow as corollaries of the main theorem. Other corollaries eliminate the use of additional axioms from splitting theorems due to Erdos, Hajnal, Komjath, Juhasz and Shelah.

Full work available at URL: https://arxiv.org/abs/1209.1307

Recommendations

• Splitting Strongly Almost Disjoint Families
• Splittings
• About splitting numbers
• Splitting families and complete separability
• scientific article; zbMATH DE number 3475449

zbMATH Keywords

family of setsfiltrationsproperty Bgeneralized continuum hypothesisconflict-free numberdisjoint refinementessentially disjoint familyMiller's theoremShelah's revised GCHZVCLöwenheim-Skolem theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63) Other combinatorial set theory (03E05) Ordered sets and their cofinalities; pcf theory (03E04) Applications of set theory (03E75)

Cites Work

• On a property of families of sets
• Comparing almost-disjoint families
• Splitting Strongly Almost Disjoint Families
• Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
• Families close to disjoint ones
• The generalized continuum hypothesis revisited
• More on cardinal arithmetic
• Conflict free colorings of (strongly) almost disjoint set-systems
• Essentially disjoint families, conflict free colorings and Shelah's revised GCH
• Title not available (Why is that?)
• Extender based forcings
• Conflict free colorings of nonuniform systems of infinite sets

Cited In (12)

• Splitting Strongly Almost Disjoint Families
• Two-cardinal diamond and games of uncountable length
• Some consistency results on density numbers
• Title not available (Why is that?)
• Infinite combinatorics plain and simple
• The secret life of \(\mu\)-clubs
• When \(P_\kappa(\lambda)\) (vaguely) resembles \(\kappa\)
• On the arithmetic of density
• Higher Souslin trees and the GCH, revisited
• Erdős and set theory
• Towers and clubs
• Title not available (Why is that?)

This page was built for publication: Splitting families of sets in ZFC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475276)