1

Let $H_1, H_2, H_3, H_4$ be four hyperplanes in $\mathbb{R}^3$. Then the maximum number of connected components of $\mathbb{R}^3-(H_1\cup H_2\cup H_3\cup H_4)$ is $14$.

The question is whether the above assertion is true. I think it is false. I think it is equivalent to the circle cutting problem where the lines that cut can be regarded as the hyperplanes, which, in this case correspond to planes. Can this be generalized to higher dimensions?Thanks beforehand.

vidyarthi
  • 7,315
  • When you say it is false, do you think that the maximum number of connected components is higher? Lower? The number of connected components can indeed be equal to 14. – mathcounterexamples.net Dec 05 '18 at 14:22
  • @mathcounterexamples.net but, according to circle cutting problem, the number of connected components should be about 11. Could you show how it is $14$. So circle cutting is not valid in higher dimensions, I suppose? – vidyarthi Dec 05 '18 at 14:47

2 Answers2

1

Take following planes: $$\begin{cases} H_1 &\equiv z= 0 \\ H_2 &\equiv y= 0\\ H_3 &\equiv x=0 \\ H_4 &\equiv x+y = k\ , k\neq0 \end{cases}$$

You'll find that the number of connected components of $\mathbb{R}^3 \setminus (H_1\cup H_2\cup H_3\cup H_4)$ is equal to $14$ (look at the number of connected components of $H_1 \setminus (H_2\cup H_3\cup H_4)$ first which is equal to $7$).

enter image description here

vidyarthi
  • 7,315
1

The claim is false. The required number of components is the same as the maximum number of parts $4$ planes can cut the space to. It is given by the formula $\frac{n^3+5n+6}{6}$ for $n$ planes. Substituting, we obtain the components to be $15$. Proof here. Example here

vidyarthi
  • 7,315