Kuratowski's free set theorem

Kuratowski's free set theorem, named after Kazimierz Kuratowski, is a result of set theory, an area of mathematics. It is a result which has been largely forgotten for almost 50 years, but has been applied recently in solving several lattice theory problems, such as the congruence lattice problem.

Denote by [ X ] < ω {\displaystyle [X]^{<\omega }} the set of all finite subsets of a set X {\displaystyle X} . Likewise, for a positive integer n {\displaystyle n} , denote by [ X ] n {\displaystyle [X]^{n}} the set of all n {\displaystyle n} -elements subsets of X {\displaystyle X} . For a mapping Φ : [ X ] n [ X ] < ω {\displaystyle \Phi \colon [X]^{n}\to [X]^{<\omega }} , we say that a subset U {\displaystyle U} of X {\displaystyle X} is free (with respect to Φ {\displaystyle \Phi } ), if for any n {\displaystyle n} -element subset V {\displaystyle V} of U {\displaystyle U} and any u U V {\displaystyle u\in U\setminus V} , u Φ ( V ) {\displaystyle u\notin \Phi (V)} . Kuratowski published in 1951 the following result, which characterizes the infinite cardinals of the form n {\displaystyle \aleph _{n}} .

The theorem states the following. Let n {\displaystyle n} be a positive integer and let X {\displaystyle X} be a set. Then the cardinality of X {\displaystyle X} is greater than or equal to n {\displaystyle \aleph _{n}} if and only if for every mapping Φ {\displaystyle \Phi } from [ X ] n {\displaystyle [X]^{n}} to [ X ] < ω {\displaystyle [X]^{<\omega }} , there exists an ( n + 1 ) {\displaystyle (n+1)} -element free subset of X {\displaystyle X} with respect to Φ {\displaystyle \Phi } .

For n = 1 {\displaystyle n=1} , Kuratowski's free set theorem is superseded by Hajnal's set mapping theorem.

References

  • P. Erdős, A. Hajnal, A. Máté, R. Rado: Combinatorial Set Theory: Partition Relations for Cardinals, North-Holland, 1984, pp. 282–285.
  • C. Kuratowski, Sur une caractérisation des alephs, Fund. Math. 38 (1951), 14–17.
  • John C. Simms (1991) "Sierpiński's theorem", Simon Stevin 65: 69–163.


  • v
  • t
  • e