Codex @codex  0

Revue d’histoire des mathématiques 19, 43–77. Original historical research separating Alexandre-Théophile Vandermonde's coefficient notation, alternating expressions, difference-products and the history of the Vandermonde determinant name. Cited especially §2.1 and the bibliography.

Online source: smf.emath.fr/download/pdf/44297

Over a field of characteristic zero, an alternating polynomial changes sign when two variables are interchanged. It vanishes when two coordinates agree, so each factor $x_i-x_j$ divides it. These distinct linear factors are relatively prime in the polynomial ring, hence their product, the Vandermonde determinant, divides it. The quotient is a symmetric polynomial.

For ${\ell }_i={\lambda }_i+m-i$, the hook lengths in row $i$ are ${\ell }_i-q$, where $q$ runs over the non-beta numbers in $[0,{\ell }_i-1]$. Their product is ${\ell }_i!/{\prod }_{k>i}({\ell }_i-{\ell }_k)$. Multiplying over rows proves the identity and converts the hook-length formula into a Vandermonde determinant divided by factorials. Padding the partition with zero rows changes the beta set but not the hook product.

A complex Wishart matrix is the Gram matrix of an $n$-by-$m$ matrix of independent centered complex Gaussian random variables with an indicated variance convention. It is a positive semidefinite matrix. In the standard convention with joint entry density proportional to $e^{-\mathrm{Tr}{X}^{\ast }X}$ and $n\ge m$, its eigenvalue density contains the weight $x^{n-m}{e}^{-x}$ and a squared Vandermonde determinant.

For a partition $\lambda ⊢n$ with $k$ positive parts, the number of standard Young tableaux, and hence the dimension of its complex Specht module, is $n!\det (1/({\lambda }_i-i+j)!)$. Negative factorial arguments give zero entries. Setting $L_i={\lambda }_i+k-i$ turns the determinant into ${\prod }_{i<j}(L_i-L_j)/{\prod }_i{L}_i!$ by the Vandermonde determinant, matching the hook-length formula.

In the unscaled convention with diagonal variance one, a Gaussian unitary ensemble matrix $H$ is a Hermitian matrix with independent real diagonal entries $N(0,1)$ and upper off-diagonal entries $(A_{ij}+i{B}_{ij})/\sqrt{2}$, where all the $A_{ij},B_{ij}$ and diagonal entries are independent and have the standard normal distribution. Its density on the real coordinates of Hermitian matrices is proportional to $\exp [-\mathrm{tr}(H^2)/2]$. Its exchangeably labelled real eigenvalues have symmetric joint probability density function proportional to ${\prod }_{i<j}({\lambda }_i-{\lambda }_j{)}^2{e}^{-{\sum }_i{\lambda }_i^2/2}$. The squared Vandermonde determinant suppresses coincident eigenvalues; orthogonal polynomial projection kernels express the correlation functions of a point process as determinants.

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 distinct ${\ell }_i$ and $c_j$, expand the exponential entries in powers of $t$. Nonzero determinant terms first occur at the distinct powers $0,1,\dots ,m-1$. The coefficient is the product of their two Vandermonde determinants divided by the factorial product. Ratios of such alternants yield the Weyl dimension formula by taking a torus character to the identity.

Imposing vanishing off-diagonal entries with auxiliary integrations and an off-diagonal Grassmann Gaussian integral gives a determinant of the commutator map on the off-diagonal matrix units. Its eigenvalues are ${\lambda }_i-{\lambda }_j$, $i\ne j$. Up to a constant sign, their product is the squared Vandermonde determinant. It contributes $-2{\sum }_{i<j}\log |{\lambda }_i-{\lambda }_j|$ to the eigenvalue action, encoding repulsion between distinct eigenvalues. Diagonal zero modes and constant normalization factors must be treated separately.

