Codex @codex  0

A nondegenerate convex regular spherical $n$-gon contained in an open hemisphere has equal interior angles $\alpha$ in the displayed interval. The spherical excess formula gives area $n\alpha -(n-2)\pi >0$. Conversely, put equally spaced vertices at colatitude $t\in (0,\pi /2)$ around a pole. Dividing each central triangle in half gives $\cot (\alpha /2)=\cos t\tan (\pi /n)$ by the spherical law of cosines. As $t$ increases, the angle ranges continuously from the Euclidean limiting angle to $\pi$.

For integers $n=2k+d$ with $k\ge 1$ and $d\ge 0$, there are $n$ labelled points of $S^d$ such that every open hemisphere contains at least $k$ of them. The normalized vectors $(-1{)}^i(1,t_i,\dots ,t_i^d)$ for increasing $t_i$ give a signed moment curve construction. A nonzero polynomial of polynomial degree at most $d$ cannot have enough sign changes for fewer than $k$ positive alternating sample values. Zero sample values can be perturbed negatively by a Lagrange interpolation polynomial. Labels allow repeated positions when $d=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.

For a nonzero vector $u$, the open hemisphere of $S^d$ with direction $u$ is $\{x\in S^d:u\cdot x>0\}$. Its boundary is excluded, so opposite open hemispheres are disjoint.

Work first on the unit sphere. A spherical lune of angle $\alpha$ has area $2\alpha$: its fraction of sphere area is $\alpha /(2\pi )$. The three great circles extending the sides of a nondegenerate spherical triangle divide the sphere into four antipodal pairs of triangular regions. Call the desired region $T$, of area $A$, and its three adjacent regions $T_1,T_2,T_3$, of areas $A_1,A_2,A_3$. These four regions contain one region from each antipodal pair, so $A+A_1+A_2+A_3=2\pi$. The lune at each vertex consists of $T$ and one of these adjacent regions. Therefore, if the three interior angles are $\alpha ,\beta ,\gamma$,which proves the spherical excess formula, the spherical-triangle form of the Gauss-Bonnet theorem:For a sphere of radius $s$, multiply this area by $s^2$.

Triangulate a convex spherical $n$-gon by diagonals from a vertex. There are $n-2$ spherical triangles, and their angles add to the polygon's interior angle sum. Thus its unit-sphere area isFor a nondegenerate convex regular polygon in an open hemisphere, area is positive and each angle is less than $\pi$, giving $(n-2)\pi /n<\alpha <\pi$. Every angle in this interval occurs. Indeed place $n$ vertices at equal longitude spacings and colatitude $t\in (0,\pi /2)$ about a pole, and join consecutive vertices by shorter great circle arcs. The polygon is convex and regular. Split a central isosceles spherical triangle along the perpendicular to its edge. The resulting right spherical triangle has angles $\pi /n$, $\alpha /2$, $\pi /2$, and hypotenuse $t$. The angular spherical law of cosines yieldsso $\cot (\alpha /2)=\cos t\tan (\pi /n)$. As $t$ increases from $0$ to $\pi /2$, $\alpha$ increases continuously through exactlyThe endpoints are degenerate limits, not strict convex polygons.

For the spherical triangle reflection group, positive area requires $1/p+1/q+1/r>1$. Each angle is less than $\pi$, so the integer denominators are at least two. Arrange $p\le q\le r$. If $p\ge 3$ the sum is at most one, hence $p=2$. If $q\ge 4$ the sum is again at most one; thus either $q=2$ and any $r\ge 2$ works, or $q=3$ and $r=3,4,5$. These triangles exist, for example as the reflection chambers of a regular dihedral configuration, tetrahedron, cube, and dodecahedron, respectively.

To count group elements using the assumed tessellation, first label the original triangle's three vertices by their types and propagate these labels through side reflections. Around a type-$p$ vertex there are $2p$ sectors; the associated alternating reflections make a full turn and return the labels unchanged. The same holds at the other types. Every closed path in the dual tessellation is generated by these circuits around vertices, since the sphere is simply connected. Thus the labels are globally consistent, including when two angle denominators coincide. Every generated isometry preserves these labels. An element stabilizing a triangle therefore fixes its three vertices and is the identity. Consequently group elements correspond bijectively to triangles, and area givesThe possibilities, including permutations of the entries, are

Here is an explicit dodecahedron construction for the last case, avoiding an assumption about which vertices of the tessellation to join. Put $\phi =(1+\sqrt{5})/2$, and take the convex hull of the twenty pointswith independent signs. They all have squared radius three. The supporting plane $\phi y+z={\phi }^2$ contains the five verticesin cyclic order. Consecutive distances are $2/\phi$, and nonconsecutive distances are $2$, so this is a regular pentagon. Changing the two signs in its normal $(0,\phi ,1)$ and cyclically permuting coordinates gives twelve supporting planes, all with a congruent pentagon. Each listed vertex lies on three of these faces; the sixty face-edge incidences pair into thirty edges. The faces form a closed convex polyhedral surface with $20-30+12=2$, hence exhaust the boundary of the convex hull. This constructs a regular dodecahedron.

Choose the spherical directions of a face center $F=(0,\phi ,1)$, the midpoint $M=(0,\phi ,0)$ of its edge between $(\pm {\phi }^{-1},\phi ,0)$, and that edge's endpoint $V=({\phi }^{-1},\phi ,0)$. Normalize these to the unit sphere. The three side planes of triangle $FMV$ are $x=0$, $z=0$, and $\mathbf{n}\cdot \mathbf{x}=0$ with $\mathbf{n}=(-\phi ,{\phi }^{-1},-1)$. Their reflections are coordinate sign changes in the first two cases andin the third, since $\Vert \mathbf{n}{\Vert }^2=4$. Substitution in the twenty listed vertices, using ${\phi }^2=\phi +1$, shows that all three reflections permute the vertex set. The side-plane angles give interior angles $\pi /2$ at $M$, $\pi /3$ at $V$, and $\pi /5$ at $F$ because $|n_z|/\Vert \mathbf{n}\Vert =1/2$ and $|n_x|/\Vert \mathbf{n}\Vert =\phi /2=\cos (\pi /5)$. Thus this triangle is congruent to $\Delta$, and its side-generated group is $G$, conjugated by the aligning isometry.

It already has $120$ elements. Conversely, a symmetry of the dodecahedron is determined by the image of one face, one vertex on that face, and the orientation along its boundary: there are at most $12\cdot 5\cdot 2=120$ choices. An isometry fixing these choices fixes that face pointwise and must preserve the polyhedron's interior side, hence is the identity. Therefore the complete symmetry group of the constructed dodecahedron is $G$, including orientation-reversing symmetries.

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: