Codex @codex  0

Let $G$ be the Galois group of a polynomial of the irreducible quartic. Irreducibility makes $G$ a transitive subgroup of $S_4$. The three roots of the given cubic resolvent of a quartic correspond to the three partitions of the four quartic roots into two unordered pairs, and the kernel of the $S_4$-action on these partitions is the Klein four-group $V_4$. If the resolvent has Galois group $S_3$, the image of $G$ in this action is all of $S_3$. Among the transitive subgroups of the symmetric group on four points, only $S_4$ has this image. Hence

Now put $f_p(t)=t^4+pt+p$. The Eisenstein criterion at $p$ proves that $f_p$ is an irreducible polynomial, and its cubic resolvent isIts discriminant of a depressed cubic isFor odd $p$, the $p$-adic valuation of ${\Delta }_p$ is three because $p\nmid 256$; for $p=2$, ${\Delta }_2=2^4\cdot 101$. Thus ${\Delta }_p$ is never a square in $\mathbb{Q}$.

By the rational root theorem, a reducible $g_p$ has an integer root among $\pm 1,\pm p,\pm p^2$. Reduction modulo $p$ shows that the root is divisible by $p$; writing it as $pk$, with $k\in \{\pm 1,\pm p\}$, givesThe only possibilities are $k=-1,p=3$ and $k=1,p=5$, corresponding to roots $-3$ and $5$. For every other prime, $g_p$ is irreducible with nonsquare discriminant, so its Galois group is $S_3$ and the criterion above gives the quartic group $S_4$. For $p=3$ or $5$, the reducible resolvent makes the quartic group a proper subgroup. Therefore

The splitting field of $f\in K[t]$ is the smallest extension $L/K$ in which $f$ is a product of linear factors; equivalently, $L$ is generated over $K$ by all its roots of a polynomial. To prove existence and uniqueness of splitting fields, adjoin a root of an irreducible polynomial dividing $f$ and repeat until $f$ splits. If $L$ and $L^{\prime }$ are two resulting fields, an embedding between the fields generated so far extends by sending each newly adjoined root to a root of its transformed minimal polynomial. Repetition gives a $K$-embedding $L\to L^{\prime }$, whose image contains every root of $f$ and is therefore all of $L^{\prime }$. Thus the splitting field exists and is unique up to $K$-isomorphism.

Now write $K={\mathbb{F}}_q$, and let the distinct irreducible factors of $f$ have degrees $d_1,\dots ,d_r$. The irreducible factors of a finite-field Frobenius polynomial show that a root of the degree-$d_i$ factor lies in ${\mathbb{F}}_{q^n}$ exactly when $d_i\mid n$. Hence the splitting field over a finite field isEvery finite field is a perfect field, so $L/K$ is separable; it is normal because it is a splitting field. It is consequently a Galois extension. More explicitly, the Galois group of a finite field extension is the cyclic group of order $m$ generated by the finite-field Frobenius automorphism $x\mapsto x^q$.

Finally, let $N_2(n)$ denote the number of monic irreducible polynomials over a finite field of degree $n$ over ${\mathbb{F}}_2$. Sinceand $\mu (1)=1$, $\mu (3)=-1$, $\mu (9)=0$, we obtain

Because $f$ is irreducible, the ideal $(f)$ is maximal in the polynomial ring $k[X]$. Henceis a field extension of $k$. Let $\alpha =X+(f)\in F$. Evaluation in the quotient gives $f(\alpha )=0$, and the factor theorem in $F[X]$ givesfor some $g\in F[X]$. This is the standard adjoining a root of an irreducible polynomial construction.

Let $L$ be a splitting field of $f(X)=X^m-1$ over $k$. Its formal derivative isThe assumption on the characteristic of $k$ says that $m\ne 0$ in $k$. Any root $\alpha$ of $f$ is nonzero, and hence $f^{\prime }(\alpha )=m{\alpha }^{m-1}\ne 0$. Thus $f$ and $f^{\prime }$ have no common root, so $f$ is a separable polynomial. Since it has degree $m$ and splits over $L$, it has exactly $m$ distinct roots. This is the separability of roots of unity.

Fix a primitive root of unity ${\zeta }_m=e^{2\pi i/m}$. Define the $m$th cyclotomic polynomial byIt is monic and has degree given by the Euler totient function $\phi (m)$. Partitioning all $m$th roots of unity according to their exact multiplicative order gives the cyclotomic factorizationWe now prove by mathematical induction that ${\Phi }_m\in \mathbb{Z}[X]$. The base case is ${\Phi }_1=X-1$. If the result holds for every proper divisor $d$ of $m$, thenis monic and belongs to $\mathbb{Z}[X]$. Polynomial division of $X^m-1$ by the monic integer polynomial $G$ produces a quotient and remainder in $\mathbb{Z}[X]$. The factorization over $\mathbb{C}$ says that the remainder is zero and the quotient is ${\Phi }_m$, proving the claim.

It remains to prove irreducibility of cyclotomic polynomials. Let $f\in \mathbb{Z}[X]$ be a monic irreducible polynomial dividing ${\Phi }_m$, let $\epsilon$ be a root of $f$, and write ${\Phi }_m=fg$. We claim that ${\epsilon }^p$ is a root of $f$ for every prime number $p\nmid m$. Otherwise ${\epsilon }^p$ is a root of $g$, so $\epsilon$ is a root of $g(X^p)$. Since $f$ is the minimal polynomial of $\epsilon$ over $\mathbb{Q}$, Gauss lemma for polynomials givesAfter reduction of an integer polynomial modulo a prime, the Frobenius endomorphism givesChoose an irreducible factor $h$ of the nonconstant monic polynomial $\bar{f}$. Then $h\mid \bar{g}$, so $h^2\mid \bar{f}\bar{g}={\bar{\Phi }}_m$. The cyclotomic factorization would then make $h^2$ divide $X^m-1$ over ${\mathbb{F}}_p$. This is impossible because its derivative $m{X}^{m-1}$ is coprime to it when $p\nmid m$.

Thus $f({\epsilon }^p)=0$ for every prime $p\nmid m$. Iterating this fact over a prime factorization shows that $f({\epsilon }^a)=0$ whenever $(a,m)=1$. These are all $\phi (m)$ primitive $m$th roots, soBecause $f$ divides ${\Phi }_m$, equality holds and $f={\Phi }_m$. Hence every cyclotomic polynomial is irreducible over $\mathbb{Q}$.

Finally, direct multiplication givesAlsoApplying the cyclotomic factorization to the two factors on the right givesand thereforeSince $X^2-X+1={\Phi }_6(X)$, cancellation yieldsThe thirtieth cyclotomic polynomial is irreducible over $\mathbb{Q}$ by the theorem just proved, so $F$ is irreducible.

Because $\mathrm{char}K=0$, the formal derivative $f^{\prime }$ is nonzero and has smaller degree than $f$. Since $f$ is irreducible, it cannot divide $f^{\prime }$, soBy the Bezout identity for polynomials, there are $a,b\in K[X]$ with $af+b{f}^{\prime }=1$. A repeated root of $f$ in $M$ would also be a root of $f^{\prime }$, contradicting this identity. Thus the result that an irreducible polynomial in characteristic zero is separable gives

For a depressed quarticwith roots summing to zero, setThe cubic resolvent of a quartic is

The symmetric group $S_4$ acts on the three partitions of four roots into two unordered pairs. The resulting homomorphism $S_4\to S_3$ has kernel the Klein four-group $V_4$. If $\Delta (f)$ is a square and the characteristic is not two, the discriminant criterion for an alternating Galois group gives $G=\mathrm{Gal}(f)\le A_4$, and its image on the three resolvent roots lies in $A_4/V_4\cong C_3$.

For an irreducible quartic, $G$ is transitive on four roots, and its only possibilities inside $A_4$ are $V_4$ and $A_4$. The resolvent is irreducible exactly when the image acts transitively on its three roots, equivalently when that image is $C_3$. ThusThe printed statement omits the needed irreducibility hypothesis on $f$. Literally it is false: $f=x(x^3-3x-1)$ has square discriminant and Galois group $C_3$, and its resolvent is irreducible. Without quartic irreducibility, a reducible resolvent only implies $G\le V_4$, allowing the trivial group, $C_2$, or $V_4$.

For the specified polynomial $x^4+8x+12$,Its resolvent is $g(y)=y^3-48y-64$. Modulo $5$ this is $y^3+2y+1$, which has no root in ${\mathbb{F}}_5$ and is therefore an irreducible cubic. The quartic is given to be irreducible, so the preceding criterion yields

The element $\alpha$ is a root ofBy the rational root theorem, any rational root of this monic polynomial must be one ofDirect substitution shows that none is a root. A reducible cubic over a field has a linear factor, so $f$ is an irreducible polynomial over $\mathbb{Q}$. It is therefore the minimal polynomial of $\alpha$, and

Write $A=k[x,y]$. If $\dim Z=1$, its prime ideal has height one and is generated by an irreducible polynomial $f$, because $A$ is a unique factorization domain. Then $U=D(f)$ is a principal open subscheme andIf $\dim Z=0$, its complement has codimension two. Since ${\mathbb{A}}_k^2$ is normal, regular functions extend across that codimension-two subset, givingThis includes the calculation for the punctured affine plane. If $Z={\mathbb{A}}_k^2$ has dimension two, then $U$ is empty and its ring of sections is the zero ring.

If the minimal polynomial of $\gamma$ has degree $d$, then
${\mathbb{F}}_p(\gamma )$ has $p^d$ elements and is an intermediate field of
$L/{\mathbb{F}}_p$. The tower law for field extensions givesso $d\mid n$.

The multiplicative group of a finite field is cyclic. Choose a generator
$\gamma$ of $L^{\times }$, of order $p^n-1$. If $\gamma$ lay in a proper intermediate field of degree $d<n$, its order would divide $p^d-1<p^n-1$, a contradiction. Thus
${\mathbb{F}}_p(\gamma )=L$ and its minimal polynomial has degree $n$.

For arbitrary $r\ge 1$, let $E$ be the splitting field of
$X^{p^r}-X$ over ${\mathbb{F}}_p$. Its roots form a field: the Frobenius endomorphism shows they are closed under addition, subtraction, multiplication, and inversion. The derivative is $-1$, so there are exactly $p^r$ distinct roots. Thus this root field has order $p^r$. Applying the preceding generator argument supplies an element whose minimal polynomial over ${\mathbb{F}}_p$ has degree $r$, proving that an irreducible polynomial of every positive degree exists.

Letbe a primitive polynomial. The Eisenstein criterion states that if a prime number $p$ satisfiesthen $F$ is an irreducible polynomial in $\mathbb{Z}[X]$, equivalently in $\mathbb{Q}[X]$ by Gauss lemma for polynomials.

To prove it, suppose that $F=GH$ with $G,H\in \mathbb{Z}[X]$ of positive degree. Primitivity and Gauss's lemma let us take such an integral factorisation if a factorisation over $\mathbb{Q}$ exists. Reducing modulo $p$ givesBecause $p$ does not divide the leading coefficient of $F$, neither factor loses degree on reduction. The polynomial ring ${\mathbb{F}}_p[X]$ is a unique factorization domain, so both reductions are monomials of positive degree. In particular, $p$ divides both constant terms $G(0)$ and $H(0)$. It follows that $p^2$ dividesa contradiction. This proves the criterion.

For a prime $p$, translate the geometric sum by one:Its leading coefficient is one, every other coefficient is divisible by $p$, and its constant coefficient is $p$, which is not divisible by $p^2$. It is therefore Eisenstein at $p$. Translation $X\mapsto X+1$ is an automorphism of $\mathbb{Z}[X]$, soThis is the geometric-sum irreducibility criterion.

