✗ Mechanism failed 2026

Cosymplectic Reeb-Hamiltonian Layer

Implementation & benchmark of arXiv:2607.05231 — Hamiltonian group actions in cosymplectic geometry

Usefulness6/10
Difficulty6/10
Novelty6/10

Source paper: Hamiltonian group actions in cosymplectic geometry arXiv:2607.05231 ⓘ · analyzed Aug 30, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Replace an unconstrained latent transition by a layer with a distinguished scalar coordinate \(t\) and a symplectic leaf state \(x=(q,p)\). The layer advances \(t\) through a Reeb drift while updating \(x\) with a symplectic Hamiltonian step, preventing arbitrary mixing between progression and content coordinates and potentially improving long-horizon stability.

Formulas

$$\alpha\wedge\beta^{n}\neq 0,\qquad \iota_R\alpha=1,\qquad \iota_R\beta=0.$$
$$\Omega=\beta+\mathrm{d}\theta\wedge\alpha\quad\text{on }M\times\mathbb{S}^{1}.$$
$$\iota_{X_H}\beta=-\mathrm{d}H+\phi_H\alpha,\qquad \dot q=\nabla_p H(q,p,t),\qquad \dot p=-\nabla_q H(q,p,t).$$
$$\begin{aligned}p_{k+1/2}&=p_k-\frac{h}{2}\nabla_qH(q_k,p_{k+1/2},t_k),\\ q_{k+1}&=q_k+h\nabla_pH(q_k,p_{k+1/2},t_k),\\ p_{k+1}&=p_{k+1/2}-\frac{h}{2}\nabla_qH(q_{k+1},p_{k+1/2},t_k),\\ t_{k+1}&=t_k+h\,v_\psi(q_k,p_k,t_k,u_k).\end{aligned}$$

Mathematical statement

A cosymplectic manifold is a \((2n+1)\)-dimensional space with closed forms \(\alpha\) and \(\beta\) satisfying \(\alpha\wedge\beta^n\neq0\), where \(\alpha\) defines the transverse direction and \(\beta\) is symplectic on its leaves. The Reeb vector field \(R\) is uniquely defined by \(\iota_R\alpha=1\) and \(\iota_R\beta=0\). Use coordinates \(z=(x,t)\), \(x=(q,p)\in\mathbb{R}^{2n}\), \(\alpha=dt\), and \(\beta=\sum_i dq_i\wedge dp_i\). The paper's thickening constructs the symplectic form \(\Omega=\beta+d\theta\wedge\alpha\) on \(M\times\mathbb{S}^1\); computationally this means treating \((x,t)\) as the leaf-plus-transverse state and preserving the canonical symplectic form on \(x\). For a Hamiltonian \(H(x,t)\), the cosymplectic moment condition \(\iota_{X_H}\beta=-dH+\phi_H\alpha\) means that the leaf component obeys \(\iota_{X_H}\beta=-d_xH\), while \(\phi_H=\partial_tH\) is the coefficient of the transverse 1-form. In canonical coordinates this gives \(\dot q=\partial H/\partial p\), \(\dot p=-\partial H/\partial q\), together with an independently chosen Reeb speed \(\dot t=v_H\). The exact geometric guarantees apply when \(H\) and the forms satisfy the stated closure and nondegeneracy assumptions; the neural adaptation should test whether approximate preservation of these structures improves learned dynamics.

Implementation notes

1. Integration point: use this as the transition block in a recurrent state-space model, latent world model, or sequence encoder. Split each hidden vector into \(q,p,t\), with \(q,p\in\mathbb{R}^{d/2}\) and one scalar \(t\); project the original hidden state into this representation once at the input and project back after the transition stack. Let an MLP \(H_\psi(q,p,t,u)\) produce the leaf Hamiltonian, where \(u\) is the current observation, action, or conditioning vector. Let a second small MLP \(v_\psi(q,p,t,u)\) produce Reeb speed, initialized near one for physical time or near a learned positive constant for abstract depth. 2. Pseudocode: compute \(g_q=\nabla_qH_\psi\) and \(g_p=\nabla_pH_\psi\) with automatic differentiation; perform the three implicit/semi-implicit updates in the displayed leapfrog formula, using one fixed-point iteration or two Newton iterations for the half-step \(p_{k+1/2}\); then set \(t_{k+1}=t_k+h\,\mathrm{softplus}(v_\psi)\) if monotonic time is required. Feed \((q_{k+1},p_{k+1},t_{k+1})\) to the next block. Add an optional residual observation update after the geometric transition, but do not let that update alter \(t\). 3. Computed from the mathematics: the canonical leaf split, Hamiltonian gradients, symplectic leapfrog map, and Reeb/transverse separation. Estimated empirically: the Hamiltonian MLP parameters, step size \(h\), the best parameterization of \(v_\psi\), and whether the approximate learned \(\beta\)-preservation survives the observation residual. Monitor the Jacobian determinant of the \((q,p)\) transition and the symplectic error \(\|D\Phi^TJ D\Phi-J\|_F\), where \(J=\begin{bmatrix}0&I\\-I&0\end{bmatrix}\). 4. First experiment: train a small latent ODE/RNN or action-conditioned world model on a synthetic harmonic oscillator and a chaotic double pendulum, comparing an equal-parameter GRU, an unconstrained MLP residual transition, and the proposed layer at equal rollout FLOPs. Evaluate one-step prediction, 100- to 1000-step rollout error, energy drift, and gradient norm stability. The target signal is lower long-horizon error and bounded energy drift at similar one-step accuracy; on a real test, use a small MuJoCo trajectory dataset and compare validation rollout error at horizons 10, 50, and 200.

Verification

Mechanism failed

Stage 1 · Toy mechanism gate: Failed ✗

Stage 2 · Mechanism transferred to benchmark: Not tested

Stage 2 · Practical benchmark result: Not run

Methodology: Toy-system gate first; the benchmark stage runs only after a pass. How verification works

Stage 1 — Mechanism check agent confidence 9/10

Built a PyTorch cosymplectic-inspired Hamiltonian transition with two fixed-point leapfrog half-steps, plus a residual MLP baseline and oscillator rollout experiment. The mathematical sanity check passed: leapfrog had determinant 1, near-zero symplectic error, and bounded energy after 1000 steps, while Euler energy exploded. However, after matched one-step training, the Hamiltonian idea was worse at horizons 10, 50, and 200 and had slightly higher energy drift, so no empirical win was observed.

Agent confidence
9/10
Baseline
RMSE horizons 10/50/200 = 0.0457 / 0.1981 / 0.5996; absolute energy drift at 200 = 0.0627
Idea
RMSE horizons 10/50/200 = 0.1025 / 0.4287 / 0.9005; absolute energy drift at 200 = 0.0672; leapfrog sanity check det=1.0 and symplectic error <= 1.6e-16

Limitations: Only a small synthetic harmonic oscillator was tested; no chaotic double pendulum, observations/actions, learned Reeb coordinate, GRU comparison, FLOP normalization, multiple seeds, or real-world dataset evaluation was performed. The learned Hamiltonian used a small MLP and two fixed-point iterations, so the negative learning result is not a broad proof against the architecture.

How to run: python3 experiment.py

Verdict computed by deterministic test code from paired-seed statistics — not by the language model.

Artifacts

Implementation overview ⬇ Download all as ZIP 3 files · code, reports and structured results