A Chain-Level Borsuk--Ulam Obstruction Proof of Norine's Antipodal-Coloring Conjecture
Abstract
We prove Norine's conjecture: every red--blue edge-coloring of the \(n\)-dimensional hypercube \(Q_n\), \(n\geq2\), in which antipodal edges have opposite colors contains a monochromatic path joining some vertex to its antipode. From a hypothetical counterexample we construct an antipodally equivariant, augmentation-preserving chain map from the cellular chains of the cubical boundary of a cube to subdivision-invariant polyhedral chains on a sphere of one lower dimension. A purely algebraic chain-level Borsuk--Ulam obstruction rules out this map.
Disclosure
“irst author is grateful for the resources and facilities provided by SIMIS, which were essential for the completion of this work. Statement of AI Use. The central proof idea in this manuscript was first generated with the assistance of GPT 5.6 Sol Ultra. The manuscript was drafted with the assistance of Codex (using GPT 5.6 Sol), and subsequently revised and approved by the authors.”
PDF page 17
- Classification
- Proof ideas or individual proof-step assistance
- Multiplier
- 8
- Verified
Structural counts
Count notes
- Source counts use the expanded primary TeX file hypercube_coloring_topological.tex.
- Appendix pages include the first PDF page with an explicit Appendix heading through the final page.