Alphabeta Math
Pipeline-generated
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.

✓ 17 results · all verified · 11 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 6 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Isogeometric Galerkin discretization

1 · Prerequisites

2 · Summary

This page defines tensor-product NURBS geometry with positive bounded weights, globally injective and bi-Lipschitz patch maps, positive cell Jacobians, and finite conforming single- and multipatch Galerkin spaces with h/p/k conventions. It proves the rational basis identities, mapped H1 and energy norm bounds, homogeneous h-knot preservation, trace conformity, exact-form Céa estimates, and a perturbed-geometry/quadrature Strang estimate. Exact NURBS representation, approximate geometry, and quadrature are separate data.

For the geometry interface, a common union of knot partitions is subdivided by ordering the normalized coordinates in each rectangle. The resulting matching simplices let the NURBS restrictions meet the PE17 curved-cell and geometry-error definitions without reclassifying the rational analysis functions as affine P1 functions. A separate homogeneous-data result derives explicit value and derivative geometry errors from same-basis coefficient perturbations. Its global injectivity bound uses the original global lower Lipschitz constant, separately from the local inverse-derivative bound; admissibility also retains the stated boundary certificate or the C1 knot-multiplicity branch. The dyadic rounding procedure states an explicit precision threshold and preserves separate geometry, quadrature, load, and boundary-lift errors.

There is a full-H1 orthogonal projector from every H1_0 input into every finite conforming rational trial space, including the zero space. This projector preserves the boundary condition by its range and requires no point evaluations. A separate Greville/Schoenberg comparison gives an explicit H1 estimate for C1,1 numerator data over arbitrary finite clamped tensor grids and degrees p_r≥1, including fully repeated knots. It preserves zero faces and compatible multipatch traces under the stated aligned tangential-grid and proportional-denominator conditions. The mapped rate theorem applies when each numerator W_a(u∘F_a) is C1,1 and satisfies its displayed boundary and face hypotheses; for fixed bounded degrees and geometry constants it is first order in the maximum span, while variable-degree convergence uses the actual displayed constants. It asserts neither an optimal h^p rate nor a degree-independent constant. The earlier sharper compact-support Q1 energy estimate and the higher-degree conditional L2 theorem remain separate claims with their original hypotheses.

Positive weights do not imply an injective map or a positive Jacobian. Matching physical patch geometry does not make arbitrary field traces conforming. Nonmatching interfaces are excluded; a mortar or Nitsche method needs its own stability and consistency proof. The elasticity estimate applies for each finite Lamé parameter and grows with λ; it gives no locking-free or λ-uniform NURBS estimate. The perturbed-form result retains the load defect and assumes discrete coercivity.

The controlling pair requires spline-evaluation-and-interpolation-algorithms, curved-mesh-geometry-and-conservative-mesh-transfer, and elasticity-near-incompressibility-and-locking-free-discretization. The sources and harvested-result dispositions are recorded in the batch coverage file. Takacs and Buffa et al. support the NURBS geometry, basis, refinement, and Galerkin conventions; Lyche, Manni and Speleers support the B-spline and Greville identities; Guermond's mesh and error-analysis notes provide independent finite-mesh and Galerkin context. The quantitative geometry, tensor H1, boundary, and multipatch arguments are proved locally with their exact assumptions; no approximation rate is inferred from a source exercise or a general IGA remark.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Tensor-product NURBS patch maps and rational spline spaces

Definition

Let d∈{2,3} and let the reference patch be Ω^=(0,1)d. For each coordinate r, fix a degree pr∈N0, a finite clamped knot vector Ξr on [0,1], and its one-dimensional B-spline basis Bir,pr,Ξr(r) from B-spline spaces and knot conventions. For a multi-index α=(i1,…,id) in the finite product index set I, define the tensor-product basis function Nα(ξ1,…,ξd):=∏r=1dBir,pr,Ξr(r)(ξr).

Choose finitely many control points Pα∈Rd and positive weights wα, and write 0<w−:=min⁡αwα≤max⁡αwα=:w+<∞. The weight denominator, rational basis, and associated rational spline space are W(ξ):=∑α∈IwαNα(ξ),Rα(ξ):=wαNα(ξ)W(ξ),Nh:=span⁡{Rα:α∈I}. The corresponding NURBS geometry map is F(ξ):=∑α∈IRα(ξ)Pα. Equivalently, let F~(ξ):=∑α∈I(wαPα,wα)Nα(ξ)∈Rd+1 and let Π(y,z):=y/z for z>0. Then F=Π∘F~ wherever W>0. The basis properties in B-spline basis properties and polynomial reproduction give nonnegative tensor factors summing to one. Consequently the weights' convex combination satisfies W≥w−>0; the later item lem-positive-nurbs-basis-and-quotient-derivative records the full rational-basis consequences.

An admissible NURBS patch map is a continuous, globally injective, bi-Lipschitz map F:Ω^‾→Ω‾ whose restriction to every nonempty knot cell is a C1 diffeomorphism onto its image. There are constants 0<j−≤j+<∞ and 1≤L<∞ such that, almost everywhere on every cell, j−≤JF:=det⁡DF≤j+,∥DF∥op≤L,∥DF−1∥op≤L. The physical image Ω is required to be a bounded Lipschitz domain. The images of the finite knot cells form a face-to-face partition with the piecewise C1 boundary presentation of Specified finite piecewise C1 boundary presentations; the map agrees on each shared cell face.

A finite multipatch geometry consists of finitely many such patch maps with disjoint physical interiors, a connected bounded Lipschitz union, and matching full physical faces wherever two patches meet. Positive weights only define a positive denominator and a convex rational basis; they do not assert global injectivity, positive Jacobian, or interface matching. Exact NURBS representation means exact representation of the specified CAD map and does not assert that this map is the exact geometry of a target physical domain.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Compactly supported H1 functions lie in H1_0

Statement

Assume Countable Choice. Let U⊂Rd be open and let z∈H1(U) vanish almost everywhere outside a compact set K⊂U. Then z∈H01(U), where H01(U) is the H1 closure of Cc∞(U).

Facts & Assumptions

Given: Countable Choice; open U⊂Rd; compact K⊂U; and z∈H1(U) with z=0 almost everywhere on U∖K.

[A1]

The Axiom of Countable Choice (ACω) is used through the zero-extension, Meyers--Serrin density and Sobolev closure interfaces [F1], [F2], and [F4]; the cutoff existence [F3] itself is choice-free.

[F1]

Compactly supported Sobolev functions extend by zero in every integer order: the zero extension E0z belongs to H1(Rd) and its Sobolev norm equals that of z.

[F2]

Meyers–Serrin density on an arbitrary open set: under Countable Choice, smooth functions in C∞(Rd)∩H1(Rd) are dense in H1(Rd).

[F3]

Test function cutoffs and euclidean localization: for compact K⊂U there is χ∈Cc∞(U) equal to one on a neighborhood of K.

[F4]

Zero-boundary Sobolev space as a norm closure: H01(U) is the closure of Cc∞(U) in the H1 norm.

Proof

1.1A1F1F2F3given

By [F1], E0z∈H1(Rd) and E0z=z on U, E0z=0 off U. By [F2], choose qn∈C∞(Rd)∩H1(Rd) with qn→E0z in H1(Rd). Choose χ from [F3].

2.1F1F3F4step 1.1algebra∎

Multiplication by χ is bounded on H1(Rd). Indeed, for a weak derivative and a test function ψ, the weak identity gives ∫χq ∂jψ=∫q ∂j(χψ)−∫q(∂jχ)ψ=−∫(χ∂jq+q∂jχ)ψ, so Dj(χq)=χDjq+q∂jχ; the boundedness of χ and its derivatives gives the H1 norm bound. Since χE0z=z almost everywhere, χqn→z in H1(U). Every χqn is smooth and compactly supported in U, so [F4] proves z∈H01(U).

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Tensor Q1 nodal interpolation has a first-order H1 error bound

Statement

Let d∈{2,3} and let the unit cube be partitioned into uniform tensor cells of side length h=1/N. Let g∈C1([0,1]d) have Lipschitz gradient with constant Mg, meaning ∣∇g(x)−∇g(y)∣≤Mg∣x−y∣ for all x,y. Let Ihg be the continuous tensor-product, degree-one nodal interpolant matching g at every grid vertex. Then Ihg lies in the tensor-product degree-one C0 spline space and ∥g−Ihg∥H1((0,1)d)≤CdhMg,Cd:=d+d+2d−1dd.

Facts & Assumptions

Given: The unit tensor grid, g and its Lipschitz-gradient constant, and the nodal interpolant described in the Statement.

[F1]

B-spline spaces and knot conventions defines degree-one tensor spline factors, and B-spline basis properties and polynomial reproduction gives their piecewise polynomial, continuity, partition and polynomial reproduction properties. On each cell, the tensor nodal shape functions are the products of the two endpoint linear factors in each coordinate; products of the one-dimensional partition/reproduction identities give ∑νϕν=1 and ∑ν(xν)rϕν=xr for each coordinate r. Hence they reproduce every affine function.

[F2]

For a C1 function with Mg-Lipschitz gradient, integration along the line segment from x0 to x gives ∣g(x)−g(x0)−∇g(x0)⋅(x−x0)∣≤12Mg∣x−x0∣2,∣∇g(x)−∇g(x0)∣≤Mg∣x−x0∣.

Proof

1.1F1F2given

Fix a cell K and one vertex x0. Put ℓ(x)=g(x0)+∇g(x0)⋅(x−x0) and r=g−ℓ. The cell diameter is d h, so [F2] gives ∣r(x)∣≤(d/2)h2Mg on K and ∣∇r(x)∣≤d hMg. The tensor Q1 interpolant reproduces ℓ, hence g−IKg=r−IKr.

2.1F1step 1.1algebra

Let ϕν be the 2d tensor nodal shape functions. They satisfy ϕν≥0, ∑νϕν=1, and ∣∇ϕν∣≤d/h. Thus ∣IKr∣≤(d/2)h2Mg and ∣∇IKr∣≤∑ν∣r(xν)∣∣∇ϕν∣≤2d−1dd hMg. Combining these with step 1.1 yields ∣g−IKg∣≤dh2Mg and ∣∇(g−IKg)∣≤(d+2d−1dd)hMg.

3.1F1step 2.1givenalgebra∎