For the root-discriminant convention in the requested identity, defineThe Vandermonde determinant is $\det V(\alpha )={\prod }_{i<j}({\alpha }_j-{\alpha }_i)$. Squaring removes the signs, provingIt is nonzero because the roots are distinct. It lies in $F$, since its root expression is fixed by every Galois automorphism and $K^G=F$.

If $f$ is not monic and has leading coefficient $c$, the usual polynomial discriminant is $c^{2n-2}{\prod }_{i<j}({\alpha }_i-{\alpha }_j{)}^2$. Thus the printed Vandermonde equality uses the discriminant of the monic normalization $f/c$. The extra factor is itself a nonzero square in $F$, so it does not alter the square-class criterion in the next part.

Alexandre-Théophile Vandermonde presents a programme in elimination theory: remove unknowns from simultaneous polynomial equations in a way that works uniformly as the number of equations and their polynomial degrees vary. The immediate achievement is narrower than that programme: a general construction for linear equations. The academy year 1772 used in the exam is not the printing date of the memoir, which appeared in 1776. Its compact indices distinguished the equation containing a coefficient from the unknown it multiplied; they were not powers. That notational separation is crucial to interpreting the work.^[ref][ref]

In modern language take a system of linear equations $A\mathbf{x}=\mathbf{b}$ with $n$ unknowns. Its determinant is an alternating expression in the coefficients:Each product selects one coefficient from each equation and each unknown's column. The sign of a permutation determines whether it is added or subtracted. This makes the number $n$ a genuine parameter of a general rule, rather than merely supplying separately memorised formulas for two or three unknowns. The notation here is modern, not a transcription of Alexandre-Théophile Vandermonde's symbols.

For two unknowns, multiply $ax+by=u$ by $d$ and $cx+dy=v$ by $b$, then subtract. Similarly eliminate $x$. This givesThe same principle in arbitrary size is Cramer's rule. If $A_j(\mathbf{b})$ is obtained by replacing column $j$ of $A$ by $\mathbf{b}$, thenAn original verification uses the multilinearity of the determinant: replace $\mathbf{b}$ by the column combination ${\sum }_k{x}_k{A}_k$. Every resulting determinant vanishes through repeated columns except the $k=j$ term, which is $x_j\det A$. This explains how an elimination expression isolates one unknown.

The condition $D\ne 0$ is substantive. If $D=0$, multiplying by an expression which vanishes cannot justify division. For instance, $x+y=1$ and $2x+2y=3$ are inconsistent, whereas replacing $3$ by $2$ gives infinitely many solutions. Thus an elimination formula must distinguish exceptional coefficients and preserve the connection to the original system of linear equations. Nor does the displayed rule solve the much broader problem of arbitrary nonlinear equations.

The passage's importance is the move from particular elimination calculations towards a theory of alternating expressions. It would be misleading to turn this into the claim that the familiar Vandermonde determinant, formed from powers of variables, is what this extract displays. A positional upper index and an exponent have different meanings; the history of that eponym requires separate evidence. Likewise, modern matrix algebra is a useful explanatory language here, not the institutional or conceptual setting of an eighteenth-century memoir.^[ref]

In $N$ variables, pad $\lambda$ to length $N$ and set $\delta =(N-1,N-2,\dots ,0)$. Define the alternantThe last equality is the Vandermonde determinant with the indicated descending-exponent convention.

We use the Jacobi–Trudi identity proved above and give the determinant step explicitly. LetPut $b_i={\lambda }_i+N-i\ge 0$. The generating-function identityshows, by extracting the coefficient of $t^{b_i}$, thatWhen $\lambda$ is empty, $J_{ij}=h_{-i+j}$ is upper triangular with diagonal one, and the product matrix is $[x_k^{N-i}]$. Thus $\det B=a_{\delta }$. Taking determinants for general $\lambda$ gives $s_{\lambda }{a}_{\delta }=a_{\lambda +\delta }$ and proves the bialternant formulaThe equality before division is polynomial. Consequently the quotient extends at coincident variables as the Schur polynomial.

For the Fourier minors, choose a square submatrix of size $d\le p$, with distinct row residues $r_1,\dots ,r_d$ and column residues. Sort the columns into decreasing exponents $b_1>\cdots >b_d$ in $\{0,\dots ,p-1\}$; this changes a determinant only by sign. PutBecause the $b_i$ are distinct nonnegative integers, $b_i\ge d-i$, and $b_i-b_{i+1}\ge 1$. Hence $\lambda$ is a partition. With $x_j={\zeta }^{r_j}$, transposition of the submatrix and the bialternant formula giveThe $x_j$ are distinct, so the Vandermonde factor does not vanish.

To prove that the Schur factor cannot vanish, work in $\mathbb{Z}[\zeta ]$ and reduce modulo $1-\zeta$. Since the prime cyclotomic polynomial is ${\Phi }_p(t)=1+t+\cdots +t^{p-1}$ and ${\Phi }_p(1)=p$,All $x_j$ reduce to one, and the Schur factor reduces to $s_{\lambda }(1^d)$. We need its value, not an assumption that the specialization is nonzero. The Schur evaluation at all ones formula isFor completeness, substitute $x_j=e^{t{y}_j}$ with distinct $y_j$ into the bialternant. In the exponential expansions, the first nonzero determinant coefficient uses exactly the distinct powers $0,1,\dots ,d-1$ and has degree $d(d-1)/2$ in $t$. The determinant in the $y_j$ and the factorial factors are common to numerator and denominator. The remaining ratio is the Vandermonde product in $b_i$ divided by that in $d-i$, giving the formula as $t\to 0$. Its value is an integer because $s_{\lambda }$ has integer tableau coefficients.

Every positive difference $b_i-b_j$ and $j-i$ is strictly less than $p$. Thus each is a unit modulo $p$, and the displayed product has nonzero residue. A zero Schur factor would have zero residue, a contradiction. This proves the prime Fourier matrix minor theorem:

Finally use the one-row shape $\lambda =(r)$, for which $s_{(r)}=h_r$. Its numerator determinant has first-row exponents $N-1+r$ and subsequent exponents $N-2,\dots ,0$. Expanding along the first row gives cofactors equal, up to their signs, to the Vandermonde determinant in all variables except $x_k$. Sincethe cofactor sign $(-1{)}^{1+k}$ cancels the indicated sign in the quotient. ThereforeThis rational expression is first computed for pairwise distinct variables; its sum is the polynomial $h_r$, giving the continuous polynomial extension when variables coincide.

A skew Young diagram is connected when any two of its cells can be joined by a sequence of cells sharing edges; touching only at a corner does not connect them. A nonempty border strip, or rim hook, is a connected skew diagram containing no $2\times 2$ square. Its height is its number of occupied rows minus one.

For a weak composition $\alpha =({\alpha }_1,\dots ,{\alpha }_{\ell })$, a border-strip tableau of shape $\lambda /\mu$ and type $\alpha$ is a chainwhose $i$th difference is a border strip of size ${\alpha }_i$. Filling that strip with $i$ gives the equivalent weakly increasing row-and-column filling. A zero part corresponds to an empty difference and has height zero. Put $\mathrm{ht}(T)={\sum }_i\mathrm{ht}({\lambda }^{(i)}/{\lambda }^{(i-1)})$. For positive $r$, $p_r={\sum }_j{x}_j^r$; write $p_{\alpha }={\prod }_{{\alpha }_i>0}{p}_{{\alpha }_i}$. Thus zero type parts are ignored: one does not multiply by the finite-variable value $p_0=N$.

We first prove the one-strip multiplication formula using alternants. Choose $N$ sufficiently large and let ${\beta }_i={\mu }_i+N-i$ be the decreasing beta numbers of a partition. Expanding the determinant by permutations showsIndeed, in each determinant monomial every variable occurs in exactly one row factor; multiplying that variable by its $r$th power is equivalent to raising that row exponent.

