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.
Size-n bootstrap from the empirical law
Definition
Input. Let , let be the declared measurable space of sampling units, and fix the observed ordered tuple . Let be its empirical probability measure from Empirical measure of observed units and The empirical measure is a probability measure. Declare a sample sigma-algebra on the ordered tuple space and provide a statistic , where is finite and is the declared target sigma-algebra; "statistic" has the measurable-map meaning in Statistics and estimators.
Write for the indexing set.
Procedure. Draw indices independently and uniformly from , so repeated indices are allowed. Set for . Return the bootstrap tuple and the replicate . Generate further replicates by repeating the index draws with fresh randomness. These are resampling units only when the tuple entries satisfy the unit contract in Sampling units and the resampling-unit contract.
The conditional IID law of the draws is proved in Empirical-law bootstrap draws are conditionally IID ↗. This algorithm does not claim that its conditional law consistently approximates any sampling law; such validity requires separate hypotheses and a separate theorem.
Depends on
- Sampling units and the resampling-unit contract
- Empirical measure of observed units
- The empirical measure is a probability measure
- Identical distribution and IID families
- Statistics and estimators
- Finite probability spaces, outcome weights, events, and event probabilities
- The set $A^{B}$ of functions $B \to A$ between finite sets is finite, with $\lvert A^{B}\rvert = \lvert A\rvert^{\lvert B\rvert}$
Used by
- Pointwise bootstrap need not preserve pair dependence Counterexample
- Assignment randomization and bootstrap are different laws Example
- Resampling complete cluster records Example
- Sampling and finite-bootstrap errors for a Bernoulli mean Example
- The bootstrap law of a two-point sample mean Example
- Empirical-law bootstrap draws are conditionally IID Theorem
Dependency tree · two levels
30 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
- Bradley Efron and Robert Tibshirani, The Bootstrap Method for Assessing Statistical Accuracy, Behaviormetrika 12 (1985), §§1–3, printed pp. 1–12 (standard reference, not scraped)
- B. Efron and R. Tibshirani, The Bootstrap Method for Assessing Statistical Accuracy, Stanford LCS Technical Report 19 / BIO 101 (October 1985; full-text report copy) (standard reference, not scraped)
- P.J. Bickel, F. Götze and W.R. van Zwet, Resampling Fewer Than n Observations, Statistica Sinica 7 (1997), §§1–3, printed pp. 1–11 (standard reference, not scraped)
- P.B. Stark, Statistics 240 Lecture Notes, Part 8: Resampling Methods, §1.1, PDF pp. 2–3 (standard reference, not scraped)