6
$\begingroup$

Try to solve this system of equations:

$$ S_1=x_1+\dots+x_n=a;\\ S_2=x_1^2+\dots+x_n^2=a;\\ {}\cdots\\ S_n=x_1^n+\dots+x_n^n=a; $$ And find the value of $S_{n+1}=x_1^{n+1}+\dots+x_n^{n+1},a\in\mathbb{C}.$

Now, by using Newton's identities I have find that $$\sigma_1=\sum x_i= a,\quad \sigma_2=\sum _{1\le j<k\le n}x_{j}x_{k}=\frac{a(a-1)}{2},\dots,\\\sigma_n=x_1x_2\dots x_n=\frac{(a-n+1)(a-n+2)\dots21}{n!}$$ So $x_1,x_2,\dots,x_n$ satisfy this equation:$$x^n-\sigma_1x^{n-1}+\sigma_2x^{n-1}+\dots+(-1)^n\sigma_n=0$$ But I can't figure out what each $x_i$ is, so can I find explicit solutions? I'm able to find $S_{n+1}$ for the second part of the question. The only difficulty is to find the explicit of each $x_i(i=1,2 ,\dots , n).$

$\endgroup$
5
  • $\begingroup$ Are you sure about the formula for $\sigma_n$? Shouldn't the first factor be $a$, too? $\endgroup$ Commented Nov 6, 2023 at 14:33
  • $\begingroup$ Sorry, maybe I don't give a clear definition of $\sigma_i$ $\endgroup$
    – Er Bu
    Commented Nov 6, 2023 at 14:48
  • $\begingroup$ I have seen the definition, but still I think there is something wrong in the formula for $\sigma_n$. For instance, how many factors are there in the numerator if $a$ is not a positive integer? Say, $a=-1$ or $a = 1+i$? $\endgroup$ Commented Nov 6, 2023 at 15:01
  • $\begingroup$ I think if $n=3$,$S_4$ doesn't have solutions for all algebraic $a$, only for $a$ root of $a^4 - 6*a^3 + 11*a^2 - 6*a=0$. $\endgroup$
    – joro
    Commented Nov 6, 2023 at 15:39
  • $\begingroup$ Btw, really it should be Girard-Newton formulas, to give credit where credit is due. :) $\endgroup$ Commented Nov 7, 2023 at 19:04

2 Answers 2

9
$\begingroup$

Consider $a$ as a transcendental over $\mathbb C$. Then each $x_i$ generates an extension of $\mathbb C(a)$ of degree $n$ whose Galois closure has Galois group the symmetric group $S_n$. Thus once $n\ge5$, you cannot solve for the $x_i$'s in terms of $a$ by radicals.

$\endgroup$
0
$\begingroup$

Hilarious little detail: the OP assumes that $a\in\mathbb{C}$.

One may wonder if the system is solvable by radicals; then it is easier to assume that $a\in\mathbb{Q}$.

Always there exists a unique -up to order- solution $(x_i)_i$ . Let $p$ be the required polynomial of degree $n$ whose root are the $x_i$'s.

$\textbf{Question.}$ Is there a rational $a$ such that $p$ is irreducible over $\mathbb{Q}$ and solvable by radicals?

The answer is not obvious.

For example, assume that $n=5$. Then, if $a$ is an integer in $[[-10^5,10^5]]$, then $galois(p)=S_5$ except when $a\in [[-1,6]]$, where $p$ is reducible.

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .