Integrals of Polynomials with Galois Group S_p

Hacker News by 9 min read 162x views
Integrals of Polynomials with Galois Group S_p

Share Post

We now regard an arbitrary duration $[a,b]$ and fixed premier $p$, and again regard polynomials $f$ alongside $Gal(f) \cong S_p$. We ask whether there continually exists an $f$ specified that it integrates to $0$ on $[a,b]$, or equivalentely, if $0 \in \mathcal I_{a,b}(S_p)$? The following theorem shows that, no, this is not the case for every interval. Note the following applies to an abitrary collection $G$ thus additionally applies to $S_p$.

Suppose \[ f(x)\in\mathbb Q[x] \] and let \(F(x)\in\mathbb Q[x]\) be an antiderivative of \(f\). Then \[ \int_a^b f(x)\,dx=F(b)-F(a). \] Therefore, our circumstance is equal to \[ F(a)=F(b). \] Now choose an duration $[a,b]$ specified that that \(a\) and \(b\) are algebraically autonomous complete \(\mathbb Q\). By definition, this method that no nonzero polynomial \(P(X,Y)\in\mathbb Q[X,Y]\) satisfies \[ P(a,b)=0. \] But if our integral were zero, we would have \[ F(b)-F(a)=0. \] Consider the polynomial \[ P(X,Y)=F(Y)-F(X). \] Since \(F\) is nonconstant, \(P\) is a nonzero polynomial in \(\mathbb Q[X,Y]\). Thus, \[ P(a,b)=0 \] would refuse the algebraic independence of \(a\) and \(b\). Consequently, \[ \int_a^b f(x)\,dx\neq0 \] for all nonzero \(f\in\mathbb Q[x]\). So there be intervals for which zero cannot pertain to \(\mathcal I_{a,b}(G)\). $\blacksquare$

We now move on to an beingness inquiry and demonstrate our main result. We volition display that for all premier \(p\), there exist infinitely many monic, irreducible polynomials \(f\in\mathbb Q[x]\) of flat \(p\) specified that \[ \int_0^1 f(x)\,dx=0 \] and \[ \operatorname{Gal}(f/\mathbb Q)\cong S_p. \] The key is to regard the family \[ F_{p,t}(x)=x^p+tx-\frac1{p+1}-\frac t2. \] Here \(t\) is a parameter. First, detect that \[ \begin{aligned} \int_0^1 F_{p,t}(x)\,dx &=\frac1{p+1}+\frac t2-\frac1{p+1}-\frac t2\\ &=0. \end{aligned} \] Thus every logical specialization \(t\in\mathbb Q\) automatically satisfies the integral condition. We volition demonstrate that \[ \operatorname{Gal}(F_{p,t}/\mathbb Q(t))\cong S_p. \] We can afterward use Hilbert's irreducibility theorem to get infinitely many suitable logical values of \(t\). For the remainder of the proof, assume \(p\) is an odd prime. We volition grip \(p=2\) separately. We demonstrate a sequence of lemmas which volition guide to the final proof.

Lemma 1: $F_{p,t}(x)$ is irreducible.

\(F_{p,t}(x)\) is irreducible as a polynomial in \(x\) over the logical function site \(\mathbb Q(t)\), thus its Galois collection acts transitively on its p roots.

PROOF

Rewrite $F_{p,t}(x)$ as \[ F_{p,t}(x) = \underbrace{x^p-\frac1{p+1}}_{A(x)} + t\underbrace{\left(x-\frac12\right)}_{B(x)}. \] Notice that \[ \gcd(A(x),B(x))=1. \] Indeed, the lone base of \(B\) is \(1/2\), and \[ A(1/2)=\frac1{2^p}-\frac1{p+1}\neq0. \] Now suppose \(F_{p,t}\) has a non-trivial factorization in \(\mathbb Q[x,t]\). Since it has flat one in \(t\), one of its factors must be autonomous of \(t\). That aspect would have to divide the two \(A(x)\) and \(B(x)\). But their top average divisor is \(1\). Therefore \(F_{p,t}\) is irreducible in \(\mathbb Q[x,t]\). Since it is monic in \(x\), Gauss's lemma gives $F_{p,t}$ is irreducible complete $\mathbb Q(t)$. Consequently, its Galois collection acts transitively on its \(p\) roots. $\blacksquare$

