Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

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.

Depends on

Used by

Dependency tree · two levels

61 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