Adjacent cells use the same vertex values, so their local interpolants agree on their common faces; consequently Ihg is continuous and belongs to the tensor degree-one spline space defined by [F1]. Square the pointwise bounds of step 2.1, integrate on each cell, and sum over the unit-volume partition. The resulting global L2 errors are at most dh2Mg and (d+2d−1dd)hMg for value and gradient. Since h≤1, the Euclidean combination defining the H1 norm is at most their sum, which is bounded by CdhMg.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passOpen item page →

Bi-Lipschitz NURBS maps preserve H1 and energy norms

Statement

Assume Countable Choice and the admissible piecewise C1 NURBS map F:Ω^→Ω of Tensor-product NURBS patch maps and rational spline spaces. Write JF=det⁡DF, and assume j−≤JF≤j+ and ∥DF∥op,∥DF−1∥op≤L almost everywhere on the cells. For every u∈H1(Ω), its pullback u^=u∘F lies in H1(Ω^), with cellwise weak gradient ∇ξu^=DFT(∇xu)∘F. The inverse pullback also preserves H1, and ∥u^∥H1(Ω^)≤j−−1/21+L2 ∥u∥H1(Ω),∥u∥H1(Ω)≤j+1/21+L2 ∥u^∥H1(Ω^). Pullback maps H01(Ω) onto H01(Ω^). For a vector field v^=v∘F, the physical gradient is (∇ξv^)DF−1, so the scalar diffusion and finite-Lamé elasticity forms are transformed by the same Jacobian and inverse-map factors.

Facts & Assumptions

Given: Countable Choice; an admissible finite piecewise C1 NURBS map F with the determinant and derivative bounds in the Statement; u∈H1(Ω); and, for the zero-boundary assertion, u∈H01(Ω).

[A1]

The Axiom of Countable Choice (ACω) is assumed through the density [F1], change-of-variables [F2], Sobolev [F3], completeness and closed-subspace [F4], compact-support H01 [F5], and boundary-integration [F6] interfaces, and to select the approximation sequences. No stronger choice principle is used.

[F1]

Meyers–Serrin density on an arbitrary open set under Countable Choice: for 1≤p<∞, smooth functions in C∞(Ω)∩W1,p(Ω) are dense in W1,p(Ω).

[F2]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions under Countable Choice: on each cell diffeomorphism, the change-of-variables factor is the positive Jacobian determinant.

[F3]

Integer-order Sobolev spaces and their norms and Weak derivative of a locally integrable function: H1 membership is characterized by an L2 function with distributional first derivatives in L2.

[F4]

The Sobolev space H1 is a Hilbert space under Countable Choice: H1 is complete for its Sobolev norm, and H01 is a closed subspace.

[F5]

Compactly supported H1 functions lie in H1_0: under Countable Choice, every compactly supported H1 function on an open set belongs to H01; its proof uses zero extension, Meyers--Serrin density and a cutoff.

[F6]

Specified finite piecewise C1 boundary presentations gives the finite piecewise C1 cell presentation; Divergence for finite piecewise C1 presentations gives cellwise integration by parts and cancellation of opposite shared-face fluxes.

Proof

1.1F2F3F6givenalgebra

First let v∈C∞(Ω)∩H1(Ω). On each open knot cell the differentiability expansions of F and v give ∇ξ(v∘F)=DFT(∇xv)∘F. Fix a test function compactly supported in Ω^. Its support stays away from the exterior patch boundary. On every part of a cell where the test function is nonzero, its image under F lies in a compact subset of Ω, so v∘F and its first derivatives are bounded there; near exterior faces the test function vanishes. Apply the divergence theorem [F6] to (v∘F)ϕej cell by cell. The values of v∘F and ϕ agree on either side of every shared face, so opposite normal fluxes cancel, and exterior terms vanish. This proves the weak-derivative identity without requiring v to extend to ∂Ω. Cellwise change of variables [F2], summed over the finite partition using finite additivity of the integral, yields ∥v∘F∥L2(Ω^)2≤j−−1∥v∥L2(Ω)2,∥∇ξ(v∘F)∥L2(Ω^)2≤L2j−−1∥∇xv∥L2(Ω)2. Thus ∥v∘F∥H1(Ω^)≤j−−1/21+L2∥v∥H1(Ω). The same argument applied to F−1, whose Jacobian is JF−1 and derivative is bounded by L, gives the reverse estimate.

2.1A1F1F2F3F4step 1.1algebra

For arbitrary u∈H1(Ω), choose vn∈C∞(Ω)∩H1(Ω) with vn→u in H1 by [F1]. Step 1.1 applied to vn−vm makes vn∘F Cauchy in H1(Ω^); completeness [F4] gives a limit u^∈H1(Ω^). The same change-of-variables estimate in step 1.1 implies vn∘F→u∘F in L2(Ω^), so this limit is the composition class. The gradient formula follows by taking the L2 limit of the step 1.1 gradients: the bound on DF and the change-of-variables estimate imply DFT(∇vn)∘F→DFT(∇u)∘F in L2. Repeating the argument with F−1 proves the reverse estimate and inverse pullback.

3.1A1F2F4F5step 1.1step 2.1algebra∎

Suppose u∈H01(Ω) and choose φn∈Cc∞(Ω) converging to u in H1 by [F4]. Each φn∘F belongs to H1(Ω^) by step 1.1 and has compact support in Ω^, because F−1 maps compact subsets of Ω to compact subsets of Ω^. Applying [F5] gives φn∘F∈H01(Ω^). The forward estimate in step 2.1 gives convergence in H1, and closedness in [F4] implies u∘F∈H01(Ω^). Applying the same reasoning to F−1 proves the converse. Finally, the scalar energy identity follows by substituting ∇xu∘F=DF−T∇ξu^ and dx=JF dξ into the defining integral. For a vector field with row-gradient convention, ∇xv=(∇ξv^)DF−1; hence εx(v)∘F=sym⁡((∇ξv^)DF−1) and div⁡xv∘F=tr⁡((∇ξv^)DF−1), which gives the stated elasticity transformation.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Matching NURBS patch traces give global H1 conformity

Statement

Assume Countable Choice. Let a bounded open set Ω⊂Rd, d∈{2,3}, be the union of finitely many bounded knot-cell images with disjoint interiors and a face-to-face finite piecewise C1 presentation. Let m≥1 and let v:Ω→Rm be C1 on the closure of each cell, with each component's cell gradient square integrable. Suppose the two one-sided vector values agree on every shared face. Then v∈H1(Ω;Rm); its weak gradient is the piecewise classical componentwise gradient. This is the interface condition used to form conforming multipatch isogeometric spaces. Boundary conditions remain an additional restriction such as membership in H01(Ω;Rm).

Facts & Assumptions

Given: Countable Choice; the finite cell partition described in the Statement; a piecewise C1 field v with componentwise square-integrable cell gradients and matching vector traces.

[A1]

The Axiom of Countable Choice (ACω) is the exact choice hypothesis of the divergence theorem [F3] and the Sobolev conventions [F4].

[F1]

Tensor-product NURBS patch maps and rational spline spaces: the physical mesh is a finite face-to-face union of mapped knot-cell images, with matching physical faces wherever patches meet.

[F2]

Specified finite piecewise C1 boundary presentations: each cell has a finite piecewise C1 boundary presentation; a finite gluing lists the shared faces with their opposite outward normals, while edges are surface-null.

[F3]

Divergence for finite piecewise C1 presentations: for a C1 vector field on each piece, the integral of its divergence is the sum of its outward face fluxes; in a finite gluing the shared-face fluxes cancel.

[F4]

Integer-order Sobolev spaces and their norms and Weak derivative of a locally integrable function: membership in H1(Ω) requires the function and its distributional first derivatives to be in L2(Ω).

Proof

1.1A1F1F2F3F4givenalgebra

Fix a component q∈{1,…,m}, a test function ϕ∈Cc∞(Ω) and a coordinate j. The finite physical partition and face-equality convention are those of [F1]. On each cell K, the vector field GK:=vqϕej is C1 up to the cell boundary. By [F3], ∫Kvq ∂jϕ+∂jvq ϕ=∫∂Kvqϕ nK,j dS. Summing this identity over the finitely many cells is legitimate because both volume terms are integrable by the hypotheses and [F4]. On a shared face the two normal fluxes add to (vq,K−vq,K′)ϕnK,j, which is zero by the matching-trace assumption; edge overlaps have surface measure zero by [F2]. The exterior boundary term is zero because ϕ is compactly supported in Ω. Therefore ∫Ωvq ∂jϕ=−∑K∫K∂jvq ϕ.

2.1F2F4step 1.1algebra∎

For every component q and coordinate j, define gqj to equal the classical ∂jvq on each open cell and arbitrarily on the cell faces. The faces have d-dimensional measure zero under the finite piecewise C1 presentation, and the finite sum of cellwise L2 norms is finite, so gqj∈L2(Ω). Step 1.1 gives the weak-derivative identity for every test function, hence Djvq=gqj weakly. Each component of v is also square integrable on the finite bounded cell partition; [F4] therefore gives v∈H1(Ω;Rm) with the asserted componentwise gradient.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Positive weights give a bounded partition-of-unity NURBS basis

Statement

For the finite tensor-product basis and weights of Tensor-product NURBS patch maps and rational spline spaces, the denominator satisfies w−≤W(ξ)≤w+, the rational basis is nonnegative and sums to one, and Nh={s/W:s∈Sh},Sh:=span⁡{Nα:α∈I}. On each open knot cell, the rational basis functions are differentiable and ∇Rα=wαW∇Nα−wαNαW2∇W. In particular, if GN:=max⁡α∥∇Nα∥L∞(cells) and GW:=w+∑α∥∇Nα∥L∞(cells), then ∥∇Rα∥L∞(cells)≤w+GNw−+w+GWw−2. These derivative bounds depend on the fixed degrees and knot cells; no degree-independent bound is asserted.

Facts & Assumptions

Given: The finite tensor-product B-spline basis of Tensor-product NURBS patch maps and rational spline spaces, its positive weights wα, and a fixed nonempty knot cell.

[F1]

B-spline basis properties and polynomial reproduction: each univariate B-spline is nonnegative and piecewise polynomial; on every nonempty knot interval the active basis functions sum to one.

[F2]

Tensor-product NURBS patch maps and rational spline spaces defines Nα as the product of the one-dimensional B-splines, W=∑αwαNα, Rα=wαNα/W, and w−≤wα≤w+.

Proof

1.1F1F2algebra

