Bourbaki

Exercise 15, § 5

Tag 03MR, permanent. Cite it as [Bourbaki, Tag 03MR].

Theory of Sets, III, 239

Bourbaki marks this one as harder than the rest.

Let E be a finite set, let L\mathfrak{L} and C\mathfrak{C} be two disjoint non-empty subsets of P(E)\mathfrak{P}(\mathrm{E}), and let λ,h,k,l\lambda, h, k, l be four integers ⩾1\geqslant 1 with the following properties : (i) for each A∈L\mathrm{A} \in \mathfrak{L} and each B∈C\mathrm{B} \in \mathfrak{C}, Card (A∩B)⩾λ\mathrm{Card}\,(\mathrm{A} \cap \mathrm{B}) \geqslant \lambda; (ii) for each A∈L\mathrm{A} \in \mathfrak{L}, Card (A)⩾h\mathrm{Card}\,(\mathrm{A}) \geqslant h; (iii) for each B∈C\mathrm{B} \in \mathfrak{C}, Card (B)⩽k\mathrm{Card}\,(\mathrm{B}) \leqslant k; (iv) for each x∈Ex \in \mathrm{E}, the number of elements of L∪C\mathfrak{L} \cup \mathfrak{C} which contain xx is exactly ll. Show that Card (E)⩽hk/λ\mathrm{Card}\,(\mathrm{E}) \leqslant hk/\lambda. (Let (ai)1⩽i⩽n(a_i)_{1 \leqslant i \leqslant n} be the sequence of distinct elements of E arranged in some order, and for each ii let rir_i be the number of elements of L\mathfrak{L} to which aia_i belongs. Show that, if Card (L)=s\mathrm{Card}\,(\mathfrak{L}) = s and Card (C)=t\mathrm{Card}\,(\mathfrak{C}) = t, then we have

∑i=1nri⩽sh,∑i=1n(l−ri)⩽tk,and∑i=1nri(l−ri)⩾λst.)\sum_{i=1}^{n} r_i \leqslant sh, \qquad \sum_{i=1}^{n} (l - r_i) \leqslant tk, \qquad \text{and} \qquad \sum_{i=1}^{n} r_i(l - r_i) \geqslant \lambda st.)

For Card (E)\mathrm{Card}\,(\mathrm{E}) to be equal to hk/λhk/\lambda it is necessary and sufficient that for each A∈L\mathrm{A} \in \mathfrak{L} and each B∈C\mathrm{B} \in \mathfrak{C} we have Card (A)=h\mathrm{Card}\,(\mathrm{A}) = h, Card (B)=k\mathrm{Card}\,(\mathrm{B}) = k,

Card (A∩B)=λ(A \cap B) = \lambda, and that there exists an r⩽lr \leqslant l such that for each x∈Ex \in E the number of elements of L\mathfrak{L} to which xx belongs is equal to rr.

Solution

No solution has been written yet.

Cited by

Cites

Nothing.

Transcribed from the printed volume. Not translated.