Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Graded Whitney mesh size and inward and outward boundary shifts

Statement

Let Ω⊂R3 be a nonempty bounded Lipschitz polyhedron with a matching shape-regular affine tetrahedral mesh Th. There are a positive continuous piecewise affine function gh, a smooth bounded vector field b on a neighborhood of Ω‾, and positive constants c,C,r,ϵ0, independent of the mesh, with the following properties. On K, chK≤gh≤ChK and Lip⁡(gh)≤C, where hK=diam⁡K. Put Ft,y±(x)=x+tgh(x)(±b(x)+ry),∣y∣≤1,0<t≤ϵ0. The maps are uniformly bi-Lipschitz on their domain. For the plus sign, Ft,y+(Ω‾)⊂Ω. For the minus sign, Ft,y−(∂Ω)⊂R3∖Ω‾, at distance at least ctgh(x) from ∂Ω. The same interior distance lower bound holds for the plus sign at boundary points. The images of K and all homotopies s↦Fst,y±(x), x∈K, lie within distance CthK of K. Their intersections with Ω are contained in a vertex patch ωK of uniformly bounded overlap, after decreasing ϵ0 if necessary. All constants may depend on Ω and the shape-regularity bound. No ratio of global maximum to minimum mesh size occurs.

Facts & Assumptions

Given: The stated polyhedron and shape-regular matching meshes. The boundary of a Lipschitz polyhedron is locally the graph of a continuous piecewise affine Lipschitz function, with a finite cover by such coordinate neighborhoods.

[F1]

Compact Euclidean sets admit finite subcovers without a choice principle (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line); the explicit concentric-ball bump and compact-set cutoff are supplied by A smooth bump between concentric Euclidean balls and Test function cutoffs and euclidean localization. Only finitely many such cutoffs and local directions are selected below.

Proof

1.1givenconstructalgebra

Fix the shape-regularity bound σ. For a cell K, let FK(x^)=bK+AKx^ be its orientation-preserving map from the reference tetrahedron. Its three columns are edge vectors, so ∥AK∥≤3hK. Since K contains an inscribed ball of radius ρK≥hK/σ and ∣K∣=∣det⁡AK∣/6, we have ∣det⁡AK∣≥8π(hK/σ)3. If s1≥s2≥s3 are the singular values of AK, then s1,s2≤3hK and s1s2s3=∣det⁡AK∣, hence s3≥cσhK. Thus every singular value is comparable to hK. Every physical edge is the image under AK of one of the six fixed reference edge vectors, whose lengths are either 1 or 2; consequently all edge lengths lie between cσhK and ChK. At a vertex of K, its three emanating edges form a matrix E=AKRi, where Ri is one of four fixed invertible reference matrices. The preceding singular-value bounds therefore give smin⁡(E)≥cσhK. Divide each column by its edge length to obtain B with unit columns. Since every edge length is at most hK, smin⁡(B)≥a>0 uniformly; decrease a to at most one. Also ∥B∥≤3. Put u0=(1/6,1/6,1/6) and p=Bu0. Then ∣p∣≤1/2. If ∣z−p∣<a/12, then ∣B−1z−u0∣<1/12, so all coordinates of B−1z are positive. Consequently the open ball B(p,a/12) is contained in the open vertex cone {Bu:uj>0} and in the unit ball, since ∣z∣<1/2+a/12<1. The open cones of distinct cells at a fixed vertex are disjoint: a point in two such cones would give a sufficiently short ray from that vertex inside both cell interiors, contrary to the matching mesh. Thus their radius-a/12 balls are disjoint and their centers are separated by at least a/6 (otherwise their midpoint lies in both balls). All centers lie in [−1,1]3. Fix an integer M>123/a and partition this cube by the coordinate grid into M3 boxes of side 2/M, assigning points on division planes to one adjacent box by a fixed half-open convention and including the outer endpoints. Each box has diameter 23/M<a/6, so contains at most one center. Hence at most M3 cells meet any vertex. This is a finite grid and pigeonhole argument, with no surface-area formula, measure theorem or choice principle. Their link is connected through faces containing that vertex: in an interior star the link is a triangulated sphere, and in a boundary star it is a triangulated disk, since a Lipschitz graph has a ball or half-ball neighborhood. Across a shared face the two diameters are comparable because each face edge is comparable to each incident cell diameter. A face path in the link has bounded length, so every two cells meeting a vertex have comparable diameters, with a constant depending only on shape regularity. Assign gh(v)=min⁡K∋vhK at every vertex and interpolate affinely. Barycentric differentiation and ∣∇λv∣≤C/hK give the asserted cellwise comparability and gradient bound.