Each tensor product Nα is nonnegative by [F1]. On any open tensor knot cell, each coordinate lies in one nonempty knot interval, so finite distributivity and [F1] give ∑α∈INα(ξ)=∏r=1d(∑irBir,pr,Ξr(r)(ξr))=1. Hence 0≤Nα≤1 on the cell. The endpoint values follow by the one-sided endpoint convention in B-spline spaces and knot conventions.

2.1F2step 1.1algebra

Since every coefficient wα is between w− and w+, the identity in step 1.1 yields w−∑αNα≤W=∑αwαNα≤w+∑αNα, so w−≤W≤w+. Thus each Rα is well-defined and nonnegative, and ∑αRα=∑αwαNαW=1. For any coefficients cα, ∑αcαRα=(1/W)∑α(cαwα)Nα. Multiplication of each coefficient by the nonzero wα is a bijection on the finite coefficient space, so the span equals Sh/W.

3.1F1F2step 1.1step 2.1algebra∎

On the open knot cell all Nα and W are polynomial and W≥w−>0 by step 2.1. The ordinary quotient rule gives the displayed gradient formula. Also ∥∇W∥∞≤∑αwα∥∇Nα∥∞≤GW and Nα≤1 by step 1.1. Applying these bounds to the quotient rule proves the stated derivative estimate. The finite number of polynomial pieces makes each GN finite.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Unit-Laplace pullback tensors are Lipschitz in the Jacobian matrix

Statement

Let d∈{2,3}, let F,G:(0,1)d→Rd be admissible piecewise C1 maps on a common finite refinement of their knot partitions, and suppose almost everywhere that both maps have positive Jacobian determinants and ∥DF∥op,∥DG∥op,∥DF−1∥op,∥DG−1∥op≤M,M≥1. Set δ=∥DF−DG∥L∞(op), the essential supremum of the operator-norm difference on that common refinement, and define the unit-diffusion pullback tensors KF=(det⁡DF)DF−1DF−T,KG=(det⁡DG)DG−1DG−T. Then, almost everywhere, ∥KF−KG∥op≤(dMd+1+2Md+3)δ. Consequently, for v,w∈H1((0,1)d), ∣∫(0,1)d(KF−KG)∇v⋅∇w∣≤(dMd+1+2Md+3)δ ∥∇v∥2∥∇w∥2. The discrepancy is a derivative-map error; a bound on ∥F−G∥∞ alone is not used.

Facts & Assumptions

Given: Two piecewise C1 admissible maps on a common finite refinement; the matrix and inverse bounds above; and v,w∈H1((0,1)d).

[F1]

Tensor-product NURBS patch maps and rational spline spaces: an admissible patch has cellwise differentiable map, positive Jacobian and finite map/inverse derivative bounds.

[F2]

Bi-Lipschitz NURBS maps preserve H1 and energy norms: the scalar unit-diffusion form pulls back to ∫(det⁡DF)DF−1DF−T∇v⋅∇w on the parameter box; the same formula holds with G.

[F3]

Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation gives the Euclidean Cauchy--Schwarz inequality; Cauchy-Schwarz inequality for L2 gives integral Cauchy--Schwarz. The determinant multilinearity, Gram--Schmidt volume bound, and inverse identity are established explicitly below.

Proof

1.1F1F2F3givenalgebra

By [F2], KF and KG are the unit-Laplace pullback tensors. Fix a point where the hypotheses hold and write A=DF, B=DG; [F1] supplies the cellwise map bounds. For any square matrix with columns c1,…,cd, if they are dependent its determinant is zero. If independent, Gram--Schmidt replaces each ci by qi=ci−∑k<iproj⁡qkci; subtracting combinations of earlier columns preserves the determinant, the qi are orthogonal, and ∥qi∥≤∥ci∥ by the Pythagorean identity. Since ∣det⁡[q1 ⋯ qd]∣2=det⁡(QTQ)=∏i∥qi∥2, this proves ∣det⁡[c1 ⋯ cd]∣≤∏i∥ci∥. Now multilinearity replaces the columns of B by those of A one at a time. Each determinant difference has one column of norm at most ∥A−B∥op≤δ and d−1 columns of norm at most M, so ∣det⁡A−det⁡B∣≤dMd−1δ. The same volume bound gives ∣det⁡B∣≤Md.

2.1givenstep 1.1algebra

The inverse identity A−1−B−1=A−1(B−A)B−1 gives ∥A−1−B−1∥op≤M2δ. Put SA=A−1A−T and SB=B−1B−T. Add and subtract B−1A−T to obtain ∥SA−SB∥op≤∥A−1−B−1∥∥A−1∥+∥B−1∥∥A−1−B−1∥≤2M3δ, while ∥SA∥op≤M2.

3.1step 1.1step 2.1algebra

Write (det⁡A)SA−(det⁡B)SB=(det⁡A−det⁡B)SA+(det⁡B)(SA−SB). The bounds in steps 1.1 and 2.1 give ∥KF−KG∥op≤dMd−1δ M2+Md 2M3δ=(dMd+1+2Md+3)δ. This proves the pointwise tensor estimate almost everywhere.

4.1F3step 3.1given∎

Apply the pointwise estimate to the integrand and then the integral Cauchy--Schwarz inequality [F3] on the unit box: ∣∫(KF−KG)∇v⋅∇w∣≤Cδ∫∣∇v∣∣∇w∣≤Cδ∥∇v∥2∥∇w∥2, where C=dMd+1+2Md+3. The integral is well-defined because the tensor difference is essentially bounded and the gradients are square integrable.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

NURBS quotient spaces transfer numerator H1 approximation

Statement

Assume Countable Choice. Let F:Ω^→Ω be an admissible NURBS map and W its continuous denominator, with W≥w−>0 and cellwise GW:=∥∇W∥L∞<∞. Let u^ be real-valued and let s∈Sh be a real numerator spline; assume both are C1 up to the boundary of each cell in the common refinement of the geometry and analysis knot grids, with matching traces, and put g:=Wu^. Then the physical rational spline vh:=(s/W)∘F−1 belongs to H1(Ω;R) and ∥u−vh∥H1(Ω)≤CFCW∥g−s∥H1(Ω^),CF:=j+1+L2,CW:=2w−+GWw−2, where u:=u^∘F−1. This result transfers a specified numerator approximation bound; it does not assert a polynomial-degree-independent rate or a general H1 rate for arbitrary knot families.

Facts & Assumptions

Given: Countable Choice; the admissible patch map F, continuous positive denominator W, real-valued parameter function u^, real numerator spline s, and matching cell traces of the Statement.

[A1]

The Axiom of Countable Choice (ACω) is the exact choice assumption of the mapped H1 supplier [F2]. The local finite-cell quotient estimate requires no stronger axiom.

[F1]

Positive weights give a bounded partition-of-unity NURBS basis: W≥w−>0, ∇W is essentially bounded on the finite cells, and Nh=Sh/W.

[F2]

Bi-Lipschitz NURBS maps preserve H1 and energy norms: H1 norms on Ω^ and Ω are equivalent with the stated map constants.

[F3]

Matching NURBS patch traces give global H1 conformity: a piecewise C1 function with matching traces and square-integrable cell gradients belongs to global H1.

Proof

1.1F1F3givenalgebra

Work on the finite common refinement and set e:=g−s. The continuous positive denominator is polynomial on each geometry cell, so g, s, e, s/W and e/W are continuous and C1 up to each refined cell boundary. Their classical cell gradients are square integrable on this finite partition; [F3] therefore puts them in H1 with these weak gradients. On each cell, u−vh=(u^−s/W)∘F−1=(e/W)∘F−1. Since W≥w−>0, the cellwise quotient rule gives ∣eW∣≤∣e∣w−,∣∇ ⁣(eW)∣≤∣∇e∣w−+GW∣e∣w−2. Taking the H1 norm and using the triangle inequality yields ∥e/W∥H1(Ω^)≤CW∥e∥H1(Ω^).

2.1A1F2F3step 1.1algebra∎

The traces of e/W match because the traces of u^, s, and W match and W is positive. Its cell gradients are square integrable by step 1.1, so [F3] gives e/W∈H1(Ω^). By [A1], [F2] maps s/W∈H1(Ω^) to vh∈H1(Ω). Applying its inverse-map estimate to (e/W)∘F−1 gives ∥u−vh∥H1(Ω)≤CF∥e/W∥H1(Ω^)≤CFCW∥g−s∥H1(Ω^). This is the claimed estimate, with all constants retaining the map and weight dependence.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passOpen item page →

Matching simplex subdivisions give a NURBS knot-cell geometry interface

Statement

Assume Countable Choice. Let F,G be two admissible tensor-product NURBS maps on Q‾=[0,1]d, d∈{2,3}, 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 pr≥1 and interior multiplicities μr≤pr. Take the union of all distinct knots in each coordinate, discard zero-length spans, and let C be the resulting common rectangular partition. On each closed C∈C, 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 C=a+diag⁡(ℓ1,…,ℓd)[0,1]d, subdivide by the d! simplices TC,π={a+diag⁡(ℓ1,…,ℓd)t:0≤tπ(1)≤⋯≤tπ(d)≤1},π∈Sd. These form a matching affine simplicial mesh of Q‾. The restricted maps F∣TC,π and G∣TC,π 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 Φ=F, Φh=G, Ω=F(Q) and Ωh=G(Q). The geometry errors are precisely e0=∥F−G∥∞ and e1=∥DF−DG∥L∞(cells;op) on the box; subdivision does not change their essential suprema. Matching traces means agreement within each mapped mesh across shared facets, not F=G on the exterior boundary. A prescribed common exterior boundary requires a separate equality of those traces. Common image topology is given by the homeomorphism G∘F−1.

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 max⁡rℓr/min⁡rℓr≤κ 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.

[F1]

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.

[F2]

Matching affine simplicial meshes and shape regularity and Admissible isoparametric curved cells specify the reference matching mesh and the C2, 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.

[F4]

The image of a lower-dimensional C1 manifold is null: under Countable Choice, the image of a C1 map from a lower-dimensional manifold into Rd is Lebesgue null; in particular each affine hyperplane containing a reference-simplex facet is null.

[A1]

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

1.1F2givenalgebra

In the normalized cube every point has some ordering of its d 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 0,eπ(d),eπ(d)+eπ(d−1),…,∑r=1deπ(r): the barycentric coefficients are 1−tπ(d), tπ(d)−tπ(d−1),…,tπ(2)−tπ(1),tπ(1). 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 0 or 1; 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].

1.2A1F1F3givenalgebra

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 Q‾. This restriction actually extends injectively to some neighborhood of that simplex: otherwise there exist distinct pairs of points at distance at most 1/n 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 F and G.

