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 , let , and let have Sobolev norm at most using the maximum over weak derivatives of order at most . For every integer , take the tensor grid , , and the partition-of-unity hats . Each Lipschitz representative of , , has a unique continuous extension to ; use these extensions to define . Then extends continuously to and satisfies .
Statement references
Facts & Assumptions
Given: The Axiom of Choice, integers , , with norm at most , and an integer .
The norm is the maximum of over all multi-indices (Integer-order Sobolev spaces and their norms), and under the Axiom of Choice each class has a Lipschitz representative with constant at most ( functions on convex domains have Lipschitz representatives).
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 on every relatively compact open subset for finite (Local smooth approximation in integer-order Sobolev spaces).
If , then on the interior domain every derivative with satisfies (Interior mollification commutes with weak derivatives).
The Axiom of Choice is assumed (The Axiom of Choice).
Proof
For each , by [F1], since its first weak derivatives are among the derivatives of of order at most . By [F1], choose their Lipschitz representatives; their Lipschitz constants are at most , because each coordinate weak derivative has essential supremum at most . Since has finite measure and every weak derivative of through order is essentially bounded, the same weak-derivative identities give , hence . By [A1] and [F2], Countable Choice holds, so the interior approximation theorem applies with and , while [F3] applies with and . For every compact segment in , convolution of each chosen Lipschitz representative differs from it uniformly by at most times the mollifier radius, so the mollified derivatives through order converge uniformly there.
For an interior grid center and interior , choose the mollifier radius smaller than the distance from their segment to . By [F3] and step 1.1, on that segment; nonnegativity and unit mass of imply for . The one-variable Taylor formula applied to therefore gives remainder at most , since . 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.
The one-dimensional hats sum to on each grid interval, so their tensor products satisfy on the cube; at most are nonzero at any point, and each nonzero term has . Therefore . Each extended Lipschitz representative and each hat is continuous on the closed cube, so the finite sum is continuous there.
Depends on
- Integer-order Sobolev spaces and their norms
- $W^{1,\infty}$ functions on convex domains have Lipschitz representatives
- Local smooth approximation in integer-order Sobolev spaces
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- AC supplies the countable and dependent choices used in Banach integration
- Interior mollification commutes with weak derivatives
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
- Dmitry Yarotsky, Error bounds for approximations with deep ReLU networks, §3.2 (standard reference, not scraped)
- Juha Kinnunen, Sobolev Spaces, §§1.2 and 3.4 (standard reference, not scraped)
- Matus Telgarsky, Deep learning theory lecture notes, §5.4 (standard reference, not scraped)