1.2F1givenconstructalgebra

In a boundary graph box choose its upward unit direction ej. Shrink its support neighborhood so that every planar boundary piece meeting that neighborhood has outward normal n satisfying n⋅ej≤−αj<0. This holds because for a graph x3=f(x′), with the domain above it, every outward unit normal is (∇f,−1)/(1+∣∇f∣2)1/2. Refine the finite boundary cover by finitely many concentric ball pairs whose larger closures lie in the assigned graph boxes and whose smaller balls still cover the compact boundary. Use [F1] to put a bump βj in each larger ball, equal to one on its smaller ball. On the open collar where S=∑jβj>0, put χj=βj/S and b0=∑jχjej. A compact-set cutoff η supported in that collar and equal to one on a smaller collar gives the global smooth field b=ηb0, extended by zero away from the support of η. This is an explicitly normalized finite partition; no arbitrary-index partition theorem or choice axiom is imported. At each collar point every participating ej has the strict inward inequality for every nearby boundary face, so their convex combination does too, uniformly. After shrinking the collar, there is r>0 such that b(x)+ry is strictly inward for all nearby faces and −b(x)+ry strictly outward, for every ∣y∣≤1.

2.1givenstep 1.1construct

A bounded connected Lipschitz polyhedron is quasiconvex: close points in one boundary graph box can be joined by two vertical segments and a horizontal segment above the graph, of total length at most a fixed multiple of their distance; interior balls have the same property. A finite smaller cover gives this assertion for sufficiently close points. For remaining pairs, join the finitely many box centers through fixed interior polygonal paths and divide their bounded length by the fixed positive distance threshold. Componentwise the same argument applies to a disconnected domain, and distinct components have positive separation. Integrating the cellwise gradient along these paths gives the mesh-independent Euclidean Lipschitz bound for gh. Extend it to a neighborhood by the explicit formula g~h(x)=inf⁡z∈Ω‾(gh(z)+L∣x−z∣), then truncate above by max⁡gh; this is positive and L-Lipschitz and agrees on Ω‾.

2.2step 1.2step 1.1algebra

Here are the distance assertions, including concave corners. In any one graph box write a=b(x)+ry. Along the horizontal segment from x′ to x′+τa′, the graph is piecewise affine; on each piece the preceding normal inequality gives a3−∇f⋅a′≥β>0. Integration along that segment gives f(x′+τa′)≤f(x′)+τa3−βτ. Thus for x∈Ω‾ the point x+τa lies above the graph by at least βτ, and its distance to the graph is at least βτ/(1+L2)1/2. Replacing b by −b reverses the inequality and puts boundary points strictly below the graph. The finite cover supplies uniform constants and a uniform allowed τ. Away from the collar, small displacements remain inside. Substitute τ=tgh(x); the upper bound on gh is at most the domain diameter. Thus one fixed ϵ0 works for every mesh.

3.1step 1.1step 2.1constructalgebra

Let ωK be the union of cells sharing a vertex with K. The sum ψK of the four global nodal hat functions for the vertices of K is one on K, zero outside ωK, and has cellwise gradient at most C/hK: every cell where it is nonzero shares a vertex with K, so step 1.1 applies. The path argument of step 2.1 gives Lip⁡(ψK)≤CΩ/hK. Hence dist⁡(K,Ω∖ωK)≥cΩhK. The number of cells in each patch and the number of patches containing one cell are bounded by the vertex-incidence bound. This proves the claimed neighborhood and overlap properties for sufficiently small displacements, including on graded meshes.

4.1step 1.1step 3.1step 2.2algebra∎

The displacement field gh(±b+ry) has a uniformly bounded Lipschitz constant, since gh, b and their Lipschitz constants are uniformly bounded. Reduce ϵ0 so this constant times ϵ0 is below 1/2. Then 12∣x−z∣≤∣Ft,y±(x)−Ft,y±(z)∣≤32∣x−z∣. The displacement is at most CthK on K. Step 3.1 now proves the patch assertion, and step 2.2 proves the interior and exterior boundary assertions.

Depends on

Used by

Dependency tree · two levels

37 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