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
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Approximation and Compactness in C(K)
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- 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
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Consistency and Limiting Distributions
- 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
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Delta Method and Asymptotic Normality
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- 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
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hereditary and Productive Behaviour of the Separation Axioms
- 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
- Matrix Differentiation and First-order Spectral Perturbation
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- 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
- 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
- Stone–Weierstrass in General
- Strong Laws of Large Numbers
- 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 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
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 ; more general coordinate laws may use any established Poincare constant . 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 , the separate Shapley definition Shapley effects for dependent inputs uses the game 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- multiresolution and variance decomposition assumes Countable Choice and the uniform cube ; its b-adic frequency components are not identified with arbitrary product-law conditional ANOVA components.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Shapley effects for dependent inputs
Definition
Assume AC. On a probability space , let be finite and let be any jointly distributed finite family of random elements. Let , and put . For , set , with , and If , let be the set of all permutations of , and let contain the indices occurring before in . The Shapley effect of coordinate under this convention is If , 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 .
Product-coordinate averaging operators
Definition
Let be finite, let be probability spaces, and let be their finite product with product sigma-algebra and product probability. Write . For , let and denote the corresponding coordinate product; the empty product is a one-point probability space. For real , define the coordinate average for almost every for which the section is integrable, and assign zero on the exceptional null set. Regard also as a function on the full product that is constant in the coordinates outside . The conventions are as an class and .
Remarks
The displayed integral is initially defined on representatives. Its independence of the representative and its properties are established by Product-coordinate projections commute and contract in L2 ↗.
Sharp Poincare bound for the uniform law on an interval
Statement
Assume Countable Choice and Dependent Choice. Let with , let be absolutely continuous, and suppose . Let have the uniform law . Then
Facts & Assumptions
Given: Countable Choice, Dependent Choice, , an absolutely continuous with square-integrable derivative, and the probability law of specified in the Statement.
The Axiom of Countable Choice (): every sequence of nonempty sets has a choice function.
The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain: for a nonempty set , an entire relation on , and , there is with and for every .
Absolute continuity on a compact interval: absolute continuity on a compact interval controls sums of endpoint increments on finite disjoint interval families.
Integration by parts for absolutely continuous functions: under Countable and Dependent Choice, absolutely continuous functions satisfy integration by parts.
The one-dimensional torus and its normalized Haar integral: the circle is integrated over a period interval with normalized Lebesgue measure.
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 .
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].
Let and for . Define for and for , then extend periodically to . The two absolutely continuous pieces match at , and . 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 is absolutely continuous on the period interval. Its mean is zero, , and affine changes of variables give .
For each integer , apply integration by parts [F2] to on , taking real and imaginary parts. The boundary term vanishes since and , giving . Parseval [F4] and the zero mean in step 1.1 yield Substituting the two norm identities from step 1.1 and dividing by proves the claimed bound. Equality holds for : its mean is zero, its variance is , and its derivative second moment is . Hence the constant is sharp.
Exact finite-permutation Shapley effects
Definition
Input: A finite player set , an exact oracle for at every , and a known satisfying and . In the sensitivity application, is the conditional-projection variance game of Shapley effects for dependent inputs.
- Initialize for every .
- For each of the permutations , traverse its entries in order. Start with . At entry , add to and replace by .
- Return for all .
The domain excludes and unavailable coalition values; the procedure does not approximate conditional expectations or their numerical errors.
Monte Carlo permutation estimator for Shapley effects
Definition
Input: A finite player set , exact coalition values with , , and a declared integer sample size .
- Draw independent permutations , each uniformly from the permutations of .
- For each row and each , compute .
- Return and the standard-error covariance estimate , where .
The exact conditional-variance evaluation is an input oracle. This permutation sampling procedure does not supply a conditional sampler or bound its numerical error.
Product-coordinate projections commute and contract in L2
Statement
For the product-coordinate averages of Product-coordinate averaging operators, each is a well-defined self-adjoint contraction on real , , and for all , as operators on .
Facts & Assumptions
Given: A finite product of probability spaces, , and subsets .
Product-coordinate averaging operators: is obtained by integrating over the complementary coordinates, with zero assigned on exceptional sections.
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.
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.
Cauchy-Schwarz inequality for : functions have integrable products and satisfy .
Proof
Given: The objects in the Statement and facts [F1]–[F4].
Let . Tonelli applied to shows that for almost every , the section is square-integrable on the complementary probability space. Cauchy–Schwarz with the constant function makes that section integrable, so [F1] defines its average there. If representatives and agree almost everywhere, Tonelli applied to shows their sections agree almost everywhere for almost every ; their averages therefore define the same almost-sure class. Fubini gives measurability of the section-average function.
On almost every section, Cauchy–Schwarz gives because has mass one. Integrating in and using Tonelli yields , so is a contraction. Averaging a function already independent of leaves it unchanged, hence .
For , Cauchy–Schwarz makes integrable. Fubini in the two groups of coordinates gives . Thus is self-adjoint.
Applying and then integrates over the coordinates outside , then over the coordinates in . Repeated finite-product Fubini permits this order and identifies the iterated integral with integration over the complement of . The equality holds almost everywhere by [F3], including when either set is empty or full, so in .
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 is monotone with , , and for every . Every , and Moreover, on the exact-oracle input for this game, the procedure Exact finite-permutation Shapley effects terminates after at most coalition-value calls and returns the Shapley effects defined above.
Facts & Assumptions
Given: AC, , , and the variance game and effects from the definition.
The Axiom of Choice: AC is assumed for the conditional-expectation supplier.
Conditional expectation is the l2 orthogonal projection: under AC, conditional expectation is the orthogonal projection onto the corresponding subspace and fixes measurable inputs.
Shapley effects for dependent inputs: and is the average normalized marginal contribution over all permutations.
Exact finite-permutation Shapley effects: the procedure initializes the accumulators, starts each permutation with , adds at entry , updates to , and returns the accumulated values divided by .
Proof
Given: The objects in the Statement and facts [A1], [F1]–[F3].
Fix , and write and . The subspaces of - and -measurable functions are nested. For every in the smaller subspace, because also belongs to the larger subspace. Thus and have the same orthogonal projection onto the smaller subspace, namely , so . Pythagoras gives .
For any permutation , sum the successive increments in the order of that permutation. Every intermediate coalition value appears once positively and once negatively, leaving . The projection in [F1] fixes , so ; the empty-set projection is constant , so . Step 1.1 gives monotonicity, so these endpoint values imply for every coalition. Thus the increments sum to .
Each increment in step 2.1 is nonnegative by step 1.1. Average over the finite set of permutations and divide by . The resulting effects are nonnegative and their sum is .
In the procedure [F3], before each entry of a permutation , the current set is exactly : it starts empty and each preceding entry is added once. Thus the increment added to is . There are permutations with entries each, so the loops perform finitely many iterations and at most exact coalition-value calls; every queried value is available by the stated oracle input. Summing the increments gives , and division by returns exactly by [F2].
Product-law Hoeffding ANOVA components
Definition
Let on the finite product probability space of Product-coordinate averaging operators. For , its Hoeffding ANOVA component indexed by is the class In particular . This convention includes all interaction orders up to ; depends only on coordinates in once the coordinate averages are identified with their lifts to the full product.
Monte Carlo permutation Shapley effects have a joint CLT
Statement
Assume AC, , , and let be the conditional-expectation variance game of Shapley effects for dependent inputs. For the iid uniform-permutation increments of Monte Carlo permutation estimator for Shapley effects, the estimates are unbiased for the Shapley effects, converge almost surely, and The sample covariance estimate in the algorithm converges almost surely to , so its standard errors are consistent. For each finite and , the procedure terminates after rows and makes at most coalition-value calls. Computing the sample means and covariance requires arithmetic operations, apart from permutation generation and oracle costs.
Facts & Assumptions
Given: AC, finite , , the conditional-projection variance game , and iid uniform permutations.
The Axiom of Choice: AC is assumed for the multivariate CLT supplier.
Shapley effects for dependent inputs: the Shapley effect averages marginal contributions over all permutations.
Monte Carlo permutation estimator for Shapley effects: each row is the vector of marginal coalition increments and the estimate is its mean divided by .
Dependent-input Shapley effects are nonnegative and sum to one: the conditional-projection game is monotone with range and endpoints .
Iid finite variance strong law: iid square-integrable real variables obey the strong law for their sample means.
Measurable coordinatewise functions preserve independence: measurable coordinatewise functions of an independent family remain independent.
Multivariate iid central limit theorem: under AC, finite-dimensional iid vectors with finite second moment have the multivariate CLT.
Moments, variance, and covariance on a probability space: covariance is the centered product expectation.
Proof
Given: The hypotheses and facts [A1], [F1]–[F7].
Fix and . Exactly permutations place precisely before : order first, place , and order the remaining coordinates last. Dividing by gives the coefficient of in the expectation of . This is exactly the Shapley weight in [F1], so and the estimator is unbiased.
The range and monotonicity of in [F3] give 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.
The bounded increment vector satisfies the finite second-moment hypothesis of [F6]. The multivariate CLT gives . Scaling by the fixed positive and using step 1.1 gives the stated joint limit for . Step 1.2 gives consistency of the covariance and standard-error estimates.
For each of the rows, the procedure traverses entries and requests two coalition values per entry. The loops are finite, so it terminates after rows and makes at most oracle calls. Computing the sample means and the sample covariance from these rows takes arithmetic operations; this excludes permutation generation and oracle costs.
Independent product inputs have an orthogonal Hoeffding decomposition
Statement
Let be finite, let have a finite product probability law, and let . With the components of Product-law Hoeffding ANOVA components, each depends only on , every nonempty component has mean zero, and for every its coordinate average satisfies . Distinct components are orthogonal, and
Facts & Assumptions
Given: A finite product probability law, a real , and the components defined above.
Product-coordinate averaging operators: averages over coordinates outside and lifts the result to the product space.
Product-coordinate projections commute and contract in L2: , is self-adjoint, and .
Moments, variance, and covariance on a probability space: variance is the squared norm after subtracting the mean.
Proof
Given: The objects in the Statement and facts [F1]–[F4].
Interchange the two finite sums in . The coefficient of is , which is zero unless , when it is one. Since , this proves reconstruction.
Fix nonempty and . Apply to the finite sum defining . For each , exactly the terms and both become by [F2]; their signs are opposite. All terms cancel, so . Also , since every satisfies . Thus depends only on , and for nonempty its mean is zero by applying [F2] to the preceding identity.
Let . Choose in their symmetric difference; after interchanging their names if needed, take , and put . Since , the projection composition rule [F2] and step 2.1 give . Since and , the same rule gives . Self-adjointness of therefore gives .
By step 1.1, . Step 3.1 makes this a finite orthogonal sum, so its squared norm is the sum of the squared component norms. Apply [F4] to identify that norm with .
First-order and total Sobol indices
Definition
Let on a finite product probability law and let denote for the components of Independent product inputs have an orthogonal Hoeffding decomposition. Write . Only when define the first-order Sobol index and total Sobol index of coordinate by For , these normalized indices are undefined. The unnormalized numerators remain well-defined and equal zero for a constant output.
Complete orthonormal tensor expansions group into Sobol components
Statement
Assume Countable Choice. Let have a finite product law. For each coordinate , let be a finite or countable orthonormal family of real-valued functions in the real space with , , and for . For , put and . Assume the tensor family is a complete orthonormal family in , and write for real . Then Consequently, if , 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 .
The Axiom of Countable Choice (): Countable Choice is assumed only for the Parseval supplier below.
Independent product inputs have an orthogonal Hoeffding decomposition: and the variance components are .
Product-coordinate projections commute and contract in L2: every is an contraction.
Parseval equivalences for an orthonormal family: under Countable Choice, finite-subset projections of a complete orthonormal family converge in norm to and their squared coefficients sum to .
Orthonormal families, complete orthonormal systems and Hilbert bases: completeness means that the closed linear span is the whole Hilbert space.
Fubini's theorem for L^1 functions on a sigma-finite product: integrable product sections may be integrated one coordinate at a time.
with the integral pairing is a Hilbert space: on real , , so the constant coefficient is .
First-order and total Sobol indices: positive output variance is required for the normalized indices.
Proof
Given: The hypotheses and facts [A1], [F1]–[F7].
For a tensor and , the product integral defining factors by [F5]. If every nonconstant coordinate of lies in , every integrated factor is , so . If some has , its factor has mean zero, so .
Let be a finite set of multi-indices and . By [F1] and step 1.1, the coefficient of in is zero when ; otherwise it is . This equals one exactly when and zero otherwise. Hence .
By [F4], completeness means the tensor family's closed span is all of . With [A1], Parseval [F3] gives in as the finite-subset net increases through the tensor family. Each is a finite signed sum of contractions by [F2], so in . Orthonormality and step 2.1 give . These nondecreasing finite subsums converge to the nonnegative sum over all indices with support ; continuity of the norm then yields .
The constant tensor is , so the real pairing [F6] gives . Parseval [F3] applied to gives . Grouping these nonnegative terms by support and substituting the component identities from step 3.1 into [F7] proves both normalized formulas when .
Pick-freeze covariances recover first and total Sobol numerators
Statement
Let have a finite product probability law , , and . Let be an independent copy of . For , define the first-order hybrid and the total-effect hybrid . Then where 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 is defined only when .
Facts & Assumptions
Given: The objects in the Statement and an independent product-law copy .
Independent product inputs have an orthogonal Hoeffding decomposition: in , distinct components are orthogonal, and nonempty components are centered in each of their own coordinates.
First-order and total Sobol indices: and are the unnormalized first-order and total-effect numerators.
Product-coordinate averaging operators: integrates the coordinates outside under the product law.
Independent random elements and Independent random elements have product joint law: independent random elements have the product joint law.
Fubini's theorem for L^1 functions on a sigma-finite product: integrable products may be evaluated by iterated integration.
Moments, variance, and covariance on a probability space: variance and covariance are centered second moments.
Product-coordinate projections commute and contract in L2: for every pair of coordinate subsets.
Proof
Given: The hypotheses of the Statement and facts [F1]–[F7].
Fix . For fixed , integrate over two independent copies of the other coordinates. Fubini [F5] factors this integral as . Averaging over gives . For a nonconstant ANOVA component with support , choose if , or any otherwise. Dependence gives . Hence [F7] gives and . The two index sets are equal by the choice of , so these averages agree; the latter is zero by the coordinate-centering property [F1]. Thus only the constant and singleton components remain, and . Orthogonality [F1] gives , the first-order numerator by [F2]. Subtracting proves the first identity.
Fix . The two values and are independent with the same conditional product integral over coordinate . Expanding their squared difference gives half its conditional expectation equal to the variance of that one-coordinate section. Integrating over by Fubini yields .
If , then because depends only on . If , dependence gives , and [F7] gives by [F1]. Thus . Orthogonality [F1] makes its squared norm , which is the total-effect numerator by [F2] and proves the second identity.
Coordinate Poincare inequalities bound total Sobol effects
Statement
Assume Countable Choice and Dependent Choice. Let have a finite product probability law, let be a real class in , and choose a real product-measurable representative of . Fix such that its marginal law is with . Assume that for almost every fixed , the section is absolutely continuous and its derivative is square-integrable under the product law. If , then More generally, the same conclusion holds with replaced by any constant for which each such almost-everywhere coordinate section of satisfies .
Facts & Assumptions
Given: Countable Choice and Dependent Choice, the product law, a real product-measurable representative of a real , the regularity assumptions in the Statement, and positive output variance.
The Axiom of Countable Choice (): every sequence of nonempty sets has a choice function.
The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain: for a nonempty set , an entire relation on , and , there is with and for every .
Independent product inputs have an orthogonal Hoeffding decomposition: is the orthogonal sum of its product ANOVA components, each depends only on , and for every .
Sharp Poincare bound for the uniform law on an interval: for the uniform law on an interval of length , the coordinate variance of an absolutely continuous section is at most times its derivative's second moment.
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.
Product-coordinate averaging operators: averages only coordinate and lifts the section average to the full product space.
Product-coordinate projections commute and contract in L2: for every pair of coordinate subsets.
Proof
Given: The hypotheses, axioms [A1]–[A2], and facts [F1]–[F6].
For , [F5] and dependence only on give . For , dependence gives , so [F6] yields by the coordinate-centering property in [F1]. Linearity and reconstruction in [F1] therefore give . Orthogonality [F1] and the index definition [F2] give .
For almost every , apply [F3] to the section of the chosen representative . Its variance is , and its derivative moment is . Integrate the inequality over ; [F4] justifies the iterated integrals and gives .
Substitute the identity from step 1.1 into step 2.1 and divide by . This proves the displayed bound. The same calculation with any valid coordinate constant proves the stated general form.
Pick-freeze Monte Carlo estimators for Sobol indices
Definition
Input: a finite product probability law , an evaluator ,
and a sample size . Draw independent rows. In each row draw six
mutually independent vectors with law . Reuse ;
for each , evaluate the hybrids
and form
For the rows, compute their sample means and
the empirical sample covariance matrix of
Explicitly, for row vectors and their mean , compute
If , return status zero-empirical-variance and no normalized index.
If , return the raw ratios and
. Also return the formal first-order plug-in
matrix , where
is the derivative of the vector ratio map evaluated at
.
No clipping is applied to a negative finite-sample ratio. The input
assumption alone does not guarantee a finite population covariance of
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, 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 inputs without these extra assumptions.
Pick-freeze Sobol ratios are consistent and have a joint delta-method CLT
Statement
Assume AC. Let , let the product-law output satisfy ,
and suppose . For the iid row vector and
estimates of Pick-freeze Monte Carlo estimators for Sobol indices, write
where , and let . The
probability that the algorithm returns zero-empirical-variance tends to
zero. For asymptotic statements, let be the returned ratio
vector when and the zero vector otherwise. Define the Borel map
by
As , is consistent in probability and
where ; since , is smooth on a neighborhood of .
Every fixed extension on the zero-status event has the same limit. Write
for the returned MCSE
covariance matrix when . Then
in probability; any fixed extension of
on the zero-status event has the same convergence. For each finite and
, the procedure terminates after rows with at most evaluations
of . Forming the sample covariance and plug-in MCSE takes
scalar arithmetic operations. The finite-sample ratios need not
be unbiased.
Facts & Assumptions
Given: AC, , , , and iid rows generated by the algorithm.
The Axiom of Choice: AC is assumed for the multivariate CLT supplier.
Pick-freeze Monte Carlo estimators for Sobol indices: each row draws six mutually independent vectors with law , evaluates once, the first-order and total-effect hybrids, and , and forms the row vector ; the output ratios use the final coordinate as denominator.
Pick-freeze covariances recover first and total Sobol numerators: the first and total pick-freeze numerators have means and , respectively.
Iid finite variance strong law: square-integrable iid variables have sample means converging almost surely to their means.
Measurable coordinatewise functions preserve independence: measurable coordinatewise functions of an independent family remain independent.
Khinchin weak law for integrable IID variables: iid integrable variables have sample means converging in probability.
Multivariate iid central limit theorem: under AC, iid finite-dimensional random vectors with finite second moment satisfy a multivariate CLT, including singular covariance.
First- and second-order delta method for random vectors: a differentiable map transfers a vector CLT to the derivative image.
Moments, variance, and covariance on a probability space: is the covariance matrix of the row vector.
Cauchy-Schwarz inequality for : square-integrable row coordinates have integrable pairwise products.
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.
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].
For each row, Cauchy–Schwarz [F9] and make and square-integrable; makes and square-integrable as well. Thus every coordinate of has finite second moment. By [F10]–[F11], and by [F8]. The covariance identity [F2] gives and , hence and . Independent rows make these row vectors iid.
Apply [F3] to each of the finitely many coordinates of . Then almost surely. Since , almost surely its last coordinate is eventually positive, so the continuous ratio formula gives almost surely and . 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.
The finite second moment from step 1.1 and [A1] satisfy [F6]. Hence . The map in the Statement is Borel, being the continuous ratio map on the open half-space and zero on its complement. Since , it is smooth near with derivative . Applying [F7] gives the joint delta-method limit, and step 2.1 transfers it to every stated fixed extension.
For every two coordinates , Cauchy–Schwarz gives . 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 . 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 near then gives in probability. Since the algorithm returns , 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.
The loops over rows and coordinates are finite, so the procedure terminates after the rows. In each row [F1] evaluates once and reuses it in every hybrid expression, evaluates the first-order and total-effect hybrids, and evaluates the four additional values . This requires evaluations per row, hence at most overall. Forming the covariance of the -dimensional row vectors costs scalar operations, and the plug-in matrix products cost .
5 · Examples, counterexamples and false statements
None yet.
Sources
- Eunhye Song, Barry L. Nelson, and Jeremy Staum, Shapley Effects for Global Sensitivity Analysis: Theory and Computation, §3.1
- Thierry Klein, Introduction to Sensitivity Analysis: The Statistical Study of Sobol Indices, complete lecture notes, §§2.2.2–2.2.3
- Matieyendou Lamboni, Bertrand Iooss, Anne-Laure Popelin, and Fabrice Gamboa, Derivative-based global sensitivity measures: general links with Sobol' indices and numerical tests, §3
- I.M. Sobol' and S. Kucherenko, Derivative based global sensitivity measures and their link with global sensitivity indices, §4, Theorem 2
- Eunhye Song, Barry L. Nelson, and Jeremy Staum, Shapley Effects for Global Sensitivity Analysis: Theory and Computation, §4.1
- Thierry Klein, Introduction to Sensitivity Analysis: The Statistical Study of Sobol Indices, complete lecture notes, §2.2.2
- Eunhye Song, Barry L. Nelson, and Jeremy Staum, Shapley Effects for Global Sensitivity Analysis: Theory and Computation, §4 and Theorem 3
- Thierry Klein, Introduction to Sensitivity Analysis: The Statistical Study of Sobol Indices, complete lecture notes, Theorem 2.1 and Corollary 2.1
- Art B. Owen, Variance Components and Generalized Sobol' Indices, §§2–2.1
- Thierry Klein, Introduction to Sensitivity Analysis: The Statistical Study of Sobol Indices, complete lecture notes, Definition 2.1
- Art B. Owen, Variance Components and Generalized Sobol' Indices, §2
- Thierry Klein, Introduction to Sensitivity Analysis: The Statistical Study of Sobol Indices, complete lecture notes, §2.2
- Andrea Saltelli, Making Best Use of Model Evaluations to Compute Sensitivity Indices, §2
- Art B. Owen, Variance Components and Generalized Sobol' Indices, §2.1
- Thierry Klein, Introduction to Sensitivity Analysis: The Statistical Study of Sobol Indices, complete lecture notes, §4
- Art B. Owen, Variance Components and Generalized Sobol' Indices, §§2.1 and 7