Orbit-spline interpolation and flabbiness of the models

The interpolation argument builds sections with a controlled value at one supported vertex. Orbit splines arise by evaluating suitable linear data along the dihedral action. Their edge congruences make them sections, and their factors identify the supported outgoing label product at the chosen vertex.

A flow-down section has that product as its prescribed value and vanishes outside the lower ideal of the chosen vertex. To extend a compatible assignment, first match the higher prescribed values. The remaining error at the next vertex is divisible by every supported outgoing label. Pairwise relative primality combines these divisibilities into divisibility by their product.

A multiple of the flow-down section corrects the error while leaving the already matched higher values unchanged. Induction over the finite prescribed set proves flabbiness. This supplies one of the substantive hypotheses of local model decomposition, which later reduces the edge-image comparison to products and counts.

Reading sequence

  1. Orbit splines in the extended realization — Define the orbit-spline construction.
  2. The reflection congruence of an orbit spline — Verify the edge equations.
  3. Orbit-spline factors with prescribed zeros — Identify the relevant label factors.
  4. Flow-down sections and outgoing label products — Specify a section with controlled support.
  5. Polynomial interpolation on external dihedral vertices — Build the required sections.
  6. Prime induced labels and relative primality at a vertex — Supply the relative-primality input.
  7. Flow-down sections imply flabbiness — Extend compatible assignments by correction.

Entries for this keyword