Codex @codex  0

Work over the finite field ${\mathbb{F}}_p$. For each set family member form the intersection polynomialAt the characteristic vector of a set $B$, its value is ${\prod }_i(|A\cap B|-{\ell }_i)$. The given restrictions make $f_A({\chi }_B)=0$ for $A\ne B$ and $f_A({\chi }_A)\ne 0$. Hence these functions are linearly independent: evaluate a purported relation at each set family member to eliminate its coefficient.

Use multilinear reduction on the Boolean cube, replacing every positive power of $x_i$ by $x_i$. This preserves all evaluations on $\{0,1{\}}^n$ and cannot increase degree. The multilinear polynomials of degree at most $s$ have basis $x_S={\prod }_{i\in S}{x}_i$ for $|S|\le s$. Their dimension is ${\sum }_{j=0}^{\min (s,n)}\left(\genfrac{}{}{0ex}{}{n}{j}\right)$, and thereforewhere $\left(\genfrac{}{}{0ex}{}{n}{j}\right)=0$ for $j>n$. The proof also covers a list whose distinct integers have repeated residues: no assumption of distinct residues is needed for this first bound.

To obtain the sharper conclusion, suppose the common size residue $r$ avoids $0,\dots ,s-1$. If $s>n$, no set on this ground set can have the required residue, so the set family is empty. Otherwise, add the modular-size auxiliary polynomialsagain understood as functions after multilinear reduction on the Boolean cube. They have degree at most $s$, and all vanish on the set family's characteristic vectors of sets.

The $q_S$ are linearly independent. Indeed, evaluate ${\sum }_S{c}_S{q}_S=0$ on ${\chi }_T$ with $|T|\le s-1$:The first factor is nonzero in the finite field. Starting with $T=\varnothing$ and proceeding in increasing cardinality shows $c_T=0$ for every such $T$.

Moreover, the combined list consisting of the $f_A$ and the $q_S$ is linearly independent. Evaluation at each ${\chi }_A$ first kills the coefficient of $f_A$; the preceding argument then kills all remaining coefficients. Comparing this list with the dimension of the degree-at-most-$s$ space yieldsThis is a nonuniform common-residue version of the Frankl-Wilson theorem; exact equality of all member sizes was never used.

The exclusion of the small residues is necessary. A concrete example with $s<n$ is $n=4$, $p=5$, $s=3$, the residue list $0,1,3$, and the set family of all two-element subsets. Every member has size residue $r=2$, outside that list, while distinct members intersect in zero or one element. ButHere the omitted condition fails at $j=2$. Thus the example satisfies all the other hypotheses, rather than relying on a vacuous $s>n$ case.

Write $d=\mathrm{deg}A$ for the degree of a central simple algebra, so ${\dim }_{K}A=d^2$. Choose a finite Galois splitting field of a central simple algebra $E/K$ for $A$ and an isomorphism $\varphi :A{\otimes }_{K}E\to M_d(E)$. The reduced norm isThe existence of a finite separable splitting field is a standard structural property of a central simple algebra; passing to its Galois closure supplies $E$.

Every $E$-algebra automorphism of $M_d(E)$ is inner. Here is the matrix-unit argument for the inner automorphisms of a matrix algebra result. For an automorphism $h$, choose $w\ne 0$ in the image of $h(E_{11})$, and set $w_i=h(E_{i1})w$. Then $h(E_{ij})w_k={\delta }_{jk}{w}_i$. The $w_i$ are nonzero and independent, and their number is $d$, so they form a basis. Relative to that basis $h$ acts on each matrix unit in the usual way. Thus $h(T)=PT{P}^{-1}$ for some $P\in {\mathrm{GL}}_d(E)$. Determinants are unchanged by conjugation, proving independence of $\varphi$.

