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

Local Taylor approximation on a Sobolev grid

Statement

Assume the Axiom of Choice. Let d,n≥1, let Q=(0,1)d, and let f∈Wn,∞(Q;R) have Sobolev norm at most 1 using the maximum over weak derivatives of order at most n. For every integer N≥2, take the tensor grid am=m/N, m∈{0,…,N}d, and the partition-of-unity hats ϕm(x)=∏i=1d(1−N∣xi−mi/N∣)+. Each Lipschitz representative of Dαf, ∣α∣<n, has a unique continuous extension to [0,1]d; use these extensions to define Tmf(x)=∑∣α∣<nDαf(am)(x−am)α/α!. Then gN=∑mϕmTmf extends continuously to [0,1]d and satisfies ∥f−gN∥L∞(Q)≤C(d,n)N−n.

Facts & Assumptions

Given: The Axiom of Choice, integers d,n≥1, Q=(0,1)d, f∈Wn,∞(Q;R) with norm at most 1, and an integer N≥2.

[F1]

The Wn,∞ norm is the maximum of ∥Dαf∥L∞ over all multi-indices ∣α∣≤n (Integer-order Sobolev spaces and their norms), and under the Axiom of Choice each W1,∞(Q) class has a Lipschitz representative with constant at most ∥Du∥L∞(Q) (W1,∞ functions on convex domains have Lipschitz representatives).

[F2]

The Axiom of Choice implies Countable Choice (AC supplies the countable and dependent choices used in Banach integration), and under Countable Choice interior mollifications converge in Wk,p on every relatively compact open subset for finite p (Local smooth approximation in integer-order Sobolev spaces).

[F3]

If u∈Wk,1(Ω), then on the interior domain Ωε every derivative with ∣α∣≤k satisfies Dα(ρε∗u)=ρε∗(Dαu) (Interior mollification commutes with weak derivatives).

[A1]

The Axiom of Choice is assumed (The Axiom of Choice).

Proof

1.1F1F2F3A1given

For each ∣α∣<n, Dαf∈W1,∞(Q) by [F1], since its first weak derivatives are among the derivatives of f of order at most n. By [F1], choose their Lipschitz representatives; their Lipschitz constants are at most d, because each coordinate weak derivative has essential supremum at most 1. Since Q has finite measure and every weak derivative of f through order n is essentially bounded, the same weak-derivative identities give f∈Wn,1(Q), hence f∈Wn−1,1(Q). By [A1] and [F2], Countable Choice holds, so the interior approximation theorem applies with k=n−1 and p=1, while [F3] applies with k=n and p=1. For every compact segment in Q, convolution of each chosen Lipschitz representative differs from it uniformly by at most d times the mollifier radius, so the mollified derivatives through order n−1 converge uniformly there.

2.1step 1.1F1F2F3algebra

For an interior grid center am and interior x, choose the mollifier radius smaller than the distance from their segment to ∂Q. By [F3] and step 1.1, Dαfδ=ρδ∗Dαf on that segment; nonnegativity and unit mass of ρδ imply ∣Dαfδ∣≤∥Dαf∥∞≤1 for ∣α∣=n. The one-variable Taylor formula applied to t↦fδ(am+t(x−am)) therefore gives remainder at most 1n!sup⁡t∣dndtnfδ(am+t(x−am))∣≤C(d,n)∥x−am∥∞n, since ∑i∣xi−am,i∣≤d∥x−am∥∞. Passing to the uniform limits from step 1.1 proves the estimate for interior points. Approximate any boundary grid center and any boundary input by interior points; the continuous extensions specified in the statement and the finite Taylor polynomial make the same estimate hold on the closed cube.

3.1step 2.1constructalgebra∎

The one-dimensional hats sum to 1 on each grid interval, so their tensor products satisfy ∑mϕm=1 on the cube; at most 2d are nonzero at any point, and each nonzero term has ∥x−am∥∞≤1/N. Therefore ∣f(x)−gN(x)∣≤∑m:ϕm(x)>0ϕm(x)C(d,n)N−n=C(d,n)N−n. Each extended Lipschitz representative and each hat is continuous on the closed cube, so the finite sum gN is continuous there.

Depends on

Used by

Dependency tree · two levels

49 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