SearcharxivSearch

arXiv · 1309.6664

Historical account and ultra-simple proofs of Descartes's rule of signs, De Gua, Fourier, and Budan's rule

Abstract

It may seem a funny notion to write about theorems as old and rehashed as Descartes's rule of signs, De Gua's rule or Budan's. Admittedly, these theorems were proved numerous times over the centuries. However, despite the popularity of these results, it seems that no thorough and up-to-date historical account of their proofs has ever been given, nor has an effort been made to reformulate the oldest demonstrations in modern terms. The motivation of this paper is to put these strongly related theorems back in their historical perspective. More importantly, we suggest a way to understand Descartes's original statement, which yet remains somewhat of an enigma. We found that this question is related to a certain way of counting the alternations and permanences of signs of the polynomial coefficients, and may have been the convention used by Descartes. Remarkably, this convention not only provides a ultra-simple proof of Descartes's rule, but it can also be used to simplify the proofs of the titular theorems. Without claiming to be exhaustive, we shall present in this paper an historical account of these theorems and their proofs, and clarify their mutual relation. We will explain how a suitable convention can help understand the original statement of Descartes and greatly simplify its proof, as well as the proofs of the above-mentioned theorems. With the exception of the proof of Fourier's theorem and its generalizations, which run on rudiments of infinitesimal calculus (Taylor's theorem), the proposed demonstrations are so short and elementary they could be taught at the undergraduate level.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Bensimhoun. 2013-09-24. Historical account and ultra-simple proofs of Descartes's rule of signs, De Gua, Fourier, and Budan's rule. https://arxiv.org/abs/1309.6664

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO