A set mapping with small intersections and no large free set
Version 1 / Nov 21, 2026 / CC BY 4.0
Abstract
Let be an uncountable cardinal of countable cofinality and suppose that . We construct a self-avoiding set mapping on whose values have cardinality at most , whose distinct values have intersection of cardinality less than , and which has no free set of cardinality . The construction combines a countable neighborhood base with an enumeration of the -sized subsets and a schedule having fewer than 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 .
Provenance statement
References
- 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
- 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