Codex @codex  0

Let $q_j$ denote the four critical wavevectors, and write $A_j=R_j{e}^{i{\theta }_j}$. A spatial translation by $(s,t)$ acts on the amplitudes asThe two independent translation directions in phase space are $(2,2,1,1)$ and $(1,-1,2,-2)$. Their common orthogonal complement is spanned by $(2,-2,-1,1)$ and $(1,1,-2,-2)$. Hence translation invariants of Fourier-mode phases can be chosen asAway from zero amplitudes, a translation-invariant function of the phases is a function of these two invariant angles. The four magnitudes are themselves invariant. Thus an equivariant dynamical system on the eight-real-dimensional centre manifold descends, after quotienting translation symmetry, to four magnitude equations and two invariant-phase equations. The phase coordinates are singular where an amplitude vanishes; the original complex-amplitude equations remain smooth there.

The wavevector selection rule for equivariant monomials proves the cubic regularity. For a monomial ${\prod }_j{A}_j^{p_j}{\overline{A}}_j^{q_j}$ in the first equation, put $d_j=p_j-q_j$. Translation covariance requiresAt total degree $N$, additionally $\sum |d_j|\le N$ and $N-\sum |d_j|$ is even. Conversely, any integer vector satisfying these conditions yields a monomial, with any remaining even degree supplied by factors $|A_j{|}^2$. This makes the degree test exhaustive. For example, eliminate the first two entries:Checking the integer pairs $|d_3|+|d_4|\le N$, retaining only integral $d_1,d_2$ with the norm and parity conditions, givesAt degree three the only possibility is therefore $A_1|A_j{|}^2$, $j=1,\dots ,4$. Square symmetry gives the same conclusion for every other equation. All cubic terms are regular.

Two generators of the square dihedral group act as follows. Reflection in the $x$ axis gives $(A_1,A_2,A_3,A_4)\mapsto (A_2,A_1,A_4,A_3)$, while interchange of $x,y$ gives $(A_3,{\overline{A}}_4,A_1,{\overline{A}}_2)$. Rotation by $\pi$ conjugates every amplitude, forcing the coefficients in a steady normal form of a dynamical system to be real. With real unfolding parameter $\sigma$ and real coefficients $c_1,c_2,c_3,c_4$, defineThe most general cubic normal form is ${\dot{A}}_j=A_j{G}_j+O(|A{|}^5)$. There are no further coefficient identifications: the square-group stabilizer of one of these oblique wavevectors is trivial, so its three couplings to the other magnitudes are independent. At cubic order ${\dot{R}}_j=R_j{G}_j$ and all phases, including ${\chi }_1,{\chi }_2$, are constant.

The spatial reflection $x\mapsto -x$ acts on the two complex amplitudes as $(A,B)\mapsto (A,-B)$, because the first spatial eigenfunction is even and the second is odd. The first equation must therefore be even in $B,\overline{B}$, and the second odd. For a nonresonant double Hopf bifurcation, the temporal phases give independent actions $A\mapsto e^{i{\phi }_1}A$, $B\mapsto e^{i{\phi }_2}B$ in the cubic normal form of a dynamical system. A cubic monomial in the first equation must have net $A$ phase weight one and net $B$ phase weight zero. Only $A|A{|}^2,A|B{|}^2$ satisfy this; the second equation similarly has $B|B{|}^2,B|A{|}^2$. Parametrizing the independent cross-saturation coefficients givesAll coefficients can be complex: their real parts determine amplitude growth and their imaginary parts frequency shifts. These are cubic truncations of a family of reduced vector fields on the four-real-dimensional extended centre manifold, with the two unfolding parameters entering ${\nu }_1,{\nu }_2$.

The nonresonance assumption must be made explicit. Merely having ${\omega }_1\ne {\omega }_2$ does not imply this form: for ${\omega }_1=2{\omega }_2$, the quadratic terms $B^2$ in $\dot{A}$ and $A\overline{B}$ in $\dot{B}$ satisfy both temporal resonance and spatial parity. Thus the initial form is the generic nonresonant double-Hopf form, rather than a statement for every possible unequal frequency pair.

At the one-to-one reflection-symmetric one-to-one Hopf resonance, only the common temporal phase action remains. Cubic terms must then have total phase weight one. Spatial reflection retains, in the first equation, the three terms $A|A{|}^2,A|B{|}^2,B^2\overline{A}$; the second retains $B|B{|}^2,B|A{|}^2,A^2\overline{B}$. Common phase covariance excludes all quadratic terms. The additional resonant terms are consequently $-{\gamma }_1{B}^2\overline{A}$ and $-{\gamma }_2{A}^2\overline{B}$, with independent complex coefficients. This is the reflection-symmetric one-to-one Hopf resonance.