Lemma 2: Galois Group contains a p-cycle

The permutation depiction of \(Gal(F_{p,t}/Q(t))\) acting on the p roots of $F_{p,t}(x)$ contains a p-cycle.

PROOF

We specialize $F_{p,t}(x)$ by letting \(t=0\). We get \[ F_{p,0}(x)=x^p-\frac1{p+1}. \] This polynomial is irreducible complete \(\mathbb Q\). To see this, use the binomial irreducibility criterion. Since \(p\) is prime, \(x^p-c\) is irreducible unless \(c\) is a \(p\)-th power in \(\mathbb Q\). Here, \[ c=\frac1{p+1} \] is not a logical \(p\)-th power. Thus its Galois collection acts transitively on its \(p\) roots [1]. By the orbit-stabilizer theorem, the command of this Galois collection is divisible by \(p\). Cauchy's theorem hence guarantees an component of command \(p\). Since we are permuting exactly \(p\) roots, this component must be a \(p\)-cycle. We can now use the specialization theorem for Galois groups, and because \(F_{p,0}\) is separable, its Galois collection embeds into the generic Galois collection (up to conjugacy). Therefore, \[ \operatorname{Gal}(F_{p,t}/\mathbb Q(t)) \text{ contains a }p\text{-cycle}. \] $\blacksquare$

Lemma 3: Galois Group contains a transposition

The permutation depiction of \(Gal(F_{p,t}/Q(t))\) acting on the p roots of $F_{p,t}(x)$ contains a transposition.

PROOF

