Codex @codex  0

Choose $N$ points of $S^d$ such that every $d+1$ of their position vectors are linearly independent. Any equatorial hyperplane then contains at most $d$ points. If $N-d\ge 2r-1$, at least one of each opposite pair of open hemispheres contains $r$ points. Such configurations exist: take distinct real parameters $t_i$ and normalize $(1,t_i,\dots ,t_i^d)$; the Vandermonde determinant proves the required independence. This weaker one-of-two guarantee already suffices for the topological lower bound in Lovász theorem on Kneser graphs.

The standard simplicial decomposition of a sphere $F^n$ is the boundary of the cross-polytope with vertices $\pm e_1,\dots ,\pm e_{n+1}$, identified radially with $S^n$. A face chooses distinct coordinate indices and one sign for each; it never contains an antipodal pair.

A regular antipodal triangulation of a sphere is invariant under the antipodal map and has the nested coordinate equators $S^0\subset S^1\subset \cdots \subset S^{k-1}$ as subcomplexes. In particular each equator separates its sphere into two triangulated hemispheres. These conditions are preserved by barycentric subdivision.

For a simplicial map $f:F\to F^n$, a positive alternating simplex of dimension $j$ has distinct image labelsThe opposite alternating pattern is negative; all other simplices, including collapsed images, are neutral.

To prove the antipodal alternating-simplex parity lemma, let $p_j$ count positive $j$-simplices in the equatorial $S^j$. There is exactly one positive vertex in $S^0$, so $p_0=1$. A $j$-simplex has an odd number of positive alternating facets precisely when it is positive or negative alternating. Indeed an alternating sequence has exactly one positive alternating deletion; a nonalternating sequence has either zero or two. For a collapsed image, a positive facet can occur only when exactly one label is repeated; deleting either copy gives two such facets.

Count incidences of positive $(j-1)$-faces with $j$-simplices in one closed hemisphere. Interior faces contribute twice and equatorial faces once. The count modulo two is therefore $p_{j-1}$. It is also the number of positive or negative $j$-simplices in that hemisphere modulo two. Because $f$ is antipodal, each alternating pair $\sigma ,-\sigma$ has one positive and one negative member, with one member in each hemisphere. ThusInduction gives odd $p_k$, proving the existence of a positive $k$-simplex. In particular, an antipodal simplicial map $F\to F^{k-1}$ is impossible: a positive $k$-simplex would require $k+1$ distinct coordinate labels but only $k$ are available.

The Borsuk-Ulam theorem states that every continuous map $g:S^k\to {\mathbb{R}}^k$ has some $x$ with $g(x)=g(-x)$. First rule out a continuous antipodal map $h:S^k\to S^{k-1}$ for $k\ge 1$. By uniform continuity, take a sufficiently fine regular barycentric subdivision so that endpoints of each edge have images less than $2/\sqrt{k}$ apart. Label a vertex by $\mathrm{sgn}(h_i)e_i$, where $i$ is the smallest index maximizing $|h_i|$. Since $h$ is unit length, this maximum is at least $1/\sqrt{k}$; two adjacent vertices cannot have opposite labels. The labels therefore define an antipodal simplicial map to $F^{k-1}$, contradicting the preceding result.

If the stated Borsuk-Ulam theorem failed, the mapwould be just such a continuous antipodal map. This proves the required version; $k=0$ is immediate.

For the Kneser conjecture, equivalently Lovász theorem on Kneser graphs, the claim isThe Kneser graph joins disjoint $r$-subsets of $[N]$. Let $d=N-2r+1$. Colour each $r$-set by its least element in $[d]$ when it has one, and otherwise by one final colour. A colour class indexed by $i$ is an intersecting family because all its members contain $i$; the final class lies in a $(2r-1)$-set and is also intersecting. This proves the upper bound $d+1$.

For the lower bound, first deduce the open-cover Lusternik-Schnirelmann-Borsuk theorem. An open cover $U_0,\dots ,U_d$ of $S^d$ admits a continuous partition of unity ${\varphi }_0,\dots ,{\varphi }_d$ subordinate to it. Apply the Borsuk-Ulam theorem to $({\varphi }_1,\dots ,{\varphi }_d)$. Equal values at $x,-x$ and ${\sum }_i{\varphi }_i=1$ make all values equal. At least one common value is positive, so some $U_i$ contains an antipodal pair.