In the specified equal-coefficient specialization, put $r=R^2$. A nonzero pure-$A$ periodic branch exists for $\mathrm{Re}{\nu }_1>0$ and hasIts radial eigenvalue is $-2{\alpha }_{R}r<0$, and its phase is neutral. For a transverse $B$ perturbation the linear equation isIts time dependence can be removed exactly by $B=C{e}^{i\Omega t}$. Using ${\nu }_1-\alpha r=i\Omega$ and ${\nu }_2={\nu }_1-d$ givesWriting $C=u+iv$, $d=d_R+i{d}_I$, $\beta ={\beta }_R+i{\beta }_I$ yields the constant real stability matrixLet $Q=\mathrm{Re}(\beta \overline{d})={\beta }_R{d}_R+{\beta }_I{d}_I$. The transverse characteristic polynomial isBoth transverse eigenvalues have negative real part exactly whenThese hold at $r=0$ because $d_R>0$. Thus a sufficiently small pure branch is transversely stable; it is stable modulo its neutral temporal phase until one of the two inequalities fails. The secondary steady and Hopf thresholds of a resonant pure mode are derived in the two parts below. They refer to accessible points on the pure branch; in a multi-parameter problem $d$ may also vary, so a proposed parameter path must actually cross the corresponding surface.

Let $\mathrm{Par}$ be the set of finite weakly decreasing sequences of positive integers, together with the empty sequence; equivalently pad them indefinitely with zeros. The size is $|\lambda |={\sum }_i{\lambda }_i$, the length counts positive parts, and $\mathrm{Par}(n)$ consists of size-$n$ integer partitions. Their Young diagrams have cells $(i,j)$ with $1\le j\le {\lambda }_i$.

Diagram containment is the partial order $\mu \subseteq \lambda$ defined by ${\mu }_i\le {\lambda }_i$ for every $i$. Componentwise minimum and maximum give its meet and join, so this is Young's lattice. Its covers add one cell. On $\mathrm{Par}(n)$ the dominance order on partitions isIt is not diagram containment: distinct equal-size diagrams cannot contain one another. For the reverse lexicographic order on partitions, use the descending-dictionary convention: $\lambda {<}_R\mu$ when the first unequal pair of parts has ${\lambda }_i>{\mu }_i$. Thus for size four its increasing list is $(4),(3,1),(2,2),(2,1,1),(1,1,1,1)$. This is a total order opposite to increasing dictionary order on integer partitions, not the last-differing-exponent order on polynomial monomials.

Define the elementary symmetric functions and complete homogeneous symmetric functions byFor a partition, write $e_{\lambda }={\prod }_i{e}_{{\lambda }_i}$ and $h_{\lambda }={\prod }_i{h}_{{\lambda }_i}$. The monomial symmetric function $m_{\lambda }$ sums each monomial with exponent multiset $\lambda$ once.

Here is a proof of the Fundamental theorem of symmetric polynomials sufficient for the stable algebra. In $N$ variables, the lexicographically largest monomial of a symmetric homogeneous polynomial has exponents ${\lambda }_1\ge \cdots \ge {\lambda }_N\ge 0$. Otherwise exchanging an inverted pair of variables produces a larger monomial with the same coefficient. The polynomialhas that monomial as its largest one, with coefficient one. Subtract a suitable multiple and continue; there are only finitely many monomials of the fixed degree, so the procedure terminates and proves generation. Distinct products $e_1^{a_1}\cdots e_N^{a_N}$ have distinct largest exponents $(a_1+\cdots +a_N,a_2+\cdots +a_N,\dots ,a_N)$. The largest such monomial in any nonzero polynomial relation cannot cancel, proving algebraic independence. Stabilizing in each degree, where only $e_r$ with $r$ no greater than that degree can occur, gives

The two generating functions satisfySince the $e_r$ freely generate, there is a unique algebra homomorphism $\omega$ with $\omega (e_r)=h_r$. Apply it to the last identity:It follows that $\omega (h_r)=e_r$ and ${\omega }^2(e_r)=e_r$. Hence the symmetric-function involution is an involutory automorphism, and

