Skip to main content
Log in

Conserved quantities in discrete dynamics: what can be recovered from Noether’s theorem, how, and why?

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

The connections between symmetries and conserved quantities of a dynamical system brought to light by Noether’s theorem depend in an essential way on the symplectic nature of the underlying kinematics. In the discrete dynamics realm, a rather suggestive analogy for this structure is offered by second-order cellular automata. We ask to what extent the latter systems may enjoy properties analogous to those conferred, for continuous systems, by Noether’s theorem. For definiteness, as a second-order cellular automaton we use the Ising spin model with both ferromagnetic and antiferromagnetic bonds. We show that—and why—energy not only acts as a generator of the dynamics for this family of systems, but is also conserved when the dynamics is time-invariant. We then begin to explore the issue of whether, in these systems, it may hold as well that translation invariance entails momentum conservation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. The Ising model was invented by the physicist Wilhelm Lenz (1920) who gave it as a problem to his student Ernst Ising, after whom it is named. In his 1925 PhD thesis, Ising “solved” the model in one dimension, showing that it does not exhibit phase changes. On the basis of this result, he incorrectly concluded that this model would not exhibit phase transitions in any dimension. It turns out that the dynamics of the two-dimensional Ising model is much harder to fully solve that that of the 1D system. A complete analytic description (if only for just the case of zero external magnetic field) was given much later by Lars Onsager, in 1944.

  2. A definition like the above will be recognized by any theoretical physicist, and yet is missing from not only virtually all college textbooks, but also respected concept-oriented works such as Landau and Lifshitz (1976), Lanczos (1986), Arnold (2010), or Goldstein et al. (2001). After all, physicists are supposed to know what energy is, and they don’t need—perhaps have good reasons not to want—a final definition (cf. the Feynman parable mentioned in Sect. 2). Most treatments proceed by giving examples of energy in increasingly elaborate contexts, and then bringing one’s attention to increasingly more abstract properties of energy. Definitions—hardly ever.

  3. Using the odd grid will yield a different partition, but with the same sum.

  4. For example, in all dynamics subject to the Lagrangian kinematics, to each generalized coordinate q i of the system there must be associated a generalized velocity \({\dot q}_i\) (so that the number of state variables is always even), and the dynamics must be such that the time-derivative of the former equals the latter.

  5. A further generalization of that is used, for example, in the modeling of spin glasses.

  6. Where we used just a 4×4 torus—a size just large enough to rule out spurious degeneracies.

  7. The proof is simple. Any spin that is part of the guard wall is surrounded by at least three like neighbors, and thus never flips—with one exception. A spin at one of the very outer corners of such a wall is exposed to two neighbors outside of the wall, and will flip if these are both “up.” A breach of a “corner tower” may then propagate to the rest of the wall.

References

  • Arnold V (2010) Mathematical methods of classical mechanics, 2nd edn, corr. 4th printing. Springer, Heidelberg

  • Bach T (2007) Methodology and implementation of a software architecture for cellular and lattice-gas automata programming. PhD thesis, Boston University. Also in http://www.ioc.ee/~silvio/nrg/

  • Bennett CH, Margolus N, Toffoli T (1988) Bond-energy variables for Ising spin-glass dynamics. Phys Rev B 37:2254

    Article  Google Scholar 

  • Boykett T, Kari J, Taati S (2008) Conservation laws in rectangular CA. J Cell Automata 3:115–122

    MathSciNet  MATH  Google Scholar 

  • Complements to this paper (2012) http://www.ioc.ee/~silvio/nrg/

  • Creutz M (1983) Microcanonical Monte Carlo simulation. Phys Rev Lett 50:1411–1414

    Article  MathSciNet  Google Scholar 

  • Doolen G et al (eds) (1988) Lattice gas methods for partial differential equations. Addison–Wesley, Boston

    Google Scholar 

  • Feynman R, Leighton R, Sands M (1963) Conservation of energy. The Feynman Lectures on Physics, vol 1, Sections 4-1–4-8. Addison–Wesley, Boston (“Feynman’s blocks”) can be read in their entirety in http://www.ioc.ee/~silvio/nrg/

  • Gibbs J (1902) elementary principles in statistical mechanics. Developed with especial reference to the rational foundation of thermodynamics. Scribners, London

  • Goldstein H, Poole C, Safko J (2001) Classical mechanics, 3rd edn. Addison–Wesley, Boston

    Google Scholar 

  • Grant B (2011) News in a nutshell. The Scientist, 31 March

  • Hardy J, de Pazzis O, Pomeau Y (1976) Molecular dynamics of a classical lattice gas: transport properties and time correlation functions. Phys Rev A13:1949–1960

    Article  Google Scholar 

  • Kari J (1996) Representation of reversible cellular automata with block permutations. Math Syst Theory 29:47–61

    MathSciNet  MATH  Google Scholar 

  • Kari J (2005) Theory of cellular automata: a survey. Theor Comput Sci 334:3–33

    Article  MathSciNet  MATH  Google Scholar 

  • Lanczos C (1986) The variational principles of mechanics, 4th edn. Dover, New York

  • Landau L, Lifshitz E (1976) Mechanics, 3rd edn. Oxford: Pergamon.

  • Lind D, Marcus B (1995) An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge

  • Lind D (2004) Multi-dimensional symbolic dynamics. Symbolic dynamics and its applications. American Mathematical Society, Providence, pp 61–79; also in Proceedings of Symposium of Applied Mathematics, 60

  • Mackey G (1963) Mathematical foundations of quantum mechanics. Benjamin, New York

  • Margolus N, Toffoli T, Vichniac G (1986) Cellular-automata supercomputers for fluid dynamics modeling. Phys Rev Lett 56:1694–1696

    Article  Google Scholar 

  • Noether E (1918) Invariante Variationsprobleme. Nachr. D. König. Gesellsch. D. Wiss. Zu Göttingen, Math-phys. Klasse 235–257 (English translation at arxiv.org/abs/physics/0503066v1)

  • Pomeau Y (1984) Invariant in cellular automata. J Phys A 17:L415–L418

    Article  MathSciNet  Google Scholar 

  • Toffoli T (1984) Cellular automata as an alternative to (rather than an approximation of) differential equations in modeling physics. Physica D 10:117–127

    Article  MathSciNet  Google Scholar 

  • Toffoli T (1999) Action, or the fungibility of computation. In Hey A (ed) Feynman and computation. Perseus, Reading, pp 349–392

    Google Scholar 

  • Toffoli T, Capobianco S, Mentrasti P (2004) A new inversion scheme, or how to turn second-order cellular automata into lattice gases. Theor Comput Sci 325:329–344

    Article  MathSciNet  MATH  Google Scholar 

  • Tyagi A (1994) A principle of least computational action. In: Workshop on physics and computation. IEEE Computer Society Press, Los Alamitos, pp 262–266

  • Vichniac G (1984) Simulating physics with cellular automata. Physica D 10:96–115

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This research was supported by the European Regional Development Fund (ERDF) through the Estonian Center of Excellence in Computer Science (EXCS), by the Estonian Science Foundation under grant no. 7520, and by the Estonian Ministry of Education and Research target-financed research theme no. 0140007s12.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Silvio Capobianco.

Appendix: Continuity and all that

Appendix: Continuity and all that

“Continuity” has two quite distinct meanings in mathematics. A continuum is a set, such as the real line or the complex plane, that is uncountable but “only mildly so,” namely, one whose cardinality equals that of the set \({2^{\mathbb{Z}}}\) (where \({{\mathbb{Z}}}\) denotes the integers—the countable set par excellence). In common parlance, a continuous variable (or parameter) means “one taking values in a continuum.”

On the other hand, a continuous function is one for which “the counterimage of every open set is an open set.” This kind of continuity is the foundation stone of general topology, and is moreover a categorical aspect of cellular automata, as explained below.

Without further qualifications, a dynamics is discrete if it is the iteration of a transformation—intuitively, a game where an onlooker can ask “How many moves have you made yet?” and get an answer “t moves,” with \(t=0,1,2,3,\ldots\). If instead the time parameter t runs along a one-dimensional continuum—and thus is a “continuous variable” in the above sense—one may be allowed, at least informally, to speak of a “continuous” dynamics. But when the dynamics is thought of as a function f t that maps a state q 0 to a new state q t (where t is the parameter of a one-parameter group—which may be continuous or discrete) this function need not, in general, be continuous in the topological sense. To avoid confusion, to just make the point that t is meant to be a continuous (rather than discrete) parameter, one should preferably speak of a continuum dynamics.

A cellular automaton is a discrete dynamics, in the sense that time ranges over a discrete set—the integers—rather than a continuum—the reals. But the discreteness of cellular automaton in not limited to the parameter t. The local state (the state of a site) ranges over a finite alphabet, and thus is a discrete variable (with, without loss of generality, the discrete topology). The local map of a cellular automaton makes use of information brought in to a site from a finite number of locations, and is thus a finite table; however, these finite neighborhoods overlap, and thus generate by iteration an infinite, though discrete, mesh. By raising the finite state-alphabet to the countable cardinality of this mesh, the global state set (the set of all possible states for the entire mesh) is a continuum; incidentally, this continuum is compact with respect to its natural topology—which is by construction the product topology of the single-site topologies.

Finally, and most importantly, a characterizing property of cellular automata is that, in spite of their pervasive discreteness, their dynamics—a mapping of that continuum into itself—is a continuous function on a metric space.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Capobianco, S., Toffoli, T. Conserved quantities in discrete dynamics: what can be recovered from Noether’s theorem, how, and why?. Nat Comput 11, 565–577 (2012). https://doi.org/10.1007/s11047-012-9336-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-012-9336-7

Keywords

Navigation