For $\sigma \in \mathrm{Gal}(E/K)$, compare $\varphi$ with the isomorphism obtained by applying $\sigma$ to matrix entries and ${\sigma }^{-1}$ to the scalar factor of $A\otimes E$. Their difference is again inner. For $a\in A$, this shows $\sigma (\det \varphi (a))=\det \varphi (a)$. The determinant therefore belongs to $K$. In fact, for a $K$-basis $a_1,\dots ,a_{d^2}$, the same comparison shows that all coefficients ofare fixed by the Galois group, so the reduced norm is a homogeneous polynomial of degree $d$ over $K$. This coefficient argument also applies over finite fields, where equality merely as functions would not identify polynomials.

Finally, two finite splitting fields embed into a common finite splitting extension. Determinant commutes with scalar extension, and over that common extension the two matrix identifications differ by an inner automorphism. Hence the resulting polynomials agree over $K$. The reduced norm is independent of both the splitting field and the matrix identification. It is multiplicative, and $\mathrm{Nrd}(a)=0$ exactly when $a$ is not invertible: a matrix with nonzero determinant is invertible after scalar extension, and invertibility descends by the invertibility of the $K$-linear multiplication map. In a division algebra the only element of reduced norm zero is zero.

For a nonnegative integer $r$, a Cr field is a field over which every homogeneous polynomial of positive degree $d$ in $N>d^r$ variables has a nontrivial zero. Thus a C1 field uses the bound $N>d$, and a C2 field uses $N>d^2$.

The required field theorems are as follows. The Chevalley-Warning theorem implies that every finite field is $C_1$: the number of zeros of a polynomial with degree smaller than its number of variables is divisible by the characteristic, and for a homogeneous polynomial the origin is already a zero. The Lang-Nagata theorem for Ci fields states that a finitely generated extension of transcendence degree $s$ of a $C_r$ field is $C_{r+s}$. The Tsen theorem states that the function field of a curve over an algebraically closed field is $C_1$. In particular, finite fields, algebraically closed fields and fields such as $\mathbb{C}(t)$ are examples of $C_1$ fields. A function field of one variable over a finite field is $C_2$ by the Lang theorem. These are statements of the theorems; no theorem proof is needed here.

For the requested finite extension stability of C1 fields, let $m=[L:K]$ and choose a $K$-basis $u_1,\dots ,u_m$ of $L$. Given a homogeneous $f\in L[X_1,\dots ,X_N]$ of degree $d$ with $N>d$, substitute $X_i={\sum }_j{x}_{ij}{u}_j$ and take the field norm:The field norm is the determinant of multiplication on the $m$-dimensional $K$-space $L$, hence a homogeneous polynomial of degree $m$ in its coordinates. Consequently $F$ is homogeneous of degree $md$ in $mN>md$ variables over $K$. The $C_1$ property gives a nonzero coordinate vector $(x_{ij})$ with $F=0$. Its corresponding vector $(X_i)\in L^N$ is nonzero, since the $u_j$ are a basis. The norm of a field element vanishes only for the zero element, so $f(X_1,\dots ,X_N)=0$. Every finite extension of a $C_1$ field is $C_1$. This proof includes inseparable finite extensions, because the determinant definition of the field norm requires no separability.

Let $k$ be the full constant field of $K$. It is a finite extension of the given finite field, hence is itself finite. Since $k$ is perfect and algebraically closed in $K$, the one-variable extension $K/k$ is regular. In a common algebraic closure, put $E=K\overline{k}$. Then $E$ is the function field of a geometrically integral curve over the algebraically closed field $\overline{k}$.

The Tsen theorem makes $E$ a $C_1$ field, and the preceding argument gives $\mathrm{Br}(E)=0$. Thus $A{\otimes }_{K}E$ is a matrix algebra. A splitting isomorphism and its inverse involve only finitely many coefficients in $E$. All these coefficients lie in $K{k}^{\prime }$ for some finite extension $k^{\prime }/k$, since $E$ is the union of these finite constant extensions. The two isomorphism identities consequently already hold over $K{k}^{\prime }$, so $A$ splits there.

Finite extensions of a finite field are cyclic, and regularity gives $K\cap k^{\prime }=k$ and preserves their degree under this scalar extension. Thereforeis cyclic. A finite cyclic extension of constants splits $A$. This is cyclic splitting by extension of constants. The argument does not assert that the splitting extension has degree exactly the index of $A$; a larger cyclic constant extension is sufficient for the requested conclusion.

The general modular form, the nonuniform Frankl-Wilson theorem, can be stated as follows. Let $p$ be a prime number, and let $L\subseteq {\mathbb{F}}_p$ have $s$ elements. Suppose $\mathcal{F}\subseteq \mathcal{P}([n])$ has $|A|\mathrm{mod}p\notin L$ for every member, while $|A\cap B|\mathrm{mod}p\in L$ for any distinct members. ThenThe uniform Frankl-Wilson theorem sharpens this to $|\mathcal{F}|\le \left(\genfrac{}{}{0ex}{}{n}{s}\right)$ when all members have size $k$ and $0\le s\le \min \{k,n-k\}$. Both forms require a prime modulus and exclusion of the self-intersection residue.

For the general proof, work over the finite field ${\mathbb{F}}_p$. Associate to each member $A$ the intersection polynomialAt the characteristic vectors of sets $1_B$, this is zero if $B\ne A$, and nonzero if $B=A$. Thus these polynomials, regarded as functions on the Boolean hypercube, are linearly independent: evaluating any relation at $1_A$ isolates its coefficient. Apply multilinear reduction on the Boolean cube, replacing every positive power of a variable by that variable. Values on the Boolean hypercube remain unchanged, and the resulting multilinear polynomials have degree at most $s$. Their ambient space has a monomial basis consisting of $x_S={\prod }_{i\in S}{x}_i$ for $|S|\le s$, with dimension ${\sum }_{j=0}^{\min (s,n)}\left(\genfrac{}{}{0ex}{}{n}{j}\right)$. This proves the general bound, including $s=0$.

For completeness, obtain the uniform sharpening without dividing by factorials in a finite field. For $s\ge 1$ put $a=k\mathrm{mod}p$ and $g(x)={\sum }_i{x}_i-a$. The functions $x_{S}g$ with $|S|<s$ are linearly independent. Indeed, a relation gives $gh=0$ with $\mathrm{deg}h<s$, so $h$ is supported only on weights in $H=\{j\in [0,n]:j\equiv a(\mathrm{mod}p)\}$. With boundary weights $-1,n+1$, this set has a gap of at least $s+1$: either consecutive allowed weights differ by $p\ge s+1$, or its terminal gap does, since $n\ge k+s\ge a+s$. The alternating sum of $h$ over any interval of $s$ free coordinates vanishes by its degree. Across that gap only one endpoint level can contribute, forcing $h$ to vanish there. Delete that level and repeat across the enlarged gap until $H$ is empty. Hence $h=0$, and independence of the square-free monomials gives the claim. Adjoin these functions to the $f_A$. Evaluation at each family vector eliminates the coefficients of $f_A$, since $g$ vanishes there; the claim eliminates all remaining coefficients. Counting dimensions yieldsThe case $s=0$ permits at most one member directly. The gap argument is an instance of the modular layer vanishing lemma.

For the final application, enumerate the distinct sets as $A_1,\dots ,A_m$ and let $v_i=1_{A_i}\in {\mathbb{R}}^n$ be their characteristic vectors of sets. If $m\le 1$, the desired bound is immediate for $n\ge 1$. Otherwise $|A_i|\ge k$, because $A_i$ intersects another member in $k$ points. At most one member can have size $k$: two distinct $k$-sets cannot have intersection size $k$. The Gram matrix of these vectors isFor real coefficients $c_i$,All terms are nonnegative, with $k>0$. If the expression vanishes, every coefficient corresponding to a set of size greater than $k$ is zero. At most one coefficient remains, and the first term forces it to be zero as well. Thus the characteristic vectors of sets are linearly independent in ${\mathbb{R}}^n$, proving the constant-intersection family boundThis proof explicitly covers the possible member of size exactly $k$; assuming all diagonal corrections were strictly positive would miss that case. Positivity of $k$ is essential: when $k=0$, the empty set and all $n$ singleton sets give $n+1$ members.

Set $m=\lceil p/100\rceil$ and $d=m-1$, so that $d<p/100<p$. The dimension of a bounded-total-degree polynomial space in $n$ variables over ${\mathbb{F}}_p$ is $\left(\genfrac{}{}{0ex}{}{n+d}{n}\right)$. If $\#N$ were smaller than this dimension, evaluation at the points of $N$ would impose fewer homogeneous linear conditions than unknown coefficients. The rank-nullity theorem would give a nonzero multivariate polynomial $P$ of total degree at most $d$, vanishing on $N$.

For every $x$, select one of the promised rich affine lines in a vector space through $x$, and write it as $\ell =\{a+tv:t\in {\mathbb{F}}_p\}$ with $v\ne 0$. The polynomial restriction to a line $Q(t)=P(a+tv)$ has degree at most $d$, and at least $m=d+1$ distinct roots of a polynomial from $N\cap \ell$. By the root bound for a polynomial, $Q$ is identically zero, so $P(x)=0$. Since this works for every $x$, $P$ vanishes at all $p^n$ points of ${\mathbb{F}}_p^n$.

The Schwartz-Zippel lemma says that a nonzero multivariate polynomial of total degree $d$ has at most $d{p}^{n-1}$ zeros on this grid. Here $d<p$, so that count is strictly less than $p^n$, a contradiction. The distinction between a formal polynomial and its function on a finite field is crucial: our degree bound is what rules out a nonzero polynomial vanishing everywhere.

We have proved the stronger quantitative rich line covering bound over a finite fieldThus $\#N{\gtrsim }_n{p}^n$, as required. The implied constant may depend on the fixed dimension $n$. The very large numerical lower bound on $p$ is more than this proof needs.

Write a matrix in the upper unitriangular group as $M=I+A$. Here $A^3=0$, and its only potentially nonzero entry in $A^2$ is $(A^2{)}_{13}=ab$. The binomial theorem therefore gives the unitriangular matrix power formulaFor an odd prime number $p$, both $p$ and $\left(\genfrac{}{}{0ex}{}{p}{2}\right)=p(p-1)/2$ vanish in the finite field ${\mathbb{F}}_p$. Thus $M^p=I$. A nonidentity $M$ has order dividing the prime $p$ (by the same exponent-division argument as in part (i)), and so has order exactly $p$.

For $p=2$, take $a=b=1$ and $x=0$. Then $M^2=I+A^2\ne I$, while $M^4=(I+A^2{)}^2=I$. This element has order $4$, not $2$. Hence every nonidentity element has order $p$ exactly for odd $p$. The counterexample at $p=2$ accounts for the quadratic term in the matrix power formula.

Let $D$ be a finite integral domain. For any $a\ne 0$, multiplication $m_a:D\to D$ is injective: $ax=ay$ implies $a(x-y)=0$, hence $x=y$ because there are no zero divisors. An injective map of a finite set to itself is surjective, so $ab=1$ for some $b$. Every nonzero element is invertible; therefore a finite integral domain is a field.

For an irreducible polynomial $f\in F[X]$, consider a nonzero class $[g]$ in the quotient ring $F[X]/(f)$. Since $f$ does not divide $g$, irreducibility gives $\gcd (f,g)=1$. The Euclidean algorithm in the polynomial ring gives polynomials $u,v$ with $uf+vg=1$. Modulo $(f)$, $[v][g]=1$. Thus the quotient by an irreducible polynomial is a field.

For a field with four elements, useThe quadratic has no root in ${\mathbb{F}}_2$, so is irreducible. Write $\alpha =[X]$. Polynomial division shows the elements are $0,1,\alpha ,\alpha +1$, with ${\alpha }^2=\alpha +1$. Its multiplication table is

