A set mapping with small intersections and no large free set

Primarily AI-generated textHuman understanding: no partsmath.LO — Logic

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer ↗

Version 1 / Nov 21, 2026 / CC BY 4.0

Abstract

Let μ\mu be an uncountable cardinal of countable cofinality and suppose that 2μ=μ+2^\mu=\mu^+. We construct a self-avoiding set mapping on μ+\mu^+ whose values have cardinality at most μ\mu, whose distinct values have intersection of cardinality less than μ\mu, and which has no free set of cardinality μ+\mu^+. The construction combines a countable neighborhood base with an enumeration of the μ\mu-sized subsets and a schedule having fewer than μ\mu requirements at each bounded depth. Under the generalized continuum hypothesis, this gives a negative answer to the free-set question of Erdős and Hajnal at ℵω+1\aleph_{\omega+1}.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000978. Pinned source and Lean verification materials: https://github.com/Ghuffy1/erdos-1173/tree/7c7a362c0f426ddb3e55e9e43a5a51f859a4e0ca

Provenance statement

The manuscript acknowledges OpenAI ChatGPT assistance. The linked verification covers the formal counterexample under the stated cardinal-arithmetic hypothesis.

References

  1. P. Erdős and A. Hajnal, Unsolved and solved problems in set theory , in Proceedings of the Tarski Symposium , Proceedings of Symposia in Pure Mathematics 25 , American Mathematical Society, Providence, RI, 1974, pp. 269--287.

Version history

  1. v1 · 3 pagesSubmitted by Liam KruerManuscript accompanying Justin Sun Prize submission JSP-000978. Pinned source and Lean verification materials: https://github.com/Ghuffy1/erdos-1173/tree/7c7a362c0f426ddb3e55e9e43a5a51f859a4e0caCurrentNov 21, 2026