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.
Conditional weak convergence in probability
Definition
Let be a separable complete metric space, let be the sigma-algebra generated by the observed data at sample size , and let be a bootstrap random element whose remaining randomness is the resampling randomization. Write for its conditional Borel probability law given . Supply as part of the data a metric on Borel probability measures on such that exactly when in the sense of Weak convergence of borel probability measures. Assume the displayed metric distance is a measurable real random variable. For a fixed Borel probability measure on , we say that converges conditionally weakly in probability to when
The metric is supplied as a hypothesis; this definition makes no metric-existence assertion. It applies to separable complete metric spaces, including separable Banach spaces, their closed linear subspaces and finite products.
Remarks
The conditioning fixes the observations and averages only over bootstrap randomization. A conditional limit in probability is not an assertion of almost-sure conditional convergence.
Depends on
Used by
- Conditional CLT for independent resampled weighted blocks Lemma
- Conditional bootstrap delta method for Hadamard differentiable maps Theorem
- Conditional K-sample block-bootstrap validity under a joint CLT Theorem
- Moving block bootstrap CLT for dependent Hilbert-valued data Theorem
- Tapered block bootstrap CLT for dependent Hilbert-valued data Theorem
Dependency tree · two levels
5 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.