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.

Global sensitivity anova and sobol estimation

1 · Prerequisites

2 · Summary

Objective

For a finite independent product input and a square-integrable real output, Independent product inputs have an orthogonal Hoeffding decomposition constructs orthogonal Hoeffding ANOVA components with variance sum. First-order and total Sobol indices defines first-order and total Sobol indices only when the output variance is positive. Pick-freeze covariances recover first and total Sobol numerators gives unbiased numerator identities, and the independent-bundle procedure Pick-freeze Monte Carlo estimators for Sobol indices has a joint CLT and plug-in MCSE under AC, finite fourth moment and positive output variance, while its ratio is not generally unbiased.

The derivative bound Coordinate Poincare inequalities bound total Sobol effects uses a coordinate Poincare inequality when a real product-measurable representative has almost-everywhere coordinate sections that are absolutely continuous with square-integrable derivatives. Under Countable Choice and Dependent Choice, Fourier Parseval proves the sharp uniform-interval constant Li2/π2; more general coordinate laws may use any established Poincare constant Ci. Complete orthonormal tensor expansions group into Sobol components gives support-grouped Sobol coefficients under Countable Choice and an explicit completeness hypothesis. UQ1's finite cutoff assumptions alone do not assert completeness.

For dependent inputs and Y=f(X), the separate Shapley definition Shapley effects for dependent inputs uses the game v(S)=Var⁡(E[Y∣σ(Xj:j∈S])) and averages its marginal gains over all input permutations; its conditional-expectation interface assumes AC. Do not apply independent Sobol formulas to dependent coordinates. The RQMC lemma Orthogonal base-b multiresolution and variance decomposition assumes Countable Choice and the uniform cube [0,1)d; its b-adic frequency components are not identified with arbitrary product-law conditional ANOVA components.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Shapley effects for dependent inputs

Definition

Assume AC. On a probability space (Ω,F,P), let d≥1 be finite and let X=(X1,…,Xd) be any jointly distributed finite family of random elements. Let Y=f(X)∈L2(P), and put V=Var⁡(Y). For S⊆[d], set GS=σ(Xj:j∈S), with G∅={∅,Ω}, and v(S)=Var⁡(E[Y∣GS]). If V>0, let Sd be the set of all d! permutations of [d], and let Piπ contain the indices occurring before i in π. The Shapley effect of coordinate i under this convention is ϕi=1d! V∑π∈Sd(v(Piπ∪{i})−v(Piπ)). If V=0, the normalized effects are undefined. This definition is for dependent inputs as well as independent ones; the independent Sobol ANOVA components are not used to define v.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Product-coordinate averaging operators

Definition

Let d≥1 be finite, let (Ej,Ej,μj) be probability spaces, and let (E,E,μ)=∏j=1d(Ej,Ej,μj) be their finite product with product sigma-algebra and product probability. Write [d]={1,…,d}. For J⊆[d], let EJ and μJ denote the corresponding coordinate product; the empty product is a one-point probability space. For real f∈L2(μ), define the coordinate average PJf(xJ)=∫E[d]∖Jf(xJ,z[d]∖J) dμ[d]∖J(z[d]∖J) for almost every xJ for which the section is integrable, and assign zero on the exceptional null set. Regard PJf also as a function on the full product that is constant in the coordinates outside J. The conventions are P[d]f=f as an L2 class and P∅f=∫f dμ.

Remarks

The displayed integral is initially defined on representatives. Its independence of the representative and its L2 properties are established by Product-coordinate projections commute and contract in L2 ↗.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Sharp Poincare bound for the uniform law on an interval

Statement

Assume Countable Choice and Dependent Choice. Let I=[a,b] with L=b−a>0, let g:I→R be absolutely continuous, and suppose g′∈L2(I). Let U have the uniform law P(U∈A)=λ(A∩I)/L. Then Var⁡(g(U))≤L2π2 E∣g′(U)∣2.

Facts & Assumptions

Given: Countable Choice, Dependent Choice, L>0, an absolutely continuous g with square-integrable derivative, and the probability law of U specified in the Statement.

[A1]

The Axiom of Countable Choice (ACω): every sequence of nonempty sets has a choice function.

[A2]

The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain: for a nonempty set X, an entire relation R on X, and a∈X, there is x:N→X with x0=a and xnRxn+1 for every n.

