Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Pick-freeze Sobol ratios are consistent and have a joint delta-method CLT

Statement

Assume AC. Let d<∞, let the product-law output satisfy f∈L4(μ), and suppose V=Var⁡(f(X))>0. For the iid row vector Z and estimates of Pick-freeze Monte Carlo estimators for Sobol indices, write η=EZ=(V{1},…,V{d},τ1,…,τd,V), where τi=∑u∋iVu, and let Σ=Cov⁡(Z). The probability that the algorithm returns zero-empirical-variance tends to zero. For asymptotic statements, let S~n be the returned ratio vector when Dˉ>0 and the zero vector otherwise. Define the Borel map g:R2d+1→R2d by g(n1,…,nd,t1,…,td,s)={(n1/s,…,nd/s,t1/s,…,td/s),s>0,0,s≤0. As n→∞, S~n is consistent in probability and n(S~n−g(η))⇒N(0,JΣJT), where J=Dg(η); since V>0, g is smooth on a neighborhood of η. Every fixed extension on the zero-status event has the same limit. Write Mn=J^Σ^J^T/n for the returned MCSE covariance matrix when Dˉ>0. Then nMn→JΣJT in probability; any fixed extension of Mn on the zero-status event has the same convergence. For each finite n≥2 and d, the procedure terminates after n rows with at most n(2d+5) evaluations of f. Forming the sample covariance and plug-in MCSE takes O(nd2+d3) scalar arithmetic operations. The finite-sample ratios need not be unbiased.

Facts & Assumptions

Given: AC, d<∞, f∈L4(μ), V>0, and iid rows generated by the algorithm.

[A1]

The Axiom of Choice: AC is assumed for the multivariate CLT supplier.

[F1]

Pick-freeze Monte Carlo estimators for Sobol indices: each row draws six mutually independent vectors X,X′,U,V,W,W′ with law μ, evaluates f(X) once, the d first-order and d total-effect hybrids, and f(U),f(V),f(W),f(W′), and forms the row vector Z=(N1,…,Nd,T1,…,Td,D); the output ratios use the final coordinate as denominator.

[F2]

Pick-freeze covariances recover first and total Sobol numerators: the first and total pick-freeze numerators have means V{i} and τi=∑u∋iVu, respectively.

[F3]

Iid finite variance strong law: square-integrable iid variables have sample means converging almost surely to their means.

[F4]

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

[F5]

Khinchin weak law for integrable IID variables: iid integrable variables have sample means converging in probability.

[F6]

Multivariate iid central limit theorem: under AC, iid finite-dimensional random vectors with finite second moment satisfy a multivariate CLT, including singular covariance.

[F7]

First- and second-order delta method for random vectors: a differentiable map transfers a vector CLT to the derivative image.

[F8]

Moments, variance, and covariance on a probability space: Σ is the covariance matrix of the row vector.

[F9]

Cauchy-Schwarz inequality for L2: square-integrable row coordinates have integrable pairwise products.

[F10]

Independent random elements and Independent random elements have product joint law: independent vectors have product joint law, so integrable functions of separate vectors factor under iterated integration.

[F11]

Linearity, monotonicity, and the modulus bound for expectation: expectation is linear on integrable variables.

Proof

Given: The hypotheses in the Statement and facts [A1], [F1]–[F11].

1.1F1F2F8F9F10F11givenalgebra

For each row, Cauchy–Schwarz [F9] and f∈L4 make f(X)f(X[i]) and f(U)f(V) square-integrable; (a−b)4≤8(a4+b4) makes Ti and D square-integrable as well. Thus every coordinate of Z has finite second moment. By [F10]–[F11], E[f(U)f(V)]=μ2 and ED=12(2E[f(X)2]−2μ2)=V by [F8]. The covariance identity [F2] gives E[f(X)f(X[i])]−μ2=V{i} and ETi=τi, hence ENi=V{i} and EZ=η. Independent rows make these row vectors iid.

2.1F1F3step 1.1given

Apply [F3] to each of the finitely many coordinates of Z. Then Zˉ→η almost surely. Since V>0, almost surely its last coordinate is eventually positive, so the continuous ratio formula gives S~n=g(Zˉ)→g(η) almost surely and P(Dˉ=0)→0. Every fixed extension on the zero-status event differs only on an event whose probability tends to zero; for any bounded continuous test function the expectation difference is at most twice its supremum norm times that probability. Hence it has the same distributional limit, and convergence in probability is also unchanged.

3.1A1F6F7step 1.1step 2.1given

The finite second moment from step 1.1 and [A1] satisfy [F6]. Hence n(Zˉ−η)⇒N(0,Σ). The map g in the Statement is Borel, being the continuous ratio map on the open half-space s>0 and zero on its complement. Since V>0, it is smooth near η with derivative J. Applying [F7] gives the joint delta-method limit, and step 2.1 transfers it to every stated fixed extension.

3.2F1F4F5F7F8F11step 1.1step 2.1givenalgebra

For every two coordinates Za,Zb, Cauchy–Schwarz gives E∣ZaZb∣<∞. Each product is the same measurable function of every iid row; [F4] gives independence and the common row law gives identical distributions. Thus [F5] gives convergence in probability of the sample means of all finitely many products ZaZb. Step 2.1 gives convergence of the row means. Expanding the sample covariance around those means by [F11] proves Σ^→Σ in probability. Continuity of the derivative of g near η then gives J^Σ^J^T→JΣJT in probability. Since the algorithm returns Mn=J^Σ^J^T/n, this proves the stated scaled covariance convergence. An arbitrary fixed finite extension on the zero-status event preserves convergence in probability because that event has probability tending to zero by step 2.1. The argument does not claim an unbiased ratio.

4.1F1givenalgebra∎

The loops over n rows and d coordinates are finite, so the procedure terminates after the n rows. In each row [F1] evaluates f(X) once and reuses it in every hybrid expression, evaluates the d first-order and d total-effect hybrids, and evaluates the four additional values f(U),f(V),f(W),f(W′). This requires 1+d+d+4=2d+5 evaluations per row, hence at most n(2d+5) overall. Forming the covariance of the (2d+1)-dimensional row vectors costs O(nd2) scalar operations, and the plug-in matrix products cost O(d3).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

56 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