(1-L)^{-1} or any function of L isn't actually a polynomial function in L. But it will behave the same way, if you take (1-L)Y_t=e_t and keep recursing back, it will expand out the same. Y_t=Y_{t-1}+e_t can be expressed as all past lags going back forever, which in lag operator form is (1+L+L^2+...)e_t
really good stuff. thanks for your work
Thank you, I am glad that you found it useful.
Very useful lecture.
great work. Very helpful
Too good. Thank you very much sir
Thanks a lot! great and clear teaching!
Super explanation.
This is fantastic. Thank you!
17:49, you say (1-L)^-1 = 1 + L + L^2, but that geometric series doesn't converge like that since lambda_2 = 1.
(1-L)^{-1} or any function of L isn't actually a polynomial function in L. But it will behave the same way, if you take (1-L)Y_t=e_t and keep recursing back, it will expand out the same. Y_t=Y_{t-1}+e_t can be expressed as all past lags going back forever, which in lag operator form is (1+L+L^2+...)e_t
very clear and helpful!
Love you great stuff mate
Thanks bro for this Tutorial.
thank you!
missing the exciting part with complex roots.