The Algorithmic Foundations of Galois’s Theory

Harold M. Edwards

Chapter Chapter 7 in Essays in Constructive Mathematics, 2022, pp 213-242 from Springer

Abstract: Abstract This chapter is devoted to a full exposition of Galois theory, which here means the theory Galois himself explained in his memoir on the conditions for the solvability of equations by radicals, often called his First Memoir. A careful reading of the First Memoir shows that Galois himself thought very algorithmically and sought to approach the problem of solving algebraic equations in a thoroughly constructive way. Early essays in the chapter describe his construction of a splitting field of the polynomial whose roots are to be found, with explicit examples in the cubic case. Later essays show how Galois’s results can be interpreted as an algorithm that constructs a splitting field, using only radical adjunctions, for any polynomial whose Galois group is solvable. The final essay uses this to derive Cardano’s formulas for the roots of a cubic polynomial in terms of radicals.

Date: 2022
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-98558-5_7

Ordering information: This item can be ordered from
http://www.springer.com/9783030985585

DOI: 10.1007/978-3-030-98558-5_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().