[F1]

Absolute continuity on a compact interval: absolute continuity on a compact interval controls sums of endpoint increments on finite disjoint interval families.

[F2]

Integration by parts for absolutely continuous functions: under Countable and Dependent Choice, absolutely continuous functions satisfy integration by parts.

[F3]

The one-dimensional torus and its normalized Haar integral: the circle is integrated over a period interval with normalized Lebesgue measure.

[F4]

The Fourier basis and Parseval's identity on the finite torus: under Countable Choice, Fourier characters form a complete orthonormal basis on the one-dimensional torus and Parseval holds in L2.

[F5]

Moments, variance, and covariance on a probability space: variance is the centered second moment.

Proof

Given: The hypotheses, axioms [A1]–[A2], and facts [F1]–[F5].

1.1F1F3F5givenalgebra

Let m=E[g(U)] and h(x)=g(a+Lx)−m for 0≤x≤1. Define H(t)=h(2t) for 0≤t≤1/2 and H(t)=h(2−2t) for 1/2≤t≤1, then extend H periodically to T. The two absolutely continuous pieces match at t=1/2, and H(0)=H(1). A finite paste of absolutely continuous pieces with matching endpoint values is absolutely continuous: split every interval crossing the junction into its at most two pieces and apply [F1] on each piece with half the error tolerance. Thus H is absolutely continuous on the period interval. Its mean is zero, ∥H∥L2(T)2=Var⁡(g(U)), and affine changes of variables give ∥H′∥L2(T)2=4L2E∣g′(U)∣2.

2.1A1A2F2F3F4step 1.1algebra∎

For each integer n, apply integration by parts [F2] to H(t)e−2πint on [0,1], taking real and imaginary parts. The boundary term vanishes since H(0)=H(1) and e−2πin=1, giving H′^(n)=2πinH^(n). Parseval [F4] and the zero mean in step 1.1 yield ∥H′∥22=∑n≠04π2n2∣H^(n)∣2≥4π2∑n≠0∣H^(n)∣2=4π2∥H∥22. Substituting the two norm identities from step 1.1 and dividing by 4π2 proves the claimed bound. Equality holds for g(x)=cos⁡(π(x−a)/L): its mean is zero, its variance is 1/2, and its derivative second moment is π2/(2L2). Hence the constant L2/π2 is sharp.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Exact finite-permutation Shapley effects

Definition

Input: A finite player set [d], an exact oracle for v(S) at every S⊆[d], and a known V>0 satisfying v(∅)=0 and v([d])=V. In the sensitivity application, v is the conditional-projection variance game of Shapley effects for dependent inputs.

  1. Initialize Ai=0 for every i∈[d].
  2. For each of the d! permutations π, traverse its entries in order. Start with S=∅. At entry i, add v(S∪{i})−v(S) to Ai and replace S by S∪{i}.
  3. Return ϕi=Ai/(d!V) for all i.

The domain excludes V=0 and unavailable coalition values; the procedure does not approximate conditional expectations or their numerical errors.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Monte Carlo permutation estimator for Shapley effects

Definition

Input: A finite player set [d], exact coalition values v(S) with v(∅)=0, v([d])=V>0, and a declared integer sample size n≥2.

  1. Draw n independent permutations π1,…,πn, each uniformly from the d! permutations of [d].
  2. For each row r and each i, compute Δi(r)=v(Piπr∪{i})−v(Piπr).
  3. Return ϕ^i=(nV)−1∑rΔi(r) and the standard-error covariance estimate Σ^Δ/(nV2), where Σ^Δ=(n−1)−1∑r(Δ(r)−Δˉ)(Δ(r)−Δˉ)T.

The exact conditional-variance evaluation is an input oracle. This permutation sampling procedure does not supply a conditional sampler or bound its numerical error.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Product-coordinate projections commute and contract in L2

Statement

For the product-coordinate averages of Product-coordinate averaging operators, each PJ is a well-defined self-adjoint contraction on real L2(μ), PJ2=PJ, and for all J,K⊆[d], PJPK=PJ∩K as operators on L2(μ).

Facts & Assumptions

Given: A finite product of probability spaces, f,g∈L2(μ), and subsets J,K⊆[d].

[F1]

