Positive transfers, exact endpoints and recovered free kernels

An elementary transfer adds a positive multiple of the upper vertex coordinate to the lower one. It preserves coordinatewise inequalities, and its distinct endpoints make the update injective. The one-edge Hilbert comparison bounds an actual state change by this transfer when the required image inclusion has been established.

Freeness of the upper selected kernel at every chronological suffix supplies the required inclusions through the global edge theorem. Iteration along the chronological list gives a comparison between the final state and the exact transfer product applied to the initial state. A discrepancy at one step contributes a nonnegative deficit. The transfer retains existing deficits and adds nonnegative contributions, so exact equality of the final endpoints forces equality at every intermediate step.

The positive defect theorem converts each numerical equality into equality of embedded images. Reversing the schedule then presents a new kernel alongside a known free kernel over the same image. The resulting splitting gives projectivity, and the graded projective-to-free theorem gives a homogeneous free basis. This is the mechanism that recovers the suffix freeness used by the simultaneous induction.

Reading sequence

  1. Elementary edge transfers and ordered products — Define the elementary update.
  2. Order preservation, injectivity and composition of transfers — Prove monotonicity and injectivity.
  3. Remaining conditions and the Hilbert-state vector — Specify the actual state at a remaining list.
  4. From one-edge bounds to the full transfer inequality — Iterate the conditional bound.
  5. The complete schedule comparison under upper-kernel freeness — Supply image inclusions from the exact upper suffix kernels.
  6. Endpoint equality forces equality at every transfer step — Use exact endpoints to remove step deficits.
  7. Recovering a projective kernel from scaled image equality — Construct the kernel splitting from image equality.
  8. Recovering terminal-kernel freeness by reverse traversal — Recover freeness through the reverse traversal.

Entries for this keyword