2.1F1F2step 1.1step 1.2algebra

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.

3.1A1F1F2F4step 2.1algebra

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 C1 map from Rd−1 into Rd. 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 e1; continuity gives the same e0. To state separate finite error bounds as required by [F2], write PαF,PβG for the two finite control-point lists and LF,LG for their admissibility derivative bounds. The nonnegative rational coefficients in [F1] sum to one, so e0≤max⁡α∣PαF∣+max⁡β∣PβG∣; the operator-norm triangle inequality gives e1≤LF+LG. The two positive determinant lower bounds are their respective admissibility constants j−F,j−G. 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, G∘F−1 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.

4.1step 1.1step 1.2F2givenalgebra∎

Each normalized ordered-coordinate simplex belongs to a finite set depending only on d. Under diagonal scaling, diameter increases by at most max⁡rℓr and inradius decreases by at most the factor min⁡rℓr 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 d=2, 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 d∈{2,3} claim.

C1C2sharedfacet1∙t2t1∙t2
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Greville comparison splines preserve faces and give an explicit H1 estimate

Statement

On [0,1]d, d∈{2,3}, choose in coordinate r any finite clamped knot vector Ξr=(ξi(r)) of degree pr≥1, with interior multiplicity at most pr+1. Let hr be its maximum positive span length, Bi(r) its canonical degree-pr basis, and ti(r)=pr−1∑k=1prξi+k(r) its Greville points. For a real-valued g∈C1([0,1]d) with Mg-Lipschitz gradient, define the actual tensor comparison spline Sg(x)=∑i1,…,idg(ti1(1),…,tid(d))∏r=1dBir(r)(xr). Put R=(∑r=1d(pr+1)2hr2)1/2,E=2∑r=1d(2pr+3)2hr2,B=E+d R. Then Sg is a continuous tensor spline, including at fully repeated knots, and ∥g−Sg∥L∞≤MgE,∥∇(g−Sg)∥L∞(cells)≤d MgR. For the Sobolev conclusion assume Countable Choice. Then Sg∈H1((0,1)d) and ∥g−Sg∥H1≤MgB. The finite construction, pointwise cell bounds, continuity and face identities do not use this additional choice assumption. The operator restricts on a coordinate face to the same construction in the tangential coordinates applied to the face data. Thus it preserves zero face data. If two face grids/degrees agree after coordinate permutation and coordinate reflections t↦1−t, their face operators agree under that identification and commute with multiplication of the face data by a constant. No knot-ratio bound is needed. All degree and continuity dependence is retained through the actual knots and the displayed degree factors. This comparison operator need not be idempotent.

Facts & Assumptions

Given: The knots, degrees, positive span maxima, tensor box, C1,1 numerator, and explicit finite formula in the Statement.

[A1]

The Axiom of Countable Choice (ACω) is assumed only for the Sobolev conclusion, through the trace-conformity supplier [F3] and Sobolev convention [F4]. The finite Greville and mean-value calculations do not require it.

[F1]

B-spline spaces and knot conventions supplies the Cox--de Boor recurrence and B-spline basis properties and polynomial reproduction, step 3.1 specialized to k=1, gives the Greville coefficient identity x=∑itiBi(x); step 3.2 of that theorem gives the cell derivative formula. Nonnegativity, support and partition of unity are in its Statement.

[F2]

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): a function continuous on a closed interval and differentiable on its interior has an interior point where its derivative equals the endpoint difference quotient.

[F3]

Matching NURBS patch traces give global H1 conformity gives weak H1 membership from piecewise C1 functions with matching values and square-integrable cell gradients, in particular for the finite Cartesian cell partition of the unit box.

[F4]

Integer-order Sobolev spaces and their norms defines the full H1 norm by the L2 norm of the function and its first weak derivatives.

Proof

1.1F1F2givenalgebra

The k=1 polynomial coefficient formula in [F1] is x=∑itiBi(x), while ∑iBi=1, so Srf:=∑if(ti)Bi reproduces every affine function. On a cell (ξm,ξm+1), all active Greville points lie in Jm=[ξm−p,ξm+p+1]∩[0,1], made from at most 2p+1 nonempty adjacent spans. Nonnegativity and partition of unity give ∣Srf(x)∣≤∥f∥L∞(Jm) for x in that cell. For a C1 section f with Mg-Lipschitz derivative, set T(x)=f(c)+f′(c)(x−c) at the left endpoint c of Jm. If y=c, then (f−T)(y)=0; if y≠c, apply [F2] to f−T on the interval with endpoints c,y. At the resulting interior point ζ, ∣(f−T)(y)∣=∣f′(ζ)−f′(c)∣ ∣y−c∣≤Mg∣Jm∣2. At x∈(ξm,ξm+1), nonnegativity and partition of unity give ∣Sr(f−T)(x)∣≤Mg∣Jm∣2. Since SrT=T, ∣f(x)−Srf(x)∣≤2Mg∣Jm∣2≤2(2pr+3)2hr2Mg. Thus each coordinate operator is a sup-norm contraction; the finite operators commute, so the telescoping identity for I−Sd⋯S1, commutation of different-coordinate operators, and contraction of each Sr let us sum these bounds on the original g and prove the function estimate with E.

1.2F1F2givenalgebra

For one coordinate write ci for its coefficient, keeping all other Greville samples fixed. Summation of the derivative formula from [F1] gives, on open cells, (∑iciBi,p)′=∑2≤i≤nξi+p>ξip(ci−ci−1)ξi+p−ξiBi,p−1. Here the nonempty-support lower-degree functions Bi,p−1, 2≤i≤n, form a nonnegative partition on each open cell; the two omitted boundary functions vanish there. Terms with ξi+p=ξi are omitted because their lower-degree splines have empty support, so no undefined 0/0 coefficient is used. Put Δi=ti−ti−1=(ξi+p−ξi)/p. For every included term Δi>0, apply [F2] to the coordinate section of g on [ti−1,ti]: its derivative quotient (ci−ci−1)/Δi equals ∂rg at some point between the two Greville samples, with all other coordinates fixed at their samples. If Δi=0, then ci=ci−1 and the corresponding lower-degree spline has empty support, so its contribution to the derivative is absent. At a cell point x in the support of an included lower-degree factor, both Greville endpoints lie in [ξi,ξi+p], within prhr of xr; the intermediate point lies there as well. In every other active coordinate, the sample and xs lie in a common degree-ps support of length at most (ps+1)hs. Therefore each gradient value in the nonnegative partition sum is evaluated within distance R of x. The Mg-Lipschitz gradient yields ∣∂rSg(x)−∂rg(x)∣≤MgR. Summing squared component bounds proves the gradient estimate.

2.1A1F1F3F4step 1.1step 1.2algebra

At an interior knot of multiplicity at most p, continuity follows from [F1]. At a knot of multiplicity p+1, the left and right pieces are clamped there; the only nonzero endpoint coefficient from each side has Greville point equal to that knot. Their face restrictions are therefore the same tangential sampled sum, so they agree; repeating this argument in each coordinate also gives agreement at intersections of repeated-knot faces. Thus the tensor construction is continuous on the closed box. Its piecewise polynomial gradients are bounded on the finite Cartesian grid, whose rectangular cells form a matching cell partition under the identity map. Under [A1], applying [F3] proves H1 membership and identifies the cell gradients as weak derivatives. The unit box has volume one, so the L2 errors are bounded by the displayed sup bounds. By [F4], ∥g−Sg∥H1=∥g−Sg∥22+∥∇(g−Sg)∥22≤MgE2+dR2≤Mg(E+dR).

3.1F1step 2.1givenalgebra∎

At an exterior endpoint of a clamped vector, only its first, respectively last, basis function has value one; the rest are zero. The corresponding Greville point is that endpoint. Substitution into the tensor formula gives exactly the asserted tangential face formula and zero-face preservation. Reflection reverses the knot list and sends each Greville point to 1−ti. On open knot cells it reverses the indexed basis functions by the Cox–de Boor recurrence in [F1], starting with the interval indicators. At a fully repeated knot the individual right-cell conventions need not commute with reflection, but the constructed sampled sum is continuous by step 2.1, so equality of the reflected sums on open cells extends to every knot and endpoint. Permuting coordinates merely permutes finite product factors. Consequently aligned face formulas agree under all declared identifications. Constant multiplication commutes with their finite linear sums.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Homogeneous knot insertion preserves an admissible NURBS patch

Statement

Let F be the tensor-product NURBS patch of Tensor-product NURBS patch maps and rational spline spaces. Insert a knot u that is new and strictly inside a nonempty span in one coordinate direction. Apply Single new-knot insertion for a B-spline curve to every control-net slice in that direction, using homogeneous controls (wαPα,wα)∈Rd+1. Then the updated homogeneous tensor spline is pointwise unchanged, every updated weight is positive, and the rational patch map remains exactly F on Ω^‾.

Facts & Assumptions

Given: A finite tensor-product knot grid, the positive weights and control points of a NURBS patch, and a new knot strictly inside a nonempty span in one coordinate direction.

[F1]

Single new-knot insertion for a B-spline curve copies controls outside the active range and replaces active controls by αiPi+(1−αi)Pi−1, with 0<αi<1 for a strictly interior new knot.

[F2]

Single new-knot insertion preserves the B-spline curve: for every vector-valued B-spline curve, the algorithm's refined control net represents the same curve at every parameter value, including knot endpoints.

[F3]

Tensor-product NURBS patch maps and rational spline spaces defines F as the first d components of the homogeneous tensor spline divided by its last component.

[F4]

Positive weights give a bounded partition-of-unity NURBS basis: the denominator is at least w−>0 whenever all weights are positive.

Proof

1.1F1F2F3algebra

Write the homogeneous control array as P~α=(wαPα,wα). The tensor spline F~(ξ)=∑α∈IP~αNα(ξ) has first d components W(ξ)F(ξ) and last component W(ξ) by [F3]. Fix the coordinate direction in which u is inserted and fix a multi-index of all other coordinates. Grouping the finite sum over the remaining index writes the corresponding slice as a B-spline curve with controls in Rd+1. By [F2], knot insertion leaves that slice unchanged for every value of the insertion coordinate. Multiplication by the fixed transverse tensor basis function and summation over all transverse indices show that the entire updated homogeneous spline F~′ equals F~ pointwise.

2.1F1F3F4step 1.1algebra∎

