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.
Matching simplex subdivisions give a NURBS knot-cell geometry interface
Statement
Assume Countable Choice. Let be two admissible tensor-product NURBS maps on , , with finite knot partitions. Geometry continuity is required even if a representation allows a degree-plus-one interior knot; in particular it follows from degrees and interior multiplicities . Take the union of all distinct knots in each coordinate, discard zero-length spans, and let be the resulting common rectangular partition. On each closed , use the polynomial expressions inherited from the incident open cell, rather than a discontinuous evaluation convention at an endpoint. Their positive denominators, positive Jacobian lower bounds and bounded map/inverse derivatives are required on these expressions. They follow by continuity from uniform cellwise admissibility bounds. No agreement of cross-face normal derivatives is required.
For , subdivide by the simplices These form a matching affine simplicial mesh of . The restricted maps and are admissible curved-cell maps in Admissible isoparametric curved cells, with the reference simplices taken in parameter coordinates. Their images are matching curved partitions, and the two global maps satisfy Curved-domain geometry approximation errors with , , and . The geometry errors are precisely and on the box; subdivision does not change their essential suprema. Matching traces means agreement within each mapped mesh across shared facets, not on the exterior boundary. A prescribed common exterior boundary requires a separate equality of those traces. Common image topology is given by the homeomorphism .
For each finite cell, the rational expression has a smooth extension to a neighborhood of its closed rectangle: its polynomial numerator and denominator extend there and the denominator remains positive after shrinking the neighborhood. Its second derivatives are therefore bounded on that closed cell. For a sequence of grids, uniform reference-simplex shape regularity follows if on every rectangle with fixed . Uniform curved-map bounds additionally require uniform first, inverse and second derivative bounds of the rational cell expressions. Neither uniform second derivative bounds nor a shape constant follows from a first derivative error bound alone. The construction changes the geometry presentation only; rational analysis functions remain rational and are not reclassified as affine P1 functions.
Facts & Assumptions
Given: The two admissible maps, their common nondegenerate knot partition, their continuous traces and closed-cell rational expressions, with the stated map bounds.
Tensor-product NURBS patch maps and rational spline spaces defines rational geometry maps, global injectivity, bi-Lipschitz continuity, positive cell Jacobians and matching physical cells.
Matching affine simplicial meshes and shape regularity and Admissible isoparametric curved cells specify the reference matching mesh and the , neighborhood-diffeomorphism, positive-Jacobian and derivative conditions on curved cells. Curved-domain geometry approximation errors specifies the common-reference geometry errors and boundary-trace compatibility.
The Euclidean inverse function theorem gives a local diffeomorphism wherever a extension has nonsingular derivative; Heine-Borel in : with the Euclidean metric a subset of 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 gives compactness of closed simplices, and For every bounded sequence in has a convergent subsequence gives a convergent subsequence of every bounded Euclidean sequence.
The image of a lower-dimensional manifold is null: under Countable Choice, the image of a map from a lower-dimensional manifold into is Lebesgue null; in particular each affine hyperplane containing a reference-simplex facet is null.
The Axiom of Countable Choice () is used to select hypothetical counterexample pairs or remote preimages in the sequential compactness arguments and is retained through the null-image supplier [F4]. All coefficient bounds, specified rounding and contraction iterations are explicit.
Proof
In the normalized cube every point has some ordering of its coordinates, hence belongs to at least one displayed simplex; strict order specifies exactly one interior. For a permutation , the closed ordered region is the convex hull of the chain vertices : the barycentric coefficients are , . Thus a tie between consecutive coordinates sets exactly the corresponding barycentric coefficient to zero. For two permutations, the common weak order groups precisely the coordinates whose order is reversed into equal blocks; their intersection is the convex hull of the common chain vertices at the block boundaries, hence is a whole face of each simplex. This proves the subdivision is a simplicial complex with disjoint interiors. On a rectangular face one coordinate is or ; the remaining subdivision orders the remaining normalized coordinates. Adjacent rectangles have the same intervals in those coordinates and the same increasing-axis convention, so their induced face subdivisions coincide. The affine diagonal maps preserve these face identities. Therefore the finite subdivision is a matching affine simplicial mesh as required in [F2].
On a closed rectangle each map is a quotient of finite polynomials with denominator bounded below by a positive number. Its cell expression therefore extends smoothly across the rectangle into a neighborhood. Its derivatives, including second derivatives, are bounded there after shrinking the neighborhood. The determinant extends continuously with a positive lower bound on the closed cell. Its restriction to each closed simplex is injective by global injectivity of the map on . This restriction actually extends injectively to some neighborhood of that simplex: otherwise there exist distinct pairs of points at distance at most from the simplex with equal images. Compactness [F3] gives convergent subsequences with limits in the simplex; equality of images and injectivity force the same limit, contradicting local injectivity [F3] near that limit. A smaller neighborhood retains positive determinant, so the restriction is a neighborhood diffeomorphism. These arguments apply separately to and .
Continuity of the original maps makes the restricted traces agree on shared simplex facets, including those lying on original knot planes. Global injectivity preserves disjoint interiors and makes intersections of physical cells precisely the images of the corresponding reference intersections. Their union is the original image. The map, inverse, determinant and finite second-derivative bounds from step 1.2 give all curved-cell requirements [F2]. The reference simplices here are actual parameter simplices; if one instead precomposes with a map from a unit simplex, its Jacobian scaling factors must be retained.
The cell restrictions do not alter the global maps, their physical images, or their value and almost-everywhere derivative differences. Every introduced reference-simplex facet lies in an affine hyperplane, the image of an affine map from into . By [F4] and [A1] each such hyperplane is null, and the finite union of introduced facets is null. Thus taking essential suprema over the refined interiors gives the same ; continuity gives the same . To state separate finite error bounds as required by [F2], write for the two finite control-point lists and for their admissibility derivative bounds. The nonnegative rational coefficients in [F1] sum to one, so ; the operator-norm triangle inequality gives . The two positive determinant lower bounds are their respective admissibility constants . These coarse bounds establish the finite geometry interface; no smallness or mesh-dependent convergence follows from admissibility alone. Since both maps are bi-Lipschitz bijections of the closed box, is the required homeomorphism between the closed image domains. The within-mesh trace matching in step 2.1 supplies boundary-trace compatibility in [F2]; no exterior trace equality between distinct maps has been proved.
Each normalized ordered-coordinate simplex belongs to a finite set depending only on . Under diagonal scaling, diameter increases by at most and inradius decreases by at most the factor relative to the normalized simplex. Hence the diameter/inradius ratio is at most times the largest ratio in that fixed finite set. This proves the stated reference shape bound. The remaining uniform curved-map bounds are exactly the additional displayed family assumptions; finite-grid smoothness in step 1.2 supplies only finite-grid constants. No analysis-space change was made in the subdivision.
Remarks
For , the ordered-coordinate subdivision draws the same diagonal on adjacent rectangles, so their common edge is a whole face of both triangulations. The picture illustrates that convention only; the coordinate-order and face argument in step 1.1 proves the general claim.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Tensor-product NURBS patch maps and rational spline spaces
- Admissible isoparametric curved cells
- Curved-domain geometry approximation errors
- Matching affine simplicial meshes and shape regularity
- The Euclidean inverse function theorem
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ 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
- For $n \ge 1$ every bounded sequence in $\mathbb{R}^n$ has a convergent subsequence
- The image of a lower-dimensional $C^1$ manifold is null
Used by
Dependency tree · two levels
76 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
- Guermond, Finite Element Interpolation, Chapter 8, Meshes, complete 12-page chapter, §§8.1–8.2 (standard reference, not scraped)