theorem A.206 Cramér–Wold, and continuous mapping

open in the book · appendices/A-long-proofs.tex:10473 · p. 2892

Rests on

Supports

Neighborhood

Every logical edge within two steps of this node.

theorem A.206: Cramér–Wold, and continuous mappingA.206definition 11.21: Distribution function11.21lemma 11.52: Slutsky11.52lemma A.208: The three averagesA.208theorem A.214: Wilks, k parameters and r constraintsA.214definition 11.20: Density11.20definition A.174: TightnessA.174proposition 11.22: Properties of the distribution function11.22theorem A.168: Lévy's continuity theoremA.168theorem A.173: Helly's selection theoremA.173theorem 11.67: Asymptotics of the MLE11.67theorem 11.88: Wilks11.88proof : ch:09-probability-statistics@proof-20proofproof : ch:09-probability-statistics@proof-21prooflemma 11.61: Score identities11.61theorem A.205: Weak law under integrability aloneA.205corollary A.210: Uniform quadratic approximation on the n^-1/2 scaleA.210lemma A.211: Root-n localisationA.211proof : app:A-long-proofs@proof-126prooflemma A.213: The three minimaA.213lemma 11.83: Gaussian quadratic forms11.83proof : app:A-long-proofs@proof-132proof

Edges

typedirectionnode provenancewhere
cites Probability and Measure derived appendices/A-long-proofs.tex:10482
depends_on Distribution function declared appendices/A-long-proofs.tex:10483
depends_on Slutsky declared appendices/A-long-proofs.tex:10483
depends_on The three averages declared appendices/A-long-proofs.tex:10514
depends_on Wilks, $k$ parameters and $r$ constraints declared appendices/A-long-proofs.tex:10914