Bourbaki marks this one as harder than the rest.
Let S be a non-empty finite subset of a vector K-space E, not containing 0. Suppose that there exists an integer k⩾1 with the following property:
(*) for all x∈S, there is a partition of S−{x} into h free subsets with h⩽k.
For such a partition (Ni)1⩽i⩽h and every sequence (rj)1⩽j⩽m of integers of {1,h} a subspace Fr1r2…rm of E is defined by induction on m as follows: Fr1 is the subspace generated by Nr1, Fr1…rp the subspace generated by the intersection of Fr1…rp−1 and Nrp. Suppose that:
(**) for all x∈S and every partition (Ni)1⩽i⩽h of S−{x} into at most k free subsets, there exists at least one sequence (rj)1⩽j⩽m such that
x∈/Fr1r2…rm.
(a) Let n be the least of the integers m⩾1 for all possible choices of x∈S and let (Ni)1⩽i⩽h and (rj)1⩽j⩽m satisfy conditions () and (*). Show that of necessity n=1. (Argue by reductio ad absurdum by assuming x∈/Fr1r2…rn and n>1. Then necessarily x∈Frn. For simplicity write Ep=Fr1r2…rp for 1⩽p⩽n and x=∑iαiyi with αi∈K and yi∈Nrn; there is at least one yi not belonging to En−1, denote it by y; then write N=Nrn−{y}, Ni′=Ni for 1⩽i⩽h and i=rn, Nrn′=N∪{x}, so that (Ni′)1⩽i⩽h is a partition of S−{y} consisting of free subsets. Define E0′=E and for 1⩽p⩽n, Ep′ as the subspace generated by the intersection of Ep−1′ and Nrp′. Now y∈/En−1; let q be the least integer such that y∈/Eq; show that Eq′⊂Eq. Let s be the least integer such that Es′⊂Es; show that rs=rn; deduce finally a contradiction from the relations y∈Es, Es−1′⊂Es−1 and Es′⊂Es.)
(b) Conclude from (a) that with the given hypotheses there exists a partition of S into h free subsets for an integer h⩽k.