Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. M. Grinsztajn, A 63-dimensional counterexample to Borsuk's conjecture, unpublished note, May 2026, as described on the source card. Lemma 6 is on p. 5 and its proof ends on p. 6.
Statement
For the set of Lemma 4, Lemma 6 (p. 5) states: "Every subset with has at most 5 points."
Proof pointer
pp. 5--6. By Lemma 5, two points are at full diameter exactly when , and is at full diameter from exactly when . So if the vertices behind form a clique in , and if then together with the vertices behind forms a clique; either way the clique number 5 of Lemma 1 gives .
Dependencies and read depth
Depends on Lemma 1, item 2, and Lemma 5. Read depth: claims checked; the statement and proof were read on pp. 5--6. The clique bound it uses is the script's computational claim, unaudited here.
Bears on. E0505: the subset bound from which the note's Theorem 1 counts at least 65 parts.