Product-coordinate averaging operators: PJf is obtained by integrating f over the complementary coordinates, with zero assigned on exceptional sections.

[F2]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: Tonelli identifies the integral of a nonnegative product-measurable function with either iterated integral.

[F3]

Fubini's theorem for L^1 functions on a sigma-finite product: integrable functions on a product have integrable sections almost everywhere and their iterated integrals agree.

[F4]

Cauchy-Schwarz inequality for L2: L2 functions have integrable products and satisfy ∫∣uv∣≤∥u∥2∥v∥2.

Proof

Given: The objects in the Statement and facts [F1]–[F4].

1.1F1F2F3F4

Let f∈L2(μ). Tonelli applied to ∣f∣2 shows that for almost every xJ, the section z↦f(xJ,z) is square-integrable on the complementary probability space. Cauchy–Schwarz with the constant function 1 makes that section integrable, so [F1] defines its average there. If representatives f and f~ agree almost everywhere, Tonelli applied to ∣f−f~∣2 shows their sections agree almost everywhere for almost every xJ; their averages therefore define the same almost-sure class. Fubini gives measurability of the section-average function.

2.1F1F2F4step 1.1

On almost every section, Cauchy–Schwarz gives ∣PJf(xJ)∣2≤∫∣f(xJ,z)∣2 dμ−J(z) because μ−J has mass one. Integrating in xJ and using Tonelli yields ∥PJf∥22≤∥f∥22, so PJ is a contraction. Averaging a function already independent of z−J leaves it unchanged, hence PJ2=PJ.

3.1F1F3F4step 2.1

For f,g∈L2, Cauchy–Schwarz makes fg integrable. Fubini in the two groups of coordinates gives ⟨PJf,g⟩=∫EJ(PJf)(PJg) dμJ=⟨f,PJg⟩. Thus PJ is self-adjoint.

4.1F1F3step 1.1∎

Applying PK and then PJ integrates over the coordinates outside K, then over the coordinates in K∖J. Repeated finite-product Fubini permits this order and identifies the iterated integral with integration over the complement of J∩K. The equality holds almost everywhere by [F3], including when either set is empty or full, so PJPKf=PJ∩Kf in L2.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Dependent-input Shapley effects are nonnegative and sum to one

Statement

Assume AC and the positive-variance hypotheses of Shapley effects for dependent inputs. Then v is monotone with v(∅)=0, v([d])=V, and 0≤v(S)≤V for every S⊆[d]. Every ϕi≥0, and ∑i=1dϕi=1. Moreover, on the exact-oracle input for this game, the procedure Exact finite-permutation Shapley effects terminates after at most 2d d! coalition-value calls and returns the Shapley effects defined above.

Facts & Assumptions

Given: AC, Y=f(X)∈L2, V=Var⁡(Y)>0, and the variance game v and effects ϕi from the definition.

[A1]

The Axiom of Choice: AC is assumed for the conditional-expectation supplier.

[F1]

Conditional expectation is the l2 orthogonal projection: under AC, conditional expectation is the orthogonal projection onto the corresponding L2 subspace and fixes measurable inputs.

[F2]

Shapley effects for dependent inputs: v(S)=Var⁡(E[Y∣GS]) and ϕi is the average normalized marginal contribution over all permutations.

[F3]

Exact finite-permutation Shapley effects: the procedure initializes the accumulators, starts each permutation with S=∅, adds v(S∪{i})−v(S) at entry i, updates S to S∪{i}, and returns the accumulated values divided by d!V.

Proof

Given: The objects in the Statement and facts [A1], [F1]–[F3].

1.1A1F1givenalgebra

Fix S⊆T⊆[d], and write mS=E[Y∣GS] and mT=E[Y∣GT]. The subspaces of GS- and GT-measurable L2 functions are nested. For every h in the smaller subspace, ⟨mT−Y,h⟩=0 because h also belongs to the larger subspace. Thus mT and Y have the same orthogonal projection onto the smaller subspace, namely mS, so mT−mS⊥mS−EY. Pythagoras gives v(T)−v(S)=∥mT−mS∥22≥0.

2.1F1F2step 1.1algebra