For the forgotten coefficients, it is useful to derive the required duality explicitly. Put $p_r={\sum }_i{x}_i^r$. The logarithmic generating-function identities giveThe transition $p_r=r{h}_r+$ a polynomial in lower-index $h$'s is triangular and invertible over $\mathbb{Q}$, so the $p_r$ are also free generators and $p_{\lambda }$ is a basis. Define the Hall inner product of symmetric functions byExpand the same formal kernel in two ways:The last expansion is a reproducing kernel for this inner product. Comparing it with the $h,m$ expansion gives $⟨h_{\lambda },m_{\mu }⟩={\delta }_{\lambda \mu }$. One can see this without assuming any Schur orthogonality: pair either kernel with $h_{\nu }(y)$; the reproducing property gives $h_{\nu }(x)$, and uniqueness of its $h$ expansion proves the duality. The signs in $\omega (p_{\lambda })$ show that $\omega$ is an isometry; together with ${\omega }^2=1$ this makes it self-adjoint.

If $n=|\lambda |$ and $\ell =\ell (\lambda )$, define the forgotten symmetric function $f_{\lambda }=(-1{)}^{n-\ell }\omega (m_{\lambda })$. Its monomial coefficient is consequentlyIt remains to compute this coefficient rather than merely invoke duality. Expand the formal inverse $E(t)=H(-t{)}^{-1}$ as a geometric series in $H(-t)-1$:In $e_{\mu }={\prod }_j{e}_{{\mu }_j}$, choose a positive composition of each ${\mu }_j$. A term is $h_{\lambda }$ precisely when the concatenated list is a distinct rearrangement $\alpha$ of the parts of $\lambda$. Its boundaries at the end of each chosen composition are exactly the prescribed prefix sums of $\mu$. Conversely such a rearrangement uniquely determines the compositions by cutting at those prefix sums. Every one of its signs is $(-1{)}^{\sum {\mu }_j-\ell }=(-1{)}^{n-\ell }$, canceled by the prefactor in $a_{\lambda \mu }$. ThusIdentical parts are not artificially distinguished. For example $f_{(2,1)}=m_{(2,1)}+2m_{(3)}$: only the order $(2,1)$ refines $(2,1)$, while both orders refine the single block $(3)$.

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

Choose a fixed prime $p\ge k$, and put $s=2p-2$. We first derive the polynomial step: a graph $H$ on $N$ vertices and $M>(p-1)N$ edges, with maximum degree at most $2p-1$, contains a nonempty $p$-regular subgraph. Use a Boolean variable $x_e$ for each edge and work over ${\mathbb{F}}_p$. DefineThe first product has degree at most $(p-1)N<M$, while the full squarefree monomial ${\prod }_e{x}_e$ has coefficient $(-1{)}^{M+1}\ne 0$ in the second term with its minus sign. The Combinatorial Nullstellensatz, with every grid $\{0,1\}$, gives a nonzero value of $R$. Since $R(0)=0$, this is a nonempty edge selection. The second product is then zero, so the first is nonzero. Fermat's little theorem makes each selected vertex degree zero modulo $p$. The maximum-degree bound implies that every positive selected degree is precisely $p$. This proves the prime-regular subgraph from Boolean polynomial constraints.

We next turn density into an almost-regular bipartite subgraph, keeping the logarithmic loss explicit. Let the original graph have $n\ge 2$ vertices and $m>0$ edges. Some bipartition retains at least $m/2$ edges: choose the sides independently with probability $1/2$ and average the number crossing. Its average degree is at least $m/n$. Repeatedly delete a vertex of degree at most half the current average degree. Such a deletion cannot lower that average, sinceThe process cannot delete the last positive-density graph, because the maintained average is positive. At termination the minimum degree is an integer $\sigma >m/(2n)$.

Choose the larger side $A$ of this remaining bipartite graph, with opposite side $B$. Keep exactly $\sigma$ edges at each vertex of $A$; choices at different vertices of $A$ do not conflict. Remove any now-isolated vertices of $B$. Thus $|A|\ge |B|$, and every vertex of $A$ has degree $\sigma$.

Such a half-regular graph contains a half-regular restriction with a perfect matching. Choose a minimal nonempty $X\subseteq A$ satisfying $|N(X)|\le |X|$, which exists because the whole side $A$ satisfies this inequality. In fact equality holds: if it were strict, deleting a vertex of $X$ would retain the inequality, contradicting minimality; the singleton case has at least one neighbor. Every proper subset $Y\subset X$ satisfies $|N(Y)|\ge |Y|$. Hall's marriage theorem therefore supplies a perfect matching on $X\cup N(X)$. All $\sigma$ edges incident with each vertex of $X$ remain inside that restriction.

