Alphabeta Math
Pipeline-generated
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

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 t1 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

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

One scrambled rule versus independent full-set replicates

Example

Take b=2, d=1, and the (0,1,1)-net with points a1=0 and a2=1/2. Use a nested uniform scramble and the integrand f(x)=x. 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 I=∫01x dx, and independent repetitions of the complete scrambled set.

[F1]

(λ,t,m,d)-nets in base b: A (0,1,1)-net in base 2 has one point in each half interval.

[F2]

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.

[F3]

Marginal uniformity makes an RQMC rule unbiased: Marginally uniform points give an unbiased estimator of the cube integral.

[F4]

Independent RQMC replicates estimate randomization variance: For R≥2 independent full-set randomizations, V^R estimates the variance of their replicate mean.

[F5]

Moments, variance, and covariance on a probability space: The variance of a square-integrable real variable is its centered second moment.

[F6]

Expectations factor over finite products of independent random variables: Integrable functions of independent random variables have factored product expectation.

[F7]

The Lebesgue integral is linear on L1(μ): Expectation is linear on integrable real random variables.

Verification

1.1F1F2given

The first input digits of 0 and 1/2 differ, so the first permutation sends them to opposite halves. The net count from [F1] is preserved, leaving one point in each half.

2.1F2step 1.1

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.

3.1F3F5F6F7step 2.1algebra

A uniform variable on an interval of width 1/2 has variance (1/2)2/12=1/48. Under either value of the first permutation, step 2.1 gives the same law for Z: half the sum of independent uniforms on the lower and upper halves. Thus this is also its unconditional law. The single-rule estimate Z=(X1+X2)/2 is unbiased for I=1/2 by [F3], and [F6]–[F7] give Var⁡(Z)=(1/48+1/48)/4=1/96 by [F5].

4.1F4step 3.1algebra∎

One realized estimate Z cannot form the centered replicate variance formula because R(R−1)=0 at R=1. With R≥2 independent full-set scrambles, [F4] gives an unbiased estimate of Var⁡(Z‾R)=1/(96R). The target integral is fixed, so this is computation-randomization uncertainty only.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A skewed finite-replicate law defeats a nominal Student interval

Example

Assume AC. Use the nested uniform scramble of the base-2 net {0,1/2} and f(x)=1[0,1/100)(x). For two independent full-set replicates, calculate the exact coverage of the usual two-sided 95% Student interval based on the sample variance, namely Z‾2±cV^2 with c the 97.5th percentile of t1. This checks the finite-R coverage caveat.

Facts & Assumptions

Given: AC, the net and scramble, the fixed target I=∫01f(x) dx, and two independent scrambles.

[F1]

(λ,t,m,d)-nets in base b: The input net has one point in each half interval.

[F2]

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.

[F3]

Independent RQMC replicates estimate randomization variance: For R=2, V^2=12∑r=12(Zr−Z‾2)2 estimates the replicate-mean variance.

[F4]

Student t and Fisher F laws: t1 is the law of G/Q1, with independent standard normal G and Q1∼χ12.

[F5]

Chi-square laws, including zero degrees: Q1 is the square of a standard normal, so G2 and the independent Q1 have the same χ12 law.

[F6]

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.

[F7]

Student t and Fisher F CDFs are continuous and strictly increasing on their supports: Under AC, t1 has a continuous, symmetric, strictly increasing CDF, so its 0.975 quantile is unique.

[A1]

The Axiom of Choice: AC is used by the stated Student t law and its CDF result [F4, F7].

[F8]

Expectation of a nonnegative or integrable random variable: Expectation is integration against the probability law.

Verification

1.1F1F2F8givenalgebra

The point in [0,1/2) is uniform there by [F2], while the point in [1/2,1) never enters [0,1/100). Thus one rule estimate is Z=12B, where B is Bernoulli with success probability (1/100)/(1/2)=1/50. Consequently [F8] gives EZ=1/100=I, and Z has a skewed two-point law.

2.1F3step 1.1algebra

For two independent estimates, if both B values agree then V^2=0 by [F3], so the interval is the singleton {0} or {1/2} and misses I=1/100. This event has probability (49/50)2+(1/50)2=2402/2500.

2.2A1F3F4F5F6F7step 1.1algebra

If the two B values differ, then Z‾2=1/4 and V^2=1/16, so the interval half-width is c/4 with c as in the Example. By [F4]–[F6], T1 can be represented as G/Q1 with G2 and Q1 independent and identically distributed; their continuous law gives P(G2=Q1)=0. Exchangeability then gives P(G2<Q1)=P(Q1<G2)=1/2, so P(∣T1∣<1)=1/2. Symmetry and continuity of the CDF [F7] imply Ft1(1)=3/4, hence its 0.975 quantile satisfies c>1. Therefore the interval half-width c/4>1/4>∣1/4−1/100∣=6/25, and it contains I. This event has probability 2(49/50)(1/50)=98/2500.

3.1step 2.1step 2.2algebra∎

The resulting two-sided interval coverage is 98/2500=0.0392, far below 0.95. The replicate variance formula remains unbiased; this finite-R example shows that unbiased variance estimation alone does not guarantee accurate Student interval coverage.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A digital shift and a nested scramble give different error laws

Example

Use the base-2 net {0,1/2} in one dimension and f(x)=x. 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 0,1/2, the integrand f(x)=x, and the two randomizations.

[F1]

Digital shift randomization in base b: A digital shift adds the same random base-b digit at each position to every point.

[F2]

Nested uniform scrambling of a finite point set: A nested scramble uses independent permutations at distinct input-prefix nodes.

[F3]

Digital shifts preserve net counts and uniform marginals: Digital shifts preserve the net almost surely and make each point uniform.

[F4]

Nested uniform scrambles preserve net counts and uniform marginals: Nested scrambles preserve the net almost surely and make each point uniform.

[F5]

Expectation of a nonnegative or integrable random variable: Expectation is integration against the probability law.

[F6]

Moments, variance, and covariance on a probability space: Variance is the centered second moment of a square-integrable variable.

[F7]

Dynkin's pi-lambda theorem: Agreement on a generating π-system determines the Borel probability law.

[F8]

Expectations factor over finite products of independent random variables: Integrable functions of independent random variables have factored product expectation.

[F9]

The Lebesgue integral is linear on L1(μ): Expectation is linear on integrable real random variables.

Verification

1.1F1F5F6F7F10givenalgebra

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 I^shift=1/4+T, where T=∑k≥2Sk2−k. For any fixed starting position, the event that the independent fair digits are all one from there onward has probability at most 2−L for every L; [F10] makes each such tail event null, so their countable union is null. A prescribed prefix of K tail digits has probability 2−K and places T in a half-open dyadic interval of length 2−K−1, exactly its probability under Unif⁡[0,1/2). These intervals generate the Borel sets of [0,1/2), and [F7] gives T∼Unif⁡[0,1/2). Hence [F5] and [F6] give EI^shift=1/2 and Var⁡(I^shift)=1/48; the null representative choice does not change these moments.

1.2F2F8F9givenalgebra

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 (1/2)2/12=1/48, so [F8]–[F9] give the average variance (1/48+1/48)/4=1/96.

2.1F3F4step 1.1step 1.2∎

By [F3] and [F4], both rules have uniform marginals and preserve the same finite net almost surely. Their estimates nevertheless have variances 1/48 and 1/96, respectively, for this f. Thus marginal uniformity and almost-sure exact net preservation alone do not determine the randomization error law.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A smooth integrand satisfies the bound while an integrable singularity does not

Example

Assume Countable Choice. In one dimension compare f1(x)=x with the integrable singular function f2(x)=x−3/4 for x>0 and f2(0)=0. 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 (0,m,1)-net in base 2, and the two integrands.

[F1]

Smooth-integrand variance rate for nestedly scrambled (λ,t,m,d)-nets: A continuously differentiable one-dimensional integrand has scrambled-net variance O(n−3) for fixed base and net quality.

[F2]

Randomized quasi-Monte Carlo point sets and estimators: Each scrambled point is marginally uniform when the RQMC marginal condition holds.

[F3]

Expectation of a nonnegative or integrable random variable: Integrability and second moments are Lebesgue integrals against the uniform law.

[F4]

Nested uniform scrambles preserve net counts and uniform marginals: Each scrambled point has uniform law and the net property is preserved almost surely.

[F5]

Monotone convergence for the integral: Increasing nonnegative measurable truncations have integrals increasing to the integral of their pointwise limit.

[F6]

Change of variables for expectation: For a nonnegative Borel function g and random element X, E[g(X)]=∫g dPX.

[F7]

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.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is inherited from [F1].

Verification

1.1A1F1given

The function f1(x)=x has continuous derivative 1 on [0,1]. With n=2m, the hypotheses of [F1] hold, so its randomized-rule variance is O(n−3).

1.2F3F5givenalgebra

For N≥1, the nonnegative Borel truncations gN=f21[1/N,1] increase pointwise to f2 and satisfy ∫01gN(x) dx=4(1−N−1/4). Likewise, hN=f221[1/N,1] increase pointwise to f22 and satisfy ∫01hN(x) dx=2(N−1). By [F5], ∫01f2=4 while ∫01f22=+∞; f2 is not continuously differentiable at 0.

2.1F2F4F6F7step 1.2algebra∎

By [F2], I^n(f2)=n−1∑if2(Xi); [F4] gives every point uniform law. Since f2≥0, [F6] and step 1.2 give E[f2(X1)2]=+∞. The squared estimate obeys I^n(f2)2≥n−2f2(X1)2, 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