Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Finite product-law polynomial-chaos input data

Definition

Fix an integer d≥1, independent real random variables Y1,…,Yd with marginal Borel probability laws ρ1,…,ρd, and a degree cutoff vector p=(p1,…,pd)∈N0d. Their joint law is ρ=ρ1⊗⋯⊗ρd on Rd, as in Independent random elements have product joint law. For a Borel probability law ρj on R, define supp⁡(ρj):={x∈R:ρj(U)>0 for every open U∋x}. The complement is a union of zero-measure members of the countable rational interval basis, so countable additivity gives ρj(supp⁡(ρj))=1. Set Γ=∏j=1dsupp⁡(ρj) and give it the trace Borel sigma-algebra from Rd. The product rectangle formula gives ρ(Γ)=1. Whenever the measure space is written as (Γ,B(Γ),ρ), ρ denotes the restriction of the product law on Rd to B(Γ); it is therefore a probability measure. The product rectangle formula also identifies this restriction with the finite product of the marginal laws restricted to their supports. The cutoff vector p is admissible when, for every j=1,…,d, ∫∣y∣2pj dρj(y)<∞ and the monomial Gram matrix Gj=(∫yr+s dρj(y))0≤r,s≤pj is positive definite, meaning cTGjc>0 for each nonzero c∈Rpj+1. Throughout the pair, assume the selected cutoff vector is admissible. The admissible degree box is {α∈N0d:0≤αj≤pj for every j}. Admissibility gives a finite inner product on each stated polynomial space. It is only a finite-degree condition; it does not assert that polynomials are dense in any L2(ρj).

Depends on

Used by

Dependency tree · two levels

11 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