Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Weighted least squares is stable on the good Gram event

Statement

Let real u∈L2(ρ) have a representative evaluable at the Christoffel samples, and let u^ be the accepted weighted least-squares fit from Christoffel-weighted least-squares polynomial collocation. On the event spec⁡(G)⊆[1/2,3/2], the normal equations have a unique solution, and u^ is the unique minimizer over p∈PΛ of the weighted empirical objective JM(p):=1M∑i=1MNKΛ(Xi)∣u(Xi)−p(Xi)∣2. Moreover, ∥u^−PΛu∥L2(ρ)≤2(1M∑i=1MNKΛ(Xi)∣u(Xi)−PΛu(Xi)∣2)1/2, so ∥u−u^∥L2(ρ)2≤∥u−PΛu∥L2(ρ)2+2M∑i=1MNKΛ(Xi)∣u(Xi)−PΛu(Xi)∣2. For 0<δ<1 and M≥12Nlog⁡(2N/δ), the good event has probability at least 1−δ by Bounded-Christoffel sampling stabilizes the empirical Gram matrix.

Facts & Assumptions

Given: A finite real orthonormal family, u∈L2(ρ), samples and weights from the Christoffel least-squares algorithm, and the good Gram event.

[F1]

Christoffel-weighted least-squares polynomial collocation defines G, the weighted normal-equation vector, and the accepted fit.

[F2]

Bounded-Christoffel sampling stabilizes the empirical Gram matrix gives probability at least 1−δ for the good Gram event under the stated sample budget.

[F3]

Finite polynomial-chaos orthogonal projection defines PΛu and its coefficient vector c.

[F4]

Finite chaos projection, Parseval identity, mean, and variance gives u−PΛu⊥PΛ.

[F5]

Independent polynomial-chaos tensor products are orthonormal gives the real orthonormal basis used by the design matrix.

Proof

1.1F1givenalgebra

Put wi=N/KΛ(Xi)>0, and let the ith row of the design matrix A be wi/M ψ(Xi)T. Then ATA=G. On the good event, G is positive definite, so the normal equations have the unique solution c^=G−1ATz, where zi=wi/M u(Xi).

1.2F1step 1.1algebra

For any coefficient vector γ, the objective at p=∑α∈Λγαψα is JM(p)=∥Aγ−z∥22. The normal equations give AT(Ac^−z)=0. With d:=γ−c^, expansion yields JM(p)−JM(u^)=2dTAT(Ac^−z)+dTATAd=dTGd. Positive definiteness of G makes this difference strictly positive whenever γ≠c^. Since the basis coefficients uniquely identify elements of PΛ, u^ is the unique minimizer.

2.1F1F3F5step 1.1algebra

Let c be the exact coefficient vector of PΛu and let ri=u(Xi)−PΛu(Xi). Then z−Ac has entries wi/M ri, and the normal equations give c^−c=G−1AT(z−Ac). Moreover, (G−1AT)(G−1AT)T=G−1ATAG−1=G−1. Thus ∥G−1AT∥op2=λmax⁡(G−1)=1/λmin⁡(G)≤2, yielding the first bound.

3.1F4F5step 2.1algebra

Orthonormality [F5] gives ∥u^−PΛu∥L2(ρ)=∥c^−c∥2. By [F4], u−PΛu is orthogonal to this polynomial difference, so Pythagoras gives ∥u−u^∥2=∥u−PΛu∥2+∥u^−PΛu∥2. Substitute the first bound and square it to obtain the second inequality.

4.1F2given∎

The probability assertion is exactly [F2] under its stated independent sampling and budget hypotheses; no probability is asserted outside that good-event regime.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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