APPLICATION OF GALOIS THEORY TO SOLVING POLYNOMIAL EQUATIONS

Background to the Study

Problem of solving polynomial equations one of oldest and most persistent themes in history of mathematics. From Babylonian methods for solving quadratic equations to Renaissance discoveries of Scipione del Ferro Niccolò Tartaglia and Gerolamo Cardano for cubic and Lodovico Ferrari for quartic mathematicians sought general procedure by which roots of any polynomial equation could be expressed in terms of its coefficients using only operations of addition subtraction multiplication division and extraction of roots. Such expression called solution by radicals. For polynomial equations degree one through four general radical formulas were successfully obtained by sixteenth century. However for over two and half centuries afterward no comparable formula could be found for general quintic degree five equation despite sustained efforts leading mathematicians. Not until early nineteenth century that Paolo Ruffini and more rigorously Niels Henrik Abel proved no such general formula exists for polynomials degree five or higher. Result now known as Abel–Ruffini theorem resolved question that had eluded mathematicians for centuries yet it did not explain why some specific quintics solvable by radicals while general quintic is not. Definitive explanation came from work of Évariste Galois young French mathematician whose ideas developed early 1830s and published posthumously introduced what is now called Galois theory. Galois insight was to associate with each polynomial equation group now called its Galois group consisting of certain permutations of roots that preserve all algebraic relations among them. He demonstrated polynomial equation solvable by radicals iff associated Galois group possesses specific structural property called solvability. Since symmetric group on five or more letters not solvable this immediately explains Abel–Ruffini theorem and moreover provides general method for determining for any given polynomial whether or not it can be solved by radicals. Galois theory since grown far beyond original motivation. It underlies modern abstract algebra forms theoretical basis for constructibility problems classical geometry such as impossibility trisecting arbitrary angle with straightedge and compass and found extensive application coding theory cryptography computational algebra. In Nigerian tertiary mathematics curriculum Galois theory typically introduced final-year undergraduate level as capstone topic abstract algebra drawing together field theory group theory polynomial theory studied earlier courses. This study undertakes rigorous proof-based investigation of Galois theory with specific application to problem of solving polynomial equations. It develops theory from first principles states and proves Fundamental Theorem applies theory to determine solvability of specific polynomials and situates classical solution methods Cardano and Ferrari within broader Galois-theoretic framework.

Statement of the Problem

Despite existence general radical formulas for polynomial equations degree at most four no such formula exists for general polynomial equation degree five or higher. Students and practitioners frequently able to apply quadratic cubic and quartic formulas mechanically yet without exposure to Galois theory they lack principled means of determining for arbitrary quintic or higher-degree polynomial whether it is solvable by radicals at all. There is therefore need for systematic theoretically grounded and computationally verified treatment that both explains impossibility of general quintic formula and provides constructive procedure for identifying and solving those higher-degree polynomials that are in fact solvable by radicals.

Aim and Objectives of the Study

Aim is to investigate application of Galois theory to problem of solving polynomial equations with particular focus determining solvability by radicals.

·         Develop algebraic foundations of Galois theory including field extensions splitting fields normality and separability.

·         State and prove Fundamental Theorem of Galois Theory and establish correspondence between subfields and subgroups.

·         Derive and prove criterion that polynomial equation solvable by radicals iff its Galois group is solvable.

·         Compute Galois groups of selected cubic quartic and quintic polynomials over rationals both by hand and using computer algebra system.

·         Demonstrate explicitly using specific quintic polynomial that Galois-theoretic criterion correctly predicts unsolvability by radicals.

·         Compare Galois-theoretic approach with classical solution methods of Cardano and Ferrari.

Research Questions

1.      What algebraic structures necessary to formalise notion of solvability of polynomial equation by radicals?

2.      How does Fundamental Theorem of Galois Theory establish correspondence between field extensions and group theory?

3.      What is precise group-theoretic criterion for polynomial equation to be solvable by radicals?

4.      How can Galois group of specific polynomial be computed in practice?

5.      Can specific quintic polynomial be exhibited whose Galois group is full symmetric group S5 thereby proving it is not solvable by radicals?

6.      How does Galois-theoretic approach compare with classical radical-formula methods in terms scope and computational demand?

Significance of the Study

Significant in several respects. Academically consolidates field theory and group theory two central pillars abstract algebra into single coherent application thereby reinforcing undergraduate understanding both subjects. Pedagogically provides worked computationally verified examples suitable for classroom use advanced algebra courses addressing common difficulty whereby Galois theory taught abstractly without sufficient concrete computation. Practically demonstrates use computer algebra systems Python with SymPy for verifying Galois-theoretic computations skill increasingly relevant in computational mathematics cryptography coding theory. Finally contributes broader mathematical literature presenting self-contained rigorously proved account solvability criterion together with fresh worked examples.

Scope of the Study

