How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Stochastic order and convergence notation for finite-dimensional random vectors
Definition
For each positive integer , let be a probability space and let be measurable into the Borel sigma-algebra generated by the Euclidean open sets, where is fixed and has the Euclidean norm (Euclidean spheres and closed balls as subspaces of , Random elements and real random variables, Probability measures and probability spaces). The spaces and measures may depend on ; no common probability space is required.
Write if for every , Write , or say that is bounded in probability, if for every there is such that For real-valued variables on one common probability space, is convergence in probability to zero as defined in Convergence in probability.
The norms and tail probabilities are part of the definition. Independence is not implicit in either notation.
Depends on
Used by
- A simple population eigengap gives root-n sample PCA eigenspace consistency Corollary
- M-estimators Definition
- Z-estimators Definition
- A degenerate weak limit with persistent expectation Example
- A tight factor times a vanishing factor Example
- An empty risk set prevents root-n tightness Example
- Cox score martingale representation and random-risk-mean replacement Lemma
- Uniform Cox partial-likelihood Hessian convergence Lemma
- A consistent approximate MLE has the misspecified sandwich limit under local LAN conditions Theorem
- A local KL expansion and square-integrable log-Lipschitz envelope give misspecified iid LAN Theorem
- Asymptotic linearity and normality of a regular MLE Theorem
- Asymptotic linearity and normality of iid Z-estimators Theorem
- Compact-uniform LAN and rate contraction imply a total-variation BvM limit Theorem
- Consistency of M-estimators under a uniform law Theorem
- Consistency of Z-estimators under a uniform law Theorem
- Cox partial-likelihood score expansion and estimator linearization Theorem
- Finite-dimensional stochastic-order calculus and tightness Theorem
- Finite-fourth-moment root-n consistency of sample-centered covariance Theorem
- First- and second-order delta method for random vectors Theorem
- IID terminal influence limit from a separately established expansion Theorem
- Independent-group terminal influence limit Theorem
- Misspecified M-estimator sandwich limit Theorem
- Terminal normal limit for weighted logrank scores Theorem
- The Gaussian covariance likelihood ratio has its fixed-dimensional Wilks limit Theorem
- Vector Slutsky theorem Theorem
- Wald, score, and likelihood-ratio asymptotic chi-square calibration Theorem
Dependency tree · two levels
13 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 16, PDF pp. 9–12 (standard reference, not scraped)
- John Duchi, Theory of Statistics, Stats 300B Lecture 2, Winter 2018, PDF pp. 1–3 (standard reference, not scraped)