Limit of Sample ACF for X_t = cos(wt)

  • Thread starter Thread starter SpringPhysics
  • Start date Start date
  • Tags Tags
    Limit
SpringPhysics
Messages
104
Reaction score
0

Homework Statement


Show that the sample acf at lag h for n observations of xt = cos(wt) converges to cos(wh) as n tends to infinity.

Homework Equations


The sample acf at lag h is defined as the sample autocovariance function at lag h divided by the sample autocovariance function at lag 0, where the sample autocovariance function at lag h is defined as:

acvf(h) = \sumt=1n-|h|(xt+|h| - \overline{x})(xt - \overline{x})

Here, \overline{x} is the sample mean of the n observations.


The Attempt at a Solution


A previous question asked to show something similar for xt = a + bt, so what I did there was just substitute everything in (everything works out nicely because there are formulas for summing integers and squares from 1 to n).

I attempted to do the same:

xt - \overline{x} = cos(wt) - 1/n \sums=1n cos(ws)


xt+h - \overline{x} = cos(wt + wh) - 1/n \sums=1n cos(ws)

So then the numerator of acvf(h) becomes:
\sumt=1n-|h|(cos(wt)cos(wt+wh) - 1/n cos(wt+wh)\sums=1n cos(ws) - 1/n cos(wt) \sums=1n cos(ws) + 1/n2 \sums=1n \sumr=1n cos(ws)cos(wr))

And the denominator of acvf(h) becomes:
\sumt=1ncos(wt)cos(wt) - 1/n \sums=1n \sumr=1n cos(ws)cos(wr)

And at this point, I have no idea how to evaluate the cosine sums to find the limit as n goes to infinity of the fraction. I attempted to convert the cosines to exponentials by Euler's formula but I ended up with more terms that were even messier.

Any help would be appreciated, even just some starting point or confirmation that some particular method works, and I'll try to grind through it again. Thanks.
 
Physics news on Phys.org
UPDATE: I solved the problem using exponentials (a bit tedious but it worked). This thread can be closed now.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top