Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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.

Depends on

Used by

Dependency tree · two levels

31 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