Borsuk’s partition problem

Target entity: Borsuk’s partition problem
Context triple: [Karol Borsuk, notableIdea, Borsuk’s partition problem]

• A. Sylvester’s theorem on partitions
  Sylvester’s theorem on partitions is a result in number theory that provides a systematic way to count integer partitions subject to certain congruence or restriction conditions, forming part of the foundational work in partition theory.
• B. Knaster–Reichbach covering
  The Knaster–Reichbach covering is a construction in set-theoretic topology used to extend homeomorphisms between dense subsets of Polish spaces to global homeomorphisms.
• C. Mazur’s theorem on convex sets
  Mazur’s theorem on convex sets is a fundamental result in functional analysis that characterizes the structure and approximation properties of convex sets in Banach spaces, particularly via convex combinations of sequences.
• D. Knaster–Ulam theorem
  The Knaster–Ulam theorem is a result in topology and measure theory that, roughly speaking, guarantees the existence of points with certain symmetry or invariance properties under measure-preserving transformations.
• E. Mazurkiewicz–Sierpiński paradox
  The Mazurkiewicz–Sierpiński paradox is a result in set-theoretic geometry showing that a sphere can be decomposed and reassembled in a counterintuitive way, illustrating the existence of paradoxical decompositions similar to the Banach–Tarski paradox.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Borsuk’s partition problem
Target entity description: Borsuk’s partition problem is a famous unsolved problem in geometry that asks whether every bounded set in n-dimensional Euclidean space can be divided into n+1 smaller-diameter subsets.

• A. Sylvester’s theorem on partitions
  Sylvester’s theorem on partitions is a result in number theory that provides a systematic way to count integer partitions subject to certain congruence or restriction conditions, forming part of the foundational work in partition theory.
• B. Knaster–Reichbach covering
  The Knaster–Reichbach covering is a construction in set-theoretic topology used to extend homeomorphisms between dense subsets of Polish spaces to global homeomorphisms.
• C. Mazur’s theorem on convex sets
  Mazur’s theorem on convex sets is a fundamental result in functional analysis that characterizes the structure and approximation properties of convex sets in Banach spaces, particularly via convex combinations of sequences.
• D. Knaster–Ulam theorem
  The Knaster–Ulam theorem is a result in topology and measure theory that, roughly speaking, guarantees the existence of points with certain symmetry or invariance properties under measure-preserving transformations.
• E. Mazurkiewicz–Sierpiński paradox
  The Mazurkiewicz–Sierpiński paradox is a result in set-theoretic geometry showing that a sphere can be decomposed and reassembled in a counterintuitive way, illustrating the existence of paradoxical decompositions similar to the Banach–Tarski paradox.
• F. None of above. chosen