For any permutation π, sum the successive increments v(Piπ∪{i})−v(Piπ) in the order of that permutation. Every intermediate coalition value appears once positively and once negatively, leaving v([d])−v(∅). The projection in [F1] fixes Y, so v([d])=V; the empty-set projection is constant EY, so v(∅)=0. Step 1.1 gives monotonicity, so these endpoint values imply 0≤v(S)≤V for every coalition. Thus the increments sum to V.

3.1F2step 1.1step 2.1givenalgebra

Each increment in step 2.1 is nonnegative by step 1.1. Average over the finite set of d! permutations and divide by V>0. The resulting effects are nonnegative and their sum is V/V=1.

4.1F2F3givenalgebra∎

In the procedure [F3], before each entry i of a permutation π, the current set S is exactly Piπ: it starts empty and each preceding entry is added once. Thus the increment added to Ai is v(Piπ∪{i})−v(Piπ). There are d! permutations with d entries each, so the loops perform finitely many iterations and at most 2d d! exact coalition-value calls; every queried value is available by the stated oracle input. Summing the increments gives Ai=∑π∈Sd(v(Piπ∪{i})−v(Piπ)), and division by d!V returns exactly ϕi by [F2].

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Product-law Hoeffding ANOVA components

Definition

Let f∈L2(μ) on the finite product probability space of Product-coordinate averaging operators. For u⊆[d], its Hoeffding ANOVA component indexed by u is the L2 class fu:=∑v⊆u(−1)∣u∣−∣v∣Pvf. In particular f∅=P∅f=Ef. This convention includes all interaction orders up to d; fu depends only on coordinates in u once the coordinate averages are identified with their lifts to the full product.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Monte Carlo permutation Shapley effects have a joint CLT

Statement

Assume AC, d<∞, V>0, and let v be the conditional-expectation variance game of Shapley effects for dependent inputs. For the iid uniform-permutation increments Δ(r) of Monte Carlo permutation estimator for Shapley effects, the estimates are unbiased for the Shapley effects, converge almost surely, and n(ϕ^−ϕ)⇒N(0,Cov⁡(Δ)V2). The sample covariance estimate in the algorithm converges almost surely to Cov⁡(Δ), so its standard errors are consistent. For each finite n≥2 and d, the procedure terminates after n rows and makes at most 2nd coalition-value calls. Computing the sample means and covariance requires O(nd2) arithmetic operations, apart from permutation generation and oracle costs.

Facts & Assumptions

Given: AC, finite d, V>0, the conditional-projection variance game v, and iid uniform permutations.

[A1]

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

[F1]

Shapley effects for dependent inputs: the Shapley effect averages marginal contributions over all permutations.

[F2]

Monte Carlo permutation estimator for Shapley effects: each row is the vector of marginal coalition increments and the estimate is its mean divided by V.

[F3]

Dependent-input Shapley effects are nonnegative and sum to one: the conditional-projection game is monotone with range [0,V] and endpoints 0,V.

[F4]

Iid finite variance strong law: iid square-integrable real variables obey the strong law for their sample means.

[F5]

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

[F6]

Multivariate iid central limit theorem: under AC, finite-dimensional iid vectors with finite second moment have the multivariate CLT.

[F7]

Moments, variance, and covariance on a probability space: covariance is the centered product expectation.

Proof

Given: The hypotheses and facts [A1], [F1]–[F7].

1.1F1F2algebra

Fix i and S⊆[d]∖{i}. Exactly ∣S∣!(d−∣S∣−1)! permutations place precisely S before i: order S first, place i, and order the remaining coordinates last. Dividing by d! gives the coefficient of v(S∪{i})−v(S) in the expectation of Δi. This is exactly the Shapley weight in [F1], so EΔi=Vϕi and the estimator is unbiased.

1.2F2F3F4F5F7algebra

The range and monotonicity of v in [F3] give 0≤Δi≤V for every permutation. Thus the increment vector is bounded and has finite covariance. Each increment coordinate and each pairwise product is the same measurable function of each sampled permutation; [F5] gives independence, and the common input law gives identical distributions. Apply [F4] to their coordinate and product sequences; the sample mean and covariance converge almost surely to their population values.

2.1A1F2F5F6step 1.1step 1.2givenalgebra

