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.
One scrambled rule versus independent full-set replicates
Example
Take , , and the -net with points and . Use a nested uniform scramble and the integrand . Compute the exact variance of one scrambled estimate and explain what independent full-set replicates add.
Facts & Assumptions
Given: The two-point net, its nested uniform scramble, fixed target , and independent repetitions of the complete scrambled set.
-nets in base : A -net in base has one point in each half interval.
Nested uniform scrambling of a finite point set: The permutation at each input-prefix node is shared by points with that prefix and independent across distinct nodes.
Marginal uniformity makes an RQMC rule unbiased: Marginally uniform points give an unbiased estimator of the cube integral.
Independent RQMC replicates estimate randomization variance: For independent full-set randomizations, estimates the variance of their replicate mean.
Moments, variance, and covariance on a probability space: The variance of a square-integrable real variable is its centered second moment.
Expectations factor over finite products of independent random variables: Integrable functions of independent random variables have factored product expectation.
The Lebesgue integral is linear on : Expectation is linear on integrable real random variables.
Verification
The first input digits of and differ, so the first permutation sends them to opposite halves. The net count from [F1] is preserved, leaving one point in each half.
The two input-prefix paths remain distinct after the first digit; hence all their subsequent node permutations are independent. Each tail is a sequence of independent uniform binary digits, so conditional on the first permutation the two scrambled points are independent uniform variables in their assigned half intervals.
A uniform variable on an interval of width has variance . Under either value of the first permutation, step 2.1 gives the same law for : half the sum of independent uniforms on the lower and upper halves. Thus this is also its unconditional law. The single-rule estimate is unbiased for by [F3], and [F6]–[F7] give by [F5].
One realized estimate cannot form the centered replicate variance formula because at . With independent full-set scrambles, [F4] gives an unbiased estimate of . The target integral is fixed, so this is computation-randomization uncertainty only.
Depends on
- $(\lambda,t,m,d)$-nets in base $b$
- Randomized quasi-Monte Carlo point sets and estimators
- Nested uniform scrambling of a finite point set
- Marginal uniformity makes an RQMC rule unbiased
- Independent RQMC replicates estimate randomization variance
- Moments, variance, and covariance on a probability space
- Expectations factor over finite products of independent random variables
- The Lebesgue integral is linear on $L^1(\mu)$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
27 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 Book: The Quasi-Monte Carlo Parts, Chapter 17 §§17.1 and 17.5 (standard reference, not scraped)