Collapsibility of Alexander duals for shade maps
Version 1 / Sep 30, 2026 / CC0 1.0
Abstract
Let be a nonempty finite set. A shade map on is a map such that toggling an element in the input does not change . We prove that, if is an inclusion-reversing shade map and , then the simplicial complex
\[
\{F\subseteq E\mid G\subseteq T(F)\}
\]
is collapsible. Equivalently, if is an inclusion-preserving shade map, then the Alexander dual of
\[
\{F\subseteq E\mid G\not \subseteq S(F)\}
\]
is collapsible. This is an Alexander-dual companion to the shade-map collapsibility theorem in \emph{The Elser nuclei sum revisited}.
The proof first matches all faces on which by a toggle. The remaining faces, characterized by , form the free convex set complex of an associated antimatroidal quasi-closure operator. We give a self-contained recursive acyclic matching on this complex. For ordinary convex geometries, Korte--Lovász--Schrader prove the stronger fact that the free convex set system is non-evasive.
Provenance statement
Tools used
- OpenAI
- ChatGPTVersion 5.6 Sol
References
No bibliography entries.
Version history
- v1 · 18 pagesSubmitted by Darij GrinbergInitial depositCurrentSep 30, 2026