00:01
The key idea to this question is that the shifted partial sum operator and the, so this is a partial sum operator, and the standard partial sum operator right here, are related by a simple frequency shift.
00:27
And this frequency shift is realized by multiplying the function by a certain complex exponents.
00:35
Okay, so that is what is going on here.
00:43
Now, let's go forward here and let's just talk about that.
00:53
So starting with the operators involved, you want to quickly realize that the standard partial sum operator takes the first, you know, 2n plus 1 -4 -4 -rero.
01:16
Coefficients from negative n to n, reconstructing an approximation to f.
01:24
The shifted partial sum operator instead looks at the coefficients from negative n, shifted to indices 0 to 2n.
01:36
So why multiplication by exponentials? this is the next question.
01:42
Multiplying a function by an exponential like e to the imt shifts, the fourier coefficients by m.
01:53
Now, this fundamental property from fourier analysis, the modulation in time, corresponds to the frequency shift.
02:05
So if you set up the problem such a way, if you multiply f by e to the i -n -t, like right here, do that multiplication here, what you get is that this is going to be, m negative nf.
02:25
This is not right at well.
02:28
So that's what you get here...