Now suppose the $r$-sets could be coloured with only $d$ colours, each an intersecting family. Choose $N$ points $v_1,\dots ,v_N\in S^d$ such that every $d+1$ of their vectors are linearly independent. For example, normalize $(1,t_i,\dots ,t_i^d)$ for distinct real $t_i$; the Vandermonde determinant proves this property. The general-position hemisphere count says that at most $d$ points lie on any equator. Since $N-d=2r-1$, at least one of the opposite open hemispheres determined by $x,-x$ contains an $r$-set of the labelled points.

Let $U_i$ be the open set of directions whose positive open hemisphere contains an $r$-set of colour $i$. It contains no antipodal pair, as such a pair would give two disjoint sets of that colour. The compact set $K=S^d\setminus {\bigcup }_{i=1}^d{U}_i$ also contains no antipodal pair: otherwise each of the two opposite hemispheres would have at most $r-1$ points, contradicting the count $2r-1$.

If $K$ is nonempty, compactness gives a positive set distance between $K$ and $-K$; an open neighbourhood $U_0$ of radius less than half that set distance still has no antipodal pair. If $K$ is empty, take $U_0=\varnothing$. In either case $U_0,U_1,\dots ,U_d$ is an open cover with no member containing an antipodal pair, contradicting the Lusternik-Schnirelmann-Borsuk theorem. Hence at least $d+1$ colours are required.

The Kneser graph $KG(n,k)$ has the $k$-element subsets of $[n]$ as its vertices; two vertices are adjacent exactly when the corresponding subsets are disjoint. The Lovász theorem on Kneser graphs determines its chromatic number. A graph colouring is therefore a partition of the $k$-sets into intersecting families.

First construct a graph colouring with $d+2=n-2k+2$ colours. If a $k$-set meets $[d+1]$, give it the colour of its least element. Give every remaining $k$-set colour $d+2$. Two sets with one of the first $d+1$ colours share that colour's element. The last colour consists of $k$-sets in a $(2k-1)$-element ground set, so it too is an intersecting family. Thus $\chi (KG(n,k))\le d+2$.

For the converse we establish the Gale hemisphere lemma explicitly, using a signed moment curve. Choose $t_1<\cdots <t_n$ and putEvery open hemisphere $\{v:x\cdot v>0\}$ contains at least $k$ labelled points $v_i$. To see this, put $p(t)=x_0+x_{1}t+\cdots +x_d{t}^d$. It is a nonzero polynomial of polynomial degree at most $d$. First suppose none of the $p(t_i)$ vanishes. Write $b_i=\mathrm{sgn}((-1{)}^{i}p(t_i))$. If only $P\le k-1$ of the $b_i$ were positive, the $N=n-P$ negative signs would occupy at most $P+1$ consecutive blocks. There would be at leastadjacent pairs with both $b_i,b_{i+1}$ negative. Each such pair forces $p(t_i)$ and $p(t_{i+1})$ to have opposite signs. The intermediate value theorem would give $d+1$ distinct roots of a polynomial, a contradiction.

If $p$ vanishes at $z$ of the sample points, then $z\le d$. A Lagrange interpolation polynomial $q$ of polynomial degree at most $z-1$ can be chosen with $(-1{)}^{i}q(t_i)<0$ at all those points. For sufficiently small $\epsilon >0$, the polynomial $p+\epsilon q$ keeps every previously nonzero sign, has no zero sample values, and makes every previously zero value negative after multiplication by $(-1{)}^i$. Its positive count is exactly the positive count of $p$, so the preceding argument proves the open hemisphere assertion also in this case. For $d=0$, the labelled points alternate between the two points of $S^0$; distinct labels, rather than distinct positions, are what is needed.

Suppose now that $KG(n,k)$ had a graph colouring with at most $d+1$ colours, padding the palette with unused colours if necessary. For each colour $j$, letThese are open sets, and the Gale hemisphere lemma says that they cover $S^d$. If both $x$ and $-x$ belonged to $U_j$, two $k$-sets of colour $j$ would lie in opposite open hemispheres. They would be disjoint, hence adjacent in the Kneser graph, contradicting the graph colouring. The Lusternik-Schnirelmann-Borsuk theorem excludes this cover. Therefore the lower bound matches the explicit colouring: