Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Antithetic variance and a monotone sufficient condition

Statement

Use the setup of Antithetic randomized sampling, assume EP[f2]<∞, and put Y=f(T(U1)), Y~=f(T(1−U1)), μ=EPf, and σ2=Var⁡P(f). Then Y and Y~ have the same law and mean, and the antithetic estimator from n independent input pairs is unbiased with

Var⁡(μ^anti)=σ2+Cov⁡(Y,Y~)2n.

Compared with the ordinary mean of 2n independent draws from P, whose variance is σ2/(2n), antithetic sampling has no larger variance exactly when Cov⁡(Y,Y~)≤0, and has strictly smaller variance exactly when this covariance is negative. A sufficient condition is that g=f∘T is coordinatewise monotone on [0,1]d (each coordinate may have either monotonicity direction). In particular, when X is a subset of Rm with the order x≤y defined by xj≤yj for every coordinate, if T is coordinatewise nondecreasing as a map into X and f is nondecreasing for that order, then g is coordinatewise nondecreasing.

Facts & Assumptions

Given: The sampler, product-uniform inputs, IID input pairs, measurability, and finite second moment in the Statement.

[F1]

Antithetic randomized sampling: The input coordinates are independent uniform [0,1] variables, T(U1)∼P, and the estimator averages [f(T(Ui))+f(T(1−Ui))]/2 over independent pairs.

[F2]

Identical distribution and IID families: IID means identical laws and mutual independence.

[F3]

Measurable coordinatewise functions preserve independence: Measurable coordinatewise functions of an independent family remain independent.

[F4]

Independent random elements have product joint law: The joint law of a finite independent family is the product of its marginal laws.

[F5]

Moments, variance, and covariance on a probability space: Variance and covariance are the centered second moment and centered product expectation.

[F6]

Covariance is symmetric and bilinear in finite linear combinations: Covariance is symmetric and bilinear on finite square-integrable linear combinations.

[F7]

Expectations factor over finite products of independent random variables: Products of independent integrable variables have factored expectations.

[F8]

Oppositely monotone functions of independent coordinates have nonpositive covariance: Square-integrable oppositely monotone functions of independent coordinates have nonpositive covariance.

[F9]

Linearity, monotonicity, and the modulus bound for expectation: Expectation is linear for integrable finite sums.

[F10]

Change of variables for expectation: If T(U) has law P, then E[f(T(U))]=EPf and, when integrable, E[f(T(U))2]=EP[f2].

Proof

Given: The objects and hypotheses in the Statement.

1.1F1F3F4F10

For a uniform coordinate, P(U1j=s)=0 for every s∈[0,1], since P(U1j≤s)=s and the left limit of this cdf at s is also s. Thus for 0≤t≤1, P(1−U1j≤t)=P(U1j≥1−t)=1−P(U1j<1−t)=t. By [F3], the reflected coordinates remain independent; [F4] then shows 1−U1 has the same product-uniform law as U1. Therefore both T(U1) and T(1−U1) have law P. Applying [F10] to f and f2 identifies their means and variances as μ and σ2, so Y and Y~ have the same law, mean μ, and variance σ2.

1.2F1F2F3F9

The pair value Zi=[f(T(Ui))+f(T(1−Ui))]/2 is a measurable function of Ui. Thus the Zi are IID by [F2]–[F3], each has mean μ by [F9], and their average is unbiased.

2.1F5F6F7step 1.2algebra

By [F5]–[F6], Var⁡(Zi)=[Var⁡(Y)+Var⁡(Y~)+2Cov⁡(Y,Y~)]/4=[σ2+Cov⁡(Y,Y~)]/2. For distinct i,j, the centered Zi,Zj are independent, so [F7] gives zero covariance; expanding the centered square of their average therefore gives the stated variance divided by n.

3.1F5F7step 2.1algebra

The mean of 2n independent P-draws has variance σ2/(2n) by the same centered-square expansion and [F7]. Comparing this with step 2.1 gives the iff conditions for weak and strict variance reduction.

4.1F1F3F4F8step 1.1given∎

For each coordinate choose a monotonicity direction for g: define Sj(v)=vj in a nondecreasing coordinate and Sj(v)=1−vj in a nonincreasing coordinate; a constant coordinate may be assigned either direction. Then S is a coordinatewise reflection map with S(S(v))=v and S(1−v)=1−S(v). By [F3] and [F4], V=S(U1) again has independent uniform coordinates, and ϕ=g∘S is coordinatewise nondecreasing on [0,1]d. Define the coordinatewise clamp C:Rd→[0,1]d by Cj(x)=min⁡{1,max⁡{0,xj}}. It is continuous and nondecreasing in every coordinate, and C(1−v)=1−C(v). Hence ϕˉ:=ϕ∘C is a Borel coordinatewise nondecreasing function on Rd, while v↦ϕˉ(1−v) is Borel and coordinatewise nonincreasing. On the cube these extensions equal ϕ(v) and ϕ(1−v), respectively; the identities for S give g(U1)=ϕ(V) and g(1−U1)=ϕ(1−V). By step 1.1, these functions are square-integrable, so [F8] applies to ϕˉ(V) and ϕˉ(1−V) and gives Cov⁡(Y,Y~)≤0. In the stated ordered-subset case, u≤v coordinatewise implies T(u)≤T(v) and then f(T(u))≤f(T(v)), which makes g nondecreasing and is the special case S(v)=v.

Depends on

Used by

Dependency tree · two levels

36 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