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.

Homogeneous knot insertion preserves an admissible NURBS patch

Statement

Let F be the tensor-product NURBS patch of Tensor-product NURBS patch maps and rational spline spaces. Insert a knot u that is new and strictly inside a nonempty span in one coordinate direction. Apply Single new-knot insertion for a B-spline curve to every control-net slice in that direction, using homogeneous controls (wαPα,wα)∈Rd+1. Then the updated homogeneous tensor spline is pointwise unchanged, every updated weight is positive, and the rational patch map remains exactly F on Ω^‾.

Facts & Assumptions

Given: A finite tensor-product knot grid, the positive weights and control points of a NURBS patch, and a new knot strictly inside a nonempty span in one coordinate direction.

[F1]

Single new-knot insertion for a B-spline curve copies controls outside the active range and replaces active controls by αiPi+(1−αi)Pi−1, with 0<αi<1 for a strictly interior new knot.

[F2]

Single new-knot insertion preserves the B-spline curve: for every vector-valued B-spline curve, the algorithm's refined control net represents the same curve at every parameter value, including knot endpoints.

[F3]

Tensor-product NURBS patch maps and rational spline spaces defines F as the first d components of the homogeneous tensor spline divided by its last component.

[F4]

Positive weights give a bounded partition-of-unity NURBS basis: the denominator is at least w−>0 whenever all weights are positive.

Proof

1.1F1F2F3algebra

Write the homogeneous control array as P~α=(wαPα,wα). The tensor spline F~(ξ)=∑α∈IP~αNα(ξ) has first d components W(ξ)F(ξ) and last component W(ξ) by [F3]. Fix the coordinate direction in which u is inserted and fix a multi-index of all other coordinates. Grouping the finite sum over the remaining index writes the corresponding slice as a B-spline curve with controls in Rd+1. By [F2], knot insertion leaves that slice unchanged for every value of the insertion coordinate. Multiplication by the fixed transverse tensor basis function and summation over all transverse indices show that the entire updated homogeneous spline F~′ equals F~ pointwise.

2.1F1F3F4step 1.1algebra∎

In the active range, each updated last coordinate is αiwi+(1−αi)wi−1 by [F1]; it is positive because both old weights are positive and 0<αi<1. Copied weights are positive as well. Thus all updated weights are positive and [F4] gives W′(ξ)>0 on the closed patch. Since F~′=F~, their first d components and last components agree, and division by this positive common last component gives F′(ξ)=F(ξ) for every ξ∈Ω^‾.

Depends on

Used by

Dependency tree · two levels

8 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