Recall that \[ F_{p,t}(x)=x^p+tx-\frac1{p+1}-\frac t2. \] Think of the equation \(F_{p,t}(x)=0\) as defining \(t\) in conditions of \(x\): \[ t=\frac{x^p-\frac1{p+1}}{\frac12-x}. \] Define the logical function \[ R_p(x)=\frac{x^p-\frac1{p+1}}{\frac12-x}. \] The crucial points of this logical function are the roots of its derivative. By the quotient rule, \[ R_p'(x)= \frac{ \frac p2x^{p-1}-(p-1)x^p-\frac1{p+1} }{ (\frac12-x)^2 }. \] Let \[ D_p(x)= \frac p2x^{p-1}-(p-1)x^p-\frac1{p+1}. \] We volition show that there is a crucial value of \(R_p\) corresponding to exactly one crucial point, and that this crucial item is simple. That volition provision us a transposition.

Consider \(D_p(x)\) on the negative genuine axis. At zero, \[ D_p(0)=-\frac1{p+1} \lt 0. \] As \(x\to-\infty\), \[ D_p(x)\to+\infty. \] Furthermore, \[ D_p'(x) = p(p-1)x^{p-2}\left(\frac12-x\right). \] Since \(p\) is odd, \(p-2\) is odd. Thus, for \(x \lt 0\), \[ D_p'(x) \lt 0. \] Consequently, \(D_p\) is strictly decreasing on the negative genuine axis. By the intermediate value theorem, there is exactly one negative genuine figure \(r\) specified that \[ D_p(r)=0. \] Moreover, \[ D_p'(r)\neq0, \] so \(r\) is a uncomplicated base of \(D_p\).

This is the key observation. Since \(r\) is a crucial point, the derivative of \(F_{p,t}\) alongside regard to \(x\) vanishes whenever \(x=r\): \[ \frac{\partial F_{p,t}}{\partial x} = px^{p-1}+t. \] Therefore, the corresponding indicator value is \[ t_0=-pr^{p-1}. \] Now assume there were another critical item \(s\) corresponding to the identical value \(t_0\). Then \[ -ps^{p-1}=-pr^{p-1}, \] which gives \[ s^{p-1}=r^{p-1}. \] Hence we can compose \[ s=\zeta r, \qquad \zeta^{p-1}=1. \] Both \(r\) and \(s\) are roots of \(D_p\). Subtracting their defining equations gives \[ 0=D_p(s)-D_p(r). \] Because \(s^{p-1}=r^{p-1}\), \[ 0=-(p-1)r^p(\zeta^p-1). \] But \[ \zeta^p=\zeta \] since \(\zeta^{p-1}=1\). Therefore, \[ \zeta=1, \] and hence \[ s=r. \] We have proved that \(r\) is the lone crucial item lying complete the crucial value \(t_0\).

At \(t=t_0\), the polynomial \(F_{p,t_0}(x)\) has a repeated base at \(x=r\). The repeated base has multiplicity exactly two since \[ \frac{\partial^2 F_{p,t}}{\partial x^2} = p(p-1)x^{p-2}, \] which is nonzero at \(r\). All another roots are simple, since we have shown that no another crucial item lies complete \(t_0\). Thus, as the indicator \(t\) moves about \(t_0\) in the complex plane, exactly two roots toggle places while all the another roots come back to their first positions. Thus, the polynomial has uncomplicated ramification at $t_0$. Its corresponding monodromy permutation is a transposition. In Galois-theoretic language, the inertia collection at this branch item contains a transposition. Therefore, \[ \operatorname{Gal}(F_{p,t}/\mathbb Q(t)) \text{ contains a transposition}. \] $\blacksquare$

Lemma 4: $G = S_p$

Let \(p\) be prime. Any subgroup \(G\leq S_p\) containing a \(p\)-cycle and a transposition is equal to \(S_p\).

PROOF

Without defeat of generality, compose \[ \sigma=(0\ 1\ 2\ \cdots\ p-1) \] and assume \[ \tau=(i\ j). \] Conjugating \(\tau\) by powers of \(\sigma\), we get \[ \sigma^k\tau\sigma^{-k} = (i+k\quad j+k), \] anywhere the indices are taken modulo \(p\). Let \[ d=j-i\not\equiv0\pmod p. \] The resulting transpositions equivalent to edges \[ \{k,k+d\} \] in a chart whose vertices are the elements of \(\mathbb Z/p\mathbb Z\). Because \(p\) is premier and \(d\neq0\), we have \[ \gcd(d,p)=1. \] Consequently, this chart is connected, so often adding \(d\) eventually visits all component of \(\mathbb Z/p\mathbb Z\). A standard fact concerning permutation groups is that the transpositions corresponding to the edges of a connected chart create the complete symmetric collection on its vertices. Thus, \[ \langle \sigma,\tau\rangle=S_p. \] Since the two \(\sigma\) and \(\tau\) pertain to \(G\), \[ S_p\subseteq G. \] But \(G\leq S_p\), so \[ G=S_p \] This proves the lemma. $\blacksquare$

Theorem: Polynomials satisfying Zero Integral Condition

For all premier \(p\), there be infinitely many monic, irreducible polynomials \(f\in\mathbb Q[x]\) of flat \(p\) specified that \[ \int_0^1 f(x)\,dx=0 \] and \[ \operatorname{Gal}(f/\mathbb Q)\cong S_p. \]

PROOF

Combining the preceding results, we have shown that \[ G=\operatorname{Gal}(F_{p,t}/\mathbb Q(t)) \] contains a \(p\)-cycle and a transposition. Lemma 4 hence gives \[ \operatorname{Gal}(F_{p,t}/\mathbb Q(t))=S_p. \]

We have established that the generic polynomial \[ F_{p,t}(x)=x^p+tx-\frac1{p+1}-\frac t2 \] has Galois group \(S_p\) complete \(\mathbb Q(t)\). Now we invoke Hilbert's irreducibility theorem. In the form we need, the theorem says that if a polynomial complete \(\mathbb Q(t)\) is irreducible and has Galois collection \(G\), afterward there are infinitely many rational specializations of \(t\) for which the specialized polynomial retains the identical Galois group. Consequently, there are infinitely many \(t_0\in\mathbb Q\) specified that \[ \operatorname{Gal}(F_{p,t_0}/\mathbb Q)=S_p. \] For all such specialization, \[ \int_0^1 F_{p,t_0}(x)\,dx=0. \] Furthermore, the polynomial is monic, irreducible, and has flat \(p\). This establishes the theorem for odd primes. For \(p=2\), the same family is irreducible complete \(\mathbb Q(t)\), and a generic irreducible quadratic automatically has Galois collection \(S_2\). Hilbert irreducibility hence gives the outcome in this case as well. $\blacksquare$

Other Article Hacker News
↑
Close Right Ads
Close Left Ads