Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-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.

Christoffel-weighted least-squares polynomial collocation

Definition

Let Λ be finite, contain 0, and let ψ=(ψα)α∈Λ be the real orthonormal basis of Finite orthonormal polynomial tensor basis. Set N=∣Λ∣ and KΛ(y)=∑α∈Λ∣ψα(y)∣2. The algorithm takes an evaluable real function u, a positive integer sample count M, and independent samples X1,…,XM from the probability law dν=(KΛ/N) dρ. It forms G=1M∑i=1MNKΛ(Xi)ψ(Xi)ψ(Xi)T,b=1M∑i=1MNKΛ(Xi)u(Xi)ψ(Xi). If every eigenvalue of G lies in [1/2,3/2], return the unique coefficient vector c=G−1b and polynomial u^=∑α∈Λcαψα. Otherwise return unstable-sample and no coefficients. The weighted empirical objective minimized on the accepted branch is 1M∑i=1MNKΛ(Xi)∣u(Xi)−p(Xi)∣2, over p∈PΛ.

Depends on

Used by

Dependency tree · two levels

4 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