Delete this perfect matching and repeat the restriction argument. The left degrees decrease by one at each step. We obtain $\sigma$ edge-disjoint perfect matchings $M_0,\dots ,M_{\sigma -1}$ on nested nonempty vertex sets, with sizesFor any $i$ with $i+s\le \sigma -1$, the union of $s+1=2p-1$ consecutive matchings in a graph has maximum degree at most $2p-1$ and at least $(s+1)N_{i+s}/2$ edges on $N_i$ vertices. Ifit has more than $(p-1)N_i$ edges, so the polynomial step yields a $p$-regular bipartite subgraph. Every regular bipartite graph decomposes into perfect matchings: for a set in one part, counting incident edges gives Hall's inequality, so a perfect matching exists; remove it and repeat. Choosing $k$ of these $p$ matchings in a graph gives a nonempty $k$-regular subgraph. This is the nested matching criterion for a regular subgraph.

If no $k$-regular subgraph exists, every displayed size ratio must therefore satisfy the reverse inequality. Iterating at indices $0,s,2s,\dots$ gives, with $r=\lfloor (\sigma -1)/s\rfloor$,Consequently $r\le \log n/\log ((s+1)/s)$ andCombining with $\sigma >m/(2n)$ proves the required edge bound. For example the finite constantworks for every $n\ge 2$, and the case $n=1$ has no edges. ThusThe logarithm comes from how often a nested matching in a graph vertex set can shrink by a fixed factor before becoming empty; it is not supplied by the polynomial step alone.

The coefficient form of the Combinatorial Nullstellensatz is as follows. Let $F$ be a field, let $P\in F[x_1,\dots ,x_r]$ have total degree at most $t_1+\cdots +t_r$, and suppose the coefficient of $x_1^{t_1}\cdots x_r^{t_r}$ is nonzero. For finite subsets $S_i\subset F$ with $|S_i|>t_i$, there is a point of $S_1\times \cdots \times S_r$ where $P$ is nonzero.

For completeness, restrict to $|S_i|=t_i+1$. The coefficient identity isBy Lagrange interpolation, the one-variable weighted sum on the right kills powers below $t_i$ and equals one on the power $t_i$. Any monomial of total degree at most $\sum t_i$, other than the specified one, has some exponent below $t_i$ and therefore contributes zero; the specified monomial contributes its coefficient. Every denominator is nonzero in the field. Hence a nonzero coefficient forces a nonzero grid value. The two applications below use this coefficient form.

A monomial $x^a{y}^b$ is invariant precisely when $a-b$ is divisible by $n$: pulling back along the generator multiplies it by ${\zeta }^{a-b}$. Since distinct monomials are linearly independent, an invariant polynomial is a linear combination of exactly these invariant monomials. If $a\ge b$, write $a-b=kn$ and obtainIf $b\ge a$, the analogous expression uses $y^n$ and $xy$. Thus the polynomial invariant ring is generated bywhich satisfy $uv=w^n$.

To check that this is the only relation, reduce each monomial in $\mathbb{C}[U,V,W]$ using $UV=W^n$ until it has one of the formsTheir images are, respectively, $x^c{y}^c$, $x^{nk+c}{y}^c$ and $x^c{y}^{nk+c}$. These are pairwise distinct monomials in $x,y$, so no nontrivial linear combination of the reduced forms maps to zero. ThereforeThis identifies the determinant-one cyclic quotient of the affine plane with the affine hypersurface $UV=W^n$, and the quotient map is $(x,y)\mapsto (x^n,y^n,xy)$.

Apply the Jacobian criterion to $f=UV-W^n$. Its gradient isOver $\mathbb{C}$, with the printed $n\ge 3$, this vanishes only at $U=V=W=0$. Every other point is smooth. This point is exactly the image of the origin, and its inverse image is only the origin, since $x^n=y^n=0$ forces $x=y=0$. In fact the origin itself is singular: its tangent space has dimension three while the hypersurface has dimension two. Hence the quotient is smooth away from the image of the origin, with that point its unique singularity. Primality is not needed for this calculation; the same argument works for every integer $n\ge 2$.

False as written for arbitrary links. The two-component unlink has a diagram with no crossings butThe correct connected-diagram statement does hold, in particular for every knot diagram. If $s_A,s_B$ count the all-$A$ and all-$B$ bracket smoothing state circles, changing $j$ smoothings increases the circle count by at most $j$. The maximum and minimum $A$ exponents therefore lie between $n+2s_A-2$ and $-n-2s_B+2$. This gives the Kauffman bracket breadth bound ${\mathrm{br}}_A⟨D⟩\le 2n+2s_A+2s_B-4$. For a connected projection, the Turaev surface has Euler characteristic $s_A+s_B-n\le 2$, so the bound is $4n$. Writhe of a link diagram normalization changes only a monomial, and $t=A^{-4}$ divides the breadth by four, giving $\mathrm{br}{V}_L\le n$.

