Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Local polynomial projections matching moments through order s

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let Q⊆Rn be a nondegenerate axis-parallel cube with centre cQ, side length ℓ(Q) and volume ∣Q∣ in the sense of Axis-parallel rectangles in Rm and their volume. Fix λ>1 and write Q∗:={x∈Rn:∥x−cQ∥∞<λℓ(Q)/2} for its open concentric dilation. Let N∈N∪{0}, and let ωQ∈Cc∞(Rn) be real, nonnegative, with ∫RnωQ>0 and supp⁡ωQ⊂Q∗. Then for every tempered distribution f∈S′(Rn) there is a unique moment-matching polynomial PQ of total degree at most N such that ⟨f−PQ, xαωQ⟩=0for every multi-index ∣α∣≤N. The polynomial PQ depends only on the restriction of f to an open neighbourhood of supp⁡ωQ: for every open U⊇supp⁡ωQ, if g∈S′ agrees with f as a distribution on U, then PQg=PQf. When f is represented by a function in L2(ωQ(x) dx), this is the orthogonal projection of f onto the polynomials of degree at most N in that weighted inner product space, with inner product (P,R)ωQ=∫RnP(x)R(x)‾ ωQ(x) dx. This inner product is positive definite on the polynomial subspace because ωQ≥0 and ∫ωQ>0.

Facts & Assumptions

Given: Countable Choice and a nondegenerate axis-parallel cube Q, an integer N≥0, a test function ωQ as in the statement, f∈S′(Rn), and multi-indices with the conventions of Ck maps and multi-index derivative notation in Euclidean space.

[L1]

A nonnegative continuous function on an open set with positive integral is positive at some point, hence positive on a nonempty open subset of that set; a polynomial vanishing on a nonempty open set is zero: at an interior point all its partial derivatives vanish, and its finite expansion about that point, obtained by the binomial formula for each monomial, has precisely those derivatives as coefficients (The spaces Cc(Rn) and Cc∞(Rn) fixes the support convention).

[F1]

xαωQ∈Cc∞(Rn)⊆S(Rn), so the pairings ⟨f,xαωQ⟩ and, for polynomials P, the regular-distribution pairings ⟨P,xαωQ⟩=∫P xαωQ are defined; polynomials are locally integrable and P xαωQ∈S (Schwartz space and its seminorms, Tempered distribution, Regular distribution from a locally integrable function).

[F2]

The space PN of polynomials of total degree at most N has finite dimension d=(N+nn), and the monomials xα, ∣α∣≤N, form a basis (Ck maps and multi-index derivative notation in Euclidean space). A finite-dimensional linear system with invertible matrix has a unique solution.

[F3]

If two distributions agree on an open set U, then their pairings with every test function supported in U agree: this is the definition of agreement of distributions on U (Distribution). In particular, if h∈Cc∞(Rn) is supported in U and f=0 on U, then ⟨f,h⟩=0.

[F4]

Since ωQ is measurable and nonnegative, dμQ=ωQ(x) dx is the measure with density ωQ relative to Lebesgue measure (The measure with density f relative to μ).

[F5]

On the measure space (Rn,μQ) the pairing ([u],[v])↦∫uv‾ dμQ is the well-defined complex L2 inner product (The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz).

Proof technique: positive-definite Gram matrix on the finite-dimensional polynomial space.

Proof

technique · direct
1.1L1F1F2algebra

The Gram matrix. Set Gαβ=∫Rnxα+βωQ(x) dx for ∣α∣,∣β∣≤N. If P=∑∣α∣≤Ncαxα satisfies ∫∣P∣2ωQ=0, then ∣P∣2ωQ=0 Lebesgue-a.e.; since ∣P∣2 is continuous and ωQ is continuous and positive on a nonempty open set by [L1] (using ∫ωQ>0 and ωQ≥0), P vanishes on that open set, hence P=0 and all cα=0 by [L1] and [F2]. Writing ∫∣P∣2ωQ=∑α,βcα‾cβGαβ, positive definiteness follows, so G is invertible.

2.1step 1.1F1F2F4F5algebra

Existence and uniqueness. The vector b=(⟨f,xαωQ⟩)∣α∣≤N∈Cd is well defined by [F1], so [F2] gives a unique coefficient vector c=G−1b and a polynomial PQ=∑∣α∣≤Ncαxα with ⟨PQ,xβωQ⟩=∑αcαGαβ=bβ=⟨f,xβωQ⟩ for every ∣β∣≤N; that is, ⟨f−PQ,xβωQ⟩=0. If f is represented by an element of L2(μQ), then for every polynomial R of degree at most N its conjugate is a linear combination of the real monomials xα, and the moment equations give (f−PQ,R)ωQ=∫(f−PQ)R‾ dμQ=0 by [F4, F5]. Thus PQ is the orthogonal projection onto the polynomial subspace in the weighted L2 inner product space. If P′,P′′ both satisfy the moment equations, then R=P′−P′′ satisfies ⟨R,xαωQ⟩=0 for ∣α∣≤N, so ∫∣R∣2ωQ=∑cα‾⟨R,xαωQ⟩=0 with cα the coefficients of R, because R‾=∑cα‾xα, and step 1.1 gives R=0. This proves existence and uniqueness.

3.1step 2.1F3given

Locality. Let U be the given neighbourhood of supp⁡ωQ on which f and g agree as distributions. For every ∣α∣≤N, the test function xαωQ is supported in supp⁡ωQ⊂U, so [F3] gives ⟨f−g,xαωQ⟩=0. Hence f and g produce the same vector b in step 2.1, and therefore the same PQ=G−1b. This proves the locality statement.

4.1step 1.1step 2.1step 3.1∎

Conclusion. Step 1.1 shows that the Gram matrix is positive definite, step 2.1 constructs the unique moment-matching polynomial and identifies it as the weighted L2 orthogonal projection when that interpretation applies, and step 3.1 records dependence only on the distribution near the support of the weight. This proves the lemma.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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