Need help in explaining the calculation of n-th power of a summation

AI Thread Summary
The discussion focuses on understanding the transformation of a summation raised to the n-th power in a mathematical equation. The original equation involves a summation of terms multiplied by a function and an exponential factor. The transformation shows that raising the summation to the n-th power results in a product of multiple sums, each corresponding to the individual terms in the original summation. The explanation clarifies how the coefficients and functions are distributed across the new summation structure. This breakdown helps in comprehending the mathematical manipulation involved in the transition between the two forms.
duranta23
Messages
2
Reaction score
0
Hi

I got to the following equation while going through a book. I can't figure out how the second line comes from the first. Can anyone please help me understand?

(1/2*\sum_{q=-Q}^Q V_s,q .H(w_q) .exp(iw_q t))^n is written as,

1/2^n * \sum_{q1=-Q}^Q \sum_{q2=-Q}^Q ... \sum_{qn=-Q}^Q V_s,q1 . V_s,q2 ... V_s,qn .H(w_q1).H(w_q2)...H(w_qn).exp(i(w_q1 +w_q2 +...w_qn).t)

Please forgive my poor latex style writing.
 
Mathematics news on Phys.org
Well, I can forgive it, but unfortunately I can't read it.
 
(1/2*\sum_{q=-Q}^Q V_{s,q} .H(w_q) .exp(iw_q t))^n

is written as,

1/2^n * \sum_{q_1=-Q}^Q \sum_{q_2=-Q}^Q ... \sum_{q_n=-Q}^Q V_{s,q_1} . V_{s,q_2} ... V_{s,q_n} .H(w_{q_1}).H(w_{q_2})...H(w_{q_n}).exp(i(w_{q_1} +w_{q_2} +...w_{q_n}).t)

The above is hopefully closer. I don't know if its just me, but I see quite a few posts with unprocessed Latex.
 
Last edited:
And if you have

(A\sum_{i=r}^s a_i)^n=A^n(a_r+a_{r+1}\dots a_s)(a_r+a_{r+1}\dots a_s)\dots (a_r+a_{r+1}\dots a_s)\text{ (to }n\text{ factors})

you get

A^n(\Sigma a_{i_1}a_{i_2}\dots a_{i_n}})

where the sum on the second line runs through all different ways of selecting each a_{i_k} from the corresponding bracket on the rhs of the first line.

This can be written as

A^n\sum_{i_1=r}^s\sum_{i_2=r}^s\dots \sum_{i_n=r}^s a_{i_1}a_{i_2}\dots a_{i_n}}

and as the indices run from r to s in each of the multiple sums, all ways of selecting a_{i_1}a_{i_2}\dots a_{i_n} will occur exactly once.

With appropriate values inserted from your example this gives you the transition between the first and second lines.
 
Makes Perfect sense. Thank you so much for the explanation :D and special thanks for forgiving my latex :P
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Back
Top