In the active range, each updated last coordinate is αiwi+(1−αi)wi−1 by [F1]; it is positive because both old weights are positive and 0<αi<1. Copied weights are positive as well. Thus all updated weights are positive and [F4] gives W′(ξ)>0 on the closed patch. Since F~′=F~, their first d components and last components agree, and division by this positive common last component gives F′(ξ)=F(ξ) for every ξ∈Ω^‾.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Conforming isogeometric Galerkin spaces and h/p/k refinement

Definition

For one admissible patch map F:Ω^→Ω, let Sh be a finite tensor-product B-spline space on a knot grid refining the geometry grid, and let W be the positive denominator of the geometry representation. The parametric rational analysis space is V^h:={s/W:s∈Sh}. Its physical push-forward is { v^∘F−1:v^∈V^h }. The homogeneous-Dirichlet conforming space is the subspace of these functions that belongs to H01(Ω); the unconstrained conforming version is the subspace belonging to H1(Ω). These spaces are finite dimensional because the tensor B-spline coefficient set is finite.

For vector-valued elasticity in Rd, use the componentwise product V^h d:=(V^h)d, push it forward component by component, and intersect with H1(Ω;Rd) or H01(Ω;Rd) as appropriate. This remains finite dimensional because it is a subspace of the finite product of scalar coefficient spaces. Trace equality is required componentwise on each shared full face.

For finitely many matching patches, use one such local rational space on each patch. A global trial function is a piecewise physical function whose traces agree pointwise on every shared full face and which belongs to the chosen global H1 or H01 space. Under Countable Choice, the vector-valued trace-matching lemma Matching NURBS patch traces give global H1 conformity proves the H1 part of this interface rule componentwise, including the Cartesian product used for elasticity. Nonmatching interfaces are excluded; a mortar or Nitsche method requires a separate stability and consistency result.

The refinement labels have the following meanings.

  • h-refinement inserts a new knot into a nonempty span at fixed degree and updates homogeneous control data by Single new-knot insertion for a B-spline curve. Theorem Homogeneous knot insertion preserves an admissible NURBS patch proves exact map preservation for this operation.
  • p-refinement raises a coordinate degree and replaces the homogeneous representation only when an exact representation with positive new weights is supplied. A degree label alone does not certify geometry preservation or an approximation rate.
  • k-refinement raises degree and chooses knot multiplicities to obtain a declared continuity, commonly the maximal Cpr−1 continuity at simple interior knots. Exact geometry preservation requires the same positive homogeneous representation check as p-refinement.

On each cell, the pullback of scalar gradients and of the linear-elasticity strain is computed using Bi-Lipschitz NURBS maps preserve H1 and energy norms. Exact geometry does not assert exact quadrature. A discretization using an approximate map or quadrature must retain its separate form and load defects.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Finite-Lamé isogeometric elasticity is conforming and quasi-optimal

Statement

Assume Countable Choice and the real displacement formulation of Linear isotropic elasticity: displacement form and data on a nonempty bounded, connected Lipschitz domain D⊂Rd, d∈{2,3}. Let V=H01(D;Rd) with the gradient norm, let the measurable shear modulus satisfy 0<μ0≤μ(x)≤μ1<∞ almost everywhere, let 0≤λ<∞, and let f∈V′. For a finite conforming isogeometric subspace Vh⊂V built from the matching NURBS patches of Conforming isogeometric Galerkin spaces and h/p/k refinement, the elasticity variational problem has a unique solution u, the Galerkin problem has a unique solution uh, and ∥u−uh∥V≤2μ1+dλμ0inf⁡vh∈Vh∥u−vh∥V. The estimate is for each finite λ and has a factor growing with λ; it is not a locking-free or λ-uniform NURBS result.

Facts & Assumptions

Given: Countable Choice; the elasticity data and domain above; and a finite isogeometric space declared conforming in H01(D;Rd).

[F1]

Conforming isogeometric Galerkin spaces and h/p/k refinement: the scalar local space is finite dimensional; the elasticity space is its componentwise d-fold product restricted to global H01(D;Rd); nonmatching faces are excluded.

[F2]

Matching NURBS patch traces give global H1 conformity: under Countable Choice, on a bounded open set in dimension two or three with a specified finite face-to-face piecewise C1 partition into bounded knot-cell images with disjoint interiors, a field C1 on each closed cell, with square-integrable cell gradients and equal one-sided values on every shared face, belongs to global H1.

[F3]

Linear isotropic elasticity: displacement form and data fixes the real convention V=H01(D;Rd) with gradient norm, μ∈L∞ with 0<μ0≤μ≤μ1, λ≥0, f∈V′, ε(v)=(∇v+∇vT)/2, and Eλ(v,w)=2∫Dμε(v):ε(w)+λ∫Ddiv⁡vdiv⁡w.

[F4]

Dirichlet elasticity energy bound and Galerkin estimate states: under Countable Choice, d∈{2,3}, the data of [F3], finite λ≥0, and any finite-dimensional conforming Vh⊂V, the continuous and Galerkin solutions are unique and ∥u−uh∥V≤(2μ1+dλ)μ0−1inf⁡vh∈Vh∥u−vh∥V.

[A1]

The Axiom of Countable Choice (ACω) is the exact axiom required by the imported elasticity theorem and its Hilbert, Lax--Milgram and Céa applications; this item adds no stronger choice principle.

Proof

1.1F1F2givenalgebra

A single-patch analysis space is finite dimensional because its tensor coefficient set is finite. A finite multipatch space is a subspace of the finite product of these local spaces and is therefore finite dimensional. Its definition imposes global H01 membership, so conformity follows directly from [F1] and the hypothesis Vh⊂V. When conformity is instead checked from cell traces, [F2] applies only after its specified finite cell presentation, closed-cell regularity, integrability and face equalities have all been verified; trace equality alone is not that verification. Thus the stipulated Vh is a finite-dimensional conforming subspace of V.

2.1A1F3F4step 1.1given∎

The typed domain, real displacement space, coefficient, load, strain and form in the Statement are exactly those fixed in [F3]. By step 1.1 the isogeometric space is a finite-dimensional conforming subspace. Thus the actual PE19 estimate [F4] applies and gives existence, uniqueness and the displayed constant. Since λ appears in the numerator, this application supplies no bound uniform in λ.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Isogeometric geometry and quadrature defects enter through Strang's bound

Statement

Assume Countable Choice and use real scalar Sobolev spaces. Let Ω^=(0,1)d, d∈{2,3}, and V=H01(Ω^;R) with the gradient norm. Let F be an exact admissible patch map and G an approximate admissible map on the same reference box, with a common finite refinement of their cell grids. Let f be a bounded real-linear functional on H01(F(Ω^);R) equipped with its physical gradient norm, and define the exact pulled-back unit-diffusion form and load by a^F(v,w)=∫Ω^KF∇v⋅∇w,KF=(det⁡DF)DF−1DF−T,ℓ^F(w)=⟨f,w∘F−1⟩. Define a^G by the same tensor formula with G. Let u∈V solve a^F(u,w)=ℓ^F(w) for every w∈V. Let Vh⊂V be a finite conforming rational spline space and let bounded ah and ℓh be a discrete form and load assembled using G and a specified quadrature rule. Assume ah is coercive on Vh with inherited norm and constant αh>0, and let MF be a boundedness constant for a^F. Define δgeom(vh):=sup⁡wh≠0∣a^F(vh,wh)−a^G(vh,wh)∣∥wh∥V,δquad(vh):=sup⁡wh≠0∣a^G(vh,wh)−ah(vh,wh)∣∥wh∥V, and δload:=sup⁡wh≠0∣ℓ^F(wh)−ℓh(wh)∣/∥wh∥V. When Vh={0} define all three defects to be zero. Let uh∈Vh solve the discrete problem; then ∥u−uh∥V≤inf⁡vh∈Vh((1+MF/αh)∥u−vh∥V+δgeom(vh)+δquad(vh)+δloadαh). If δ=∥DF−DG∥L∞(op) and both map derivative and inverse bounds are at most M≥1, then the geometry defect obeys δgeom(vh)≤(dMd+1+2Md+3)δ ∥vh∥V. The hypotheses require discrete coercivity; neither exact geometry nor positive NURBS weights imply it. The estimate retains the load defect and makes no convergence claim for any geometry or quadrature rule.

Facts & Assumptions

Given: Countable Choice; exact and approximate admissible maps on a common reference domain; the exact pulled-back problem; finite conforming Vh; boundedness of the exact form; and coercivity of the assembled form with constant αh.

[A1]

The Axiom of Countable Choice (ACω) is the precise choice hypothesis of First Strang estimate for conforming perturbed Galerkin problems; the local tensor defect calculation adds no stronger choice principle.

[F1]

Bi-Lipschitz NURBS maps preserve H1 and energy norms: the unit-diffusion form pulls back to a^F(v,w)=∫Ω^KF∇v⋅∇w, with KF=(det⁡DF)DF−1DF−T, and the H1 norm bound applies to the pulled-back load; the tensor formula applies to G as well.

[F2]

Unit-Laplace pullback tensors are Lipschitz in the Jacobian matrix: when both maps and inverses have operator bounds at most M, ∣a^F(v,w)−a^G(v,w)∣≤(dMd+1+2Md+3)δ∥v∥V∥w∥V.

[F3]

Variational-crime settings and consistency defects defines the conforming form defect δa,h as the supremum of ∣a^F(vh,wh)−ah(vh,wh)∣/∥wh∥V and the load defect as the corresponding supremum for ℓ^F−ℓh.

[F4]

First Strang estimate for conforming perturbed Galerkin problems under Countable Choice: for Hilbert V, a bounded coercive exact form with bounded data and constant MF, finite conforming Vh, and a bounded discrete form coercive with constant αh, the error is bounded by the best-approximation term (1+MF/αh)∥u−vh∥V plus the form and load defects divided by αh.

[F5]

Matching simplex subdivisions give a NURBS knot-cell geometry interface subdivides a common finite NURBS knot partition into matching parameter-coordinate simplices; each restriction is an admissible curved-cell map, and the NURBS e0,e1 errors and global map relation are unchanged by the subdivision. Cross-face derivative matching and equality of distinct exterior boundaries are not asserted.

[F6]

Homogeneous NURBS data errors generate geometry and metric error bounds derives e0≤E0 and e1≤E1 from same-basis homogeneous coefficient errors, a positive weight margin, an original global lower Lipschitz bound, and an explicit boundary certificate; its stated C1 multiplicity branch and dyadic rounding construction are sufficient alternatives under their displayed hypotheses.

