Search arXivSearch

arXiv · 1908.00972

Visualization of Abel's Impossibility Theorem

Abstract

In this paper we construct a visualization of the Abel's Impossibility Theorem also known as the Abel-Ruffini Theorem. Using the canvas object in JavaScript along with the p5.js library, and given any expression that uses analytic functions and radicals one can always construct closed paths such that the expression evaluated at the coefficients of a general polynomial returns to it's initial position, while the roots of the polynomial undergo a non-trivial permutation. Hence, such expression does not reconstruct the roots from the coefficients. Using the visualization we begin by considering the necessity of radicals to solve second degree polynomial equations and build towards degree five polynomial equations. In eventuality our program shows that there is no formula for an arbitrary fifth degree polynomial equation that uses analytic functions, finite field operations, and radicals that reconstructs the roots of the polynomial from it's coefficients. This theorem was partially completed by Paolo Ruffini in 1799 and completed by Niels Abel in 1824.

Explore related subjects

Keep this discovery

BibTeXRIS

J. Morales, V. Kalicki, R. Ostrander. 2019-08-01. Visualization of Abel's Impossibility Theorem. https://arxiv.org/abs/1908.00972

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