For a field with nine elements, useThe values of $X^2+1$ at $0,1,2$ are $1,2,2$, so the quadratic is irreducible. Every class is uniquely $a+b\beta$, $a,b\in {\mathbb{F}}_3$, with ${\beta }^2=-1=2$. These nine classes form a finite field; multiplication is $(a+b\beta )(c+d\beta )=(ac-bd)+(ad+bc)\beta$, with coefficients modulo three.

The squares in the finite field ${\mathbb{F}}_7$ are $0,1,2,4$. For $x=0,1,\dots ,6$, the values of $x^3-x+1$ and the numbers of possible $y$ are respectivelyAdding $O$ yields $\#E({\mathbb{F}}_7)=12$. The Trace of Frobenius is $a=8-12=-4$. The trace of the square of an elliptic-curve endomorphism is $a^2-2q=16-14=2$, so the elliptic-curve point count over a finite field givesFor example, this trace identity follows from ${\pi }^2-[a]\pi +[q]=0$ and $\mathrm{tr}[q]=2q$.

One suitable second elliptic curve isHere $4\cdot 3^3+27\cdot 6^2\equiv 2(\mathrm{mod}7)$, so its elliptic-curve discriminant is nonzero. Its complete list of rational points is $O,(3,0),(6,3),(6,4)$, obtained by checking the seven $x$-values. For $P=(6,3)$ the tangent slope is $1$ in ${\mathbb{F}}_7$, and the elliptic-curve addition formula gives $2P=(3,0)$. Consequently $P$ has order four and $E^{\prime }({\mathbb{F}}_7)\cong \mathbb{Z}/4\mathbb{Z}$.

For the modular Heisenberg group, the three independent entries each have $p$ choices, soThe multiplication and commutation calculations work over the finite field ${\mathbb{F}}_p$ exactly as over $\mathbb{R}$. Taking $x^{\prime }=1,z^{\prime }=0$ and $x^{\prime }=0,z^{\prime }=1$ shows thatLet $c=M(0,1,0)$. Its powers exhaust the centre and $c$ has order $p$, giving the group presentationLet $a=M(1,0,0)$ and $b=M(0,0,1)$. Their images $\bar{a},\bar{b}$ in the quotient group translate the $x,z$ entries independently. They commute modulo the centre, have order $p$, and generate $p^2$ distinct pairs. ThereforeFor context, $ab{a}^{-1}{b}^{-1}=c$, with $c$ central. All conclusions above include $p=2$; one must not infer that every nonidentity element of $H_2$ has order two, since $(ab{)}^2=c$.

The Frankl-Wilson theorem. Let $p$ be a prime number, let $L\subseteq {\mathbb{F}}_p$ have $s$ elements, and let $\mathcal{F}\subseteq \mathcal{P}([n])$. Suppose that $|A|\mathrm{mod}p\notin L$ for every $A\in \mathcal{F}$, whereas $|A\cap B|\mathrm{mod}p\in L$ for all distinct members. Thenwith terms beyond $n$ understood as zero.

Work over the finite field ${\mathbb{F}}_p$. For each member define its intersection polynomialReplace every positive power $x_i^d$ by $x_i$ to obtain a multilinear polynomial ${\tilde{f}}_A$ of polynomial degree at most $s$. This Boolean multilinearization preserves its values at every characteristic vector of a set. At the characteristic vector of a set $B$,It is zero if $A\ne B$ and nonzero if $A=B$. Evaluating a proposed linear relation at each $1_B$ therefore establishes linear independence of the ${\tilde{f}}_A$. The vector space of multilinear polynomials of polynomial degree at most $s$ has the basis of monomials ${\prod }_{i\in T}{x}_i$, $|T|\le s$, of size ${\sum }_{j=0}^s\left(\genfrac{}{}{0ex}{}{n}{j}\right)$. This proves the Frankl-Wilson theorem by the polynomial method in combinatorics. The empty product for $s=0$ is $1$, and the argument still applies.