A term vanishes if the new exponent equals another exponent. Otherwise suppose the changed exponent moves from position $i$ to position $j\le i$ when restored to decreasing order. Its determinant sign is $(-1{)}^{i-j}$. The resulting partition $\lambda$ hasand all other rows unchanged. The new diagram contains $\mu$, and its size increases by $r$. Between successive added rows, the overlap is exactly the single column ${\mu }_{t-1}+1$. Thus the added cells form a connected strip without a $2\times 2$ square, of height $i-j$. Conversely every added border strip has consecutive occupied rows and exactly this single-column overlap, forcing these formulas and the corresponding exponent shift. The correspondence is therefore bijective. Divide by the unchanged Vandermonde determinant and use the bialternant formula to get the power-sum border-strip multiplication identity

Apply this formula successively to each positive part of $\alpha$. Each sequence of choices is exactly a border-strip tableau, and its product of signs is $(-1{)}^{\mathrm{ht}(T)}$. ThereforeCommutativity of the power sums also shows that the resulting coefficient does not depend on the order of the positive parts of the type.

Take $\mu$ empty and restrict to $N\ge \ell (\lambda )$ variables. Multiply by $a_{\delta }$, with $\delta =(N-1,\dots ,0)$:In an alternant $a_{\nu +\delta }$, the exponents are distinct and their decreasing arrangement is $\nu +\delta$. Consequently the monomial $x^{\lambda +\delta }$ occurs only for $\nu =\lambda$, and in that determinant its coefficient is one. This proves the Frobenius alternant character formula

To identify these coefficients with symmetric-group characters, recall the Frobenius characteristic mapThe representation-theoretic identification $\mathrm{ch}({\chi }^{\lambda })=s_{\lambda }$ can be justified by Young's rule: the permutation character on ordered blocks of sizes $\nu$ is ${\sum }_{\lambda }{K}_{\lambda \nu }{\chi }^{\lambda }$. Its characteristic is $h_{\nu }$, because its fixed block decompositions allocate whole cycles to blocks, and the exponential generating series for those allocations is ${\prod }_{j}H(t_j)$. On the symmetric-function side, Hall duality and Schur orthonormality give $h_{\nu }={\sum }_{\lambda }{K}_{\lambda \nu }{s}_{\lambda }$. Inverting the unitriangular Kostka matrix establishes the identification. Thus the coefficient of $s_{\lambda }$ in $p_{\rho }$ is the irreducible character value on cycle type $\rho$. We have supplied the border-strip computation rather than assuming the character rule.

Grouping border-strip chains by their first removal of a cycle length $r$ now yields the Murnaghan–Nakayama ruleOne may choose the $r$-cycle to be last in a strip-building chain because the power sums commute. The empty-shape value on the empty type is one, providing the recursion's initial condition.

For the staircase $\delta =(m-1,m-2,\dots ,1)$, use $m$ beta numbers including its padded zero row. Its beta set isRemoving a rim hook of length $r$ lowers one beta number by $r$ into an unoccupied nonnegative position, reversing the exponent-shift description above. For a positive even $r$, this move either hits another occupied even position or goes below zero. Therefore there are no removable even-size border strips.

Under the Hall inner product of symmetric functions, the adjoint of multiplication by $p_r$ is $r\partial /\partial p_r$: this follows on the power-sum basis from $z_{\nu }/z_{\nu \setminus r}=r{m}_r(\nu )$. Taking adjoints of the one-strip multiplication rule expresses this derivative on $s_{\delta }$ as the signed sum over removable size-$r$ strips. That sum is empty for even $r$, soThe rational symmetric-function algebra is freely generated by the power sums, and its characteristic is zero. Vanishing of each of these derivatives therefore proves the staircase Schur functions use only odd power sums statement:

Finally, the cycle type of an $n$-cycle has one strip of size $n$. A straight diagram is a border strip exactly when its second row has length at most one: otherwise it contains the upper-left $2\times 2$ square; conversely the first row with a single-column tail is connected and contains none. These diagrams are exactly the hook partitions $(n-s,1^s)$, of height $s$. There is one strip filling in this case and none otherwise, giving

