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.
Randomized quasi-Monte Carlo and replicate error — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convergence: Nets and Filters
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Deterministic quasi-Monte Carlo and discrepancy
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Gaussian Orthogonal Decomposition and Quadratic Forms
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Densities and Radon Volume on Manifolds
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Randomized quasi-Monte Carlo and replicate error
- Reeb Stability and Global Foliation Constructions
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Statistical, resampling, simulation, and numerical error ledger
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
2 · Summary
Summary
These examples separate point count from replicate count, compare a digital shift with nested scrambling, and show both the smooth-integrand rate and its limits. Under the stated AC assumption for the Student calibration, the skewed two-point replicate law has an unbiased variance estimate but very poor coverage for a two-replicate Student interval.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
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.
A skewed finite-replicate law defeats a nominal Student interval
Example
Assume AC. Use the nested uniform scramble of the base- net and . For two independent full-set replicates, calculate the exact coverage of the usual two-sided Student interval based on the sample variance, namely with the th percentile of . This checks the finite- coverage caveat.
Facts & Assumptions
Given: AC, the net and scramble, the fixed target , and two independent scrambles.
-nets in base : The input net has one point in each half interval.
Nested uniform scrambling of a finite point set: Conditional on the first permutation, the two point tails are independent uniform tails in their assigned halves.
Independent RQMC replicates estimate randomization variance: For , estimates the replicate-mean variance.
Student t and Fisher F laws: is the law of , with independent standard normal and .
Chi-square laws, including zero degrees: is the square of a standard normal, so and the independent have the same law.
Positive-degree chi-square laws have a positive density and regular CDF: A positive-degree chi-square variable is positive almost surely and has a continuous density.
Student t and Fisher F CDFs are continuous and strictly increasing on their supports: Under AC, has a continuous, symmetric, strictly increasing CDF, so its quantile is unique.
The Axiom of Choice: AC is used by the stated Student t law and its CDF result [F4, F7].
Expectation of a nonnegative or integrable random variable: Expectation is integration against the probability law.
Verification
The point in is uniform there by [F2], while the point in never enters . Thus one rule estimate is , where is Bernoulli with success probability . Consequently [F8] gives , and has a skewed two-point law.
For two independent estimates, if both values agree then by [F3], so the interval is the singleton or and misses . This event has probability .
If the two values differ, then and , so the interval half-width is with as in the Example. By [F4]–[F6], can be represented as with and independent and identically distributed; their continuous law gives . Exchangeability then gives , so . Symmetry and continuity of the CDF [F7] imply , hence its quantile satisfies . Therefore the interval half-width , and it contains . This event has probability .
The resulting two-sided interval coverage is , far below . The replicate variance formula remains unbiased; this finite- example shows that unbiased variance estimation alone does not guarantee accurate Student interval coverage.
A digital shift and a nested scramble give different error laws
Example
Use the base- net in one dimension and . Compare its digital shift and nested uniform scramble. Both randomizations preserve the net almost surely and make each point uniform, but their estimate variances differ.
Facts & Assumptions
Given: The input points , the integrand , and the two randomizations.
Digital shift randomization in base : A digital shift adds the same random base- digit at each position to every point.
Nested uniform scrambling of a finite point set: A nested scramble uses independent permutations at distinct input-prefix nodes.
Digital shifts preserve net counts and uniform marginals: Digital shifts preserve the net almost surely and make each point uniform.
Nested uniform scrambles preserve net counts and uniform marginals: Nested scrambles preserve the net almost surely and make each point uniform.
Expectation of a nonnegative or integrable random variable: Expectation is integration against the probability law.
Moments, variance, and covariance on a probability space: Variance is the centered second moment of a square-integrable variable.
Dynkin's pi-lambda theorem: Agreement on a generating -system determines the Borel probability law.
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
Under a binary digital shift, the two output first digits are opposite and their later digits agree. Outside the null event that the shared tail is eventually all ones, their numeric half-open representatives therefore have average , where . For any fixed starting position, the event that the independent fair digits are all one from there onward has probability at most for every ; [F10] makes each such tail event null, so their countable union is null. A prescribed prefix of tail digits has probability and places in a half-open dyadic interval of length , exactly its probability under . These intervals generate the Borel sets of , and [F7] gives . Hence [F5] and [F6] give and ; the null representative choice does not change these moments.
Under nested scrambling, the two distinct first input digits are sent to opposite halves. After that first digit their input-prefix nodes are distinct, so the two subsequent digit streams are independently scrambled. Conditional on which point enters which half, they are independent uniforms on their respective half intervals, and either assignment gives the same law for their average. Hence this is also the unconditional law. Each has variance , so [F8]–[F9] give the average variance .
By [F3] and [F4], both rules have uniform marginals and preserve the same finite net almost surely. Their estimates nevertheless have variances and , respectively, for this . Thus marginal uniformity and almost-sure exact net preservation alone do not determine the randomization error law.
A smooth integrand satisfies the bound while an integrable singularity does not
Example
Assume Countable Choice. In one dimension compare with the integrable singular function for and . The first satisfies the smooth scrambled-net variance hypotheses; the second does not even have a finite second moment.
Facts & Assumptions
Given: Countable Choice, a nested uniform scramble of a -net in base , and the two integrands.
Smooth-integrand variance rate for nestedly scrambled -nets: A continuously differentiable one-dimensional integrand has scrambled-net variance for fixed base and net quality.
Randomized quasi-Monte Carlo point sets and estimators: Each scrambled point is marginally uniform when the RQMC marginal condition holds.
Expectation of a nonnegative or integrable random variable: Integrability and second moments are Lebesgue integrals against the uniform law.
Nested uniform scrambles preserve net counts and uniform marginals: Each scrambled point has uniform law and the net property is preserved almost surely.
Monotone convergence for the integral: Increasing nonnegative measurable truncations have integrals increasing to the integral of their pointwise limit.
Change of variables for expectation: For a nonnegative Borel function and random element , .
Moments, variance, and covariance on a probability space: Variance is defined for square-integrable variables and is finite only when their second moment is finite.
The Axiom of Countable Choice (): Countable Choice is inherited from [F1].
Verification
The function has continuous derivative on . With , the hypotheses of [F1] hold, so its randomized-rule variance is .
For , the nonnegative Borel truncations increase pointwise to and satisfy . Likewise, increase pointwise to and satisfy . By [F5], while ; is not continuously differentiable at .
By [F2], ; [F4] gives every point uniform law. Since , [F6] and step 1.2 give . The squared estimate obeys , so its second moment is infinite. By [F7] it has no finite variance, and the smooth variance theorem does not apply to this integrable singularity.
Sources
- Art B. Owen, Monte Carlo Book: The Quasi-Monte Carlo Parts, Chapter 17 §§17.1 and 17.5
- Art B. Owen, Monte Carlo Book: The Quasi-Monte Carlo Parts, Chapter 17 §17.1 and §17.4
- Art B. Owen, Monte Carlo Book: The Quasi-Monte Carlo Parts, Chapter 17 §§17.5–17.6
- Pierre L’Ecuyer and Christiane Lemieux, Recent Advances in Randomized Quasi-Monte Carlo Methods, §§5.2–5.3, 6.2
- Art B. Owen, Local Antithetic Sampling with Scrambled Nets, §5.1
- Art B. Owen, Monte Carlo Book: The Quasi-Monte Carlo Parts, Chapter 17 §17.5