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.
m-out-of-n bootstrap and subsampling
Definition
Let be an integer, let be a measurable observation space, let be a probability law on it, and let be IID -distributed sampling units (Identical distribution and IID families). For each , let be a measurable real-valued statistic and write ; the target is a scalar and is its declared normalization at sample size . The empirical law is a probability law by A finite empirical measure is a probability law.
For an integer , the m-out-of-n bootstrap draws conditionally IID from and computes The conditional distribution of this root given the observed sample is the bootstrap approximation. The ordinary n-out-of-n bootstrap is the case and uses .
For , subsampling without replacement chooses a subset uniformly from the subsets of and computes Its conditional law is the uniform distribution over those subsets. With replacement and without replacement are distinct conditional laws, even though both use the same declared statistic .
The asymptotic regime considered on this page has integer and . The resampled root uses the actual size- scale ; validity does not follow merely from this regime. For inference based on a centered root, the scale ratio is an additional root-specific centering condition when it is used. A design with dependent sampling units requires a separate design-matched resampling procedure. This definition does not identify a bootstrap law with a Bayesian posterior or a design-randomization law. Extrapolation from several resample sizes is not asserted here; it requires a separate proof of the source-specific regular expansion and remainder regime.
Depends on
Used by
- Absolute-value boundary and squared-mean degeneracy Example
- Uniform endpoint: ordinary bootstrap failure and the m-out-of-n remedy Example
- Weakly close root laws can still give failed uniform coverage Example
- m-out-of-n bootstrap and subsampling recover the uniform endpoint root Theorem
- Ordinary bootstrap failure for a uniform support endpoint Theorem
- Ordinary bootstrap failure for nonsmooth and first-order-degenerate mean functionals Theorem
- Uniform subsampling coverage under root-law control Theorem
Dependency tree · two levels
10 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
- P. J. Bickel, F. Götze, and W. R. van Zwet, Resampling Fewer Than n Observations: Gains, Losses, and Remedies for Losses, §3 (standard reference, not scraped)
- Ryan Martin, Stat 451 Lecture Notes 0812: Bootstrap, pp. 27–30 (standard reference, not scraped)