The bounded increment vector satisfies the finite second-moment hypothesis of [F6]. The multivariate CLT gives n(Δˉ−EΔ)⇒N(0,Cov⁡(Δ)). Scaling by the fixed positive V and using step 1.1 gives the stated joint limit for ϕ^. Step 1.2 gives consistency of the covariance and standard-error estimates.

3.1F2givenalgebra∎

For each of the n rows, the procedure traverses d entries and requests two coalition values per entry. The loops are finite, so it terminates after n rows and makes at most 2nd oracle calls. Computing the d sample means and the d×d sample covariance from these rows takes O(nd2) arithmetic operations; this excludes permutation generation and oracle costs.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Independent product inputs have an orthogonal Hoeffding decomposition

Statement

Let d≥1 be finite, let X=(X1,…,Xd) have a finite product probability law, and let f(X)∈L2. With the components of Product-law Hoeffding ANOVA components, f=∑u⊆[d]fuin L2, each fu depends only on Xu, every nonempty component has mean zero, and for every i∈u its coordinate average satisfies Pu∖{i}fu=0. Distinct components are orthogonal, and Var⁡(f(X))=∑∅≠u⊆[d]E[fu(Xu)2].

Facts & Assumptions

Given: A finite product probability law, a real f∈L2, and the components fu defined above.

[F1]

Product-coordinate averaging operators: Pv averages over coordinates outside v and lifts the result to the product space.

[F2]

Product-coordinate projections commute and contract in L2: PJPK=PJ∩K, PJ is self-adjoint, and PJ2=PJ.

[F3]

Product-law Hoeffding ANOVA components: fu=∑v⊆u(−1)∣u∣−∣v∣Pvf.

[F4]

Moments, variance, and covariance on a probability space: variance is the squared L2 norm after subtracting the mean.

Proof

Given: The objects in the Statement and facts [F1]–[F4].

1.1F1F3algebra

Interchange the two finite sums in ∑u⊆[d]fu. The coefficient of Pvf is ∑u⊇v(−1)∣u∣−∣v∣=(1−1)d−∣v∣, which is zero unless v=[d], when it is one. Since P[d]f=f, this proves reconstruction.

2.1F1F2F3step 1.1algebra

Fix nonempty u and i∈u. Apply Pu∖{i} to the finite sum defining fu. For each w⊆u∖{i}, exactly the terms v=w and v=w∪{i} both become Pwf by [F2]; their signs are opposite. All terms cancel, so Pu∖{i}fu=0. Also Pufu=fu, since every v⊆u satisfies PuPv=Pv. Thus fu depends only on u, and for nonempty u its mean P∅fu is zero by applying [F2] to the preceding identity.

3.1F2step 2.1choose

Let u≠w. Choose i in their symmetric difference; after interchanging their names if needed, take i∈u∖w, and put Q=P[d]∖{i}. Since Pufu=fu, the projection composition rule [F2] and step 2.1 give Qfu=QPufu=Pu∖{i}fu=0. Since Pwfw=fw and i∉w, the same rule gives Qfw=QPwfw=Pwfw=fw. Self-adjointness of Q therefore gives ⟨fu,fw⟩=⟨fu,Qfw⟩=⟨Qfu,fw⟩=0.

4.1F3F4step 1.1step 3.1algebra∎

By step 1.1, f−Ef=∑u≠∅fu. Step 3.1 makes this a finite orthogonal sum, so its squared L2 norm is the sum of the squared component norms. Apply [F4] to identify that norm with Var⁡(f(X)).

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

First-order and total Sobol indices

Definition

Let f∈L2(μ) on a finite product probability law and let Vu denote E[fu2] for the components of Independent product inputs have an orthogonal Hoeffding decomposition. Write V=Var⁡(f)=∑u≠∅Vu. Only when V>0 define the first-order Sobol index and total Sobol index of coordinate i by Si:=V{i}V,STi:=∑u∋iVuV. For V=0, these normalized indices are undefined. The unnormalized numerators remain well-defined and equal zero for a constant output.

TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

Complete orthonormal tensor expansions group into Sobol components

Statement

Assume Countable Choice. Let X=(X1,…,Xd) have a finite product law. For each coordinate j, let (ϕj,k)k∈Aj be a finite or countable orthonormal family of real-valued functions in the real space L2(μj) with 0∈Aj, ϕj,0=1, and Eϕj,k(Xj)=0 for k≠0. For α∈A1×⋯×Ad, put ψα(x)=∏jϕj,αj(xj) and supp⁡(α)={j:αj≠0}. Assume the tensor family (ψα)α is a complete orthonormal family in L2(μ), and write cα=⟨f,ψα⟩ for real f∈L2(μ). Then Var⁡(f)=∑α≠0cα2,Vu=∑supp⁡(α)=ucα2(u≠∅). Consequently, if V=Var⁡(f)>0, Si=∑supp⁡(α)={i}cα2V,STi=∑i∈supp⁡(α)cα2V. The completeness assumption is separate from finite polynomial-chaos orthogonality; no law is asserted here to have a complete polynomial family.

Facts & Assumptions

Given: Countable Choice, the real product-law tensor family and completeness hypotheses in the Statement, and real f∈L2(μ).

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed only for the Parseval supplier below.

[F1]

Independent product inputs have an orthogonal Hoeffding decomposition: fu=∑v⊆u(−1)∣u∣−∣v∣Pvf and the variance components are Vu=∥fu∥22.

[F2]

Product-coordinate projections commute and contract in L2: every Pv is an L2 contraction.

[F3]

Parseval equivalences for an orthonormal family: under Countable Choice, finite-subset projections of a complete orthonormal family converge in norm to f and their squared coefficients sum to ∥f∥22.

[F4]

Orthonormal families, complete orthonormal systems and Hilbert bases: completeness means that the closed linear span is the whole Hilbert space.

[F5]

Fubini's theorem for L^1 functions on a sigma-finite product: integrable product sections may be integrated one coordinate at a time.

[F6]

L2 with the integral pairing is a Hilbert space: on real L2(μ), ⟨f,g⟩=∫fg dμ, so the constant coefficient is Ef.

[F7]

First-order and total Sobol indices: positive output variance is required for the normalized indices.

Proof

Given: The hypotheses and facts [A1], [F1]–[F7].

1.1F5given

For a tensor ψα and J⊆[d], the product integral defining PJψα factors by [F5]. If every nonconstant coordinate of α lies in J, every integrated factor is ϕj,0=1, so PJψα=ψα. If some j∉J has αj≠0, its factor has mean zero, so PJψα=0.

2.1F1step 1.1algebra

Let F be a finite set of multi-indices and fF=∑α∈Fcαψα. By [F1] and step 1.1, the coefficient of cαψα in (fF)u is zero when supp⁡(α)⊈u; otherwise it is ∑supp⁡(α)⊆v⊆u(−1)∣u∣−∣v∣=(1−1)∣u∣−∣supp⁡(α)∣. This equals one exactly when supp⁡(α)=u and zero otherwise. Hence (fF)u=∑α∈F:supp⁡(α)=ucαψα.

3.1A1F2F3F4step 2.1

By [F4], completeness means the tensor family's closed span is all of L2(μ). With [A1], Parseval [F3] gives fF→f in L2 as the finite-subset net increases through the tensor family. Each Qu:f↦fu is a finite signed sum of contractions Pv by [F2], so QufF→Quf=fu in L2. Orthonormality and step 2.1 give ∥QufF∥22=∑α∈F:supp⁡(α)=ucα2. These nondecreasing finite subsums converge to the nonnegative sum over all indices with support u; continuity of the norm then yields Vu=∑supp⁡(α)=ucα2.

4.1F3F6F7step 3.1algebra∎

The constant tensor is ψ0=1, so the real L2 pairing [F6] gives c0=⟨f,1⟩=Ef. Parseval [F3] applied to f−c0 gives Var⁡(f)=∑α≠0cα2. Grouping these nonnegative terms by support and substituting the component identities from step 3.1 into [F7] proves both normalized formulas when V>0.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Pick-freeze covariances recover first and total Sobol numerators

Statement

Let X=(X1,…,Xd) have a finite product probability law μ, f∈L2(μ), and μf=E[f(X)]. Let X′ be an independent copy of X. For i∈[d], define the first-order hybrid X[i]=(Xi,X−i′) and the total-effect hybrid X~[i]=(X−i,Xi′). Then E[(f(X)−μf)(f(X[i])−μf)]=V{i},12E[(f(X)−f(X~[i]))2]=∑u∋iVu, where Vu=E[fu2] are the variance components of Independent product inputs have an orthogonal Hoeffding decomposition. The first covariance is an unbiased numerator for the first-order index and the half squared difference is an unbiased numerator for the total index; normalizing by V is defined only when V>0.

Facts & Assumptions

Given: The objects in the Statement and an independent product-law copy X′.

[F1]

Independent product inputs have an orthogonal Hoeffding decomposition: f=∑ufu in L2, distinct components are orthogonal, and nonempty components are centered in each of their own coordinates.

[F2]

First-order and total Sobol indices: V{i} and ∑u∋iVu are the unnormalized first-order and total-effect numerators.

[F3]

Product-coordinate averaging operators: PJ integrates the coordinates outside J under the product law.

[F4]

Independent random elements and Independent random elements have product joint law: independent random elements have the product joint law.

[F5]

Fubini's theorem for L^1 functions on a sigma-finite product: integrable products may be evaluated by iterated integration.

[F6]

Moments, variance, and covariance on a probability space: variance and covariance are centered second moments.

[F7]

Product-coordinate projections commute and contract in L2: PJPK=PJ∩K for every pair of coordinate subsets.

Proof

Given: The hypotheses of the Statement and facts [F1]–[F7].

1.1F1F2F3F4F5F6F7

Fix i. For fixed xi, integrate f(xi,x−i)f(xi,x−i′) over two independent copies of the other coordinates. Fubini [F5] factors this integral as (P{i}f(xi))2. Averaging over xi gives E[f(X)f(X[i])]=∥P{i}f∥22. For a nonconstant ANOVA component with support u≠{i}, choose j∈u∖{i} if i∈u, or any j∈u otherwise. Dependence gives Pufu=fu. Hence [F7] gives P{i}fu=P{i}Pufu=P{i}∩ufu and P{i}Pu∖{j}fu=P{i}∩(u∖{j})fu. The two index sets are equal by the choice of j, so these averages agree; the latter is zero by the coordinate-centering property [F1]. Thus only the constant and singleton components remain, and P{i}f=μf+f{i}. Orthogonality [F1] gives ∥P{i}f∥22=μf2+V{i}, the first-order numerator by [F2]. Subtracting μf2 proves the first identity.

1.2F3F4F5F6algebra

Fix x−i. The two values f(Xi,x−i) and f(Xi′,x−i) are independent with the same conditional product integral over coordinate i. Expanding their squared difference gives half its conditional expectation equal to the variance of that one-coordinate section. Integrating over x−i by Fubini yields 12E[(f(X)−f(X~[i]))2]=∥f−P−if∥22.

2.1F1F2F3F7step 1.2algebra∎

If i∉u, then P−ifu=fu because fu depends only on Xu. If i∈u, dependence gives Pufu=fu, and [F7] gives P−ifu=P−iPufu=Pu∖{i}fu=0 by [F1]. Thus f−P−if=∑u∋ifu. Orthogonality [F1] makes its squared norm ∑u∋iVu, which is the total-effect numerator by [F2] and proves the second identity.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Coordinate Poincare inequalities bound total Sobol effects

Statement

Assume Countable Choice and Dependent Choice. Let X=(X1,…,Xd) have a finite product probability law, let f be a real class in L2, and choose a real product-measurable representative F of f. Fix i such that its marginal law is μi(A)=λ(A∩[ai,bi])/Li with Li=bi−ai>0. Assume that for almost every fixed x−i, the section xi↦F(xi,x−i) is absolutely continuous and its derivative ∂iF is square-integrable under the product law. If V=Var⁡(f(X))>0, then STi≤Li2π2 E∣∂iF(X)∣2V. More generally, the same conclusion holds with Li2/π2 replaced by any constant Ci for which each such almost-everywhere coordinate section of F satisfies Var⁡Xi(g)≤CiEXi∣g′∣2.

Facts & Assumptions

Given: Countable Choice and Dependent Choice, the product law, a real product-measurable representative F of a real f∈L2, the regularity assumptions in the Statement, and positive output variance.

[A1]

The Axiom of Countable Choice (ACω): every sequence of nonempty sets has a choice function.

[A2]

The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain: for a nonempty set X, an entire relation R on X, and a∈X, there is x:N→X with x0=a and xnRxn+1 for every n.

[F1]

