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

Homogeneous NURBS data errors generate geometry and metric error bounds

Statement

Assume Countable Choice. Let Q=(0,1)d, d∈{2,3}. Use a common finite tensor-product B-spline basis Nα of coordinate degrees pr≥1, clamped endpoint multiplicities pr+1, and interior multiplicities at most pr. 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 A=∑αaαNα,W=∑αwαNα,F=A/W,A′=∑αaα′Nα,W′=∑αwα′Nα,G=A′/W′. Here aα=wαPα∈Rd and aα′=wα′Pα′. Suppose F is admissible in Tensor-product NURBS patch maps and rational spline spaces, w−≤wα≤w+, ∥DF∥,∥(DF)−1∥≤L, det⁡DF≥j−>0, and the global lower Lipschitz bound is explicitly ∣F(x)−F(y)∣≥c∣x−y∣ on Q‾, c>0. The latter is the reciprocal of a global inverse Lipschitz bound and need not equal 1/L.

Define finite data quantities ϵA=max⁡α∣aα′−aα∣,ϵW=max⁡α∣wα′−wα∣<w−,m=w−−ϵW>0,R=max⁡α∣Pα∣, H=∑αmax⁡C∥∇Nα∥L∞(C),T=ϵA+RϵW,E0=T/m, E1=HϵA+LϵW+RHϵWm+T(w++ϵW)Hm2. All vector norms are Euclidean and all derivative norms are operator norms. H 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 wα′≥m, G is continuous on Q‾, and e0:=∥F−G∥∞≤E0,e1:=∥DF−DG∥L∞(cells;op)≤E1. If E1<min⁡(c,1/L), then G is globally injective and bi-Lipschitz onto its image, and ∣G(x)−G(y)∣≥(c−E1)∣x−y∣,∥DG∥≤L+E1,∥(DG)−1∥≤L1−LE1,det⁡DG≥j−(1−LE1)d>0. The image G(Q) is open. For the admissible-patch conclusion, retain the explicit boundary hypothesis that G(Q) is a Lipschitz domain with its finite piecewise C1 knot-cell presentation. A sufficient verifiable alternative is that G extends C1 to a neighborhood of Q‾ with nonsingular derivative there; this alternative holds when every interior multiplicity is at most pr−1. With either boundary condition G is admissible. No equality of the physical boundaries of F(Q) and G(Q) is asserted; their correspondence is G∘F−1.

For these admissible maps put M=max⁡(1,L,L+E1,L1−LE1),CM=dMd+1+2Md+3. Their unit-Laplace tensors satisfy ∥KF−KG∥∞≤CME1, and their bilinear-form difference is at most CME1∥∇v∥2∥∇w∥2. For any family with uniformly bounded L,c−1,R,w+,m−1 and HϵA+HϵW+ϵW=O(hs), s>0, the geometry form defect is O(hs). 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 aα and every wα to the nearest multiple of 2−b (ties go to the smaller integer), followed by Pα′=aα′/wα′. Put ηb=2−b−1 and D=2Hd+2L+2RHw−+4(d+R)(w++w−/2)Hw−2. Choose an integer b≥0 such that ηb<min⁡(w−/2,c/(2D),1/(2LD)). Then this generator has ϵA≤d ηb, ϵW≤ηb, e0≤2(d+R)ηb/w−, and e1≤Dηb; in particular it generates the positive denominator, Jacobian, and global injectivity bounds above. In the C1 knot branch (μr≤pr−1) it generates admissible approximate domains without an independent boundary certificate. Taking b so that Dηb≤hs produces a stated geometry derivative rate for any supplied grid family, with its actual D, 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.

[F1]

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.

[F2]

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.

[F6]

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∈(a,b) with f(b)−f(a)=f′(c)(b−a): 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.

[A1]

The Axiom of Countable Choice (ACω) 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

1.1F1givenalgebra

Put E=A′−A and e=W′−W. By [F1], ∣E∣≤ϵA, ∣e∣≤ϵW, W′≥m and ∣F∣≤R. Direct differentiation of the finite polynomial pieces gives ∥DE∥≤HϵA, ∣De∣≤HϵW and ∣DW′∣≤(w++ϵW)H. These inequalities use ∥z⊗q∥=∣z∣∣q∣ for each numerator term. Interior multiplicity at most degree makes every Nα continuous; thus F,G,E,e have matching traces. Positive denominator makes each rational cell piece smooth through that cell's closure.

1.2step 1.1givenalgebra

The exact identity G−F=(E−Fe)/W′ yields ∣G−F∣≤T/m=E0. Differentiating on a cell yields DG−DF=DE−eDF−F⊗DeW′−(E−Fe)⊗DW′(W′)2. Using step 1.1 and ∥DF∥≤L proves ∥DG−DF∥≤E1. No derivative error is assumed in this argument.

2.1A1F6step 1.1step 1.2givenalgebra

The continuous piecewise smooth function q=G−F is E1-Lipschitz on the convex box. The finitely many knot hyperplanes have dense complement in Q; by [A1], approximate any x,y∈Q‾ by sequences xn,yn∈Q whose coordinates avoid all knot values. The segment [xn,yn] 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 a,b of one subsegment, if q(a)=q(b) the desired bound is immediate; otherwise set e=(q(b)−q(a))/∣q(b)−q(a)∣ and apply [F6] to t↦e⋅q(a+t(b−a)). This function is continuous on [0,1] and differentiable on (0,1) using the cell expression, so ∣q(b)−q(a)∣=∣e⋅(Dq(ζ)(b−a))∣≤E1∣b−a∣ for some ζ in the subsegment. Summing subsegment lengths proves ∣q(xn)−q(yn)∣≤E1∣xn−yn∣. Continuity of q gives ∣q(x)−q(y)∣≤E1∣x−y∣ in the limit. Applying the same scalar mean-value argument to F, whose cell derivative norm is at most L, gives ∣F(x)−F(y)∣≤L∣x−y∣ on Q‾. Consequently ∣G(x)−G(y)∣≥(c−E1)∣x−y∣ and ∣G(x)−G(y)∣≤(L+E1)∣x−y∣. The first inequality proves global injectivity and the inverse Lipschitz bound.

2.2step 1.2givenalgebra

At every cell point, DG=DF(I+(DF)−1(DG−DF)) and the second term in parentheses has norm at most LE1<1. Its smallest singular value is at least 1−LE1, so the inverse bound is L/(1−LE1). Along the straight matrix homotopy from DF to DG, 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 det⁡DG≥j−(1−LE1)d. The derivative upper bound is the triangle inequality. These inequalities extend to each closed cell by continuity of that cell's polynomial-rational expression.

3.1F3step 2.1givenalgebra

Openness needs no topological or choice assumption. On the original open image Ω=F(Q) define r=q∘F−1; step 2.1 and the global lower bound give Lip⁡(r)≤E1/c=:t<1. Fix z0∈Ω and a closed ball of radius ρ centered there contained in Ω. For y within (1−t)ρ/2 of z0+r(z0), Ty(z)=y−r(z) maps this closed ball into itself and contracts by t: indeed ∣Ty(z)−z0∣≤(1−t)ρ/2+tρ<ρ. [F3] supplies a unique fixed point, and its equation z+r(z)=y puts this neighborhood inside G(Q). Hence G(Q) is open.

4.1A1F1F4step 1.1step 2.1step 2.2step 3.1algebra

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 C1 extension alternative, local inverses [F4] map boundary coordinate halfspaces near a box point to finitely many C1 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 t>gi(y), with gi locally C1. Their intersection is t>max⁡igi(y), 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 yn in those neighborhoods with preimages xn outside that fixed preimage neighborhood. Compactness [F4] gives a convergent subsequence with limit x∈Q‾ and continuity gives G(x)=G(x0), 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 pr−1, the polynomial pieces match through first derivatives, hence the rational pieces give a C1 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.

5.1F2step 1.2step 2.2step 4.1givenalgebra

Step 2.2 gives the map bounds M, and step 1.2 gives e1≤E1. Apply [F2] without repeating its determinant/inverse calculation to obtain the tensor and form bounds. In a family with the specified uniform constants, E1=O(hs), so the smallness holds eventually, M remains bounded and the geometry form defect is O(hs). This statement does not bound a changed load or quadrature rule.

6.1F5step 1.1step 1.2step 2.1step 2.2step 3.1step 4.1step 5.1algebra∎

By [F5], bracket 2bx 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 ηb. Componentwise rounding therefore gives the stated d ηb homogeneous numerator error and ηb weight error. Since ηb<w−/2, m≥w−/2, T≤(d+R)ηb, and w++ϵW≤w++w−/2. Substitute these bounds in E0,E1 to obtain E0≤2(d+R)ηb/w− and E1≤Dηb<min⁡(c/2,1/(2L)). The denominator, value, derivative, determinant, injectivity and openness conclusions follow from steps 1.1–3.1. A sufficiently large integer b exists because 2−b tends to zero; this is a specified integer rounding construction, with no arbitrary choice. The C1 knot branch of step 4.1 gives its boundary admissibility. Step 5.1 then gives the geometry form rate when Dηb≤hs.

Depends on

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