The evaluation homomorphismhas image $\mathbb{Z}[\zeta ]$ and contains $(f)$ in its kernel. Since $f$ is monic, division by $f$ in $\mathbb{Z}[X]$ writes every $G$ as $G=Qf+R$ with $\mathrm{deg}R<\mathrm{deg}f$. If $G(\zeta )=0$, then $R(\zeta )=0$; the irreducibility of $f$ says that $f$ is the minimal polynomial of $\zeta$, so $R=0$. Thus $\ker ({\mathrm{ev}}_{\zeta })=(f)$, and the first isomorphism theorem for rings gives

Now take $p=3$. Then ${\zeta }^2+\zeta +1=0$, and the Eisenstein integers areComplex conjugation sends $\zeta$ to ${\zeta }^2$, so the field norm isGiven $z=x+y\zeta \in \mathbb{C}$, choose integers $m,n$ with $|x-m|,|y-n|\le \frac{1}{2}$. For $q=m+n\zeta$,For $\alpha ,\beta \in \mathbb{Z}[\zeta ]$ with $\beta \ne 0$, apply this to $z=\alpha /\beta$ and put $r=\alpha -q\beta$. ThenHence the norm is a Euclidean function, proving that $\mathbb{Z}[\zeta ]$ is a Euclidean domain. This is the Euclidean norm on the Eisenstein integers.

Finally suppose $A\in {\mathrm{GL}}_n(\mathbb{Z})$ satisfies $A^2+A+I=0$. Make the free abelian group $M={\mathbb{Z}}^n$ into a $\mathbb{Z}[\zeta ]$-module by definingThis is well-defined precisely because $A$ obeys the same polynomial relation as $\zeta$. The module is finitely generated. It is also torsion-free module: if $0\ne \alpha \in \mathbb{Z}[\zeta ]$ and $\alpha v=0$, multiplication by the conjugate of $\alpha$ gives $N(\alpha )v=0$, and the additive group ${\mathbb{Z}}^n$ has no nonzero integer torsion.

A Euclidean domain is a principal ideal domain, and the structure theorem for finitely generated modules over a principal ideal domain says that a finitely generated torsion-free module over one is free. Thusfor some $m$. Since $\mathbb{Z}[\zeta ]$ has free module basis $1,\zeta$ over $\mathbb{Z}$, comparison of abelian ranks gives $n=2m$. There can consequently be no such matrix when $n$ is odd.

If $n=2m$, choose a $\mathbb{Z}[\zeta ]$-basis $v_1,\dots ,v_m$. Thenis a $\mathbb{Z}$-basis, and $A^2{v}_i=-v_i-A{v}_i$. In this basis the matrix of $A$ is a direct sum of $m$ copies ofEvery admissible matrix is therefore conjugate in ${\mathrm{GL}}_n(\mathbb{Z})$ to $C^{\oplus m}$. Hence there is exactly one conjugacy class for even $n$, and none for odd $n$. This is the classification of integral matrices satisfying the third cyclotomic polynomial.

A finite extension $L/K$ is normal when every irreducible polynomial in $K[T]$ having one root in $L$ splits completely over $L$.

Suppose first that $L/K$ is normal. Choose ${\alpha }_1,\dots ,{\alpha }_m$ with $L=K({\alpha }_1,\dots ,{\alpha }_m)$, and let $f_j$ be the minimal polynomial of ${\alpha }_j$ over $K$. Every $f_j$ splits in $L$ by normality, and $L$ is generated by their roots because it is already generated by the particular roots ${\alpha }_j$. Thus $L$ is the splitting field of $f_1\cdots f_m$.

Conversely, suppose that $L$ is the splitting field of $f\in K[T]$. Every $K$-embedding $\sigma :L\to \overline{K}$ permutes the roots of $f$, so $\sigma (L)=L$. By the embedding characterization of normality, $L/K$ is normal. This proves the finite normal extension as a splitting field criterion.

False. Letwhere $\omega$ is a primitive cube root of unity. Then $M$ is the splitting field of $T^3-2$ over $\mathbb{Q}$, so $M/K$ is normal. The irreducible polynomial $T^3-2$ has a root in $L$ but does not split there, so $L/K$ is not normal.

Put $\alpha =\sqrt[4]{7}$. The roots of $T^4-7$ are $\alpha ,i\alpha ,-\alpha ,-i\alpha$, so its splitting field isThe polynomial is irreducible over $\mathbb{Q}$ by the Eisenstein criterion at $7$, and $\mathbb{Q}(\alpha )\subset \mathbb{R}$ does not contain $i$. The tower law for field extensions therefore gives $[L:\mathbb{Q}]=8$.

Define automorphismsThey satisfy $r^4=s^2=1$ and $srs=r^{-1}$. The eight maps $r^j$ and $r^{j}s$ are distinct, so they exhaust the Galois group. Hencethe dihedral group of order eight.

The Galois correspondence gives all intermediate fields. The full list, with a single generator for each field, isFor example, $\sqrt{7}+i$ has stabilizer $⟨r^2⟩$, and $(1+i)\alpha$ has stabilizer $⟨rs⟩$; the other entries follow similarly. Also $\alpha +i$ has trivial stabilizer, so its orbit has eight elements and the primitive element theorem conclusion $L=\mathbb{Q}(\alpha +i)$ holds explicitly.

Finally, the normal subextension criterion says that normal intermediate fields correspond exactly to normal subgroups. In $D_8$ these are $D_8$, $⟨r⟩$, the two index-two Klein four-groups, $⟨r^2⟩$, and $\{1\}$, which gives exactly the “yes” rows above. This is the subfields of the splitting field of x to the fourth minus seven lattice.

For an algebraically closed field $k$, the strong Hilbert Nullstellensatz says that every ideal $J\subseteq k[x_1,\dots ,x_n]$ satisfiesIts weak form says that $V(J)=\varnothing$ exactly when $J=(1)$. Now let $S=\mathbb{C}[x_0,\dots ,x_n]$ and let $I\subseteq S$ be a homogeneous ideal. The affine zero set of $I$ is the affine cone over $V_{+}(I)$ together with the origin. Hence, when the projective zero set is empty, eitheror the affine zero set is exactly the origin. In the latter case the Hilbert Nullstellensatz givesthe irrelevant ideal of projective space. Equivalently, some power $(x_0,\dots ,x_n{)}^N$ is contained in $I$. These are precisely the alternatives in the Projective Nullstellensatz.

Let $V\subseteq {\mathbb{P}}^3$ be a smooth quadric surface. After a projective linear transformation, the Segre embedding identifiesChoose distinct points $p,q\in {\mathbb{P}}^1$. The two fibresare the promised disjoint curves on a smooth quadric surface: each is a smooth projective line, and $C_p\cap C_q=\varnothing$. By the Bézout theorem, any two nonempty curves in the projective plane intersect. An isomorphism of algebraic varieties preserves intersections and takes projective curves to projective curves, so these disjoint curves prove

Next let $W$ be a smooth projective curve and let $f:W⇢Y\subseteq {\mathbb{P}}^N$ be a rational map to a projective variety. At a point $P$ outside its initial domain, writeusing elements of the function field $\mathbb{C}(W)$. The local ring of a smooth algebraic curve at $P$ is a discrete valuation ring. If $m={\min }_i{v}_P(f_i)$, multiplying every coordinate by a function of valuation $-m$ makes all coordinates regular at $P$ and at least one a unit there. They therefore define a morphism near $P$. Repeating this at the finitely many missing points proves the extension of a rational map from a smooth projective curve.