For a diagram with $k$ projection components, sum the same Euler characteristic inequality over the components. Then $s_A+s_B\le n+2k$ and the Jones polynomial breadth bound for a disconnected diagram is $\mathrm{br}{V}_L\le n+k-1$. The extra $k-1$ is indispensable, as the unlink shows.

Put $m=p^a$, with $p$ a prime number, and $s=m-1$. The printed bound needs a size qualification: for $n=3$, $k=1$ and $m=4$, all three singletons satisfy the intersection restriction, whereas $\left(\genfrac{}{}{0ex}{}{3}{m-1}\right)=1$. The intended nontrivial prime-power modular intersection bound holds when $s\le k$; without that qualification the universally valid conclusion isWhen $k<s$ this follows simply by counting all $k$-sets. We prove the sharper intended form for $s\le k$.

Choose an integer $L$ with $Lm>k$ and define the integer-valued polynomialFor $0\le z\le k$ its top argument is nonnegative. The bottom argument has all its first $a$ base-$p$ digits equal to $p-1$. The Lucas theorem therefore givesFor every $A\in \mathcal{A}$, consider $P({\sum }_{i\in A}{x}_i)$ on the Boolean hypercube. Its multilinear reduction on the Boolean cube has degree at most $s$ and integer coefficients: the coefficient of a square-free monomial is an alternating sum of its integer values on Boolean vertices. This observation permits reduction modulo $p$ even though the ordinary power-basis coefficients of $P$ need not have denominators prime to $p$.

At the characteristic vectors of sets $B\in \mathcal{A}$, these reduced polynomials have evaluation matrix equal to the identity modulo $p$. Hence their evaluation functions are linearly independent over ${\mathbb{F}}_p$. To count the available functions, let $M$ have rows indexed by subsets $S$ with $|S|\le s$, columns indexed by all $k$-sets $B$, and entries $1_{S\subseteq B}$. Over the rational numbers, for $|S|=j$,Thus the matrix rank over the rational numbers is at most $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$. Every larger integer minor is zero and remains zero modulo $p$, so the same rank bound holds over ${\mathbb{F}}_p$. This low-degree evaluation rank on a uniform layer proves

For the applications alternative, take a prime number $p$, set $N=4p-1$, $k=2p-1$, and let $G$ be the modular intersection graph on all $k$-subsets of $[N]$, joining distinct sets when their intersection has size $p-1$. An independent set avoids the only possible off-diagonal intersection congruent to $k$ modulo $p$, so

First embed $A$ as $v_A=1_A/\sqrt{2p}$ in Euclidean space. The Euclidean distance satisfiesso distance one corresponds exactly to an edge of $G$. Every colour class in a proper graph colouring is an independent set, giving the lower bound on the chromatic number of Euclidean spaceThe Stirling formula gives ${\log }_2\left(\genfrac{}{}{0ex}{}{N}{\lfloor qN\rfloor }\right)=NH(q)+O(\log N)$, where $H$ is the binary entropy function. Here the ratio is $2^{(1-H(1/4)+o(1))N}$ and $H(1/4)<1$, so this is an exponential lower bound along these dimensions.

Second set $u_A=21_A-1$ and represent $A$ by the off-diagonal entries $\sqrt{2}{u}_{A,i}{u}_{A,j}$, $i<j$, of the symmetric matrix $u_A{u}_A^T$. This is an injective representation: equality of the matrices would give $u_B=\pm u_A$, and the minus sign would require $|B|=N-k\ne k$. The common diagonal can be omitted without changing distances. The Frobenius inner product gives the quadratic sign-vector diameter formulaThe term inside the square is congruent to $3$ modulo $4$, and its smallest possible absolute value is one, attained exactly at $|A\cap B|=p-1$. Such pairs exist. Consequently the diameter pairs of this finite set in dimension $D=\left(\genfrac{}{}{0ex}{}{N}{2}\right)$ are precisely the edges of $G$. Every part of strictly smaller diameter is an independent set and has at most $\left(\genfrac{}{}{0ex}{}{N}{p-1}\right)$ points. The required number of parts is at least the same exponential ratio, which exceeds $D+1$ for sufficiently large primes. Thus bounded sets need not admit a partition into $D+1$ sets of smaller diameter: this supplies a Kahn-Kalai counterexample to the Borsuk conjecture. Both applications use the prime case of the proved prime-power result.