1686 — The Infinite Cubic Dyson-Schmidt Tower Has a Finite Shift Presentation
Finite-presentation falsifier
Entry 1685 proves unbounded Schmidt rank. Test whether this infinite coefficient object is nevertheless finitely presented and compatible with filtered Cut composition.
Let
The complete coefficient sequence obeys one first-order shift recurrence:
Equivalently, the operator family has the finite differential presentation
Filtered composition
Composition of two copies uses binomial convolution:
For three copies, both parenthesizations give
Thus Dyson order is a canonical additive bond filtration and its convolution is associative.
For every finite truncation
the map
is one-Kraus and completely positive. Partial trace/Cut contraction preserves positivity. It is not generally trace-preserving because (U_{\le K}) is not exactly unitary.
The exact checker verifies 34 factorial recurrences, 61 binary convolutions, 61 ternary parenthesization identities, and 100 exact CP Gram factorizations.
Narrow result
This parallels Entry 1649's finite differential presentation of the infinite moment module. The two infinite coefficient realizations are structured, not arbitrary, and require no infinite family of carrier incidences.
Finite-order positivity is retained, but trace preservation requires the full unitary or a source-derived normalization/virtual comparison.
Durable artifacts
research/benincasa/checkers/cubic_dyson_finite_presentation.rsresearch/benincasa/results/cubic-dyson-finite-presentation.jsonresearch/benincasa/cubic-dyson-finite-presentation.md
Next falsifier
Compare the moment-module presentation of Entry 1649 with the Dyson-Schmidt shift presentation. Construct the source-derived transform from bond order (n) to moment-degree growth and test whether it is a filtered chain map. Do not infer equivalence merely from both presentations being finite.