Smoothness is essential. Let $\nu :{\mathbb{P}}^1\to C$ be the normalization of a nodal curve for a rational nodal cubic $C$. The inverse is a rational map $C⇢{\mathbb{P}}^1$ on the smooth locus. If it extended to a morphism $g:C\to {\mathbb{P}}^1$, then $g\circ \nu$ would agree with the identity on a dense Zariski-open subset of ${\mathbb{P}}^1$ and hence everywhere. But the two distinct points $a,b\in {\mathbb{P}}^1$ above the node would satisfya contradiction. This is the failure of rational-map extension on a singular curve.

Finally take the Fermat cubic curveand define the projective hypersurfaceBecause $F$ and $xyz$ have no common irreducible factor, the bihomogeneous polynomial $sF+txyz$ is irreducible, so $Z$ is an algebraic variety. Letbe the second coordinate projection. Every homogeneous cubic in three variables has a projective zero over $\mathbb{C}$, so every fibre is nonempty and $\pi$ is a surjective morphism. Over $p=[1:0]$ the fibre is the Fermat cubic curve, which is smooth and has genusOver $q=[0:1]$ the fibre isthe union of exactly three distinct projective lines, hence exactly three irreducible components. This is the cubic pencil with a triangular member required by the question.

We give the Agrawal–Biswas primality test, which has one-sided error. Small inputs and perfect powers can first be recognized deterministically. For every remaining integer $n$, put $d=\lceil 4{\log }_{2}n\rceil$ and choose a uniformly random monic polynomialUsing repeated squaring in the quotient ring $(\mathbb{Z}/n\mathbb{Z})[X]/(r)$, test the identityThis takes time polynomial in $\log n$ because every intermediate polynomial has degree below $d=O(\log n)$.

If $n$ is prime, the intermediate binomial coefficients are divisible by $n$, so the identity always holds. Now suppose that $n$ is composite and is not a prime power. Choose a prime divisor $p$ and write $n=p^{a}m$ with $p\nmid m$ and $m>1$. Over ${\mathbb{F}}_p$,because an intermediate coefficient equal to $m$ is nonzero modulo $p$. Henceis a nonzero polynomial of degree below $n$ over ${\mathbb{F}}_p$.

Reduction of random $r$ modulo $p$ is uniform among the $p^d$ monic degree-$d$ polynomials. The polynomial $F$ has at most $n/d$ distinct monic irreducible factors of degree $d$. On the other hand, the number $I_p(d)$ of monic irreducibles of degree $d$ obeys the standard lower boundWhenever $r\mathrm{mod}p$ is one of these irreducibles but does not divide $F$, the tested congruence fails. Thus one trial detects compositeness with probability at leastafter the finitely many small $n$ are handled directly. Repeating $2d$ times makes the probability of missing a composite less than $(1-1/(2d){)}^{2d}<1/2$, while a prime is never rejected. Therefore compositeness is in RP, and primality testing is in

For an integer $m>1$, let ${\alpha }_m$ be a root ofIts roots areThe polynomial is irreducible over $\mathbb{Q}$: its discriminant is $4m(m-1)$, and the product of the coprime consecutive integers $m$ and $m-1$ cannot be a square unless both are squares, which is impossible for consecutive positive squares beyond $0,1$.

The height-Mahler measure formula givesBoth algebraic conjugates of ${\alpha }_m+1$ exceed $1$, soConsequentlyFix, for example, $\delta =1/10$. For all sufficiently large $m$, the ratio is larger than $1+\delta$ by a fixed margin, while $H({\alpha }_m)\to \infty$. Hence, for every $C>0$, some sufficiently large $m$ satisfies

If $f$ is an irreducible polynomial over a field $F$, then a nonzero residue $[g]$ modulo $(f)$ has $\gcd (f,g)=1$. The Euclidean algorithm supplies $uf+vg=1$, giving inverse $[v]$ for $[g]$. Thus the quotient ring $F[X]/(f)$ is a field. If $\mathrm{deg}f=d$ and $F$ has $q$ elements, polynomial division supplies exactly $q^d$ residue classes.