Can $S_5$ be written as a multiple of $S_3$ and $S_2$?

  • MHB
  • Thread starter anemone
  • Start date
In summary, the given expression is equivalent to $S_n=x^n+y^n+z^n$ and $S_1=0$, which leads to $x+y+z=0$. From this, we can derive the equations $x^2+y^2+z^2=-2xy$ and $x^3+y^3+z^3=3xyz$. Using these equations, we then prove that $\dfrac{S_5}{5}=\dfrac{S_3}{3}\cdot\dfrac{S_2}{2}$ by manipulating $S_5$ and obtaining the desired equality.
  • #1
anemone
Gold Member
MHB
POTW Director
3,883
115
Let \(\displaystyle S_n=x^n+y^n+z^n\). If \(\displaystyle S_1=0\), prove that \(\displaystyle \frac{S_5}{5}=\frac{S_3}{3}\cdot\frac{S_2}{2}\).
 
Mathematics news on Phys.org
  • #2
Re: Prove S_5/5= S_3/3. S_2/2

My solution:

If we view $S_n$ as a recursive algorithm, we see that it must come from the characteristic equation:

\(\displaystyle (r-x)(r-y)(r-z)=0\)

\(\displaystyle r^3-(x+y+z)r^2+(xy+xz+yz)r-xyz=0\)

Since $x+y+z=S_1=0$, we obtain the following recursion:

\(\displaystyle S_{n+3}=-(xy+xz+yz)S_{n+1}+xyzS_{n}\)

Now, observing we may write:

\(\displaystyle (x+y+z)^2=x^2+y^2+z^2+2(xy+xz+yz)\)

\(\displaystyle 0=S_2+2(xy+xz+yz)\)

\(\displaystyle -(xy+xz+yz)=\frac{S_2}{2}\)

Also, we find:

\(\displaystyle (x+y+z)^3=-2\left(x^3+y^3+z^3 \right)+3\left(x^2+y^2+z^2 \right)(x+y+z)+6xyz\)

\(\displaystyle 0=-2S_3+6xyz\)

\(\displaystyle xyz=\frac{S^3}{3}\)

And so our recursion may be written:

\(\displaystyle S_{n+3}=\frac{S_2}{2}S_{n+1}+\frac{S_3}{3}S_{n}\)

Letting $n=2$, we then find:

\(\displaystyle S_{5}=\frac{S_2}{2}S_{3}+\frac{S_3}{3}S_{2}\)

\(\displaystyle S_{5}=\frac{5}{6}S_2S_{3}\)

\(\displaystyle \frac{S_5}{5}=\frac{S_3}{3}\cdot\frac{S_2}{2}\)

Shown as desired.
 
  • #3
Re: Prove S_5/5= S_3/3. S_2/2

MarkFL said:
My solution:

If we view $S_n$ as a recursive algorithm, we see that it must come from the characteristic equation:

\(\displaystyle (r-x)(r-y)(r-z)=0\)

\(\displaystyle r^3-(x+y+z)r^2+(xy+xz+yz)r-xyz=0\)

Since $x+y+z=S_1=0$, we obtain the following recursion:

\(\displaystyle S_{n+3}=-(xy+xz+yz)S_{n+1}+xyzS_{n}\)

Now, observing we may write:

\(\displaystyle (x+y+z)^2=x^2+y^2+z^2+2(xy+xz+yz)\)

\(\displaystyle 0=S_2+2(xy+xz+yz)\)

\(\displaystyle -(xy+xz+yz)=\frac{S_2}{2}\)

Also, we find:

\(\displaystyle (x+y+z)^3=-2\left(x^3+y^3+z^3 \right)+3\left(x^2+y^2+z^2 \right)(x+y+z)+6xyz\)

\(\displaystyle 0=-2S_3+6xyz\)

\(\displaystyle xyz=\frac{S^3}{3}\)

And so our recursion may be written:

\(\displaystyle S_{n+3}=\frac{S_2}{2}S_{n+1}+\frac{S_3}{3}S_{n}\)

Letting $n=2$, we then find:

\(\displaystyle S_{5}=\frac{S_2}{2}S_{3}+\frac{S_3}{3}S_{2}\)

\(\displaystyle S_{5}=\frac{5}{6}S_2S_{3}\)

\(\displaystyle \frac{S_5}{5}=\frac{S_3}{3}\cdot\frac{S_2}{2}\)

Shown as desired.

Thanks for participating, MarkFL! And your method is neat and elegant!

We are given $S_n=x^n+y^n+z^n$ and $S_1=0$ which implies $x+y+z=0$.

From this given information we then have

1.2.
$\small(x+y+z)^2=x^2+y^2+z^2+2(xy+yz+xz)$

