Non-vanishing of multiple correlation sequences

arXiv:2607.13286 2026 Memory 1 ideas extracted · analyzed Aug 30, 2026

What the math gives to ML

The paper provides a constructive counterexample showing that multiple correlation sequences can remain nonzero in a 3-step nilsystem even when every observable is orthogonal to the natural 2-step Conze–Lesigne factor. The transferable mechanism is hierarchical noncommutative memory: information stored in third-order commutator coordinates can disappear under low-order projections while still producing persistent three-time correlations. A neural implementation is a bounded nilpotent recurrent state whose update follows a truncated Baker–Campbell–Hausdorff law and whose coordinates are reduced layer-by-layer to a fundamental domain. This yields a falsifiable test: a 3-step model should retain nonzero lagged triple correlations after its first- and second-layer states are projected away, whereas a 2-step or ordinary linear recurrent baseline should show decay.

Ideas from this paper

Unverified 2026

Third-Order Nilpotent Memory Cell

Replace or augment an RNN or state-space model hidden state with coordinates on a bounded 3-step nilpotent group. The first layer stores ordinary features, the second layer stores pairwise commutator memory, and the third layer stores nested commutators that can preserve three-time dependencies invisible to first- and second-order summaries. Layered reduction keeps the state bounded while retaining the algebraic interaction structure.

Useful6/10
Difficulty7/10
Novelty8/10
Paper: Non-vanishing of multiple correlation sequences arXiv:2607.13286