Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Conventions (pp. 111--112). A set-mapping of of type assigns to each subset of power a set with ; of type , the same on the subsets of power less than . It has order when for every in its domain. A set is free when for every in the domain. The relation (respectively ) says that every set-mapping of type (respectively ) and order on a set of power has a free set of power ; the negated arrow says that this fails.
Theorem 1 (p. 116, quoted). " if ; if ."
So for every cardinal and every infinite there is a set-mapping of a set of power , of type and order 2, so that each value has at most one point, with no free set of power ; and for every uncountable there is one of type and order 2 with no infinite free set. Section 3 (p. 112) draws the consequence that positive results can be expected only for finite types and for type , which the paper writes for type .
Source. P. Erdős and A. Hajnal, On the structure of set-mappings, Acta Math. Acad. Sci. Hungar. 9 (1958), 111--131: Theorem 1 on p. 116, announced in Section 3 on p. 112; the definitions in Sections 1--2, pp. 111--112. The edition is the one identified on the source card.
Read depth. Claims checked: the statement and the definitions it uses were read clause by clause on the printed pages. The proof was not checked.
Proof pointer
The paper proves only the first statement (p. 116) and notes that the second follows from it. For it uses Lemma 1 (pp. 114--115, a construction the paper credits to J. Novák): an injective choice of a proper subset of power for each of power . It sends to one point of when , and to the empty set otherwise; then no of power is free, since is mapped to a point of .
Dependencies
Lemma 1 of the same paper (pp. 114--115).
Bears on
No Erdős problem page directly. The theorem explains why the paper's free-set questions, among them its Problem 1 (Problem 1), are posed for finite types and type .