Centralizer-Constrained Hyperbolic Dynamics
Implementation & benchmark of arXiv:2607.05023 — Rigidity on compact surfaces through hyperbolic symmetries
Source paper: Rigidity on compact surfaces through hyperbolic symmetries arXiv:2607.05023 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
For data with known hyperbolic or Möbius symmetries, constrain learned infinitesimal transformations to commute with the symmetry group generators. This produces a neural ODE, recurrent update, or hyperbolic embedding layer whose dynamics cannot arbitrarily break quotient-space symmetries, potentially improving extrapolation across symmetry-related examples.
Formulas
Mathematical statement
The paper identifies trivial infinitesimal motions with the centralizer Lie algebra \(\mathcal T_\Gamma=\{A\in\mathfrak{sl}(2,\mathbb R):Ag=gA\ \text{for all }g\in\Gamma\}\), where \(\mathfrak{sl}(2,\mathbb R)=\{A\in\mathbb R^{2\times2}:\operatorname{tr}(A)=0\}\), \(\Gamma\subset\operatorname{PSL}(2,\mathbb R)\) is the symmetry group, and \(g\) is represented by a determinant-one \(2\times2\) matrix modulo sign. The paper uses the adjoint action \(\operatorname{Ad}(g)(A)=gAg^{-1}\); for diagonal \(g=\operatorname{diag}(\lambda_1,\lambda_2)\), the displayed eigenvectors of \(\operatorname{Ad}(g)\) have eigenvalues \(1,\lambda_1\lambda_2^{-1},\lambda_2\lambda_1^{-1}\). The implementation uses either exact nullspace projection onto the commutant or a soft penalty \(\sum_i\|Ag_i-g_iA\|_F^2\), with \(g_i\) a finite generating set for \(\Gamma\). The mathematical asset is a low-dimensional invariant parameter space and exact symmetry preservation under exponentiation.
Implementation notes
Integrate this into a hyperbolic embedding model or recurrent/neural-ODE block operating on 2D tangent coordinates. (1) Store known symmetry generators \(g_1,\ldots,g_r\in\operatorname{PSL}(2,\mathbb R)\) as determinant-one matrices, and let the trainable infinitesimal update be \(A=\begin{bmatrix}a&b\\c&-a\end{bmatrix}\), which automatically lies in \(\mathfrak{sl}(2,\mathbb R)\). Use \(h_{t+1}=\exp(\Delta tA)h_t\) in tangent coordinates, or apply \(\exp(\Delta tA)\) as a Möbius transformation to an upper-half-plane embedding. (2) Start with the soft version by adding \(\rho\sum_i\|Ag_i-g_iA\|_F^2\) to the task loss. Then implement the exact version: vectorize \((a,b,c)\), construct the linear equations \(Ag_i-g_iA=0\), compute their SVD nullspace once, and parameterize \(A=N\theta\), where columns of \(N\) span the nullspace. (3) Track the spectral radius of \(\exp(\Delta tA)\), hidden-state norm growth, and equivariance error \(\|F(gx)-gF(x)\|\). If generators are unknown, estimate them from paired augmented examples and compare learned commutator residuals with the soft penalty. (4) Test on a toy classification or sequence task generated from upper-half-plane points, using random \(\operatorname{PSL}(2,\mathbb R)\) transformations as nuisance symmetries. Compare an unconstrained MLP or ODE, ordinary augmentation, soft centralizer regularization, and exact nullspace parameterization. Success is lower symmetry-held-out error and bounded hidden-state norms at equal parameter count, with reduced equivariance error and no loss of in-distribution accuracy.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.