Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Single new-knot insertion for a B-spline curve

Definition

Use the zero-based reindexing ti=ξi+1 of the clamped knot vector in B-spline spaces and knot conventions, so t0≤⋯≤tn+p with n≥p+1. Let p∈N0, d∈N, and let the controls be P0,…,Pn−1∈Rd. Let k be a nonempty span index with tk<u<tk+1, where u is not already a knot. Insert u between tk and tk+1 to obtain t′. The output controls Q0,…,Qn are defined by

Qi={Pi,0≤i≤k−p,αiPi+(1−αi)Pi−1,k−p+1≤i≤k,Pi−1,k+1≤i≤n,αi=u−titi+p−ti.

The middle range is empty when p=0. The curve uses the same degree and the B-spline basis for the new knot vector. Each denominator in the middle range is positive and each αi lies in [0,1], so the update is an exact affine blend. This procedure inserts one knot that is new to the vector; repeated insertion at an existing knot is not part of this algorithm's input contract.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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