In the history of mathematics, the principle of permanence, or law of the permanence of equivalent forms, was the idea that algebraic operations like addition and multiplication should behave consistently in every number system, especially when developing extensions to established number systems.[1][2]
Before the advent of modern mathematics and its emphasis on the axiomatic method, the principle of permanence was considered an important tool in mathematical arguments. In modern mathematics, arguments have instead been supplanted by rigorous proofs built upon axioms, and the principle is instead used as a heuristic for discovering new algebraic structures.[3] Additionally, the principle has been formalized into a class of theorems called transfer principles,[3] which state that all statements of some language that are true for some structure are true for another structure.
History
editThe principle was described by George Peacock in his book A Treatise of Algebra (emphasis in original):[4]
132. Let us again recur to this principle or law of the permanence of equivalent forms, and consider it when stated in the form of a direct and converse proportion.
"Whatever form is Algebraically equivalent to another, when expressed in general symbols, must be true, whatever those symbols denote."
Conversely, if we discover an equivalent form in Arithmetical Algebra or any other subordinate science, when the symbols are general in form though specific in their nature, the same must be an equivalent form, when the symbols are general in their nature as well as in their form.
The principle was later revised by Hermann Hankel[5][6] and adopted by Giuseppe Peano, Ernst Mach, Hermann Schubert, Alfred Pringsheim, and others.[7]
Around the same time period as A Treatise of Algebra, Augustin-Louis Cauchy published Cours d'Analyse, which used the term "generality of algebra"[8][page needed] to describe (and criticize) a method of argument used by 18th century mathematicians like Euler and Lagrange that was similar to the Principle of Permanence.
Applications
editOne of the main uses of the principle of permanence is to show that a functional equation that holds for the real numbers also holds for the complex numbers.[9]
As an example, the equation hold for all real numbers s, t. By the principle of permanence for functions of two variables, this suggests that it holds for all complex numbers as well.[10]
For a counter example, consider the following properties
- commutativity of addition: for all ,
- left-cancellative property of addition: if , then , for all .
Both properties hold for all natural, integer, rational, real, and complex numbers. However, when following Georg Cantor's extensions of the natural numbers beyond infinity, neither satisfies both properties simultaneously.
- In ordinal arithmetic, addition is left-cancellative, but no longer commutative. For example, .
- In cardinal arithmetic, addition is commutative, but no longer left-cancellative, since whenever or is infinite. For example, , but .[11]
Hence both of these, the early rigorous infinite number systems, violate the principle of permanence.
References
edit- ^ Wolfram, Stephen. "Chapter 12, Section 9, Footnote: Generalization in mathematics". A New Kind of Science. p. 1168.
- ^ Toader, Iulian D. (2021), "Permanence as a principle of practice", Historia Mathematica, 54: 77–94, arXiv:2408.08547, doi:10.1016/j.hm.2020.08.001
- ^ a b "Principle of Permanence". History of Science and Mathematics Stack Exchange.
- ^ A Treatise on Algebra (J. & J. J. Deighton, 1830). — A Treatise on Algebra (2nd ed., Scripta Mathematica): Vol.1 Arithmetical Algebra (1842), Vol.2 On Symbolical Algebra and its Applications to the Geometry of Position (1845). Quote from 1830 ed., p. 104.
- ^ Wolfram, Stephen. "Chapter 12, Section 9, Footnote: Generalization in mathematics". A New Kind of Science. p. 1168.
- ^ "Hankel, Hermann | Encyclopedia.com". www.encyclopedia.com.
- ^ Toader, Iulian D. (2021), "Permanence as a principle of practice", Historia Mathematica, 54: 77–94, arXiv:2408.08547, doi:10.1016/j.hm.2020.08.001
- ^ Cauchy, Augustin-Louis (1821). "Analyse Algébrique". Cours d'Analyse de l'Ecole royale polytechnique. Vol. 1. L'Imprimerie Royale, Debure frères, Libraires du Roi et de la Bibliothèque du Roi. Retrieved 2015-11-07. * Free version at archive.org
- ^ Dauben, Joseph W. (1979), Georg Cantor: his mathematics and philosophy of the infinite, Boston: Harvard University Press, ISBN 978-0-691-02447-9.
- ^ Gamelin, T. Complex Analysis, UTM Series, Springer-Verlag, 2001c
- ^ The smallest infinite number is denoted by and in ordinal and cardinal arithmetic, respectively.
 | This article about the history of mathematics is a stub. You can help Wikipedia by expanding it. |