The constant-intersection family bound, directly. Write $\mathcal{F}=\{F_1,\dots ,F_q\}$ and assume $n\ge 1$. The cases $q\le 1$ are immediate. If $\lambda =0$, the nonempty members are pairwise disjoint and there can also be the empty set, givingFor $\lambda >0$, every member has size at least $\lambda$. If every member has size strictly greater than $\lambda$, form the real matrix $X$ whose rows are their characteristic vectors of sets. Its Gram matrix satisfiesFor any nonzero real vector $z$,Thus the rows are linearly independent and $q\le n$. If a member $F_1$ has size $\lambda$, it lies inside every other member. The sets $F_i\setminus F_1$, $i>1$, are nonempty and pairwise disjoint, so $q-1\le n-\lambda$. This also givesThese bounds are sharp: the singletons together with $\varnothing$ attain $n+1$ at $\lambda =0$, while all complements of singletons attain $n$ at $\lambda =n-2>0$ when $n\ge 3$.

The constant t-wise intersection dichotomy. In its substantive form the last argument requires $m\ge t$. The printed statement does not explicitly impose this. Without it the $t$-fold condition can be vacuous and the claimed dichotomy is false: take $t=3$, $m=2$, $n=1$, $A_1=\varnothing$, $A_2=\{1\}$ and $\lambda =1$. There is no $3$-tuple to test, no common $1$-set, and $k=0$, so $m=2>k+t-2=1$. We therefore prove the intended assertion for $m\ge t$ and record this necessary qualification.

If $\lambda =0$, the first alternative always holds with $S=\varnothing$. Suppose $\lambda >0$. Choose $t-2$ indices attaining the minimum intersection size $k$, and writeFor each of the $q=m-t+2\ge 2$ remaining indices put $B_j=K\cap A_j$. The hypothesis gives $|B_j\cap B_{\ell }|=\lambda$ for distinct remaining indices. This reduces the constant t-wise intersection dichotomy to a constant-intersection family bound on the $k$-element set $K$. The two possibilities are treated below.

Compute each scheme-theoretic fibre by tensoring with the residue field of the chosen base point.

For the first map, put $L=\kappa (\mathfrak{p})$ for a point $\mathfrak{p}$ of $\mathrm{Spec}k[T]$ and let $t$ be the image of $T$ in $L$. ThenIf the characteristic of a field is not two and $t\ne 0$, the two factors $U-t$ and $U+t$ are coprime, so the Chinese remainder theorem gives $L[U]/(U^2-t^2)\simeq L\times L$: the scheme-theoretic fibre is two distinct $L$-points. If $t=0$, its ring is $L[U]/(U^2)$, a dual number ring, so it is a nonreduced double point. In characteristic two, $U^2-t^2=(U-t{)}^2$ at every point, giving a nonreduced double point in every scheme-theoretic fibre. This covers the generic point, where $L=k(T)$, as well as closed points defined by irreducible polynomials.

For the arithmetic map, the generic scheme-theoretic fibre isOver a closed point $(p)$ it is $\mathrm{Spec}{\mathbb{F}}_p[T]/(T^2+1)$. At $p=2$ this is $\mathrm{Spec}{\mathbb{F}}_2[ϵ]/({ϵ}^2)$, since $T^2+1=(T+1{)}^2$. For odd $p$, the finite field multiplicative group is cyclic, and $-1$ is a square exactly when $p\equiv 1(\mathrm{mod}4)$. ThusIn the second case there is one degree-two closed point over ${\mathbb{F}}_p$, which becomes two points after extending the residue field to an algebraic closure. The case $p=2$ remains nonreduced after such extension.

For $\mathrm{Spec}\mathbb{C}\to \mathrm{Spec}\mathbb{Z}$, the unique source point maps to the generic point $(0)$. Since all nonzero integers are invertible in $\mathbb{C}$,Indeed $\mathbb{C}{\otimes }_{\mathbb{Z}}\mathbb{Q}=\mathbb{C}$, whereas $\mathbb{C}{\otimes }_{\mathbb{Z}}{\mathbb{F}}_p=\mathbb{C}/p\mathbb{C}=0$. The distinction between a reduced split scheme-theoretic fibre and a nonreduced double point is essential in the first two examples.

