Bourbaki

Exercise 7, § 7

Algebra, II, 401

Bourbaki marks this one as harder than the rest.

Let SS be a non-empty finite subset of a vector KK-space EE, not containing 0. Suppose that there exists an integer k⩾1k \geqslant 1 such that for every subset

T of S, Card(T) ≤k⋅rg(T)\leq k \cdot \mathrm{rg}(T). Show that there exists a partition of S into h free subsets for some integer h≤kh \leq k. (Prove that S satisfies condition (***) of Exercise 6, arguing by induction on Card(S) and taking amongst all the subspaces Fr1…rmF_{r_1 \ldots r_m} one of those with the smallest possible dimension; if G is such a subspace and j an index for which Card(G ∩\cap N_j) is the least possible, prove that

k⋅Card(G∩Nj)≤Card(G∩(S−{x})) k \cdot \mathrm{Card}(G \cap N_j) \leq \mathrm{Card}(G \cap (S - \{x\}))
≤Card(G∩S)≤k⋅Card(G∩Nj).) \leq \mathrm{Card}(G \cap S) \leq k \cdot \mathrm{Card}(G \cap N_j).)

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.