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.
ANOVA variance identity for nestedly scrambled point sets
Statement
Assume Countable Choice. Let be fixed and let be their nested uniform scramble in base . For and , define For real Borel , write . Then with the ANOVA components of Base- Haar contrasts and multiresolution ANOVA components.
Facts & Assumptions
Given: Countable Choice, the fixed input points, their nested uniform scramble, and real .
Nested uniform scrambling of a finite point set: At each input-prefix node, all points use the same uniform permutation, and distinct nodes and coordinates use independent permutations.
Base- Haar contrasts and multiresolution ANOVA components: The normalized contrasts are supported on one parent, are constant on its children, and have zero mean on the parent.
Orthogonal base- multiresolution and variance decomposition: The contrast products form a complete orthonormal decomposition and .
Nested uniform scrambles preserve net counts and uniform marginals: Every scrambled point of a -net has uniform law on the cube.
Moments, variance, and covariance on a probability space: Variance is the centered second moment of a square-integrable real variable.
Change of variables for expectation: Expectations of integrable Borel functions of a random element are integrals against its law; the nonnegative case also holds for extended integrals.
The Lebesgue integral is linear on : Expectation is linear on integrable real random variables.
Expectations factor over finite products of independent random variables: Integrable functions of independent random variables have factored product expectation.
-nets in base : A -net has one point, and the only elementary interval of total depth zero is the whole cube.
The Axiom of Countable Choice (): Countable Choice is the axiom used by [F3].
Proof
Given: The facts above and the estimator in the Statement.
For a contrast label , its normalized child vector is . These vectors have coordinate sum zero and : if , the nonzero entries of meet entries equal to in and sum to ; if , the squared norm is . In a fixed coordinate , consider . If , condition on all permutations used by these two factors except the one at the length- input prefix of . The coarse factor and both output parent locations are then fixed, while the finer output child is uniform, so the conditional product expectation is zero. The case is symmetric. At equal levels with distinct input parents, condition on the preceding prefix permutations; the two independent next-node permutations give mean-zero child factors, hence zero expected product. With a common input parent, both points have the same output parent, so distinct output translation indices give zero product. For a common parent at level , its output parent is uniform among the parents. If the two points use the same next child, the expectation of the product is . If they use distinct next children, their ordered output children are uniform among the distinct pairs; since , Thus, for a common parent at equal levels, the coordinate covariance is ; the zero cases above cover all other level or parent pairs.
Scrambling is independent across coordinates. Therefore products from distinct coordinate subsets have zero cross expectation, since a coordinate appearing in only one product contributes a mean-zero contrast independent of the other coordinates; [F8] factors that expectation across coordinates. For a common subset and scale, step 1.1 leaves only identical parent and contrast indices; multiplying the coordinate expectations gives . Summing squared coefficients over the parent and contrast indices gives by [F3].
For each , the singleton is a -net by [F9]. Using the same node permutations as in the full array gives exactly as its scrambled point by [F1], so [F4] gives without a net assumption on the full array. For any finite ANOVA sum with constant coefficient , each nonconstant basis product consequently has mean zero under each by [F2] and [F6]. Expanding its centered variance and using [F7] and step 2.1 yields the corresponding finite sum . By [F3], take increasing finite sums of whole ANOVA components in . For real , so pointwise . Apply this to and integrate; uniformity and [F6] give Thus the estimators converge in . Uniformity and [F6] give the limit mean and finite second moment, and each finite estimator has the same mean because all its nonconstant terms are centered, using [F7]. The centered estimators therefore converge in , so their variances converge by [F5]. Finally, because every ; [F3] makes finite, so the series converges absolutely and the finite-sum identity passes to the limit.
Substituting into the identity of step 3.1 gives both displayed forms.
Depends on
- Nested uniform scrambling of a finite point set
- Base-$b$ Haar contrasts and multiresolution ANOVA components
- Orthogonal base-$b$ multiresolution and variance decomposition
- Nested uniform scrambles preserve net counts and uniform marginals
- $(\lambda,t,m,d)$-nets in base $b$
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Moments, variance, and covariance on a probability space
- Change of variables for expectation
- The Lebesgue integral is linear on $L^1(\mu)$
- Expectations factor over finite products of independent random variables
Used by
- Fixed-quality net gain coefficients are uniformly bounded Lemma
- Pair-count formula for scrambled-net gain coefficients Lemma
- Sharp gain bound for scrambled (0,m,d)-nets Lemma
- Smooth-integrand variance rate for nestedly scrambled (λ,t,m,d)-nets Theorem
- Variance bound for a nested scramble of a (0,m,d)-net Theorem
Dependency tree · two levels
42 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
- Art B. Owen, Monte Carlo Variance of Scrambled Net Quadrature, §§6–7 (standard reference, not scraped)
- Art B. Owen, Monte Carlo Book: The Quasi-Monte Carlo Parts, Chapter 17 §17.5 (standard reference, not scraped)