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

Analytic derivative bounds give exponential polynomial approximation on a triangle

Statement

Let S be the closed reference triangle T‾, where T={x,y>0,x+y<1}, or the closed interval [0,1], and let f:S→R be real-valued. Write Pp(S) for restrictions of real polynomials of total degree at most p on the triangle and degree at most p on the interval. Say that f is smooth up to S when every partial derivative on the interior has a continuous extension to S. Suppose that for some M>0 and A≥1,

∥Dαf∥L∞(S)≤MA∣α∣∣α∣!for every multi-index α.

Use ∥g∥W1,∞(S):=∥g∥L∞(S)+∑i=1dim⁡S∥∂ig∥L∞(S). Then constants C,b>0, depending only on A and the fixed reference domain, satisfy

inf⁡q∈Pp(S)∥f−q∥W1,∞(S)≤CMe−bp(p≥1).

For the interval branch there is also an endpoint-preserving polynomial Jpf∈Pp([0,1]) whose derivative is the L2 orthogonal projection of f′ onto Pp−1. It satisfies ∥(Jpf)′∥2≤∥f′∥2 and ∥f−Jpf∥H1≤CMe−bp after changing C,b by constants depending only on A.

Facts & Assumptions

Given: The fixed reference interval or triangle, the smoothness and factorial derivative bound in the statement, and p≥1.

[F1]

Taylor's formula with Lagrange remainder holds along every segment contained in an open convex set. (Multivariable Taylor formula with a Lagrange remainder along a line segment)

[F2]

Cauchy–Schwarz bounds the integral of a derivative over an interval of length one by its L2 norm. (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs)

[F3]

Multi-index order, factorial, monomial powers, and canonical partial derivatives have the conventions in the cited definition. (Ck maps and multi-index derivative notation in Euclidean space)

[F4]

The fundamental theorem of calculus gives ∫01f′(t)dt=f(1)−f(0) when f is continuously differentiable on the interval, as it is here. (The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a))

Proof

1.1givenalgebra

For 0<τ<1 and integer n≥1 define Bn,τ(t)=∑j=⌈nτ⌉n(nj)tj(1−t)n−j. Then 0≤B≤1, deg⁡B≤n, and ∣B′∣≤n. If t≤τ−δ for fixed δ>0, Chernoff's bound follows directly from 1j≥nτ≤ez(j−nτ) for z>0: Bn,τ(t)≤e−znτ(1−t+tez)n. For sufficiently small fixed z, the exponent per n is negative uniformly because its derivative at z=0 is t−τ≤−δ. Applying the same argument to the complementary lower tail gives exponential smallness of 1−B on t≥τ+δ. Differentiation telescopes to one binomial atom times n; away from the threshold its probability is bounded by the same tail estimate with gap δ/2 for all sufficiently large n, and increasing the constant covers the finitely many smaller n. Thus B and 1−B switch from exponentially small to 1+O(e−cn) across a strip of fixed width, and their derivatives outside that strip are O(ne−cn).

2.1step 1.1construct

Choose 0<ρ<1/(32A) and a finite coordinate-grid cover of S by boxes of radius ρ with centers ai∈S, 1≤i≤m. In each coordinate form a left increasing binomial factor with threshold ai,j−3ρ/2 and a right decreasing factor with threshold ai,j+3ρ/2; omit the left factor when its threshold is at most zero and the right factor when its threshold is at least one. Their product bi has degree at most 4n, lies in [0,1], equals 1+O(e−cn) on the inner box of radius ρ and its first derivatives there are O(ne−cn); outside the outer box of radius 2ρ its value and first derivatives are O(ne−cn). The omitted boundary factors require no suppression on a side where the outer box does not meet S.

3.1F1F3step 2.1givenalgebra

Let Ti,s be the total-degree-s Taylor polynomial at ai. When ai is on the boundary, take limits of interior centers; all derivatives extend continuously to S. On the intersection of the outer box and S, convexity keeps the Taylor segment inside the triangle, so [F1] and the multinomial formula give ∣f−Ti,s∣+∣∇(f−Ti,s)∣≤CM(s+1)(4Aρ)s≤CM2−s after enlarging C for small s. On all of S, the coefficient formula for Ti,s gives ∣Ti,s∣+∣∇Ti,s∣≤CM(s+1)2Ds for a fixed D>1 depending only on A.

3.2step 2.1algebra

Set wi=bi∏j<i(1−bj) and w0=∏j≤m(1−bj). Then ∑i=0mwi=1 and 0≤wi≤1. At every point of S some inner box applies, so one factor 1−bi, together with its first derivatives, is exponentially small there; the product rule and ∣bj′∣≤Cn give ∥w0∥W1,∞(S)≤Cne−cn. Outside the outer box for a fixed i, the same product rule gives ∣wi∣+∣∇wi∣≤Cne−cn.

4.1step 3.2step 3.1algebraconstruct

Put q=∑i=1mwiTi,s. Since f−q=w0f+∑iwi(f−Ti,s), the near-box and far-box bounds of steps 3.1 and 3.2 give ∥f−q∥W1,∞(S)≤CM{n2−s+n(s+1)2Dse−cn}. Choose fixed ε>0 with ε≤1 and εlog⁡D<c/2, and let s=⌊εn⌋. Then the right side is at most CMe−b0n. Each wi has degree at most 4mn, so q has total degree at most 4mn+s≤(4m+1)n. Choose n=⌊p/(4m+1)⌋; for the finitely many p with n=0, the zero polynomial and an enlarged constant handle the claim. This proves the exponential estimate for every p≥1.

5.1F2F4step 4.1givenalgebra∎

On the interval let P be the L2 orthogonal projection of f′ onto Pp−1 and put Jpf(t)=f(0)+∫0tP(s)ds. The positive-definite finite polynomial Gram matrix gives a unique projection; Pythagoras gives ∥P∥2≤∥f′∥2 and ∥f′−P∥2≤∥f′−r∥2 for every r∈Pp−1. Orthogonality to constants gives ∫01P=∫01f′, and [F4] evaluates the latter as f(1)−f(0). Thus Jpf(1)=f(0)+∫01P=f(1), while Jpf(0)=f(0) by construction. The derivatives of f′ satisfy a factorial bound with fixed constants M′=MA and A′=2A, since (j+1)!≤2jj! for j≥1. For p≥2, apply step 4.1 to f′ with degree p−1; best approximation of the L2 projection then gives ∥f′−P∥2≤CMe−b(p−1), which is at most C′Me−b′p after changing constants. For p=1, the derivative contraction and the bound ∥f′∥2≤MA give the same asserted estimate after enlarging C′. Finally f−Jpf=∫0t(f′−P) and [F2] bounds its L2 norm by ∥f′−P∥2. The derivative and value bounds prove the stated interval estimate.

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