The geometric join of nonempty finite sets is the union
of the convex hulls of all selections containing at
most one point from each
(Bárány et al. 2015). The sets
are called color classes, and such
a selection is called colorful. The geometric join is therefore a union of colorful
simplices and need not be convex.
Lee (2026) constructed, for each integer ,
color classes in
whose geometric join is not contractible,
where
denotes the ceiling function. This refutes the
conjecture that at least
color classes always suffice for contractibility. Lee (2026) also proved that more
than
color classes suffice for contractibility when
. For
, at least
color classes always give a star
convex set, and this threshold is sharp. Lee (2026) reports
that ChatGPT discovered the initial lifting argument and that the remaining proofs
were developed with OpenAI and Anthropic models and verified by the author.