Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Bramble–Hilbert approximation on a reference simplex

Statement

Assume Countable Choice. Let 1≤p<∞, integer r≥1, integer s≥0, and real-valued v∈Wmax⁡(r,s),p(S^d). There is a polynomial q∈Pr−1(S^d), chosen by matching all means ∫S^dDαq=∫S^dDαv for ∣α∣≤r−1, such that:

  • if 0≤s≤r, then ∥v−q∥Ws,p(S^d)≤C∣v∣Wr,p(S^d);
  • if s>r, then ∥v−q∥Ws,p(S^d)≤C∑j=rs∣v∣Wj,p(S^d).

The second clause assumes v∈Ws,p; constants depend only on d,p,r,s.

Facts & Assumptions

Given: 1≤p<∞, integers r≥1 and s≥0, and v∈Wmax⁡(r,s),p(S^d).

[F1]

The mean-zero Poincare–Wirtinger inequality holds on the reference simplex for every finite p. (Poincare–Wirtinger inequality on a reference simplex)

[F2]

Sobolev classes provide all weak derivatives up to the specified integer order, and their norms are finite sums of derivative Lp norms. (Integer-order Sobolev spaces and their norms)

[F3]

The mean-zero Poincare supplier [F1] assumes Countable Choice. (The Axiom of Countable Choice (ACω))

[F4]

Holder's inequality on the finite-volume simplex sends Lp derivatives into L1 for finite p. (Holder's inequality for integrals, including the endpoint cases)

Proof

1.1givenalgebra

The monomials xα with ∣α∣≤r−1 form a basis of Pr−1. Thus if N is the number of these multi-indices, then N=dim⁡Pr−1. Define the linear moment map M:Pr−1→RN by M(q)α=∣S^d∣−1∫S^dDαq. If every component is zero, take the largest degree m of a nonzero homogeneous part of q. For each ∣α∣=m, Dαq is the constant α! times the coefficient of xα in that highest homogeneous part; its zero mean forces that coefficient to vanish. This contradicts the choice of m. Repeating downward shows q=0, so M is injective and, since its domain and codomain have the same finite dimension, bijective.

2.1F2F4step 1.1given

The vector of means of Dαv, ∣α∣≤r−1, is defined because each derivative is in Lp on the finite-measure simplex and therefore in L1 by [F4]. By bijectivity in step 1.1 there is a unique q∈Pr−1 with those moments. For w=v−q, each derivative Dαw, ∣α∣≤r−1, has zero mean; and every derivative of q of order at least r is zero.

3.1F1F2F3step 2.1

Apply [F1] to every mean-zero derivative of order r−1 in step 2.1; its Lp norm is bounded by the Lp norms of derivatives of order r of v, since Drq=0. Apply [F1] successively to derivatives of orders r−2,r−3,…,0, each of which also has zero mean; at each stage its norm is bounded by the next derivative order already controlled. Thus all derivatives of w of order at most r are bounded by C∣v∣Wr,p. If s≤r, retaining only orders through s proves the first clause.

4.1F2step 2.1step 3.1algebra∎

If s>r, the same argument controls all derivative orders at most r−1 by C∣v∣Wr,p. For each r≤∣β∣≤s, Dβw=Dβv because Dβq=0. Adding the finitely many derivative bounds through order s gives ∥w∥Ws,p≤C∑j=rs∣v∣Wj,p, proving the second clause.

Depends on

Used by

Dependency tree · two levels

32 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