Linear Relations of Finite Length Modules are Shift Equivalent to Maps
Pith reviewed 2026-05-22 23:48 UTC · model grok-4.3
The pith
Linear relations defined on finite length modules are shift equivalent to bijective mappings.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Linear relations defined as submodules of the direct sum of two modules carry dynamical information and enable subtle invariants. When the modules have finite length, every such relation is shift equivalent to a bijective mapping.
What carries the argument
Shift equivalence applied to linear relations (submodules of module direct sums) on finite-length modules, reducing them to bijective maps.
If this is right
- Dynamical systems modeled by linear relations on finite length modules can be studied instead via bijective maps.
- Invariants originally defined through relations become computable from the equivalent bijective mappings.
- The uncertainty captured by relations is converted into deterministic behavior under shift equivalence.
Where Pith is reading between the lines
- The equivalence may suggest similar reductions for other algebraic objects that model sampled dynamics.
- Computational techniques developed for maps could now be applied directly to finite-length relations.
- Testing the boundary of finite length could reveal where the equivalence breaks and new invariants appear.
Load-bearing premise
The modules under consideration have finite length.
What would settle it
Exhibit a linear relation on an infinite-length module that cannot be shown shift equivalent to any bijective mapping.
Figures
read the original abstract
Linear relations, defined as submodules of the direct sum of two modules, can be viewed as objects that carry dynamical information and reflect the inherent uncertainty of sampled dynamics. These objects also provide an algebraic structure that enables the definition of subtle invariants for dynamical systems. In this paper, we prove that linear relations defined on modules of finite length are shift equivalent to bijective mappings.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript claims to prove that linear relations (defined as submodules of the direct sum of two modules) on modules of finite length are shift equivalent to bijective mappings. These relations are presented as carrying dynamical information and enabling subtle invariants for dynamical systems.
Significance. If correct, the result would establish an equivalence between linear relations on finite-length modules and bijective maps under shift equivalence, potentially simplifying the analysis of their dynamics and invariants. The finite-length hypothesis is explicitly required. However, with no derivations, definitions, or supporting arguments available for examination, the actual significance cannot be assessed.
major comments (1)
- [Abstract] Abstract (final sentence): the central theorem is asserted without any definitions of shift equivalence, linear relations beyond the one-sentence description, or a proof sketch. This prevents verification of whether the finite-length condition suffices for the claimed equivalence.
Simulated Author's Rebuttal
We thank the referee for their review. We address the single major comment below.
read point-by-point responses
-
Referee: [Abstract] Abstract (final sentence): the central theorem is asserted without any definitions of shift equivalence, linear relations beyond the one-sentence description, or a proof sketch. This prevents verification of whether the finite-length condition suffices for the claimed equivalence.
Authors: The abstract is a concise summary of the result. The manuscript defines linear relations as submodules of the direct sum of two modules, introduces shift equivalence in the standard sense for relations, and provides a complete proof that any linear relation on a finite-length module is shift equivalent to a bijective map (using the finite-length hypothesis to guarantee the existence of suitable shifts and inverses). All supporting arguments appear in the body of the paper. revision: no
Circularity Check
No significant circularity; theorem proof is self-contained
full rationale
The paper states a theorem that linear relations on modules of finite length are shift equivalent to bijective mappings, with the finite length condition given explicitly as the setting. No equations, fitted parameters, self-citations, or ansatzes are present in the abstract or described claim that would reduce the result to its inputs by construction. As a pure existence/proof result in algebra, the derivation chain consists of standard mathematical arguments that do not invoke any of the enumerated circularity patterns. The result is presented as proved within the paper rather than presupposed.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
E. Akin, M. Mrozek, M. Przybylski and J. Wiseman, A complete invariant for shift equivalence for Boolean matrices and finite relations, Topology and its Applications, 357 (2024), 109075
work page 2024
- [2]
- [3]
- [4]
-
[5]
C-C. Chen, J. A. Conejero, M. Kosti´ c and M. Murillo-Arcila, Dynamics of multivalued linear operators, Open Mathematics 15 (2017), 1, 948–958
work page 2017
-
[6]
C. Conley, Isolated invariant sets and the Morse index, Regional conference series in mathematics , 38 (1978), AMS
work page 1978
-
[7]
J. Franks and D. Richeson, Shift equivalence and the Conley index, Transac- tions of the American Mathematical Society , 352 (2000), 7, 3305–3322
work page 2000
-
[8]
M. Juda, Unsupervised features learning for sampled vector fields, SIAM Jour- nal on Applied Dynamical Systems , 19 (2020), 4, 2720–2736
work page 2020
-
[9]
T. Kaczynski and M. Mrozek, Conley index for discrete multi-valued dynamical systems, Topology and its Applications, 65 (1995), 1, 83–96
work page 1995
-
[10]
Mac Lane, Homology, Classics in Mathematics , (1995), Springer Berlin, Heidelberg
S. Mac Lane, Homology, Classics in Mathematics , (1995), Springer Berlin, Heidelberg
work page 1995
-
[11]
Moore, Interval analysis, Series in automatic computation , (1966), Prentice-Hall
R.E. Moore, Interval analysis, Series in automatic computation , (1966), Prentice-Hall
work page 1966
-
[12]
M. Mrozek, Leray functor and cohomological Conley index for discrete dynam- ical systems, Transactions of the American Mathematical Society , 318 (1990), 1, 149–178
work page 1990
-
[13]
A. Szymczak, The Conley index for discrete semidynamical systems, Topology and its Applications , 66 (1995), 3, 215–240
work page 1995
-
[14]
M. Mrozek, Construction and properties of the Conley index, Banach Center Publications, 47 (1999), 1, 29–40
work page 1999
-
[15]
M. Przybylski, M. Mrozek and J. Wiseman, The Szymczak Functor and Shift Equivalence on the Category of Finite Sets and Finite Relations, Journal of Dynamics and Differential Equations , 37 (2025), 1835–1870
work page 2025
-
[16]
J. W. Robbin and D. Salamon, Dynamical systems, shape theory and the Conley index, Ergodic Theory & Dynamical Systems , 8 (1988), 375–393
work page 1988
-
[17]
L. Vietoris, ¨Uber den h¨ oheren Zusammenhang kompakter R¨ aume und eine Klasse von zusammenhangstreuen Abbildungen, Mathematische Annalen , 97 (1927), 1, 454–472. 20
work page 1927
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.