Independent product inputs have an orthogonal Hoeffding decomposition: f is the orthogonal sum of its product ANOVA components, each fu depends only on Xu, and Pu∖{j}fu=0 for every j∈u.

[F2]

First-order and total Sobol indices: VSTi=∑u∋iVu when V>0.

[F3]

Sharp Poincare bound for the uniform law on an interval: for the uniform law on an interval of length Li, the coordinate variance of an absolutely continuous section is at most (Li2/π2) times its derivative's second moment.

[F4]

Fubini's theorem for L^1 functions on a sigma-finite product and Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: the almost-everywhere coordinate inequalities may be integrated over the remaining product coordinates.

[F5]

Product-coordinate averaging operators: P−i averages only coordinate i and lifts the section average to the full product space.

[F6]

Product-coordinate projections commute and contract in L2: PJPK=PJ∩K for every pair of coordinate subsets.

Proof

Given: The hypotheses, axioms [A1]–[A2], and facts [F1]–[F6].

1.1F1F2F5F6

For i∉u, [F5] and dependence only on Xu give P−ifu=fu. For i∈u, dependence gives Pufu=fu, so [F6] yields P−ifu=P−iPufu=Pu∖{i}fu=0 by the coordinate-centering property in [F1]. Linearity and reconstruction in [F1] therefore give f−P−if=∑u∋ifu. Orthogonality [F1] and the index definition [F2] give ∥f−P−if∥22=∑u∋iVu=VSTi.

2.1A1A2F3F4F5step 1.1

For almost every x−i, apply [F3] to the section of the chosen representative F. Its variance is ∫∣F−P−iF∣2dμi, and its derivative moment is ∫∣∂iF∣2dμi. Integrate the inequality over x−i; [F4] justifies the iterated integrals and gives ∥f−P−if∥22≤(Li2/π2)E∣∂iF(X)∣2.

3.1F2step 1.1step 2.1givenalgebra∎

Substitute the identity from step 1.1 into step 2.1 and divide by V>0. This proves the displayed bound. The same calculation with any valid coordinate constant Ci proves the stated general form.

AlgorithmAlgorithm: AI-adaptedProof: Not applicableOpen item page →

Pick-freeze Monte Carlo estimators for Sobol indices

Definition

Input: a finite product probability law μ, an evaluator f∈L2(μ), and a sample size n≥2. Draw n independent rows. In each row draw six mutually independent vectors X,X′,U,V,W,W′ with law μ. Reuse Y=f(X); for each i∈[d], evaluate the hybrids X[i]=(Xi,X−i′),X~[i]=(X−i,Xi′), and form Ni=f(X)f(X[i])−f(U)f(V),Ti=12(f(X)−f(X~[i]))2,D=12(f(W)−f(W′))2. For the n rows, compute their sample means Nˉi,Tˉi,Dˉ and the empirical sample covariance matrix Σ^ of Z=(N1,…,Nd,T1,…,Td,D). Explicitly, for row vectors Zr and their mean Zˉ, compute Σ^=1n−1∑r=1n(Zr−Zˉ)T(Zr−Zˉ). If Dˉ=0, return status zero-empirical-variance and no normalized index. If Dˉ>0, return the raw ratios S^i=Nˉi/Dˉ and S^Ti=Tˉi/Dˉ. Also return the formal first-order plug-in matrix J^Σ^J^T/n, where J^ is the derivative of the vector ratio map evaluated at (Nˉ1,…,Nˉd,Tˉ1,…,Tˉd,Dˉ). No clipping is applied to a negative finite-sample ratio. The L2 input assumption alone does not guarantee a finite population covariance of Z or a valid MCSE interpretation of this matrix.

Remarks

Pick-freeze covariances recover first and total Sobol numerators makes each numerator and the denominator unbiased for its corresponding variance quantity. The ratios are not asserted unbiased; A pick-freeze ratio can be biased at finite sample size ↗ gives an explicit finite-sample bias witness. Under AC, f∈L4(μ) and positive output variance, Pick-freeze Sobol ratios are consistent and have a joint delta-method CLT establishes the joint CLT and the plug-in matrix's asymptotic MCSE interpretation. The empirical matrix formula above is still computed for L2 inputs without these extra assumptions.

TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

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).

5 · Examples, counterexamples and false statements

None yet.

Sources