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.

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.

Depends on

Used by

Dependency tree · two levels

32 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