Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 simplex polynomial projection has explicit p-rates

Statement

Let K^ be the reference simplex of Matching affine simplicial meshes and shape regularity, let α=(α0,…,αd) have nonnegative real entries, and let ωα=∏j=0dλjαj, where λj are its barycentric coordinates. Give polynomials the inner product ⟨f,g⟩α=∫K^ωαfg. Put P−1={0} and let En=Pn(K^)⊖Pn−1(K^) in this weighted inner product. For a finite sum u=∑n≥0un, un∈En, define

∥u∥Hαs2:=∑n≥0(1+μn)s∥un∥L2(ωα)2,μn=n(n+d+∣α∣),

and define Hαs as the completion of these finite sums. If m≥ℓ≥0, its orthogonal degree truncation Ppu=∑n=0pun obeys

∥u−Ppu∥Hαℓ≤(1+μp+1)−(m−ℓ)/2∥u∥Hαm.

For q∈Pp(K^), ∥q∥Hαm≤(1+μp)(m−ℓ)/2∥q∥Hαℓ. These are estimates in the explicitly coefficient-defined scale Hαs; they do not identify that scale with ordinary unweighted Hs(K^).

Facts & Assumptions

Given: A dimension d≥2, αj≥0, real exponents m≥ℓ≥0, and degree p≥0.

[F1]

The reference simplex is a bounded nondegenerate simplex with barycentric coordinates; its matching-mesh and reference-map conventions are fixed by Matching affine simplicial meshes and shape regularity.

[A1]

Pn(K^) is finite-dimensional, and ωα is positive in the open simplex and integrable. Thus its weighted L2 inner product is positive definite on polynomials.

Proof

1.1F1A1givenalgebra

Since ωα>0 in the interior, a nonzero polynomial cannot have weighted square integral zero: continuity gives a ball on which its absolute value is bounded below by a positive number. Integrability follows from αj≥0 on the bounded simplex. Hence the weighted inner product is positive definite on each finite-dimensional polynomial space. Orthogonal projection onto Pn−1 therefore gives the finite-dimensional orthogonal decomposition Pn=E0⊕⋯⊕En. The scale in the Statement is the completion of this orthogonal-sum norm, so its coefficient description and truncation are well-defined.

2.1givenstep 1.1algebra

For a finite sum u=∑un, orthogonality gives ∥u−Ppu∥Hαℓ2=∑n>p(1+μn)ℓ∥un∥α2≤(1+μp+1)ℓ−m∑n>p(1+μn)m∥un∥α2, because μn=n(n+d+∣α∣) is increasing for n≥0. Taking square roots proves the tail estimate for finite sums.

3.1step 1.1step 2.1algebra∎

Truncation is contractive in every coefficient norm Hαs, and finite sums are dense by the definition of the completion. The finite-sum estimate in step 2.1 therefore passes to every u∈Hαm. If q∈Pp, each degree layer has n≤p, so (1+μn)m−ℓ≤(1+μp)m−ℓ term by term; summing proves the inverse estimate. Neither argument invokes a derivative norm, which is why neither implies an unweighted Sobolev estimate.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · one level

1 result within one dependency step 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