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

Derivative geometry error controls the Laplace tensor defect

Statement

Let Φ,Φh be the orientation-preserving maps of Curved-domain geometry approximation errors, with J,Jh≥j∗>0 and ∥DΦ∥∞+∥DΦh∥∞≤M. Set B=JDΦ−1DΦ−T and Bh=JhDΦh−1DΦh−T. Then ∥B−Bh∥∞≤Ce1, where C depends only on d,j∗,M. Consequently ∣∫Ω^∇vT(B−Bh)∇w∣≤Ce1∥∇v∥2∥∇w∥2 for v,w∈H1(Ω^).

Facts & Assumptions

Given: Two orientation-preserving C1 diffeomorphisms with the stated determinant lower bounds and uniform derivative upper bounds.

[F1]

Curved-domain geometry approximation errors: e1=∥DΦ−DΦh∥∞ and J,Jh are the positive determinants.

[F2]

Pullback gradients and induced surface metrics: the pulled-back Laplace tensor is JDΦ−1DΦ−T.

[F3]

Holder's inequality for integrals, including the endpoint cases: integral Cauchy–Schwarz bounds the product of the two gradient magnitudes.

Proof

1.1F1givenalgebra

On the bounded matrix set ∥A∥,∥C∥≤M, the determinant is a polynomial in the entries, so its derivative is bounded on that set and ∣det⁡A−det⁡C∣≤CdMd−1∥A−C∥. Apply this with A=DΦ and C=DΦh to obtain ∣J−Jh∣≤Ce1.

2.1F1F2step 1.1algebra

The inverse identity A−1−C−1=A−1(C−A)C−1 and J,Jh≥j∗ show ∥DΦ−1−DΦh−1∥≤C(d,M,j∗)e1; indeed every singular value is at most M and their product is at least j∗, so the smallest is at least j∗/Md−1 and each inverse norm is at most Md−1/j∗. Expanding JA−1A−T−JhC−1C−T into the determinant difference and the two inverse-factor differences gives ∥B−Bh∥∞≤Ce1.

3.1F3step 2.1given∎

Pointwise, ∣∇vT(B−Bh)∇w∣≤Ce1∣∇v∣∣∇w∣. Integrating and applying [F3] proves the stated bilinear-form defect bound; the right side is finite because both gradients are in L2.

Depends on

Used by

Dependency tree · two levels

17 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