{'fraction_non_alphanumeric': 0.020289855072463767, 'fraction_numerical': 0.0, 'mean_word_length': 4.323076923076923, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Convexity of Chebyshev Sets Revisited

Abstract A subset C of a normed vector space V is called a Chebyshev set if every point in V admits a unique nearest point in C. In this article we give a novel proof that every Chebyshev set in n-dimensional Euclidean space is convex. This statement is sometimes referred to as the “Bunt–Motzkin Theorem.”