Exercise 17, § 5
Tag 03MT, permanent. Cite it as [Bourbaki, Tag 03MT].
Theory of Sets, III, 240
Bourbaki marks this one as harder than the rest.
Let be three integers such that , , . Show that there exists an integer with the following properties : for each finite set E with at least elements, and each partition of the set of subsets of elements of E, it is impossible that every subset of elements of E contains a subset and that every subset of elements of E contains a subset ; in other words, if every subset of elements of E contains some , there exists a subset A of elements of E such that every subset of elements of A belongs to . (Proof by induction. Show that we may take
and finally . If E is a set with elements, if and if , show that if the proposition were false, then every subset of elements of E′ would contain a subset X′ of elements such that , and that every subset of elements of E′ would contain a subset Y′ of elements such that .)
Solution
No solution has been written yet.
Cited by
Nothing.
Cites
Nothing.