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.
Homogeneous NURBS data errors generate geometry and metric error bounds
Statement
Assume Countable Choice. Let , . Use a common finite tensor-product B-spline basis of coordinate degrees , clamped endpoint multiplicities , and interior multiplicities at most . Only positive-length knot spans are cells. Exact homogeneous re-representation on this common basis must be established before comparing data on originally different grids; it is not inferred from a common geometric image. Let Here and . Suppose is admissible in Tensor-product NURBS patch maps and rational spline spaces, , , , and the global lower Lipschitz bound is explicitly on , . The latter is the reciprocal of a global inverse Lipschitz bound and need not equal .
Define finite data quantities All vector norms are Euclidean and all derivative norms are operator norms. is defined by the actual cell polynomials, so retains every degree, knot-spacing and multiplicity dependence. It is finite on each fixed finite nondegenerate grid; no uniform bound over degenerating grids is asserted. Then , is continuous on , and If , then is globally injective and bi-Lipschitz onto its image, and The image is open. For the admissible-patch conclusion, retain the explicit boundary hypothesis that is a Lipschitz domain with its finite piecewise knot-cell presentation. A sufficient verifiable alternative is that extends to a neighborhood of with nonsingular derivative there; this alternative holds when every interior multiplicity is at most . With either boundary condition is admissible. No equality of the physical boundaries of and is asserted; their correspondence is .
For these admissible maps put Their unit-Laplace tensors satisfy , and their bilinear-form difference is at most . For any family with uniformly bounded and , , the geometry form defect is . The bound is generated from homogeneous data; convergence of those data remains a separate approximation or certification obligation. Loads, quadrature and boundary-lift defects remain separate.
A concrete geometry generator is scalar rounding of every component of and every to the nearest multiple of (ties go to the smaller integer), followed by . Put and Choose an integer such that . Then this generator has , , , and ; in particular it generates the positive denominator, Jacobian, and global injectivity bounds above. In the knot branch () it generates admissible approximate domains without an independent boundary certificate. Taking so that produces a stated geometry derivative rate for any supplied grid family, with its actual , rather than claiming a rate from positive weights or knot refinement alone.
Facts & Assumptions
Given: The finite common basis, original admissible map, homogeneous coefficient errors, positive denominator margin and constants in the Statement; the strict smallness and boundary conditions only where their conclusions are invoked.
Positive weights give a bounded partition-of-unity NURBS basis gives nonnegative partition of unity, denominator bounds and the cellwise quotient derivative; Tensor-product NURBS patch maps and rational spline spaces gives admissibility and global bi-Lipschitz conventions.
Unit-Laplace pullback tensors are Lipschitz in the Jacobian matrix gives the displayed tensor and form estimate for two admissible maps once their derivative errors and map bounds are supplied.
A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point and and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in give the unique limit of a specified contraction iteration in a closed Euclidean ball.
The Euclidean inverse function theorem gives local inverses for extensions with 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 and For every bounded sequence in has a convergent subsequence supply compactness and the bounded-sequence subsequence argument at the boundary.
Integer part: for every real there is exactly one integer with supplies the adjacent integers bracketing a scaled scalar, so the specified nearest rounding exists; For the sequence is null, and for the sequence diverges to gives .
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : if a real function is continuous on a closed interval and differentiable on its interior, its endpoint difference is its derivative at an interior point times the interval length.
The Axiom of Countable Choice () is used to select hypothetical counterexample pairs or remote preimages in the sequential compactness arguments. All coefficient bounds, specified rounding and contraction iterations are explicit.
Proof
Put and . By [F1], , , and . Direct differentiation of the finite polynomial pieces gives , and . These inequalities use for each numerator term. Interior multiplicity at most degree makes every continuous; thus have matching traces. Positive denominator makes each rational cell piece smooth through that cell's closure.
The exact identity yields . Differentiating on a cell yields Using step 1.1 and proves . No derivative error is assumed in this argument.
The continuous piecewise smooth function is -Lipschitz on the convex box. The finitely many knot hyperplanes have dense complement in ; by [A1], approximate any by sequences whose coordinates avoid all knot values. The segment is not contained in any knot hyperplane and meets each such hyperplane in at most one point, so it splits into finitely many subsegments, each in one closed cell. For endpoints of one subsegment, if the desired bound is immediate; otherwise set and apply [F6] to . This function is continuous on and differentiable on using the cell expression, so for some in the subsegment. Summing subsegment lengths proves . Continuity of gives in the limit. Applying the same scalar mean-value argument to , whose cell derivative norm is at most , gives on . Consequently and . The first inequality proves global injectivity and the inverse Lipschitz bound.
At every cell point, and the second term in parentheses has norm at most . Its smallest singular value is at least , so the inverse bound is . Along the straight matrix homotopy from to , the same bound prevents a singular matrix; the determinant therefore keeps its positive sign. The determinant's absolute value is the product of singular values, giving . The derivative upper bound is the triangle inequality. These inequalities extend to each closed cell by continuity of that cell's polynomial-rational expression.
Openness needs no topological or choice assumption. On the original open image define ; step 2.1 and the global lower bound give . Fix and a closed ball of radius centered there contained in . For within of , maps this closed ball into itself and contracts by : indeed . [F3] supplies a unique fixed point, and its equation puts this neighborhood inside . Hence is open.
The explicitly assumed Lipschitz boundary presentation, step 2.1, step 2.2 and the cellwise smooth local inverse [F4] give exactly admissibility [F1]. For the sufficient extension alternative, local inverses [F4] map boundary coordinate halfspaces near a box point to finitely many inequalities with independent inward gradients. Choose the image of the sum of the active inward coordinate vectors as vertical direction; every active inequality has positive vertical derivative. The one-variable inverse furnished by [F4] expresses each as , with locally . Their intersection is , a Lipschitz graph. Shrink this neighborhood so local coordinates describe the image of a neighborhood of the chosen preimage. If remote preimages still entered every such shrinking image neighborhood, choose points in those neighborhoods with preimages outside that fixed preimage neighborhood. Compactness [F4] gives a convergent subsequence with limit and continuity gives , contradicting injectivity from step 2.1. Thus no remote image component changes the local graph. The finitely many smooth rational faces give the required boundary presentation. If all interior multiplicities are at most , the polynomial pieces match through first derivatives, hence the rational pieces give a extension across internal faces. At exterior box faces extend the outermost polynomial pieces with the same matching identities. Positive denominator and nonsingular derivatives persist in a sufficiently small neighborhood of the compact box by continuity, establishing the alternative.
Step 2.2 gives the map bounds , and step 1.2 gives . Apply [F2] without repeating its determinant/inverse calculation to obtain the tensor and form bounds. In a family with the specified uniform constants, , so the smallness holds eventually, remains bounded and the geometry form defect is . This statement does not bound a changed load or quadrature rule.
By [F5], bracket between adjacent integers, select the closer endpoint with the prescribed tie rule, and rescale. A real scalar therefore differs from its specified nearest grid multiple by at most . Componentwise rounding therefore gives the stated homogeneous numerator error and weight error. Since , , , and . Substitute these bounds in to obtain and . The denominator, value, derivative, determinant, injectivity and openness conclusions follow from steps 1.1–3.1. A sufficiently large integer exists because tends to zero; this is a specified integer rounding construction, with no arbitrary choice. The knot branch of step 4.1 gives its boundary admissibility. Step 5.1 then gives the geometry form rate when .
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Tensor-product NURBS patch maps and rational spline spaces
- Positive weights give a bounded partition-of-unity NURBS basis
- Unit-Laplace pullback tensors are Lipschitz in the Jacobian matrix
- The Euclidean inverse function theorem
- A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point
- $\mathbb{R}$ and $\mathbb{R}^n$ for $n \ge 1$ with the Euclidean metric are complete, componentwise from the Cauchy criterion in $\mathbb{R}$
- 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
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
- For $|r| < 1$ the sequence $r^k$ is null, and for $|r| > 1$ the sequence $|r|^k$ diverges to $+\infty$
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
Used by
Dependency tree · two levels
109 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 (standard reference, not scraped)
- Takacs, Numerical Analysis of Isogeometric Methods, geometry and rational-spline conventions (standard reference, not scraped)