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.
Bernoulli root laws are uniformly close in Levy–Prokhorov distance
Statement
For and , let be the law of where are IID Bernoulli. For every , where is the Levy–Prokhorov metric. The bound is uniform in the sample size and choice-free.
Facts & Assumptions
Given: Integers , , and the laws .
Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials: A Bernoulli variable is with probability and otherwise; a binomial variable is a finite sum of independent Bernoulli variables.
A Bernoulli variable has mean and variance ; a binomial variable has mean and variance : A binomial variable has mean and variance , including .
Chebyshev's inequality for random variables: For a square-integrable real random variable and , .
Levy prokhorov metric: The Levy–Prokhorov distance is the infimum of radii for which both closed-set inequalities and hold for every closed .
Proof
Given: The integers, parameters, and laws in the statement.
If , the laws coincide. Suppose . For each , give probabilities at , at , at , and zero at , and take independent copies of this finite pair. Then , , and ; the pairs are independent across . Thus , whose mean is zero and whose variance, by [F2], is . If , interchange the two parameters and change the sign of the difference; its variance is .
Put and for . By [F3] and step 1.1, the coupling just constructed satisfies . For any closed set , the event is contained in , so . Interchanging and gives the reverse inequality. Hence is admissible in [F4], so the infimum defining is at most . For the laws coincide and their distance is zero by [F4]. This proves the bound for every endpoint case as well.
Depends on
Used by
Dependency tree · two levels
20 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
- J. P. Romano and A. M. Shaikh, On the Uniform Asymptotic Validity of Subsampling and the Bootstrap, §2.2, Example 2.1 (standard reference, not scraped)