arXiv:2611.17375v1 Announce Type: new Abstract: Can every set of diameter one in four dimensions be split into at most five parts of smaller diameter? Three parts suffice in the plane and four in three-dimensional space. In four dimensions five parts are sometimes necessary. We prove that six always suffice, improving the previous upper bound of seven. For small circumradius we use six cones. For large circumradius five balls meet every diametral pair of a compact set. At intermediate radii we bound the diameter of each part by the diameter of a rational polytope. The theorem is formalised in Lean.
Continue to arXiv Mathematics →You are being forwarded in 6s — stay on this page