Restricted to polynomial equations with rational coefficients and to Galois theory over fields characteristic zero so that all field extensions considered automatically separable. Emphasis placed on polynomials degree three four five since sufficient to illustrate both solvable case degrees three four and selected solvable quintics and unsolvable case general quintic. Covers classical Galois correspondence for finite extensions and does not extend to infinite Galois theory transcendence theory or inverse Galois problem although mentioned briefly as areas further study.

Limitations of the Study

Theoretical and computational nature does not involve primary data collection or human subjects. Principal limitation lies restriction to polynomials low degree up to degree five for explicit computation since Galois group computation becomes rapidly more complex for higher-degree polynomials owing to combinatorial growth symmetric group Sn. Additionally while computer algebra verification in Chapter Four carried out using SymPy in Python underlying algorithms for automated Galois group computation such as resolvent polynomial methods are themselves active area computational algebra research and used here as verification tools rather than derived from first principles.

Operational Definition of Terms

·         Field: Algebraic structure consisting of set together with two operations addition multiplication satisfying field axioms in which every non-zero element has multiplicative inverse.

·         Field Extension: Field K containing subfield F denoted K/F where K regarded as vector space over F.

·         Splitting Field: Smallest field extension of F over which given polynomial factors completely into linear factors.

·         Galois Group: Group of all automorphisms of field extension K/F that fix every element of F denoted Gal(K/F).

·         Solvable Group: Group G possessing chain subgroups from trivial subgroup to G itself in which each subgroup normal in next and each successive quotient abelian.

·         Solvable by Radicals: Polynomial equation solvable by radicals if its roots can be expressed using coefficients four basic arithmetic operations and extraction of nth roots for various positive integers n.

·         Discriminant: Polynomial function of coefficients whose vanishing indicates presence repeated roots and whose square root when adjoined closely tied to alternating group in Galois correspondence.

Short Conclusion

Findings confirm Galois theory provides both definitive theoretical explanation for non-existence of general radical formula for degree five and higher polynomials and constructive framework for solving those polynomials that are solvable. Classical criterion derived: polynomial equation solvable by radicals iff Galois group is solvable group. Since symmetric group Sn for n≥5 not solvable this explains Abel-Ruffini theorem. Explicit computational verification using Python SymPy confirms irreducible cubic and quartic examples have solvable Galois groups and solvable quintic examples solvable while x^5 - 4x + 2 has Galois group isomorphic to S5 order 120 not solvable thus not solvable by radicals. Comparison with Cardano Ferrari shows classical methods are specific instances of general Galois criterion but lack general scope. Recommends deeper integration into undergraduate curricula alongside computer algebra systems.

10 SEO-Friendly FAQs

1. What is Galois theory application to polynomial equations?

Provides criterion polynomial solvable by radicals iff its Galois group solvable; associates each polynomial with group permutations of roots preserving algebraic relations.

2. What is Fundamental Theorem of Galois Theory?

Establishes correspondence between intermediate fields of Galois extension and subgroups of its Galois group enabling translation field theory problems into group theory; fails when extension not Galois.

3. Why is general quintic not solvable by radicals?

Abel-Ruffini theorem: general polynomial degree n not solvable for n≥5 because has Galois group Sn; for n≥5 Sn is not solvable; chain of extensions base field containing roots unity each simple radical extension requires solvable group.

4. How to show x^5-4x+2 not solvable?

Irreducible quintic over Q prime degree p exactly p-2 real roots then Galois group Sp; x^5-4x+2 irreducible 3 real 2 complex nonreal so Galois group S5 order 120 not solvable; solvability by radicals decidable constructive proof.

5. How are Galois groups computed?

Hand computation via discriminant resolvent polynomials Dedekind theorem modulo p factorization patterns plus computational verification using Python SymPy group-theoretic techniques for 12 test polynomials tables group orders solvability status.

6. What is solvable group?

Group possessing chain subgroups trivial to G itself each subgroup normal in next each successive quotient abelian; S3 S4 solvable A5 S5 for n≥5 not solvable.

7. How do Cardano and Ferrari compare to Galois?

Cardano cubic Ferrari quartic are general radical formulas existing because S3 S4 and subgroups solvable; Galois criterion explains existence for ≤4 and non-existence for ≥5 and provides method determining specific polynomials solvable beyond general formulas scope vs computational demand.

8. What are field extension splitting field normality separability?

Field extension K/F K vector space over F; splitting field smallest extension polynomial factors completely linear; normal separable ensures Galois correspondence holds; over characteristic zero all extensions automatically separable.

9. What is relevance today?

Underlies modern abstract algebra constructibility problems cryptography coding theory computational algebra; skill verifying with computer algebra systems increasingly relevant.

10. Where to find similar math project topics?

Explore Galois theory polynomial equations solvability topics on ScholarNestHub mathematics collection and university Galois theory Abel-Ruffini theorem resources.