The consistency of ZFC + 2ℵ0 > ℵω + ℐ(ℵ2) = ℐ(ℵω)

DOI10.2307/2275632MaRDI QIDQ4382465zbMATH OpenOpenAlexFDO

Authors Martin Philip Gilchrist, S. Shelah

Publication date 19 October 1998

Published in Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

forcingGCHgraph coloringrandom reals

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15)

Abstract: An omega-coloring is a pair <f,B> where f:[B]^{2} ---> omega. The set B is the field of f and denoted Fld(f). Let f,g be omega-colorings. We say that f realizes the coloring g if there is a one-one function k:Fld(g) ---> Fld(f) such that for all {x,y}, {u,v} in dom(g) we have f({k(x),k(y)}) not= f({k(u),k(v)}) => g({x,y}) not= g({u,v}). We write f~g if f realizes g and g realizes f. We call the ~-classes of omega-colorings with finite fields identities. We say that an identity I is of size r if |Fld(f)|=r for some/all f in I. For a cardinal kappa and f:[kappa]^2 ---> omega we define I(f) to be the collection of identities realized by f and I (kappa) to be bigcap {I(f)| f:[kappa]^2 ---> omega}. We show that, if ZFC is consistent then ZFC + 2^{aleph_0}> aleph_omega + I(aleph_2)=I(aleph_omega) is consistent.

Review text

This paper continues the program of determining the types of colorings of finite subgraphs of a complete graph with \(\kappa\) many edges (where \(\kappa\) is an uncountable cardinal), supposed that the edges of the graph are colored with countably many colors. More formally, an \(\omega\)-coloring is a pair \((f,B)\) where \(f:[B]^2\to \omega\). Then \(\text{field}(f)= B\). Then \(f\) is said to realize another \(\omega\)-coloring \(g\) iff there exists a one-to-one function \(k:\text{field}(g)\to\text{field}(f)\) such that for all \(x,y\in\text{dom}(g)\), \(f(kx)\neq f(ky)\) implies \(g(x)\neq g(y)\). The equivalence relation \(\simeq\) is defined by \(f\simeq g\) iff \(f\) realizes \(g\) and vice versa. The equivalence classes are called identities. The size of an identity is defined as the size of some (all) of its members. The authors consider only finite identities. For \(\kappa\) a cardinal and \(f:[\kappa]^2\to \omega\) let \({\mathcal J}(f)\) be the set of all finite identities realized by \(f\), and let \[ {\mathcal J}(\kappa)= \bigcap\{{\mathcal J}(f)\mid f:[\kappa]^2\to \omega\}. \] The main result is now that the theory \[ \text{ZFC}+ 2^{\aleph_0}> \aleph_\omega+ {\mathcal J}(\aleph_2)= {\mathcal J}(\aleph_\omega) \] is consistent, supposed that ZF is consistent. The proof is by adding more than \(\aleph_\omega\) random reals to a model of GCH.

Recommendations

• Identities on cardinals less than ℵ_ω
• Consistency results on infinite graphs
• An \(\aleph_1\)-dense ideal on \(\aleph_2\)
• scientific article; zbMATH DE number 4047709

Cites work

• Appendix to models with second order properties II trees with no undefined branches
• Combinatorial set theory
• Models with second order properties II. Trees with no undefined branches
• Partition relations for cardinal numbers

Cited in

(2)

• scientific article; zbMATH DE number 549071 (Why is no real title available?)
• Identities on cardinals less than ℵ_ω

This page was built for publication: The consistency of ZFC + 2^ℵ₀ > ℵ_ω + ℐ(ℵ₂) = ℐ(ℵ_ω)

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