Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Weighted orthogonal-polynomial Galerkin spaces and spectral scale

Definition

Let μ be a finite positive Borel measure on a compact interval [a,b] with infinite relative support. For each integer N≥0, the moment data (a,b,m=N+1,r=2N+1,μ) satisfy the hypotheses of Positive-measure Gaussian quadrature moment data. Let p0,…,pN be the monic orthogonal polynomials supplied by Monic orthogonal polynomials exist uniquely through the quadrature order, and write

hn=∫[a,b]pn(x)2 dμ(x)>0.

The finite-dimensional weighted Galerkin space is

VN(μ)=span⁡{p0,…,pN}⊂L2(μ).

Here L2(μ) means measurable functions with finite integral of the squared absolute value, modulo equality μ-almost everywhere.

For a coefficient sequence (cn)n≥0 with ∑n≥0(1+n2)s∣cn∣2hn<∞, define its weighted spectral Sobolev norm by ∥∑n≥0cnpn∥Hμs2=∑n≥0(1+n2)s∣cn∣2hn,s≥0. The real powers are those of Real powers for positive bases, with the zero-base positive-exponent convention; since every base 1+n2 is positive, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x) makes every weight positive. The associated orthogonal Galerkin projection is ΠN(∑n≥0cnpn)=∑n=0Ncnpn. This coefficient-defined scale is specific to the weight μ and the selected orthogonal-polynomial family; no equivalence with a derivative-based Sobolev norm is asserted here.

Depends on

Used by

Dependency tree · two levels

34 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