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

Greville comparison splines preserve faces and give an explicit H1 estimate

Statement

On [0,1]d, d∈{2,3}, choose in coordinate r any finite clamped knot vector Ξr=(ξi(r)) of degree pr≥1, with interior multiplicity at most pr+1. Let hr be its maximum positive span length, Bi(r) its canonical degree-pr basis, and ti(r)=pr−1∑k=1prξi+k(r) its Greville points. For a real-valued g∈C1([0,1]d) with Mg-Lipschitz gradient, define the actual tensor comparison spline Sg(x)=∑i1,…,idg(ti1(1),…,tid(d))∏r=1dBir(r)(xr). Put R=(∑r=1d(pr+1)2hr2)1/2,E=2∑r=1d(2pr+3)2hr2,B=E+d R. Then Sg is a continuous tensor spline, including at fully repeated knots, and ∥g−Sg∥L∞≤MgE,∥∇(g−Sg)∥L∞(cells)≤d MgR. For the Sobolev conclusion assume Countable Choice. Then Sg∈H1((0,1)d) and ∥g−Sg∥H1≤MgB. The finite construction, pointwise cell bounds, continuity and face identities do not use this additional choice assumption. The operator restricts on a coordinate face to the same construction in the tangential coordinates applied to the face data. Thus it preserves zero face data. If two face grids/degrees agree after coordinate permutation and coordinate reflections t↦1−t, their face operators agree under that identification and commute with multiplication of the face data by a constant. No knot-ratio bound is needed. All degree and continuity dependence is retained through the actual knots and the displayed degree factors. This comparison operator need not be idempotent.

Facts & Assumptions

Given: The knots, degrees, positive span maxima, tensor box, C1,1 numerator, and explicit finite formula in the Statement.

[A1]

The Axiom of Countable Choice (ACω) is assumed only for the Sobolev conclusion, through the trace-conformity supplier [F3] and Sobolev convention [F4]. The finite Greville and mean-value calculations do not require it.

[F1]

B-spline spaces and knot conventions supplies the Cox--de Boor recurrence and B-spline basis properties and polynomial reproduction, step 3.1 specialized to k=1, gives the Greville coefficient identity x=∑itiBi(x); step 3.2 of that theorem gives the cell derivative formula. Nonnegativity, support and partition of unity are in its Statement.

[F2]

The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a): a function continuous on a closed interval and differentiable on its interior has an interior point where its derivative equals the endpoint difference quotient.

[F3]

Matching NURBS patch traces give global H1 conformity gives weak H1 membership from piecewise C1 functions with matching values and square-integrable cell gradients, in particular for the finite Cartesian cell partition of the unit box.

[F4]

Integer-order Sobolev spaces and their norms defines the full H1 norm by the L2 norm of the function and its first weak derivatives.

Proof

1.1F1F2givenalgebra

The k=1 polynomial coefficient formula in [F1] is x=∑itiBi(x), while ∑iBi=1, so Srf:=∑if(ti)Bi reproduces every affine function. On a cell (ξm,ξm+1), all active Greville points lie in Jm=[ξm−p,ξm+p+1]∩[0,1], made from at most 2p+1 nonempty adjacent spans. Nonnegativity and partition of unity give ∣Srf(x)∣≤∥f∥L∞(Jm) for x in that cell. For a C1 section f with Mg-Lipschitz derivative, set T(x)=f(c)+f′(c)(x−c) at the left endpoint c of Jm. If y=c, then (f−T)(y)=0; if y≠c, apply [F2] to f−T on the interval with endpoints c,y. At the resulting interior point ζ, ∣(f−T)(y)∣=∣f′(ζ)−f′(c)∣ ∣y−c∣≤Mg∣Jm∣2. At x∈(ξm,ξm+1), nonnegativity and partition of unity give ∣Sr(f−T)(x)∣≤Mg∣Jm∣2. Since SrT=T, ∣f(x)−Srf(x)∣≤2Mg∣Jm∣2≤2(2pr+3)2hr2Mg. Thus each coordinate operator is a sup-norm contraction; the finite operators commute, so the telescoping identity for I−Sd⋯S1, commutation of different-coordinate operators, and contraction of each Sr let us sum these bounds on the original g and prove the function estimate with E.

1.2F1F2givenalgebra

For one coordinate write ci for its coefficient, keeping all other Greville samples fixed. Summation of the derivative formula from [F1] gives, on open cells, (∑iciBi,p)′=∑2≤i≤nξi+p>ξip(ci−ci−1)ξi+p−ξiBi,p−1. Here the nonempty-support lower-degree functions Bi,p−1, 2≤i≤n, form a nonnegative partition on each open cell; the two omitted boundary functions vanish there. Terms with ξi+p=ξi are omitted because their lower-degree splines have empty support, so no undefined 0/0 coefficient is used. Put Δi=ti−ti−1=(ξi+p−ξi)/p. For every included term Δi>0, apply [F2] to the coordinate section of g on [ti−1,ti]: its derivative quotient (ci−ci−1)/Δi equals ∂rg at some point between the two Greville samples, with all other coordinates fixed at their samples. If Δi=0, then ci=ci−1 and the corresponding lower-degree spline has empty support, so its contribution to the derivative is absent. At a cell point x in the support of an included lower-degree factor, both Greville endpoints lie in [ξi,ξi+p], within prhr of xr; the intermediate point lies there as well. In every other active coordinate, the sample and xs lie in a common degree-ps support of length at most (ps+1)hs. Therefore each gradient value in the nonnegative partition sum is evaluated within distance R of x. The Mg-Lipschitz gradient yields ∣∂rSg(x)−∂rg(x)∣≤MgR. Summing squared component bounds proves the gradient estimate.

2.1A1F1F3F4step 1.1step 1.2algebra

At an interior knot of multiplicity at most p, continuity follows from [F1]. At a knot of multiplicity p+1, the left and right pieces are clamped there; the only nonzero endpoint coefficient from each side has Greville point equal to that knot. Their face restrictions are therefore the same tangential sampled sum, so they agree; repeating this argument in each coordinate also gives agreement at intersections of repeated-knot faces. Thus the tensor construction is continuous on the closed box. Its piecewise polynomial gradients are bounded on the finite Cartesian grid, whose rectangular cells form a matching cell partition under the identity map. Under [A1], applying [F3] proves H1 membership and identifies the cell gradients as weak derivatives. The unit box has volume one, so the L2 errors are bounded by the displayed sup bounds. By [F4], ∥g−Sg∥H1=∥g−Sg∥22+∥∇(g−Sg)∥22≤MgE2+dR2≤Mg(E+dR).

3.1F1step 2.1givenalgebra∎

At an exterior endpoint of a clamped vector, only its first, respectively last, basis function has value one; the rest are zero. The corresponding Greville point is that endpoint. Substitution into the tensor formula gives exactly the asserted tangential face formula and zero-face preservation. Reflection reverses the knot list and sends each Greville point to 1−ti. On open knot cells it reverses the indexed basis functions by the Cox–de Boor recurrence in [F1], starting with the interval indicators. At a fully repeated knot the individual right-cell conventions need not commute with reflection, but the constructed sampled sum is continuous by step 2.1, so equality of the reflected sums on open cells extends to every knot and endpoint. Permuting coordinates merely permutes finite product factors. Consequently aligned face formulas agree under all declared identifications. Constant multiplication commutes with their finite linear sums.

Depends on

Used by

Dependency tree · two levels

27 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