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.
Christoffel sampling is normalized and its weighted Gram has mean identity
Statement
Let and be as in Christoffel-weighted least-squares polynomial collocation, with . Then pointwise, the measure is a probability measure, and the random matrix satisfies , , and almost surely.
Facts & Assumptions
Given: A finite real orthonormal polynomial family indexed by , with , and its Christoffel kernel.
Christoffel-weighted least-squares polynomial collocation defines and the rank-one matrix .
Integration is linear on integrable functions (The Lebesgue integral is linear on ); the finite sums defining can therefore be integrated term by term.
Cauchy-Schwarz inequality for makes each product integrable. Since , integration against is integration against that density for nonnegative measurable functions, and for signed functions once absolute integrability is established.
Proof
Since and , . By [F2]–[F3], . Therefore is a probability measure and the denominator in [F1] is positive everywhere.
For each pair , [F4] and show , so the entry is integrable under . Using the signed density identity in [F4], its expectation is by [F2], hence . The rank-one outer product is positive semidefinite and has operator norm , proving the remaining assertions.
Depends on
Used by
Cited to discharge well-definedness by Christoffel-weighted least-squares polynomial collocation.
Dependency tree · two levels
16 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
- Albert Cohen and Giovanni Migliorati, Optimal Weighted Least-Squares Methods, §2 (standard reference, not scraped)
- Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, §6.2 (standard reference, not scraped)