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

Corner-adapted strong approximations preserve orthant sides

Statement

Let F:K→[0,∞)c×Rn−c be a finite whole-star smooth embedding, and write ρiF for its first c coordinate functions. Assume for each original simplex σ and each i that Zi,σ={x∈σ:ρiF(x)=0} is a union of faces and that, at every b∈Zi,σ, the linear form d(ρiF)b on the tangent cone of σ is nonnegative with zero set precisely the tangent cone of Zi,σ. These are the adapted face/tangent conditions, not merely simplex rank conditions.

There is δ>0 such that every strong δ-approximation G preserving each of these coordinate planes on the specified zero subcomplexes maps all of K into the same closed orthant and has exactly the same coordinate zero sets. It is an embedding for this choice of δ. Thus plane-preserving fitting and extension can be used in corner charts when the initial pieces satisfy these adapted face conditions.

Facts & Assumptions

Given: the finite whole-star smooth embedding F:K→[0,∞)c×Rn−c, its coordinate functions ρ1F,…,ρcF, the zero sets Zi,σ={x∈σ:ρiF(x)=0} (unions of faces), the adapted face/tangent hypotheses, and a strong δ-approximation G that preserves each coordinate plane on the specified zero subcomplexes (Relative smooth triangulations, strong approximation and bundle fitting).

[F1]

Whole-star smooth embeddings are stable under sufficiently small strong approximation: there is δ0>0 such that every strong δ0-approximation of F is again a whole-star embedding (Whole-star smooth embeddings are stable under strong piecewise C1 approximation).

[F2]

Segment integration bounds the change of a smooth function by the supremum of its directional derivative times the segment length, and every continuous positive function on a nonempty compact set has a positive minimum (If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).

[F3]

Orthant preservation means ρiG≥0 for every i and equality of the zero sets; the coordinate planes are preserved in the sense that ρiG=ρiF=0 on the given zero subcomplexes. All these notions are those of Relative smooth triangulations, strong approximation and bundle fitting.

Proof

technique · direct
1.1F2F3algebra

Structure of a zero set. Fix a coordinate and an original simplex, writing u=ρiF and Z=u−1(0)∩σ. The zero set is a finite union of faces. Its maximal faces are pairwise disjoint: if two met at b, the hypothesis would identify their union of tangent cones with the zero face of the convex cone Cb under the supporting form dub. This zero face is convex and corresponds to a face τ of σ containing b: the supporting form vanishes on the direction space of the minimal face containing b, is nonnegative on every vertex direction v−b, and its zero cone is generated by that direction space and precisely the zero-valued vertex directions. A relative interior direction of that face must belong to one of the finitely many zero-face cones, forcing that face to contain τ; hence τ⊂Z, contrary to maximality of two distinct intersecting faces. Thus, near any maximal zero face τ, the only zero face is τ itself. If Z=σ, plane preservation already forces ρiG=0 throughout σ; assume otherwise that Z is nonempty and proper. For every z∈τ and every vertex v outside τ, the tangent hypothesis gives duz(v−z)>0. Their finite minimum over the compact face τ is a number κτ>0. This is a bound on those transverse vertex directions, not on all unit directions outside the zero cone.

2.1F2step 1.1algebra

Distance lower bound. Near a proper maximal zero face τ, write x=(1−t)z+ty by barycentric projection, with z∈τ, y in the opposite face and t the sum of coordinates outside τ. For x sufficiently near τ, t<1/2 and ∣x−z∣≤tdiam⁡σ is arbitrarily small, uniformly along τ. Step 1.1 gives duz(y−z)≥κτ by expressing y as a convex combination of outside vertices. Uniform continuity of du on σ follows directly by covering it with half-radius continuity balls, taking a finite subcover, and using the triangle inequality on each corresponding full-radius ball. It gives duz+s(x−z)(y−z)≥κτ/2 for 0≤s≤1, after choosing the neighbourhood small enough. Segment integration yields u(x)≥tκτ/2≥[κτ/(2diam⁡σ)]dist⁡(x,Z), since z∈Z and ∣x−z∣≤tdiam⁡σ. Take the finite minimum of these positive constants over the maximal zero faces. If the compact remainder outside their neighbourhoods is nonempty, the continuous positive ratio u(x)/dist⁡(x,Z) has a positive minimum there by [F2]; if it is empty, omit this bound. Consequently there is a>0 with u(x)≥adist⁡(x,Z) on the whole simplex. No such bound is needed when Z is empty or the whole simplex.

3.1F2F3step 2.1

Perturbing the coordinate functions. For x∈σ choose a closest point z∈Zi,σ when the zero set is nonempty and proper; it exists by compactness of Zi,σ and the segment [z,x] lies in the convex simplex. Since ρiG(z)=ρiF(z)=0 on the zero subcomplex, segment integration of the piecewise smooth difference along [z,x], split into the finitely many refined pieces and added, gives ∣ρiG(x)−ρiF(x)∣≤δ∣x−z∣=δdist⁡(x,Zi,σ), using the derivative bound of the strong approximation. Choose δ<a/2 with a from step 2.1. Then ρiG(x)≥(a/2)dist⁡(x,Zi,σ), so ρiG≥0 on σ with equality exactly on Zi,σ. If Zi,σ=σ, plane preservation gives ρiG=0 there. If Zi,σ is empty, then ρiF has a positive minimum mσ on the compact simplex by [F2], and the value error ∣G−F∣<δ with δ<mσ/2 keeps ρiG positive on all of σ.

4.1F1step 3.1∎

Conclusion. Choose δ>0 below δ0 of [F1], every a/2 for a proper nonempty zero set, and every mσ/2 for an empty zero set, omitting nonexistent cases. Every strong δ-approximation G preserving the zero subcomplexes then has ρiG≥0 with zero set exactly Zi,σ on every simplex, for every i: all coordinate functions are nonnegative and the coordinate zero sets are exactly the prescribed ones, so G maps K into the same closed orthant with the same boundary structure. By [F1] G is again a whole-star embedding. This supplies the side control that affine-plane preservation alone does not give, as the half-plane warning in the cited Munkres exercise requires.

Depends on

Used by

Dependency tree · two levels

47 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