Write the diagonal maximal torus of $U(n)$ as $t=\mathrm{diag}(z_1,\dots ,z_n)$, $|z_i|=1$, and let $\delta =(n-1,n-2,\dots ,0)$. Irreducible complex representations are indexed by dominant integer tuples ${\lambda }_1\ge \cdots \ge {\lambda }_n$, their highest weights. The Weyl character formula in integer-exponent form isThe ratio initially uses distinct $z_i$, and extends to repeated eigenvalues by continuity. Every unitary matrix is conjugate to such a diagonal matrix, so this determines the character on the entire group. The shift $\delta$ differs from the usual Weyl vector $\rho =((n-1)/2,(n-3)/2,\dots ,(1-n)/2)$ by a multiple of $(1,\dots ,1)$; the corresponding determinant factors cancel between numerator and denominator.

We first justify the highest-weight information needed in the proof. Restriction to the torus splits a representation into integer weight spaces. In an irreducible representation choose a lexicographically largest weight $\lambda$ and a nonzero vector $v$ of that weight. A matrix unit $E_{ij}$ with $i<j$ raises the weight by $e_i-e_j$, so it annihilates $v$. The character is invariant under permutations of diagonal coordinates, because permutation matrices conjugate the torus. Hence permutations of $\lambda$ are also weights, and lexical maximality forces ${\lambda }_1\ge \cdots \ge {\lambda }_n$.

Irreducibility implies that $v$ generates the representation under the complexified Lie algebra. Indeed, a Lie-algebra invariant subspace is preserved by exponentials of skew-Hermitian matrices, which generate $U(n)$. Reorder any product of matrix units into lower-triangular units, diagonal units and upper-triangular units, usingInduction on length and on the number of out-of-order pairs gives the required spanning version of the Poincaré-Birkhoff-Witt theorem. Upper-triangular units kill $v$, and diagonal units act by scalars. Every nonempty product of lower-triangular units lowers its weight by a nonzero sum of positive roots. Therefore the top weight space is exactly $\mathbb{C}v$, and its multiplicity is one. This supplies the leading coefficient without assuming a character formula.

For completeness, every dominant integer tuple occurs. Put $d_j={\lambda }_j-{\lambda }_{j+1}\ge 0$ and form the representationIts lexicographically highest weight is $\lambda$, with one-dimensional highest space, represented by the tensor products of $e_1\wedge \cdots \wedge e_j$. A negative determinant exponent is a legitimate one-dimensional unitary-group character. Averaging an inner product over normalized Haar measure gives invariant orthogonal complements, so the tensor representation splits into irreducible summands. One of them has highest weight $\lambda$. Uniqueness will also follow from the formula and Schur orthogonality relations.

Define the alternant $A_{\kappa }(z)=\det (z_i^{{\kappa }_j})$ for a strictly decreasing integer tuple $\kappa$. The denominatoris the Vandermonde determinant, and its modulus is the denominator modulus in the Weyl integration formula. The Laurent polynomial ${\chi }_{\lambda }{A}_{\delta }$ is alternating. Any alternating Laurent polynomial decomposes as a finite summonomials with repeated exponents have zero coefficient, and the remaining permutation orbits are indexed uniquely by strictly decreasing tuples.

The lexicographically highest monomial in the product is $z^{\lambda +\delta }$ with coefficient one. Indeed, the highest monomial of the character is $z^{\lambda }$ with coefficient one, and the unique lexical maximum among permutations of $\delta$ is $\delta$ itself. It follows that $c_{\lambda +\delta }=1$.

Fourier orthogonality on the torus, whose probability measure is ${\prod }_{i}d{\theta }_i/(2\pi )$, gives alternant orthogonality on a unitary torus:Expand both determinants: an integral survives exactly when the two exponent tuples are identical up to permutation. Strict decreasing order then forces $\kappa =\eta$, and its $n!$ matching terms each contribute one.

Finally, Schur orthogonality relations give ${\int }_{U(n)}|{\chi }_{\lambda }{|}^2=1$. Applying the allowed Weyl integration formula to this class function givesSince the coefficient $c_{\lambda +\delta }$ already equals one, every other coefficient vanishes. Thus ${\chi }_{\lambda }{A}_{\delta }=A_{\lambda +\delta }$, proving the formula. If two irreducible representations had the same highest weight, their characters would now coincide; the Schur orthogonality relations imply that they are isomorphic. Apparent singularities at repeated diagonal eigenvalues are removable because the quotient equals the actual finite Laurent-polynomial character. No dimension formula has been assumed.

Use ${\mathbb{F}}_{32}={\mathbb{F}}_2[\omega ]$ with ${\omega }^5={\omega }^2+1$. The given primitive polynomial over a finite field makes $\omega$ have order $31$. For a binary cyclic code, squaring a zero preserves the zero condition: $v(\omega {)}^2=v({\omega }^2)$ for $v\in {\mathbb{F}}_2[X]$. Thus the binary cyclotomic cosets modulo an odd integer governing the four specified zeros areThe two displayed orbits are disjoint, each has size five, and together contain $1,2,3,4$. Therefore specifying $\omega$ and ${\omega }^3$ already forces all four consecutive defining zeros of a cyclic code.

The minimal polynomial of an algebraic element of $\omega$ is $m_1(X)=X^5+X^2+1$. For ${\omega }^3$, the orbit size shows that its algebraic minimal polynomial has degree five. The candidate $m_3(X)=X^5+X^4+X^3+X^2+1$ vanishes there, sinceFor example, the five-bit representations of these terms are $11111,01110,11010,01010,00001$, whose sum is zero in ${\mathbb{F}}_2^5$. As $m_3$ is a monic polynomial of degree five and annihilates ${\omega }^3$, it is precisely its algebraic minimal polynomial; no assumption that the provided polynomial list is exhaustive is necessary.

The narrow-sense primitive BCH code isBoth algebraic minimal polynomials divide each such $v$, and they are coprime polynomials. Their product is a divisor of $X^{31}-1$. Hence the generator polynomial is their product. Direct multiplication with field characteristic two givesThe designed distance is five, because $g$ vanishes at the four consecutive powers $\omega ,{\omega }^2,{\omega }^3,{\omega }^4$.

Here is an explicit BCH bound proof for these zeros. If a nonzero codeword had support of a vector of size $\nu \le 4$, with distinct positions $i_1,\dots ,i_{\nu }$ and nonzero coefficients $b_1,\dots ,b_{\nu }$, put ${\lambda }_r={\omega }^{i_r}$. Evaluating at the first $\nu$ defining powers givesThe coefficient matrix has determinant $\left({\prod }_r{\lambda }_r\right){\prod }_{r<s}({\lambda }_s-{\lambda }_r)$, a nonzero Vandermonde determinant because the ${\lambda }_r$ are distinct and nonzero. It therefore forces every $b_r=0$, a contradiction. Thus the minimum Hamming distance is at least five.

For the matching upper bound, multiplication gives the actual codewordwhich has Hamming weight five and degree below $31$. HenceThis proves the actual distance without needing the optional theorem. Its numerical hypothesis is also satisfied: with $s=5$ and the error parameter $l=2$, $2^{sl}=2^{10}=1024$, whereas ${\sum }_{i=0}^3\left(\genfrac{}{}{0ex}{}{31}{i}\right)=1+31+465+4495=4992$.

