Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  



























Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Statement  





2 Proof  





3 See also  





4 References  





5 Further reading  














Slutsky's theorem






Deutsch
Español
Français
Italiano
עברית
Polski
Русский
Suomi
Türkçe
Українська

 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 


















From Wikipedia, the free encyclopedia
 


Inprobability theory, Slutsky's theorem extends some properties of algebraic operations on convergent sequencesofreal numbers to sequences of random variables.[1]

The theorem was named after Eugen Slutsky.[2] Slutsky's theorem is also attributed to Harald Cramér.[3]

Statement[edit]

Let be sequences of scalar/vector/matrix random elements. If converges in distribution to a random element and converges in probability to a constant , then

where denotes convergence in distribution.

Notes:

  1. The requirement that Yn converges to a constant is important — if it were to converge to a non-degenerate random variable, the theorem would be no longer valid. For example, let and . The sum for all values of n. Moreover, , but does not converge in distribution to , where , , and and are independent.[4]
  2. The theorem remains valid if we replace all convergences in distribution with convergences in probability.

Proof[edit]

This theorem follows from the fact that if Xn converges in distribution to X and Yn converges in probability to a constant c, then the joint vector (Xn, Yn) converges in distribution to (Xc) (see here).

Next we apply the continuous mapping theorem, recognizing the functions g(x,y) = x + y, g(x,y) = xy, and g(x,y) = x y−1 are continuous (for the last function to be continuous, y has to be invertible).

See also[edit]

References[edit]

  1. ^ Goldberger, Arthur S. (1964). Econometric Theory. New York: Wiley. pp. 117–120.
  • ^ Slutsky, E. (1925). "Über stochastische Asymptoten und Grenzwerte". Metron (in German). 5 (3): 3–89. JFM 51.0380.03.
  • ^ Slutsky's theorem is also called Cramér's theorem according to Remark 11.1 (page 249) of Gut, Allan (2005). Probability: a graduate course. Springer-Verlag. ISBN 0-387-22833-0.
  • ^ See Zeng, Donglin (Fall 2018). "Large Sample Theory of Random Variables (lecture slides)" (PDF). Advanced Probability and Statistical Inference I (BIOS 760). University of North Carolina at Chapel Hill. Slide 59.
  • Further reading[edit]


    Retrieved from "https://en.wikipedia.org/w/index.php?title=Slutsky%27s_theorem&oldid=1186968185"

    Categories: 
    Asymptotic theory (statistics)
    Probability theorems
    Theorems in statistics
    Hidden categories: 
    CS1 German-language sources (de)
    Articles with short description
    Short description matches Wikidata
     



    This page was last edited on 26 November 2023, at 16:44 (UTC).

    Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Mobile view



    Wikimedia Foundation
    Powered by MediaWiki