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.
Whitney extension for finite-order Euclidean jets
Statement
Let , let be a closed subset of , a nonnegative integer, and, for each , let be a polynomial of degree at most with values in . Suppose that on each compact part of , for every multi-index , uniformly in . Then there is a map whose order- Taylor polynomial at each is . The construction needs no choice axiom.
Facts & Assumptions
Given: The closed set, integer order, and compatible polynomial jets of the statement.
Ordinary finite-order Taylor estimates apply to the polynomial jets and smooth cutoff functions (Multivariable Taylor formula with a Lagrange remainder along a line segment).
Proof
The cases and are immediate: use zero in the first case, and in the second define ; the compatibility condition is precisely the Taylor criterion for its derivatives . Assume is nonempty and proper. Subdivide the standard integer-translated dyadic grid into closed cubes. Retain every dyadic cube satisfying which is maximal under dyadic parent inclusion. Every belongs to the closure of one of these cubes: arbitrarily small cubes about satisfy the inequality, while sufficiently large ancestors fail it. Their interiors are disjoint. A retained cube has : the upper bound follows because its parent fails the retention test and every point of the parent lies within of . Consequently cubes whose fixed small enlargements meet have comparable side lengths, and only a dimension-dependent bounded number of those enlargements meet any one point. All cubes are obtained from a countable, explicitly ordered grid.
Fix one nonnegative bump on the unit cube, equal to one on that cube and supported in its concentric enlargement. Rescale it to each retained cube to get . Set on . The denominator is at least one because the cubes cover the complement, and the sum is locally finite by step 1.1. Thus and ; the constants are locally uniform because intersecting enlarged cubes have comparable sizes and bounded overlap. For each cube choose the nearest point to its centre, breaking ties by successive minimum coordinates on the compact nearest-point set. This specifies without arbitrary selections. Define off , and on .
Fix and let through the complement. Write and choose its lexicographically first nearest point . If , step 1.1 gives and . Taylor expansion of the polynomial about , combined with the assumed compatibility of every derivative order, gives locally uniformly as . Differentiating the partition sum and using and the derivative bound in step 2.1 yields for . There are only boundedly many terms at , and each has the displayed order.
Compatibility again gives : , and the polynomial Taylor sum converts every jet discrepancy into that bound. Since , step 3.1 implies as through the complement. The same estimate at points of is exactly the given compatibility. Starting with , these estimates prove by induction that each derivative of order at most extends continuously across with value : for subtract the linear part of and divide by to verify differentiability, and for use the zero-order continuity estimate. Thus and has the required jets. Every selection in the construction was by an ordered grid or a compact-set coordinate minimum.
Depends on
Used by
Dependency tree · two levels
5 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
- Hassler Whitney, Analytic Extensions of Differentiable Functions Defined in Closed Sets, Transactions of the AMS 36 (1934), Theorem I (standard reference, not scraped)
- Azagra, Ferrera and Gómez-Gil, The Morse-Sard theorem revisited, Section 2, arXiv:1511.05822 (standard reference, not scraped)