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

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.

Depends on

Used by

Dependency tree · two levels

66 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources