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

Legendre weighted projection has its spectral-Sobolev rate

Statement

Let s≥0, N≥0, and u=∑n≥0cnPn∈HLs from Legendre weighted spectral-Sobolev scale and projection. Then

∥u−ΠNu∥LL2≤(1+(N+1)(N+2))−s/2∥u∥HLs.

Facts & Assumptions

Given: A real s≥0, an integer N≥0, and a coefficient sequence in HLs.

[F1]

Legendre weighted spectral-Sobolev scale and projection: ΠNu=∑n=0NcnPn and the HLs coefficient weight is (1+n(n+1))s2/(2n+1); its spectral factor is nondecreasing in n for s≥0.

[F2]

Legendre polynomials have explicit norms and weighted derivative orthogonality: ∫−11PnPm=2δmn/(2n+1).

Proof

1.1F1F2algebra

For a finite Legendre sum, [F1] gives u−ΠNu=∑n>NcnPn. Orthogonality [F2] therefore gives ∥u−ΠNu∥LL22=∑n>N22n+1∣cn∣2. For every n>N, 1+n(n+1)≥1+(N+1)(N+2); multiplying each term by the inverse weight gives the stated squared bound for finite sums.

2.1F1step 1.1algebra∎

Finite sums are dense in the completion defining HLs. The truncation ΠN is contractive in both the coefficient norm and the s=0 norm, so the finite-sum inequality passes to the limit along any Cauchy sequence of finite sums. Taking square roots proves the claimed estimate for every u∈HLs.

Depends on

Used by

Dependency tree · two levels

13 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