$0=x^2+y^2+z^2+2(xy+yz+xz)$

$x^2+y^2+z^2=-2(xy+yz+xz)$

$x^2+y^2+z^2=-2(xy+z(x+y))$

$x^2+y^2+z^2=-2xy-2z(-z)$

$x^2+y^2-z^2=-2xy$

$xy=-\left(\dfrac{x^2+y^2-z^2}{2} \right)$
$\small(x+y+z)^3=x^3+y^3+z^3+3(xy(x+y)+yz(y+z)+xz(x+z))+6xyz$

$0=x^3+y^3+z^3+3(xy(-z)+yz(-x)+xz(-y))+6xyz$

$0=x^3+y^3+z^3+3(xy(-z)+yz(-x)+xz(-y))+6xyz$

$x^3+y^3+z^3=3xyz$

We're asked to prove $\dfrac{S_5}{5}=\dfrac{S_3}{3}\cdot\dfrac{S_2}{2}$.

We see that

$S_5=x^5+y^5+z^5$

$\;\;\;\;\;=x^5+y^5+(-x-y)^5$

$\;\;\;\;\;=x^5+y^5-(x+y)^5$

$\;\;\;\;\;=x^5+y^5-(x^5+5x^4y+10x^3y^3+10x^2y^3+5xy^4+y^5)$

$\;\;\;\;\;=-(5x^4y+10x^3y^3+10x^2y^3+5xy^4)$

$\;\;\;\;\;=-(5xy(x^3+y^3)+10x^2y^2(x+y))$

$\;\;\;\;\;=-5xy((x^3+y^3)+2xy(x+y))$

$\;\;\;\;\;=-5xy((x+y)(x^2-xy+y^2)+2xy(x+y))$

$\;\;\;\;\;=-5xy((x+y)(x^2-xy+y^2+2xy))$

$\;\;\;\;\;=-5xy((x+y)(x^2+xy+y^2))$

$\;\;\;\;\;=-5\left(\dfrac{(x^3+y^3+z^3}{3z} \right)(-z)(x^2-\left(\dfrac{x^2+y^2-z^2}{2} \right)+y^2))$

$\;\;\;\;\;=5\left(\dfrac{x^3+y^3+z^3}{3} \right)\left(\dfrac{x^2+y^2+z^2}{2} \right)$

and therefore we obtain

$\dfrac{S_5}{5}=\dfrac{S_3}{3}\cdot\dfrac{S_2}{2}$ and we're done.(Emo)
 

FAQ: Can $S_5$ be written as a multiple of $S_3$ and $S_2$?

1. How do you prove that S_5/5 is equal to S_3/3·S_2/2?

To prove this statement, we can use the definition of sets and the properties of cardinality. Firstly, we need to show that the sets S_5/5 and S_3/3·S_2/2 have the same number of elements. This can be done by showing that there is a bijection (one-to-one and onto mapping) between the elements of the two sets. This can be achieved by defining a function that maps each element of S_5/5 to a unique element in S_3/3·S_2/2 and vice versa. Since the function is both one-to-one and onto, it proves that the two sets have the same number of elements, thus proving that S_5/5 = S_3/3·S_2/2.

2. What are the properties of cardinality that are used in the proof?

The properties of cardinality used in the proof are the fact that if two sets have the same number of elements, then they are equal, and the fact that the cardinality of a Cartesian product of two sets is equal to the product of their individual cardinalities. In this case, we are using the fact that S_3/3·S_2/2 is a Cartesian product of two sets, S_3/3 and S_2/2, and thus its cardinality is equal to the product of their cardinalities.

3. What is the significance of the notation "S_5/5" and "S_3/3·S_2/2"?

The notation "S_5/5" represents the set of all permutations of a set with 5 elements, where each permutation has a cycle length of 5. Similarly, "S_3/3·S_2/2" represents the set of all permutations of a set with 5 elements, where each permutation has a cycle length of 3 and 2. So, the notation represents the specific type of permutations in each set.

4. Can this statement be generalized to other sets?

Yes, this statement can be generalized to other sets. In fact, it can be generalized to any two sets S_m/m and S_n/n, where m and n are positive integers. The proof would follow the same logic, where we would need to show that there is a bijection between the elements of the two sets, thus proving that S_m/m = S_n/n.

5. What are the applications of this proof in mathematics?

This proof has many applications in mathematics, particularly in the study of group theory and symmetric groups. It also has applications in combinatorics, as it can be used to count the number of different ways a set can be permuted, given certain conditions on the length of the cycles. Additionally, this proof can be used to prove other theorems and statements in mathematics, where the concept of bijection and cardinality is involved.

Back
Top