[F7]

The Sobolev space H1 is a Hilbert space makes H01(Ω^) Hilbert in its full H1 norm under Countable Choice, and A bounded-domain Poincare inequality for H1-zero fields makes the gradient norm equivalent to that norm on the unit cube.

Proof

1.1F1F4F7givenalgebra

By [F7], V is Hilbert in its stated gradient norm; because [F1] makes F(Ω^) bounded, the same Poincare supplier also shows that the physical gradient seminorm is a norm. For any vector z∈Rd, [F1] and the map bounds give z⋅KFz=JF∣DF−Tz∣2≥j−L−2∣z∣2,∥KF∥op≤j+L2. Indeed, ∣DF−Tz∣≥∣z∣/∥DFT∥op≥∣z∣/L and ∣DF−Tz∣≤L∣z∣. Thus a^F is coercive and bounded in the gradient norm. The pullback gradient identity and change of variables in [F1] give ∥w∘F−1∥∇,F≤j+L∥w∥V, so the physical gradient-bounded load pulls back to bounded data. With the exact solution given in the Statement, all exact-form hypotheses of [F4] hold; one may take MF=j+L2.

1.2F1F3givenalgebra

By [F1], the exact and approximate pulled-back forms use tensors KF and KG. The form defect in [F3] splits, for any vh,wh, as a^F(vh,wh)−ah(vh,wh)=(a^F(vh,wh)−a^G(vh,wh))+(a^G(vh,wh)−ah(vh,wh)). Take absolute values, divide by ∥wh∥V, and take the supremum over nonzero wh; the triangle inequality yields δa,h(vh)≤δgeom(vh)+δquad(vh). If Vh={0} all three defects are zero by the Statement and the same comparison is vacuous.

1.3F2given

Under the additional map bound in the Statement, [F2] holds for every wh, so taking its supremum gives δgeom(vh)≤(dMd+1+2Md+3)δ∥vh∥V. This controls only the form's geometry component; it says nothing about the load or quadrature defect.

1.4F5givenalgebra

For NURBS maps F,G satisfying the Statement, apply [F5] on their common knot partition. The resulting reference simplicial mesh is matching, and the cellwise PE17 geometry errors are exactly the same e0,e1 used here; the homeomorphism G∘F−1 gives the common image topology. The boundary traces of F and G need not be equal.

2.1A1F3F4step 1.1step 1.2step 1.3givenalgebra

By [F4], the error is bounded by best approximation plus δa,h/αh and δF,h/αh. Substitute the split from step 1.2, which is exactly the sum of our geometry and quadrature defects, and use δF,h=δload. Taking the infimum over vh gives the displayed inequality. Step 1.3 supplies the explicit geometry bound under the additional derivative-map hypotheses.

3.1F2F6step 1.3givenalgebra∎

If the same-basis homogeneous-data hypotheses of [F6] hold and its boundary condition makes G admissible, then its derivative estimate supplies δ≤E1. Step 1.3 therefore gives δgeom(vh)≤(dMd+1+2Md+3)E1∥vh∥V. In the stated dyadic branch, E1≤Dηb, so this particular geometry contribution is at most (dMd+1+2Md+3)Dηb∥vh∥V. This does not bound the separate quadrature, load, or discrete-coercivity terms.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Exact-geometry isogeometric Poisson Galerkin estimate

Statement

Assume Countable Choice. Let D⊂Rd, d∈{2,3}, be bounded, connected, and Lipschitz, and let V=H01(D;R) with norm ∥v∥V=∥∇v∥L2(D). Let A:D→Rd×d be measurable and symmetric, with constants 0<α≤β<∞ such that ζ⋅A(x)ζ≥α∣ζ∣2and∥A(x)∥op≤βfor a.e. x∈D, ζ∈Rd. For f∈V′, define a(u,v)=∫DA∇u⋅∇v and F(v)=f(v). Let Vh⊂V be any finite conforming isogeometric subspace on the exact admissible patch geometry. Then the weak problem and its Galerkin restriction have unique solutions u and uh, and ∥u−uh∥V≤βαinf⁡vh∈Vh∥u−vh∥V. This is an exact-form estimate; it makes no assertion about approximate geometry, quadrature, polynomial-degree-independent constants, or a rate without a separate numerator approximation theorem.

Facts & Assumptions

Given: Countable Choice; the bounded Lipschitz domain and scalar Sobolev space above; measurable symmetric coefficient A with the stated bounds; f∈V′; and finite conforming isogeometric Vh⊂V.

[A1]

The Axiom of Countable Choice (ACω) is used through the Hilbert-space and Céa suppliers in [F3]--[F4]; no stronger choice principle is required by this application.

[F1]

Conforming isogeometric Galerkin spaces and h/p/k refinement: the exact-geometry global trial space is finite dimensional, and its homogeneous-Dirichlet version is by definition a subspace of H01(D).

[F2]

Matching NURBS patch traces give global H1 conformity proves global H1 membership from matching full-face traces for the piecewise smooth fields used to construct multipatch spaces.

[F3]

The Sobolev space H1 is a Hilbert space and Zero-boundary Sobolev space as a norm closure: H01(D) is closed in the H1 Hilbert space under Countable Choice. The bounded-domain Poincaré inequality A bounded-domain Poincare inequality for H1-zero fields makes ∥∇⋅∥2 an equivalent Hilbert norm.

[F4]

Céa quasi-optimality for coercive conforming Galerkin problems under Countable Choice: for a Hilbert space, a bounded form constant M, coercivity constant α0>0, bounded data, and a finite-dimensional subspace, the continuous and discrete solutions are unique and the error is at most (M/α0) times best approximation.

Proof

1.1givenalgebra

The operator bound on A and Cauchy--Schwarz give ∣a(v,w)∣≤β∥v∥V∥w∥V. The lower coefficient bound gives a(v,v)≥α∥v∥V2. Hence a is bounded with M=β and coercive with α0=α.

2.1A1F1F2F3F4givenstep 1.1∎

By [F3], V with the gradient norm is a real Hilbert space. Its data functional F is bounded by the definition of V′, and Vh is finite dimensional and conforming by [F1] (with [F2] verifying the interface condition when needed). Thus all hypotheses of [F4] hold with M=β and α0=α. Applying [F4] gives both solutions and its estimate is exactly the displayed inequality. Its hypotheses concern the exact form only, so the conclusion carries no geometry or quadrature defect term and no approximation rate beyond the best-approximation infimum.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Tensorized spline quasi-interpolation gives a NURBS L2 rate

Statement

Assume the Axiom of Choice. On each coordinate interval [0,1], let a clamped degree-pr analysis knot mesh have largest cell size hr, and let Qr be a family as in Bounded local spline quasi-interpolants with reproduction order 0≤ℓr≤pr, local constant Mr, and stability constant Cr. Require each analysis knot mesh to refine the corresponding geometry knot vector, and let Sh=⨂r=1dSpr,ξ(r) be the corresponding numerator space defining the patch trial space in Conforming isogeometric Galerkin spaces and h/p/k refinement. Suppose g:Ω^→R belongs to L2(Ω^), has weak pure derivatives ∂rℓr+1g∈L2(Ω^), and, for each r, almost every section in coordinate r belongs to Wℓr+1,2(0,1) and satisfies the hypotheses of the one-dimensional estimate in Sobolev approximation by local spline quasi-interpolants. Require each Qr to have its bounded extension to L2(Ω^), acting in coordinate r, with norm at most Sr=CrMr; require the coordinate operators to commute pairwise and to commute with weak derivatives in every other coordinate on this class. These are explicit hypotheses on the supplied family, not conclusions of the univariate rate theorem. Under the Axiom of Choice, completed-product Fubini is available, and the sectionwise operators and derivatives are assumed measurable. Define Q:=Qd⋯Q1 and set Ar:=(1+Cr)Mrℓr+1+1/2/ℓr!. Then Qg∈Sh and ∥g−Qg∥L2(Ω^)≤∑r=1dAr ⁣(∏j≠rSj)hrℓr+1∥∂rℓr+1g∥L2(Ω^). If g=W(u^) and vh:=(Qg/W)∘F−1, then ∥u−vh∥L2(Ω)≤j+w−∥g−Qg∥L2(Ω^),u:=u^∘F−1. This is an L2 approximation estimate. It does not imply an H1 energy rate.

Facts & Assumptions

Given: The Axiom of Choice; coordinatewise clamped meshes and quasi-interpolant families with the extension, stability, commutation, section-regularity, and measurability hypotheses of the Statement; the finite tensor-product spline space; numerator g and NURBS denominator W; and map F with Jacobian upper bound j+.

[A1]

The Axiom of Choice is assumed for the one-dimensional Sobolev quasi-interpolation estimate and completed-product Fubini used below; it is not inferred from the weaker Countable Choice branch used by the pullback theorem.

[F1]

Bounded local spline quasi-interpolants: each Qr is linear, local, reproduces all polynomials through degree ℓr, and obeys the common local L2 stability bound with overlap at most Mr.

[A2]

In addition to [F1], the Statement assumes bounded extensions to L2(Ω^) with norm Sr, pairwise commutation, commutation with weak derivatives in other coordinates on the anisotropic class, and the stated section-regularity and measurability.

[F2]

Sobolev approximation by local spline quasi-interpolants under the Axiom of Choice: for a fixed clamped mesh, ∥f−Qrf∥L2≤Arhrℓr+1∥f(ℓr+1)∥L2 with the displayed Ar.

[F3]

Tonelli and Fubini for the completed product, with only almost-everywhere section measurability: nonnegative section integrals over a completed product agree with the iterated integrals. The Euclidean Lebesgue measure is the completion of the product of the factor Lebesgue measures identifies the Euclidean box measure with this completed product.

[F4]

Conforming isogeometric Galerkin spaces and h/p/k refinement defines the analysis space as Sh/W for analysis knots refining the geometry grid; Positive weights give a bounded partition-of-unity NURBS basis gives W≥w−>0.

[F5]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions gives substitution for every nonnegative measurable integrand on each open cell diffeomorphism under Countable Choice. Additivity of the nonnegative Lebesgue integral sums these integrals over the finite partition; the admissible reference and physical cell faces are null. The choice implication AC supplies the countable and dependent choices used in Banach integration supplies Countable Choice under [A1].

Proof

1.1A1A2F1F2F3givenalgebra

For a continuous one-dimensional section f, square the local stability inequalities in [F1] and sum over the disjoint knot cells. Each point belongs to at most Mr neighborhoods, so ∥Qrf∥L2(0,1)2≤Cr2Mr∥f∥L2(0,1)2 and therefore ∥Qrf∥2≤Sr∥f∥2. Apply [F2] to almost every section and integrate the squared estimates over the remaining coordinates by [F3]. This gives ∥(I−Qr)g∥L2(Ω^)≤Arhrℓr+1∥∂rℓr+1g∥L2(Ω^).

2.1A2F1F3step 1.1givenalgebra

By [A2], each coordinate operator is bounded on L2(Ω^) and the coordinate operators commute pairwise. Each Qj reproduces the constant function one by [F1], whose norm on the unit box is one. Its operator bound therefore gives 1=∥Qj1∥2≤Sj, so Sj≥1. Use the finite telescoping identity I−Qd⋯Q1=∑r=1dQd⋯Qr+1(I−Qr), with the product empty for r=d. Step 1.1 and boundedness of the left factors bound its rth summand in L2 by Arhrℓr+1∏j>rSj∥∂rℓr+1g∥2. Since each omitted Sj≥1, this is at most Arhrℓr+1∏j≠rSj∥∂rℓr+1g∥2. Summing proves the displayed tensor-product estimate; the range is the tensor-product spline numerator space by construction.

3.1A1F4F5step 2.1algebra∎

By [F4], Qg/W is a NURBS analysis function. Put z:=(g−Qg)/W, so u−vh=z∘F−1 and ∥z∥2≤w−−1∥g−Qg∥2. For each reference open cell K, [F5] applied to ∣z∘F−1∣2 on F(K) gives ∫F(K)∣z∘F−1∣2 dx=∫K∣z(ξ)∣2JF(ξ) dξ. These compositions are measurable on each cell by the same change-of-variables interface; arbitrary values on the finitely many null faces do not affect their classes. Summing over the cells and using JF≤j+ yields ∥u−vh∥22≤j+∥z∥22≤j+w−−2∥g−Qg∥22. Taking square roots proves the physical bound for arbitrary L2 numerator errors. No gradient estimate is used, so no energy-norm conclusion follows.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Smooth compactly supported data have a degree-one NURBS energy rate

Statement

Assume Countable Choice. Let F:Ω^→D be one admissible NURBS patch, Ω^=(0,1)d, d∈{2,3}, with determinant upper bound j+, derivative and inverse-derivative bound L, and continuous denominator W that is C1 on each knot cell, satisfies W≥w−>0, and has ∥∇W∥L∞≤GW. Let g∈C1(Ω^‾) have Lipschitz gradient with constant Mg and support contained in a nonempty compact set K⋐Ω^, and set u^=g/W and u=u^∘F−1. Let the uniform tensor grid of side h=1/N refine the geometry knot grid, let Sh be its tensor-product degree-one C0 numerator space, and let Vh={(s/W)∘F−1:s∈Sh}∩H01(D) be the corresponding isogeometric trial space. Let Ihg be the tensor Q1 nodal interpolant. If h<dist⁡(K,∂Ω^)/d, then vh=(Ihg/W)∘F−1 belongs to Vh. If u is the weak solution of an exact symmetric scalar elliptic problem with coefficient operator bound β and coercivity bound α as in Exact-geometry isogeometric Poisson Galerkin estimate, and uh its exact-form isogeometric Galerkin solution in Vh, then ∥u−uh∥H01(D),∇≤βα CFCWCd hMg, where CF=j+1+L2, CW=2/w−+GW/w−2, and Cd=d+d+2d−1dd. These constants retain their map, weight, coefficient, and dimension dependence. This proves only the degree-one compact-support branch; it is not a general high-degree, knot-family, or locking-free rate.

Facts & Assumptions

Given: The admissible patch and denominator bounds; the compactly supported C1,1 parameter numerator g; the uniform degree-one tensor grid; and the exact elliptic weak problem described in the Statement.

[A1]

The Axiom of Countable Choice (ACω) is used by the imported Hilbert-space Céa result in [F6]; the local interpolation argument does not require the Axiom of Choice.

[F1]

Tensor Q1 nodal interpolation has a first-order H1 error bound: for the uniform tensor grid and C1,1 numerator, Ihg is in the degree-one tensor spline space and ∥g−Ihg∥H1(Ω^)≤CdhMg.

[F2]

Compactly supported H1 functions lie in H1_0: compactly supported H1 functions in the reference domain belong to H01.

[F3]

Matching NURBS patch traces give global H1 conformity: piecewise C1 fields with square-integrable cell gradients and matching traces belong to H1.

[F4]

NURBS quotient spaces transfer numerator H1 approximation: under Countable Choice, a continuous positive denominator and cellwise C1-up-to-boundary target and comparison with matching traces bound the physical H1 error by CFCW times the numerator H1 error.

[F5]

Bi-Lipschitz NURBS maps preserve H1 and energy norms: the map preserves H01 and gives the stated physical/reference norm factor CF.

[F6]

Exact-geometry isogeometric Poisson Galerkin estimate: for the exact symmetric form with coefficient upper and coercivity constants β and α, the exact-geometry Galerkin error in gradient norm is at most β/α times best approximation.

Proof

1.1F1F2F3F5givenalgebra

If g=0, then s=0, u=vh=0 and the result is immediate. Otherwise use the nonempty support set K from the Statement. Every tensor cell meeting ∂Ω^ has all its vertices outside K: each vertex is within d h of a boundary point. Therefore g is zero at those vertices, and the cellwise Q1 interpolant is identically zero on each such boundary cell. The function s:=Ihg is continuous, has support in the compact dh-neighborhood of K inside Ω^, and is a degree-one tensor spline by [F1]. Both s/W and g/W are piecewise C1, have matching traces because s,g,W are continuous and W≥w−>0, and have square-integrable cell gradients. By [F3] they belong to H1; their supports are compact in the reference box, so [F2] puts them in H01(Ω^). Pullback by [F5] gives vh,u∈H01(D).

1.2A1F1F4givenalgebra

The grid compatibility in the Statement makes s=Ihg an element of the numerator space defining Vh. Apply [F4] with target numerator g=Wu^ and approximating numerator s. The numerator g is C1 on the closed box, s is a continuous cellwise polynomial, and the continuous denominator W is a positive cellwise polynomial. Hence g/W and s/W are C1 up to each common-refinement cell boundary and have matching traces; Countable Choice is [A1], so all hypotheses hold and ∥u−vh∥H1(D)≤CFCW∥g−Ihg∥H1(Ω^)≤CFCWCdhMg, where the final inequality is [F1].

2.1A1F6step 1.2givenalgebra∎

Apply the exact-form Galerkin estimate [F6] and use vh as a candidate in its best-approximation infimum. The gradient error is at most (β/α)∥u−vh∥H1(D); insert step 1.2 to obtain the displayed bound. No quadrature, perturbed geometry, or high-degree approximation rate is used.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Boundary-preserving NURBS projection and matching-patch energy approximation

Statement

Assume Countable Choice and use real-valued scalar Sobolev spaces throughout. Let D⊂Rd, d∈{2,3}, be a nonempty bounded connected Lipschitz domain with a finite face-to-face admissible NURBS patch partition as in Conforming isogeometric Galerkin spaces and h/p/k refinement. Let Vh⊂H01(D;R) be its full finite rational trial space with matching physical traces and homogeneous Dirichlet boundary condition. For any such finite space, including the zero space, there is a real-linear projector Πh:H01(D;R)→Vh specified by ∫D(Πhu vh+∇Πhu⋅∇vh)=∫D(uvh+∇u⋅∇vh)(vh∈Vh). It fixes every vh∈Vh, satisfies Πh2=Πh, preserves the homogeneous boundary condition for every H01 input, and ∥Πhu∥H1(D)≤∥u∥H1(D),∥u−Πhu∥H1(D)≤inf⁡vh∈Vh∥u−vh∥H1(D). This is a global variational projector, defined without point evaluation of H1 inputs.

For the following actual approximation estimate, on patch a let Fa have determinant upper bound j+,a and inverse/forward derivative bound La, and let its fixed continuous positive geometry denominator satisfy Wa≥w−,a>0 and ∥∇Wa∥L∞(cells)≤Ga. Require the analysis knot grids defining Vh to refine the geometry knot grids. Choose the tensor clamped analysis knots defining the local numerator spaces of Vh with degrees pa,r≥1, maximum spans ha,r, and interior multiplicities at most pa,r+1; require their numerator spaces to contain the geometry numerator and denominator after any exact re-representation. Use Ra,Ea,Ba from Greville comparison splines preserve faces and give an explicit H1 estimate for these actual knots.

For each shared face, require its parameter identification to be a permutation and reflections of tangential coordinates, its tangential degrees and knot vectors to agree under that identification, and Wa∣f=cab Wb∣f′∘Tabfor a specified constant cab>0. These are explicit sufficient compatibility data for the approximation branch, checked on finite face representations; a single patch needs none. For u∈H01(D) require ga:=Wa(u∘Fa) to have a C1 representative on the closed reference box with Ma-Lipschitz gradient, to vanish on every exterior face, and to satisfy ga∣f=cabgb∣f′∘Tab on each shared face. These pointwise conditions concern only this smooth approximation class. Define Ca=j+,a1+La2(2w−,a+Gaw−,a2),εh=(∑aCa2Ma2Ba2)1/2. Then the explicitly constructed vh∣Fa((0,1)d)=(Saga/Wa)∘Fa−1 belongs to Vh and ∥u−Πhu∥H1(D)≤∥u−vh∥H1(D)≤εh. For fixed bounded degrees and uniform map/weight/numerator bounds this is an O(max⁡a,rha,r) H1 estimate on arbitrary graded meshes, including simple-knot maximal-continuity families. If degrees vary with refinement, retain the actual Ba; convergence follows whenever the displayed εh tends to zero. This does not assert an optimal hp rate or a degree-independent constant.

Under the exact scalar elliptic data of Exact-geometry isogeometric Poisson Galerkin estimate, its Galerkin solution obeys ∥u−uh∥∇≤(β/α)εh. Componentwise the same construction applies to finite-Lamé elasticity: if Ma,q bounds the gradient Lipschitz constant of component numerator q, replace Ma2 by ∑qMa,q2 in εh2 and obtain ∥u−uh∥∇≤(2μ1+dλ)μ0−1εh under that supplier's full data.

For the single-patch reference-domain problem in Isogeometric geometry and quadrature defects enter through Strang's bound, assume g=Wu satisfies the same C1,1 and zero-boundary conditions above. Apply the construction with the reference-domain projector Πh and put ε^h=(2/w−+G/w−2)MgB. Then its original defects and constants give ∥u−uh∥∇≤(1+MF/αh)ε^h+αh−1(δgeom(Πhu)+δquad(Πhu)+δload). In particular its existing geometry bound gives δgeom(Πhu)≤(dMd+1+2Md+3)∥DF−DG∥∞∥u∥H1; discrete coercivity, load error and quadrature error remain separate hypotheses/terms.

Facts & Assumptions

Given: The precise finite patch geometry, positive denominator bounds, rational trial space and, for approximation, the clamped knots, face compatibility and C1,1 numerators in the Statement.

[A1]

The Axiom of Countable Choice (ACω) is the exact choice hypothesis used by the Hilbert, Céa, pullback, integration, PE19, Strang and null-face suppliers below. The local Greville construction uses only finite sums and the mean-value theorem; no stronger choice principle is assumed.

[F1]

Conforming isogeometric Galerkin spaces and h/p/k refinement gives the finite conforming rational trial space. The Sobolev space H1 is a Hilbert space gives the Hilbert structure of H01(D) in its full H1 norm.

[F2]

Céa quasi-optimality for coercive conforming Galerkin problems gives continuous/discrete solvability and the M/α error bound for every finite conforming subspace of a Hilbert space.

[F3]

Greville comparison splines preserve faces and give an explicit H1 estimate constructs Sa and proves its actual H1 error MaBa, zero-face preservation and compatibility under the specified face identifications.

[F4]

NURBS quotient spaces transfer numerator H1 approximation, under Countable Choice and a continuous positive denominator, gives ∥u−vh∥H1(Da)≤Ca∥ga−sa∥H1((0,1)d) for any specified continuous, cellwise C1 numerator comparison. Its proof also gives the reference quotient bound 2/w−+G/w−2 before mapping.

[F5]

Matching NURBS patch traces give global H1 conformity supplies global H1 membership for matching cell/patch values. Compactly supported H1 functions lie in H1_0 gives H1_0 membership for a compactly supported H1 function on any open set. Specified finite piecewise C1 boundary presentations and Tensor-product NURBS patch maps and rational spline spaces specify the finite cell/facet presentation and the cellwise C1 NURBS maps.

[F6]

The Euclidean Lebesgue measure is the completion of the product of the factor Lebesgue measures identifies the Euclidean measure with the completed product; Tonelli and Fubini for the completed product, with only almost-everywhere section measurability applies to nonnegative measurable functions on the completed product; Dominated convergence applies to measurable functions with an integrable majorant.

[F7]

Exact-geometry isogeometric Poisson Galerkin estimate gives β/α times best gradient approximation under its scalar elliptic data. Finite-Lamé isogeometric elasticity is conforming and quasi-optimal gives (2μ1+dλ)/μ0 under its finite-Lamé displacement data.

[F8]

Isogeometric geometry and quadrature defects enter through Strang's bound supplies its exact reference-domain infimum estimate and the geometry-defect bound in the Statement, under all of its map, load, boundedness and discrete-coercivity hypotheses.

[F11]

The image of a lower-dimensional C1 manifold is null: under Countable Choice, the image in Rd of a C1 map from a lower-dimensional manifold is Lebesgue null.

[F12]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs gives ∣(x,y)H1∣≤∥x∥H1∥y∥H1 for the real H1 inner product.

Proof

1.1A1F1F2F12givenalgebra

On H=H01(D) use its full H1 inner product from [F1] as the coercive form a0, and use the functional v↦(u,v)H1. By [F12], this functional is bounded by ∥u∥H1∥v∥H1; the form a0 has boundedness and coercivity constants both one. Under [A1], [F2] applies; its continuous solution is u itself and its unique discrete solution is precisely the specified Πhu. The M/α=1 estimate proves the asserted best-approximation bound. The variational equations and uniqueness imply real linearity. If u∈Vh, u satisfies the discrete equations, so Πhu=u; this proves both surjectivity onto Vh and idempotence, including the zero-space case. Testing with vh=Πhu and [F12] gives ∥Πhu∥H12≤∥u∥H1∥Πhu∥H1, hence contraction after division when nonzero. All images lie in Vh⊂H01(D).

1.2F1F3F5givenalgebra

Put sa=Saga. By [F3], it belongs to the actual numerator space, is continuous and cellwise polynomial, and vanishes on exterior faces. On a shared face its two traces obey sa=cabsb∘Tab, because [F3] restricts to the identical tangential construction and respects multiplication by cab. Dividing by the stated denominator relation gives equality of the rational traces. Therefore the piecewise physical vh has matching values everywhere and continuous value zero on ∂D; positivity of the denominator and admissibility of the finite maps make it continuous on D‾, cellwise C1, and give square-integrable gradients. By [F5], vh∈H1(D).

1.3A1F5F6F10givenalgebra

We verify the coordinate-line part of the zero-boundary closure without invoking a C1-domain trace theorem on a Lipschitz domain. Let z∈H1(D) be real, continuous on D‾, cellwise C1 on the finite partition, and zero on ∂D. In one open cell, fix a coordinate j and cover the cell by all open rational boxes whose closures lie in the cell; [F10] makes this a countable cover. On any such box, for each fixed choice of the other coordinates the function of xj is differentiable. If z=0 and ∂jz≠0 at xj=t0, the derivative definition gives ∣z(t)−z(t0)∣≥12∣∂jz(t0)∣⋅∣t−t0∣ for all sufficiently close t≠t0, so zero is isolated among the zeros on that line. Fix an injection of rational intervals into N using [F10]; assigning to each such zero the interval with least code that contains it and no other zero gives an injection into a countable family. Therefore every coordinate-line section of Zj:={z=0,∂jz≠0} is null. The set is measurable on the box because z and ∂jz are continuous; Fubini [F6] makes Zj null there.

1.4F3givenalgebra

In the single reference box, write q:=g−Sg. Directly, ∥q/W∥L2≤w−−1∥q∥L2 and ∥∇(q/W)∥L2≤w−−1∥∇q∥L2+Gw−−2∥q∥L2 by the quotient rule and the stated lower and derivative bounds for W. Thus ∥q/W∥H1≤(2/w−+G/w−2)∥q∥H1≤ε^h by [F3]. This is the direct reference-domain quotient bound.

2.1A1F5F10F11step 1.3givenalgebra

Each partition face is contained in the image of an incident reference-cell face under its cell expression. The full cell derivative is nonsingular by admissibility, so its restriction to the (d−1)-dimensional face tangent space has rank d−1; since the rational cell expression extends C1 across that closed face, the face is contained in the image of a C1 map from an open subset of Rd−1. By [F11] each such image, and hence each face, is Lebesgue null. Countably many boxes, finitely many cells, and these null faces show that ∇z=0 almost everywhere on {z=0}.

3.1A1F1F5F6F9step 1.2step 2.1algebraconstruct

Choose a fixed C1 function as follows: let χ(t)=0 for t≤1, χ(t)=3(t−1)2−2(t−1)3 for 1<t<2, and χ(t)=1 for t≥2, and set θ(s)=sχ(∣s∣). Then θ=0 on [−1,1], θ(s)=s for ∣s∣≥2, and ∥θ′∥∞<∞. Put zϵ=ϵθ(z/ϵ). Its cellwise chain rule and matching values give zϵ∈H1(D) by [F5], with gradient θ′(z/ϵ)∇z. Its support lies in Kϵ:={x∈D‾:∣z(x)∣≥ϵ}, which is compact by [F9] and disjoint from ∂D; hence Kϵ⋐D and [F5] gives zϵ∈H01(D). The function error is bounded by Cθϵ for Cθ:=max⁡∣s∣≤2∣θ(s)−s∣, so its L2 norm tends to zero because ∣D∣<∞ by [F9]. The gradient error tends pointwise to zero off {z=0}, is zero almost everywhere on that set by step 2.1, and is bounded in squared magnitude by (1+∥θ′∥∞)2∣∇z∣2∈L1(D). Dominated convergence [F6] proves zϵ→z in H1(D). Since H01(D) is closed by [F1], z∈H01(D). Applying this result to vh from step 1.2 gives vh∈Vh.

4.1A1F3F4F5step 1.1step 1.2step 3.1algebra

Apply [F4] on each patch with numerator target ga and comparison sa, whose required trace and cell regularity were checked in step 1.2. The denominator is continuous by the Statement; its positive cellwise polynomial expression and the closed-box C1 target ga make ga/Wa C1 up to every cell boundary, and [A1] supplies Countable Choice. Then [F3] gives ∥u−vh∥H1(Da)≤CaMaBa. The disjoint patch interiors cover D up to their null faces; the global weak derivatives agree with the local derivatives by [F5]. Sum the squares of these H1 bounds to obtain ∥u−vh∥H1(D)≤εh. Step 1.1 then gives the projector error. Since ha,r≤1, the formula for Ba is of order maximum span for fixed degrees; no neighboring-span ratio was used. Varying-degree convergence follows exactly when the displayed upper bound tends to zero.

5.1F7step 3.1step 4.1algebra

Use vh∈Vh from step 3.1 in the best-gradient infimum of [F7] and bound its gradient error by its H1 error from step 4.1. This yields (β/α)εh for scalar elliptic data. Apply the same scalar construction to each displacement component; summing the component squared errors replaces Ma2 by ∑qMa,q2 and gives a conforming vector comparison. The elasticity branch of [F7] then yields the displayed finite-Lamé bound with its existing factor.

6.1F8step 1.1step 1.2step 1.4step 3.1algebra∎

On the reference box let wh:=Sg/W. The same continuity, quotient and zero-boundary arguments of steps 1.2 and 3.1, with the identity as physical map, put wh in the reference rational space Vh⊂H01(Ω^). Step 1.4 proves ∥u−wh∥H1≤ε^h. Apply step 1.1 to the reference-domain projector: its best-approximation property gives ∥u−Πhu∥H1≤∥u−wh∥H1≤ε^h. In [F8] choose the admissible comparison Πhu instead of taking the infimum; its gradient error is bounded by this H1 error. This proves the displayed Strang estimate without suppressing any defect. Finally [F8] bounds the geometry defect by the existing tensor constant times ∥DF−DG∥∞∥Πhu∥∇, and step 1.1 gives ∥Πhu∥∇≤∥Πhu∥H1≤∥u∥H1. All original hypotheses of [F8] are retained.

5 · Examples, counterexamples and false statements

None yet.

Sources