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.
Shape-controlled secants and relative piecewise smooth extension
Statement
Let be a finite geometric complex and piecewise smooth in the sense of Relative smooth triangulations, strong approximation and bundle fitting. There are subdivisions agreeing on every original face, with mesh tending to zero and a single lower thickness bound for every positive-dimensional simplex, whose secant maps , defined by affine interpolation of the values of at vertices, converge strongly in piecewise to .
If is a subcomplex and an open neighbourhood of , the approximation can instead be chosen pointwise equal to on a neighbourhood of and equal to a secant map outside , on shape-controlled subdivisions; subdivision of is permitted and does not alter there, and every affine target-plane constraint already satisfied by on original simplices is preserved.
There is also a local extension statement: given a finite subcomplex , a sufficiently small strong approximation to on any subdivision extends to a prescribed small strong approximation to on a subdivision of , with and with the original simplices unchanged outside the closed star of . The permitted error of depends on the requested error and the finite original simplices, not on the shape of the subdivision of . If is an affine target map and on , then everywhere; equivalently, the linear part of annihilates each correction. This last extension does not assert a shape bound on its coned simplices.
Facts & Assumptions
Given: the finite geometric complex , the piecewise smooth map , a subcomplex with an open neighbourhood of , and a finite subcomplex with a strong approximation of on a subdivision of , in the sense of Relative smooth triangulations, strong approximation and bundle fitting.
Finite convex cell complexes admit compatible triangulations by coning from interior points. Barycentric subdivision has nonempty faces as vertices and strict face chains as simplices, so a chain all of whose faces belong to a subcomplex is a simplex of its barycentric subdivision; thus the subdivided subcomplex is full (Finite convex cell complexes admit compatible triangulations, Barycentric subdivision of an abstract simplicial complex).
Segment integration gives the value error of the linearization and chain-rule differentiation bounds composite corrections (If is differentiable with integrable then ; and a bounded derivative makes Lipschitz, The chain rule for total derivatives: ).
Approximation and relative approximation have the meanings fixed in Relative smooth triangulations, strong approximation and bundle fitting: for , strong -approximation combines the value bound with the derivative bound on every nonzero tangent-star vector, and shape control is a positive lower bound for .
Proof
Lattice subdivisions with a uniform thickness bound. If has no positive-dimensional simplices, its unchanged complex and secant prove the approximation assertions with the thickness condition vacuous. Otherwise give the finitely many vertices a total order and realize the abstract complex as a union of faces of one standard simplex with vertices . The original geometric realization is related to this one by a linear isomorphism on each simplex, and finitely many such isomorphisms have uniformly bounded operator norms and inverse norms on their affine spans. In cut the unit lattice cubes by the hyperplanes , , and all their faces; these cuts form a locally finite convex cell complex, since intersections arise by activating the shared supporting equalities. After translating a cube to only the cuts with occur, so there are finitely many cell shapes up to translation; triangulating every cell compatibly by [F1] with the translation-invariant choice of the average of its vertices gives finitely many simplex shapes, with maximal diameter and positive minimum thickness in positive dimensions. The simplex and each of its faces are unions of these cells, so scaling by gives subdivisions of , hence of the embedded abstract complex, with mesh at most and thickness at least ; restrictions to all faces agree because one global cell complex is used. Transporting back to the original realization multiplies diameter and inradius by the finitely many bounded factors of the linear isomorphisms, leaving the claimed mesh bound and one positive thickness . Iterated barycentric subdivision has no such bound and is not used.
Combinatorial extension of a subdivision, and coned corrections. For the extension statement, extend the given subdivision of combinatorially in increasing dimension: keep every original simplex outside the closed star of , and for each affected simplex whose boundary has already been subdivided, cone that boundary subdivision from the original barycentre. Each cone over a face simplex from the barycentre of the ambient simplex is a simplex, and the cones agree on common faces by the ray description of a simplex, so this produces a subdivision of containing the given subdivision of . Suppose a correction is already defined and piecewise smooth on the subdivided boundary of an original simplex with barycentre ; every in has the unique expression with and . The function for and for is smooth, since every right derivative is a polynomial in times and tends to zero at . Thus is a smooth scalar taper with for and for and define on and . On each coned simplex this is smooth across , because near forces there, and it assumes the prescribed values on the boundary; faces agree because and are determined by and is one function on the subdivided boundary.
Secant estimate on a shape-controlled simplex. A zero-dimensional refined simplex has secant value and zero tangent space, so contributes zero error. Let be a positive-dimensional refined simplex inside an original simplex , with incenter , diameter and inradius , and put . On the compact simplex the derivative of has a modulus of continuity as , uniformly in the base point. To justify uniformity, for any continuity supplies balls about each base point on which its derivative differs from the centre value by less than . The balls of half those radii cover ; a finite subcover and the minimum of their half-radii ensure that any two sufficiently close points have derivative difference less than by the triangle inequality. Define as the supremum of those differences at distance at most ; boundedness follows from the same finite-cover argument. Segment integration along gives for . The affine map interpolates the vertex errors , each of modulus at most , and an affine function on a simplex attains its supremum at a vertex, so . For an affine map on with and a unit vector in the affine span of , the point lies in by the definition of incenter and inradius, so . Applying this to gives , and adding the continuity term gives for all . As the mesh tends to zero, both the value and the derivative errors tend to zero uniformly over all base points and all vectors of the refined tangent cones of ; taking the maximum of the finitely many moduli over the original simplices proves strong piecewise convergence.
Extension error bounds. On a cone over a boundary simplex, ; writing the barycentric coordinates of in and summing those outside the face carrying shows that is an affine function of divided by the fixed barycentre-to-face height, and . On the region the bounds and depend only on the original simplex, not on the subdivision of the boundary. The strong bound on controls its operator norm on the entire direction space of each refined boundary simplex: apply it at relative interior points, where every direction is tangent, and pass to the boundary by continuity. The correction of step 1.2 has value and derivative by the chain rule, so its supremum norm and derivative norm are bounded by with depending only on ; near the correction vanishes identically. Hence, for finitely many affected simplices handled in increasing dimension, the product of the finitely many constants converts any requested final error into a sufficient bound on the initial error, uniformly over all subdivisions of ; a zero correction on an already fixed subcomplex is retained, and the correction is zero outside the closed star of by construction. If is affine and its linear part is , then is equivalent to on . The formula gives on every newly extended simplex, so induction preserves everywhere.
Relative approximation with plane preservation. For the relative statement, barycentrically subdivide once if necessary so that is full: a face chain all of whose barycentric vertices lie in lies in by [F1]. Then let be the sum of the barycentric coordinates at vertices outside ; on each subdivision simplex the coordinates are affine, so is a global continuous piecewise affine nonnegative function, and its zero set is exactly : a point of lies in a subdivision simplex all of whose vertices lie in because is full, so all coordinates outside vanish, while forces into the hull of vertices lying in , hence into . The zero set of is closed and the complement of is compact, so, when is nonempty, a positive lower bound exists: continuity and positivity give neighbourhoods on which is at least half its value at the centre, and a finite subcover gives the minimum of finitely many positive half-values. If is empty, take and the assertion outside is vacuous. Otherwise take the cutoff using step 1.2, so on and on and its values lie in ; its derivative is bounded, and the piecewise affine function has bounded derivative on the fixed finite subdivision. Setting gives, near , ; outside , ; and the derivative error is bounded by the derivative error of plus a fixed constant times its value error, both of which tend to zero by step 2.1. Each simplex restriction is smooth and face values agree. If maps an original simplex into an affine plane, then so do its vertex interpolants and every affine combination of with them, so all affine target-plane constraints are preserved, and the preliminary subdivision still admits the uniformly controlled subdivisions of step 1.1.
Assembly. The subdivisions of step 1.1 have mesh tending to zero and one positive thickness bound and, by step 2.1, their secant maps converge strongly in piecewise to ; step 3.1 provides the relative version, fixing near , agreeing with a secant map outside and preserving affine target-plane constraints. For the extension statement, step 1.2 extends the subdivision and defines the coned correction, and step 2.2 bounds its norm by a constant depending only on the original simplices times the norm of the boundary correction, uniformly over all subdivisions of ; choosing the initial error small enough, in the finitely many affected simplices in increasing dimension, therefore realises any prescribed final strong-approximation error, keeps the correction zero outside the closed star of , and preserves a vanishing affine-linear component. This proves all three assertions.
Depends on
- Relative smooth triangulations, strong approximation and bundle fitting
- Finite convex cell complexes admit compatible triangulations
- Barycentric subdivision of an abstract simplicial complex
- If $f : [a,b] \to \mathbb{R}^m$ is differentiable with integrable $f'$ then $\int_a^b f' = f(b)-f(a)$; and a bounded derivative makes $f$ Lipschitz
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
Used by
Dependency tree · two levels
34 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
- James R. Munkres, Elementary Differential Topology, revised edition (1966), Princeton University Press (standard reference, not scraped)