Now calculate the root-evaluation syndrome for a cyclic code from the received polynomial. Reduction modulo $m_1(X)$ gives $u(X)\equiv X^3$, so $S_1=u(\omega )={\omega }^3$. Substitution followed by the same reduction gives $u(X^3)\equiv X^4+X^3+X$, whose five-bit representation is $11010={\omega }^9$. ThusThe single-error test from two binary BCH syndromes identifies coordinate $3$, since a one-bit error $X^j$ has syndromes ${\omega }^j,{\omega }^{3j}$. Flip that coordinate to obtainBoth defining evaluations vanish: $c_{\mathrm{correct}}(\omega )={\omega }^3+{\omega }^3=0$ and $c_{\mathrm{correct}}({\omega }^3)={\omega }^9+{\omega }^9=0$. More directly,so it is certainly a codeword of $\mathcal{X}$. It is at Hamming distance one from $u$. Since the minimum Hamming distance is five, no other codeword can be within two errors of $u$: such a word would be at distance at most three from $c_{\mathrm{correct}}$, contradicting the proved distance. Thus this is the unique bounded-distance decoding under the linear code's two-error guarantee.

The decoded polynomial printed in the original PDF is incorrect. It instead adds $X^{10}$ to $u$, giving a polynomial $c_{\mathrm{printed}}=u+X^{10}$. Its defining evaluations areTherefore it is not a codeword, and the request to verify that it belongs to $\mathcal{X}$ is a false premise. The field table and the printed syndromes agree with correction at $X^3$; the correction at $X^{10}$ does not. The boxed corrected polynomial resolves this source error and supplies the intended decoding and membership proof.

Let $H$ be the $r$-uniform hypergraph and use strong saturation of a uniform hypergraph in its immediate-completion sense: each missing edge $e$ lies in an $(r+t)$-set $T$ whose other $r$-subsets are already edges of $H$. The argument allows existing hypergraph cliques. Take $n\ge r+t$, the usual parameter range; if $r\le n<r+t$, strong saturation forces every possible edge to be present, and the inequality is immediate whenever its binomial terms are defined. The case $t=0$ has the trivial lower bound zero.

For $t\ge 1$, choose distinct real numbers $z_1,\dots ,z_n$ and form the $t\times n$ Vandermonde matrix $M$ whose $i$th column is $(1,z_i,\dots ,z_i^{t-1}{)}^T$. Every $t$ columns are linearly independent by the Vandermonde determinant. Set $U=\ker M\subseteq {\mathbb{R}}^n$, so $\dim U=n-t$, and work in the quotient vector spaceHere the inclusion of ${\bigwedge }^{r}U$ is injective: extend a basis of $U$ to a basis of ${\mathbb{R}}^n$ and use the resulting wedge bases of the exterior powers. Write $w_e$ for the image in $W$ of the coordinate wedge indexed by an $r$-set $e$. All these images span $W$.

For any $(r+t)$-set $T$, let $V_T$ be its coordinate subspace. The restriction of $M$ has rank $t$, so $U\cap V_T$ has dimension $r$. Wedge a basis of this intersection to obtain a nonzero elementEvery coefficient $c_e$ is nonzero. Indeed, projection of $U\cap V_T$ onto the $e$ coordinates is an isomorphism: a vector in its kernel is supported on $T\setminus e$, whose $t$ columns of $M$ are independent. The coefficient is the determinant of that projection in the chosen bases. Passing to $W$ therefore gives a linear dependence

If $e$ is missing from $H$, take its strong-saturation witness $T$. The dependence expresses $w_e$ in the span of the $w_f$ for the other edges $f\subseteq T$, all of which are present. Thus the vectors indexed by the present edges span all of $W$. The exterior-power quotient bound for strong hypergraph saturation follows:The bound is sharp: include precisely the $r$-sets meeting one fixed $t$-set $S$. A missing edge $e$ is disjoint from $S$, and every other $r$-subset of $e\cup S$ meets $S$, so adding $e$ immediately completes a hypergraph clique of order $r+t$. The number of included edges is exactly the displayed bound.

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.

An $r$-uniform hypergraph is strongly saturated with respect to a complete uniform hypergraph of order $r+t$ if adding any missing edge creates a new complete uniform hypergraph on $r+t$ vertices containing that edge. Equivalently, for every missing $r$-set $e$, there is an $(r+t)$-set $T\supseteq e$ for which all other $r$-subsets are edges. Existing complete subhypergraphs are allowed in this strong-saturation definition.

We prove the bound by an exterior-power quotient bound for strong hypergraph saturation. Assume $r,t\ge 1$ and $n\ge r+t$. Let $V={\mathbb{R}}^n$ with basis $e_1,\dots ,e_n$. Choose distinct real numbers $a_1,\dots ,a_n$ and let $U$ be the kernel of the $t\times n$ matrix whose column $i$ isEvery $t$ columns are linearly independent by the Vandermonde determinant, so $\dim U=n-t$. Form the quotient vector spaceFor each $r$-set $e=\{i_1<\cdots <i_r\}$, let $v_e$ be the image in $W$ of the exterior product $e_{i_1}\wedge \cdots \wedge e_{i_r}$. These images span $W$.

For an $(r+t)$-set $T$, let $V_T$ be its coordinate subspace. The matrix restricted to $T$ has rank $t$, so $U\cap V_T$ has dimension $r$. The wedge of a basis of this intersection is a nonzero vectorEvery coefficient $c_e$ is nonzero. Indeed, projection from $U\cap V_T$ onto the $r$ coordinates in $e$ is an isomorphism: a vector in its kernel would be supported on $T\setminus e$, where the $t$ columns are independent, and hence would be zero. That projection's determinant is precisely the corresponding wedge coefficient. Thus, in the quotient vector space,For a missing edge, choose its strong-saturation witness $T$. All other vectors in this relation come from present edges, so the missing edge's vector is in their span. Consequently the present-edge vectors already span all of $W$. Their number is at least its dimension:This is sharp. Take all $r$-sets that meet a fixed $t$-set $D$. A missing edge $e$ is disjoint from $D$, and on $e\cup D$ every other $r$-set meets $D$; adding $e$ completes the required clique. The number of edges is exactly the boxed difference. If $r\le n<r+t$, no missing edge could have a witness, so a strongly saturated hypergraph must be complete; the substantive construction above is for the usual range $n\ge r+t$.

For the set-pair problem, write $m=|I|$ and choose $x_i\in R_i\cap S_i$. If $i\ne j$, the cross-disjointness implies that $x_i$ is in neither $R_j$ nor $S_j$. In particular, the witnesses are distinct. Let $D=\{x_i:i\in I\}$; each $R_i$ and $S_i$ contains exactly its own witness from $D$.

Choose two different indices $i,j$. The sets $R_i\setminus \{x_i\}$ and $S_j\setminus \{x_j\}$ are disjoint, lie outside $D$, and have sizes $r-1$ and $s-1$. HenceFor equality, partition the ground set into disjoint sets $P,Q,D$ with sizes $r-1,s-1,n-r-s+2$, respectively, and enumerate $D$ as $x_1,\dots ,x_m$. SetThen $R_i\cap S_j$ is $\{x_i\}$ for $i=j$ and empty otherwise. This realizes equality whenever the bound permits $m\ge 2$. The argument is a diagonal-intersection set-pair bound, with no additional assumptions on intersections among the $R_i$ or among the $S_i$.

Use the standard orientations on the three spheres and the complex orientation on Complex projective space. Let $h\in H^2({\mathbb{CP}}^3;\mathbb{Z})$ satisfy $⟨h^3,[{\mathbb{CP}}^3]⟩=1$. The cohomology ring of complex projective space is $\mathbb{Z}[h]/(h^4)$. The Künneth theorem givesWrite the induced map on cohomology as $f^{\ast }h=pa+qb+rc$ with integers $p,q,r$. Naturality and graded commutativity of the cup product giveThe mapping degree is therefore $d=6pqr$. This is the factorial degree obstruction for products of two-spheres. Every positive value is a positive multiple of six, so the least possible positive degree is at least $6$.