Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 K be a finite geometric complex and f:K→Rq piecewise smooth in the sense of Relative smooth triangulations, strong approximation and bundle fitting. There are subdivisions Km agreeing on every original face, with mesh tending to zero and a single lower thickness bound θ>0 for every positive-dimensional simplex, whose secant maps Sm, defined by affine interpolation of the values of f at vertices, converge strongly in piecewise C1 to f.

If L⊂K is a subcomplex and U an open neighbourhood of ∣L∣, the approximation can instead be chosen pointwise equal to f on a neighbourhood of ∣L∣ and equal to a secant map outside U, on shape-controlled subdivisions; subdivision of L is permitted and does not alter f there, and every affine target-plane constraint already satisfied by f on original simplices is preserved.

There is also a local extension statement: given a finite subcomplex A⊂K, a sufficiently small strong approximation g to f∣A on any subdivision extends to a prescribed small strong approximation G to f on a subdivision of K, with G=f and with the original simplices unchanged outside the closed star of A. The permitted error of g depends on the requested error and the finite original simplices, not on the shape of the subdivision of A. If p is an affine target map and p(g)=p(f) on A, then p(G)=p(f) everywhere; equivalently, the linear part of p annihilates each correction. This last extension does not assert a shape bound on its coned simplices.

Facts & Assumptions

Given: the finite geometric complex K, the piecewise smooth map f:K→Rq, a subcomplex L with an open neighbourhood U of ∣L∣, and a finite subcomplex A with a strong approximation g of f∣A on a subdivision of A, in the sense of Relative smooth triangulations, strong approximation and bundle fitting.

[F1]

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).

[F3]

Approximation and relative approximation have the meanings fixed in Relative smooth triangulations, strong approximation and bundle fitting: for δ>0, strong δ-approximation combines the value bound sup⁡b∣g(b)−f(b)∣<δ with the derivative bound ∣dgb(v)−dfb(v)∣<δ∣v∣ on every nonzero tangent-star vector, and shape control is a positive lower bound for r(σ)/diam⁡σ.

Proof

technique · direct
1.1F1algebra

Lattice subdivisions with a uniform thickness bound. If K has no positive-dimensional simplices, its unchanged complex and secant f 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 Δ⊂RN with vertices 0,e1,…,eN. 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 RN cut the unit lattice cubes by the hyperplanes ∑ixi=j, j∈Z, 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 [0,1]N only the cuts with j=0,…,N 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 D and positive minimum thickness θ0 in positive dimensions. The simplex mΔ={xi≥0, ∑ixi≤m} and each of its faces are unions of these cells, so scaling by 1/m gives subdivisions of Δ, hence of the embedded abstract complex, with mesh at most D/m and thickness at least θ0; 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.

1.2F1F2algebra

Combinatorial extension of a subdivision, and coned corrections. For the extension statement, extend the given subdivision of A combinatorially in increasing dimension: keep every original simplex outside the closed star of A, 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 K containing the given subdivision of A. Suppose a correction e=g−f is already defined and piecewise smooth on the subdivided boundary of an original simplex σ with barycentre c; every x≠c in σ has the unique expression x=c+t(y−c) with 0<t≤1 and y∈∂σ. The function b(s)=exp⁡(−1/s) for s>0 and b(s)=0 for s≤0 is smooth, since every right derivative is a polynomial in 1/s times exp⁡(−1/s) and tends to zero at 0. Thus a(t)=b(t−1/3)/(b(t−1/3)+b(2/3−t)) is a smooth scalar taper with a(t)=0 for t≤1/3 and a(t)=1 for t≥2/3 and define G(x)=f(x)+a(t)e(y) on σ∖{c} and G(c)=f(c). On each coned simplex this is smooth across c, because a=0 near c forces G=f there, and it assumes the prescribed values on the boundary; faces agree because t and y are determined by x and e is one function on the subdivided boundary.

2.1F2F3step 1.1algebra