A set $S$ of prime numbers has Dirichlet density $\delta$ if the following limit exists:Equivalently, the denominator can be ${\sum }_p{p}^{-s}$, since that sum is $\log (1/(s-1))+O(1)$. Adding or removing finitely many prime numbers leaves the Dirichlet density unchanged.

Put $\alpha =\sqrt[4]{2}>0$ and $L=\mathbb{Q}(\alpha ,i)$. This is the splitting field of $X^4-2$, whose four roots of a polynomial are $\alpha ,i\alpha ,-\alpha ,-i\alpha$. The polynomial is an Eisenstein polynomial at $2$, so $[\mathbb{Q}(\alpha ):\mathbb{Q}]=4$. Since $\mathbb{Q}(\alpha )$ is contained in the real numbers, it does not contain $i$, giving $[L:\mathbb{Q}]=8$. Thus $L/\mathbb{Q}$ is a Galois extension of degree $8$. Its Galois group is the dihedral group of order $8$: the field automorphisms $r(\alpha )=i\alpha$, $r(i)=i$ and $s(\alpha )=\alpha$, $s(i)=-i$ satisfy $r^4=s^2=1$ and $srs=r^{-1}$.

For an odd prime number $p$, the condition $p\equiv 1(\mathrm{mod}4)$ means that the finite field ${\mathbb{F}}_p$ contains all fourth roots of unity. Under this condition, $2$ is a quartic residue exactly when $X^4-2$ has a root in ${\mathbb{F}}_p$; multiplying that root by $1,i,-1,-i$ gives all four distinct roots. Conversely, complete splitting of $X^4-2$ over ${\mathbb{F}}_p$ gives both a fourth root of $2$ and a primitive fourth root of unity, so it also forces $p\equiv 1(\mathrm{mod}4)$.

The polynomial discriminant of $X^4-2$ is $-2^{11}$. Hence every odd prime number is unramified in $L$, and the root-splitting criterion is equivalent to its Frobenius automorphism acting trivially on all the roots. Since the roots generate $L$, this is equivalent to the Frobenius automorphism being the identity, or to $p$ being a completely split prime of $L/\mathbb{Q}$. The Chebotarev density theorem says that the unramified prime numbers with Frobenius conjugacy class $C$ have Dirichlet density $|C|/|\mathrm{Gal}(L/\mathbb{Q})|$. Here $C=\{1\}$, so

Work over the finite field ${\mathbb{F}}_2$. Reduce polynomials modulo $X_i^2-X_i$, so their monomials are square-free. The binary Reed-Muller code $\mathrm{RM}(r,m)$ consists of the evaluation vectors of polynomials of degree at most $r$ at all $2^m$ points of ${\mathbb{F}}_2^m$, in a fixed order. This is a linear code of length $2^m$ and dimension ${\sum }_{j=0}^r\left(\genfrac{}{}{0ex}{}{m}{j}\right)$, for $0\le r\le m$. Square-free monomials give independent evaluation functions, as follows inductively by splitting according to the last variable.

The minimum Hamming distance of a linear code equals its least nonzero Hamming weight. The result isHere $r=0$ is the repetition code, while $r=m$ is the full binary vector space and has distance one. For the induction step, write $f(x,t)=u(x)+tv(x)$, where $\mathrm{deg}u\le r$ and $\mathrm{deg}v\le r-1$. Its evaluation vector is $(u,u+v)$, the Reed-Muller bar-product recursion. If $v=0$, its nonzero Hamming weight is at least $2d(r,m-1)=2^{m-r}$, with the full-space endpoint treated as above. If $v\ne 0$, every position where $v=1$ contributes exactly one to the sum of the two weights; hence the weight is at least $\mathrm{wt}(v)\ge 2^{(m-1)-(r-1)}=2^{m-r}$. The monomial $X_1\cdots X_r$ is one exactly on $2^{m-r}$ points, attaining the bound. Degrees greater than $m$ give the same full code; the zero code at negative degree has no nonzero word whose weight could define a finite minimum.