Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 1998 / Problems / Day 2, P11

IMC 1998 · Day 2 · P11

Suppose that SS is a family of spheres (i.e., surfaces of balls of positive radius) in Rn\mathbb{R}^n, n≥2n \ge 2, such that the intersection of any two contains at most one point. Prove that the set MM of those points that belong to at least two different spheres from SS is countable.

Solution (official)

For every x∈Mx \in M choose spheres S,T∈SS, T \in S such that S≠TS \ne T and x∈S∩Tx \in S \cap T; denote by UU, VV, WW the three components of Rn∖(S∪T)\mathbb{R}^n \setminus (S \cup T), where the notation is such that ∂U=S\partial U = S, ∂V=T\partial V = T and xx is the only point of U‾∩V‾\overline{U} \cap \overline{V}, and choose points with rational coordinates u∈Uu \in U, v∈Vv \in V, and w∈Ww \in W. We claim that xx is uniquely determined by the triple ⟨u,v,w⟩\langle u, v, w \rangle; since the set of such triples is countable, this will finish the proof.

To prove the claim, suppose, that from some x′∈Mx' \in M we arrived to the same ⟨u,v,w⟩\langle u, v, w \rangle using spheres S′,T′∈SS', T' \in S and components U′U', V′V', W′W' of Rn∖(S′∪T′)\mathbb{R}^n \setminus (S' \cup T'). Since S∩S′S \cap S' contains at most one point and since U∩U′≠∅U \cap U' \ne \emptyset, we have that U⊂U′U \subset U' or U′⊂UU' \subset U; similarly for VV's and WW's. Exchanging the role of xx and x′x' and/or of UU's and VV's if necessary, there are only two cases to consider: (a) U⊃U′U \supset U' and V⊃V′V \supset V' and (b) U⊂U′U \subset U', V⊃V′V \supset V' and W⊂W′W \subset W'. In case (a) we recall that U‾∩V‾\overline{U} \cap \overline{V} contains only xx and that x′∈U′‾∩V′‾x' \in \overline{U'} \cap \overline{V'}, so x=x′x = x'. In case (b) we get from W⊂W′W \subset W' that U′⊂U‾∪V‾U' \subset \overline{U} \cup \overline{V}; so since U′U' is open and connected, and U‾∩V‾\overline{U} \cap \overline{V} is just one point, we infer that U′=UU' = U and we are back in the already proved case (a).

Similar problems