Wiki
Wiki

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 SS of type tt assigns to each subset X⊆SX\subseteq S of power tt a set f(X)⊆Sf(X)\subseteq S with f(X)∩X=∅f(X)\cap X=\varnothing; of type <t<t, the same on the subsets of power less than tt. It has order nn when ∣f(X)∣<n\lvert f(X)\rvert<n for every XX in its domain. A set S′⊆SS'\subseteq S is free when f(X)∩S′=∅f(X)\cap S'=\varnothing for every X⊆S′X\subseteq S' in the domain. The relation (m,n,t)→p(m,n,t)\to p (respectively (m,n,<t)→p(m,n,<t)\to p) says that every set-mapping of type tt (respectively <t<t) and order nn on a set of power mm has a free set of power pp; the negated arrow says that this fails.

Theorem 1 (p. 116, quoted). "(m,2,t)↛t(m, 2, t)\not\to t if t≥ℵ0t\ge\aleph_0; (m,2,<t)↛ℵ0(m, 2, <t)\not\to\aleph_0 if t>ℵ0t>\aleph_0."

So for every cardinal mm and every infinite tt there is a set-mapping of a set of power mm, of type tt and order 2, so that each value has at most one point, with no free set of power tt; and for every uncountable tt there is one of type <t<t 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 kk and for type ω\omega, which the paper writes for type <ℵ0<\aleph_0.

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 ∣S∣=m≥t\lvert S\rvert=m\ge t it uses Lemma 1 (pp. 114--115, a construction the paper credits to J. Novák): an injective choice of a proper subset g(X)⊊Xg(X)\subsetneq X of power tt for each XX of power tt. It sends XX to one point of Y∖XY\setminus X when X=g(Y)X=g(Y), and to the empty set otherwise; then no X0X_0 of power tt is free, since g(X0)⊊X0g(X_0)\subsetneq X_0 is mapped to a point of X0X_0.

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 ω\omega.