Secant estimate on a shape-controlled simplex. A zero-dimensional refined simplex has secant value f and zero tangent space, so contributes zero error. Let s be a positive-dimensional refined simplex inside an original simplex σ, with incenter b, diameter h and inradius r≥θh, and put Tb(x)=f(b)+Df(b)(x−b). On the compact simplex σ the derivative of f has a modulus of continuity ωσ(h)→0 as h→0, uniformly in the base point. To justify uniformity, for any ε>0 continuity supplies balls about each base point on which its derivative differs from the centre value by less than ε/2. 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 ωσ(h) as the supremum of those differences at distance at most h; boundedness follows from the same finite-cover argument. Segment integration along [b,x] gives ∣f(x)−Tb(x)∣≤h ωσ(h) for x∈s. The affine map Sm−Tb interpolates the vertex errors f(v)−Tb(v), each of modulus at most h ωσ(h), and an affine function on a simplex attains its supremum at a vertex, so sup⁡s∣Sm−Tb∣≤h ωσ(h). For an affine map A on s with sup⁡s∣A∣≤E and a unit vector v in the affine span of s, the point b+rv lies in s by the definition of incenter and inradius, so ∣DA(v)∣=∣A(b+rv)−A(b)∣/r≤2E/r. Applying this to Sm−Tb gives ∥DSm−Df(b)∥≤2ωσ(h)/θ, and adding the continuity term ∥Df(b)−Df(x)∥≤ωσ(h) gives ∥DSm−Df(x)∥≤(2/θ+1)ωσ(h) for all x∈s. 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 C1 convergence.

2.2F2step 1.2algebra

Extension error bounds. On a cone over a boundary simplex, x=c+t(y−c); writing the barycentric coordinates of x in σ and summing those outside the face carrying y shows that t is an affine function of x divided by the fixed barycentre-to-face height, and y=c+(x−c)/t. On the region t≥1/3 the bounds ∣Dt∣≤C1(σ) and ∥Dy∥≤C2(σ) depend only on the original simplex, not on the subdivision of the boundary. The strong bound on De 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 a(t)e(y) and derivative a′(t)e(y)Dt+a(t)De(y)Dy by the chain rule, so its supremum norm and derivative norm are bounded by Cσ∥e∥C1 with Cσ depending only on σ; near c the correction vanishes identically. Hence, for finitely many affected simplices handled in increasing dimension, the product of the finitely many constants Cσ converts any requested final error into a sufficient bound on the initial error, uniformly over all subdivisions of A; a zero correction on an already fixed subcomplex is retained, and the correction is zero outside the closed star of A by construction. If p is affine and its linear part is P, then p(g)=p(f) is equivalent to P(e)=0 on A. The formula gives P(a(t)e(y))=a(t)P(e(y))=0 on every newly extended simplex, so induction preserves p(G)=p(f) everywhere.

3.1F1F2F3step 1.1step 2.1

Relative approximation with plane preservation. For the relative statement, barycentrically subdivide once if necessary so that L is full: a face chain all of whose barycentric vertices lie in L lies in L by [F1]. Then let d be the sum of the barycentric coordinates at vertices outside L; on each subdivision simplex the coordinates are affine, so d is a global continuous piecewise affine nonnegative function, and its zero set is exactly ∣L∣: a point of ∣L∣ lies in a subdivision simplex all of whose vertices lie in L because L is full, so all coordinates outside L vanish, while d(x)=0 forces x into the hull of vertices lying in L, hence into ∣L∣. The zero set of d is closed and the complement of U is compact, so, when ∣K∣∖U is nonempty, a positive lower bound d0 exists: continuity and positivity give neighbourhoods on which d is at least half its value at the centre, and a finite subcover gives the minimum of finitely many positive half-values. If ∣K∣∖U is empty, take gm=f and the assertion outside U is vacuous. Otherwise take the cutoff χ(s)=a(s/d0) using step 1.2, so χ=0 on [0,d0/3] and χ=1 on [2d0/3,∞) and its values lie in [0,1]; its derivative is bounded, and the piecewise affine function d has bounded derivative on the fixed finite subdivision. Setting gm=f+χ(d)(Sm−f) gives, near ∣L∣, gm=f; outside U, gm=Sm; and the derivative error is bounded by the derivative error of Sm 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 f maps an original simplex into an affine plane, then so do its vertex interpolants and every affine combination of f with them, so all affine target-plane constraints are preserved, and the preliminary subdivision still admits the uniformly controlled subdivisions of step 1.1.

4.1step 1.1step 1.2step 2.1step 2.2step 3.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 C1 to f; step 3.1 provides the relative version, fixing f near L, agreeing with a secant map outside U 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 C1 norm by a constant depending only on the original simplices times the C1 norm of the boundary correction, uniformly over all subdivisions of A; 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 A, and preserves a vanishing affine-linear component. This proves all three assertions.

Depends on

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