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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

42 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