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.
Tensor products are dense in Bochner L2 under scalar and spatial density
Statement
Let be the scalar linear span of a declared polynomial-chaos family in and let be a linear subspace dense in the separable real Hilbert space . Assume separately that is dense in ; this law-specific completeness hypothesis is not inferred from finite moments. Then the algebraic tensor span is dense in .
Facts & Assumptions
Given: A finite product probability space, the stated scalar density hypothesis, and a dense linear spatial subspace .
Bochner L2 space for a finite product-law input defines using strongly measurable square-integrable maps.
Dominated convergence gives convergence of scalar integrals for pointwise almost-everywhere convergence under an integrable measurable majorant.
Scalar density of in is an explicit hypothesis in Given, not a conclusion of the finite-basis orthonormality theorem.
Density of in is an explicit hypothesis in Given.
Strongly measurable Banach-valued function characterizes strong measurability through simple-map approximation; a scalar measurable function times a fixed vector is strongly measurable.
Proof
Fix and . By [F1] and [F5], choose a simple approximation sequence and replace it and by zero on their measurable null exceptional set. Write for the resulting simple maps, which converge everywhere to the Borel representative . Set . The truncation sets are measurable and is finite-valued simple. At it is zero; at every other point it eventually equals , so . Since , [F2] gives . Choose one such map with error below , taking by allowing a zero value. It remains to approximate its finitely many terms with total error below .
For each , use [F3] and [F4] to choose and with . Such choices are possible by first making the scalar error arbitrarily small, which bounds , and then making the vector error small. The product norm estimate follows pointwise from the triangle inequality and then from scalar square-integral estimation. Each product is strongly measurable by [F5], so these are legitimate Bochner-space norms.
The finite sum belongs to the displayed algebraic tensor span, and the triangle inequality with step 2.1 gives distance less than from . Together with step 1.1 its distance from is less than . Since and were arbitrary, the span is dense.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
22 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
- Christian Clason, Introduction to Finite Element Methods, Chapter 11 (standard reference, not scraped)
- Bruno Sudret, Polynomial Chaos Expansions and Stochastic Finite Element Methods, §§3–4 (standard reference, not scraped)