Early History of Algebra: a Sketch
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Algorithmic Factorization of Polynomials Over Number Fields
Rose-Hulman Institute of Technology Rose-Hulman Scholar Mathematical Sciences Technical Reports (MSTR) Mathematics 5-18-2017 Algorithmic Factorization of Polynomials over Number Fields Christian Schulz Rose-Hulman Institute of Technology Follow this and additional works at: https://scholar.rose-hulman.edu/math_mstr Part of the Number Theory Commons, and the Theory and Algorithms Commons Recommended Citation Schulz, Christian, "Algorithmic Factorization of Polynomials over Number Fields" (2017). Mathematical Sciences Technical Reports (MSTR). 163. https://scholar.rose-hulman.edu/math_mstr/163 This Dissertation is brought to you for free and open access by the Mathematics at Rose-Hulman Scholar. It has been accepted for inclusion in Mathematical Sciences Technical Reports (MSTR) by an authorized administrator of Rose-Hulman Scholar. For more information, please contact [email protected]. Algorithmic Factorization of Polynomials over Number Fields Christian Schulz May 18, 2017 Abstract The problem of exact polynomial factorization, in other words expressing a poly- nomial as a product of irreducible polynomials over some field, has applications in algebraic number theory. Although some algorithms for factorization over algebraic number fields are known, few are taught such general algorithms, as their use is mainly as part of the code of various computer algebra systems. This thesis provides a summary of one such algorithm, which the author has also fully implemented at https://github.com/Whirligig231/number-field-factorization, along with an analysis of the runtime of this algorithm. Let k be the product of the degrees of the adjoined elements used to form the algebraic number field in question, let s be the sum of the squares of these degrees, and let d be the degree of the polynomial to be factored; then the runtime of this algorithm is found to be O(d4sk2 + 2dd3). -
January 10, 2010 CHAPTER SIX IRREDUCIBILITY and FACTORIZATION §1. BASIC DIVISIBILITY THEORY the Set of Polynomials Over a Field
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION §1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics. A polynomials is irreducible iff it cannot be factored as a product of polynomials of strictly lower degree. Otherwise, the polynomial is reducible. Every linear polynomial is irreducible, and, when F = C, these are the only ones. When F = R, then the only other irreducibles are quadratics with negative discriminants. However, when F = Q, there are irreducible polynomials of arbitrary degree. As for the integers, we have a division algorithm, which in this case takes the form that, if f(x) and g(x) are two polynomials, then there is a quotient q(x) and a remainder r(x) whose degree is less than that of g(x) for which f(x) = q(x)g(x) + r(x) . The greatest common divisor of two polynomials f(x) and g(x) is a polynomial of maximum degree that divides both f(x) and g(x). It is determined up to multiplication by a constant, and every common divisor divides the greatest common divisor. These correspond to similar results for the integers and can be established in the same way. One can determine a greatest common divisor by the Euclidean algorithm, and by going through the equations in the algorithm backward arrive at the result that there are polynomials u(x) and v(x) for which gcd (f(x), g(x)) = u(x)f(x) + v(x)g(x) . -
2.4 Algebra of Polynomials ([1], P.136-142) in This Section We Will Give a Brief Introduction to the Algebraic Properties of the Polynomial Algebra C[T]
2.4 Algebra of polynomials ([1], p.136-142) In this section we will give a brief introduction to the algebraic properties of the polynomial algebra C[t]. In particular, we will see that C[t] admits many similarities to the algebraic properties of the set of integers Z. Remark 2.4.1. Let us first recall some of the algebraic properties of the set of integers Z. - division algorithm: given two integers w, z 2 Z, with jwj ≤ jzj, there exist a, r 2 Z, with 0 ≤ r < jwj such that z = aw + r. Moreover, the `long division' process allows us to determine a, r. Here r is the `remainder'. - prime factorisation: for any z 2 Z we can write a1 a2 as z = ±p1 p2 ··· ps , where pi are prime numbers. Moreover, this expression is essentially unique - it is unique up to ordering of the primes appearing. - Euclidean algorithm: given integers w, z 2 Z there exists a, b 2 Z such that aw + bz = gcd(w, z), where gcd(w, z) is the `greatest common divisor' of w and z. In particular, if w, z share no common prime factors then we can write aw + bz = 1. The Euclidean algorithm is a process by which we can determine a, b. We will now introduce the polynomial algebra in one variable. This is simply the set of all polynomials with complex coefficients and where we make explicit the C-vector space structure and the multiplicative structure that this set naturally exhibits. Definition 2.4.2. - The C-algebra of polynomials in one variable, is the quadruple (C[t], α, σ, µ)43 where (C[t], α, σ) is the C-vector space of polynomials in t with C-coefficients defined in Example 1.2.6, and µ : C[t] × C[t] ! C[t];(f , g) 7! µ(f , g), is the `multiplication' function. -
Calculus Terminology
AP Calculus BC Calculus Terminology Absolute Convergence Asymptote Continued Sum Absolute Maximum Average Rate of Change Continuous Function Absolute Minimum Average Value of a Function Continuously Differentiable Function Absolutely Convergent Axis of Rotation Converge Acceleration Boundary Value Problem Converge Absolutely Alternating Series Bounded Function Converge Conditionally Alternating Series Remainder Bounded Sequence Convergence Tests Alternating Series Test Bounds of Integration Convergent Sequence Analytic Methods Calculus Convergent Series Annulus Cartesian Form Critical Number Antiderivative of a Function Cavalieri’s Principle Critical Point Approximation by Differentials Center of Mass Formula Critical Value Arc Length of a Curve Centroid Curly d Area below a Curve Chain Rule Curve Area between Curves Comparison Test Curve Sketching Area of an Ellipse Concave Cusp Area of a Parabolic Segment Concave Down Cylindrical Shell Method Area under a Curve Concave Up Decreasing Function Area Using Parametric Equations Conditional Convergence Definite Integral Area Using Polar Coordinates Constant Term Definite Integral Rules Degenerate Divergent Series Function Operations Del Operator e Fundamental Theorem of Calculus Deleted Neighborhood Ellipsoid GLB Derivative End Behavior Global Maximum Derivative of a Power Series Essential Discontinuity Global Minimum Derivative Rules Explicit Differentiation Golden Spiral Difference Quotient Explicit Function Graphic Methods Differentiable Exponential Decay Greatest Lower Bound Differential -
Finding Equations of Polynomial Functions with Given Zeros
Finding Equations of Polynomial Functions with Given Zeros 푛 푛−1 2 Polynomials are functions of general form 푃(푥) = 푎푛푥 + 푎푛−1 푥 + ⋯ + 푎2푥 + 푎1푥 + 푎0 ′ (푛 ∈ 푤ℎ표푙푒 # 푠) Polynomials can also be written in factored form 푃(푥) = 푎(푥 − 푧1)(푥 − 푧2) … (푥 − 푧푖) (푎 ∈ ℝ) Given a list of “zeros”, it is possible to find a polynomial function that has these specific zeros. In fact, there are multiple polynomials that will work. In order to determine an exact polynomial, the “zeros” and a point on the polynomial must be provided. Examples: Practice finding polynomial equations in general form with the given zeros. Find an* equation of a polynomial with the Find the equation of a polynomial with the following two zeros: 푥 = −2, 푥 = 4 following zeroes: 푥 = 0, −√2, √2 that goes through the point (−2, 1). Denote the given zeros as 푧1 푎푛푑 푧2 Denote the given zeros as 푧1, 푧2푎푛푑 푧3 Step 1: Start with the factored form of a polynomial. Step 1: Start with the factored form of a polynomial. 푃(푥) = 푎(푥 − 푧1)(푥 − 푧2) 푃(푥) = 푎(푥 − 푧1)(푥 − 푧2)(푥 − 푧3) Step 2: Insert the given zeros and simplify. Step 2: Insert the given zeros and simplify. 푃(푥) = 푎(푥 − (−2))(푥 − 4) 푃(푥) = 푎(푥 − 0)(푥 − (−√2))(푥 − √2) 푃(푥) = 푎(푥 + 2)(푥 − 4) 푃(푥) = 푎푥(푥 + √2)(푥 − √2) Step 3: Multiply the factored terms together. Step 3: Multiply the factored terms together 푃(푥) = 푎(푥2 − 2푥 − 8) 푃(푥) = 푎(푥3 − 2푥) Step 4: The answer can be left with the generic “푎”, or a value for “푎”can be chosen, Step 4: Insert the given point (−2, 1) to inserted, and distributed. -
History of Algebra and Its Implications for Teaching
Maggio: History of Algebra and its Implications for Teaching History of Algebra and its Implications for Teaching Jaime Maggio Fall 2020 MA 398 Senior Seminar Mentor: Dr.Loth Published by DigitalCommons@SHU, 2021 1 Academic Festival, Event 31 [2021] Abstract Algebra can be described as a branch of mathematics concerned with finding the values of unknown quantities (letters and other general sym- bols) defined by the equations that they satisfy. Algebraic problems have survived in mathematical writings of the Egyptians and Babylonians. The ancient Greeks also contributed to the development of algebraic concepts. In this paper, we will discuss historically famous mathematicians from all over the world along with their key mathematical contributions. Mathe- matical proofs of ancient and modern discoveries will be presented. We will then consider the impacts of incorporating history into the teaching of mathematics courses as an educational technique. 1 https://digitalcommons.sacredheart.edu/acadfest/2021/all/31 2 Maggio: History of Algebra and its Implications for Teaching 1 Introduction In order to understand the way algebra is the way it is today, it is important to understand how it came about starting with its ancient origins. In a mod- ern sense, algebra can be described as a branch of mathematics concerned with finding the values of unknown quantities defined by the equations that they sat- isfy. Algebraic problems have survived in mathematical writings of the Egyp- tians and Babylonians. The ancient Greeks also contributed to the development of algebraic concepts, but these concepts had a heavier focus on geometry [1]. The combination of all of the discoveries of these great mathematicians shaped the way algebra is taught today. -
Arithmetical Proofs in Arabic Algebra Jeffery A
This article is published in: Ezzaim Laabid, ed., Actes du 12è Colloque Maghrébin sur l'Histoire des Mathématiques Arabes: Marrakech, 26-27-28 mai 2016. Marrakech: École Normale Supérieure 2018, pp 215-238. Arithmetical proofs in Arabic algebra Jeffery A. Oaks1 1. Introduction Much attention has been paid by historians of Arabic mathematics to the proofs by geometry of the rules for solving quadratic equations. The earliest Arabic books on algebra give geometric proofs, and many later algebraists introduced innovations and variations on them. The most cited authors in this story are al-Khwārizmī, Ibn Turk, Abū Kāmil, Thābit ibn Qurra, al-Karajī, al- Samawʾal, al-Khayyām, and Sharaf al-Dīn al-Ṭūsī.2 What we lack in the literature are discussions, or even an acknowledgement, of the shift in some authors beginning in the eleventh century to give these rules some kind of foundation in arithmetic. Al-Karajī is the earliest known algebraist to move away from geometric proof, and later we see arithmetical arguments justifying the rules for solving equations in Ibn al-Yāsamīn, Ibn al-Bannāʾ, Ibn al-Hāʾim, and al-Fārisī. In this article I review the arithmetical proofs of these five authors. There were certainly other algebraists who took a numerical approach to proving the rules of algebra, and hopefully this article will motivate others to add to the discussion. To remind readers, the powers of the unknown in Arabic algebra were given individual names. The first degree unknown, akin to our �, was called a shayʾ (thing) or jidhr (root), the second degree unknown (like our �") was called a māl (sum of money),3 and the third degree unknown (like our �#) was named a kaʿb (cube). -
The Persian-Toledan Astronomical Connection and the European Renaissance
Academia Europaea 19th Annual Conference in cooperation with: Sociedad Estatal de Conmemoraciones Culturales, Ministerio de Cultura (Spain) “The Dialogue of Three Cultures and our European Heritage” (Toledo Crucible of the Culture and the Dawn of the Renaissance) 2 - 5 September 2007, Toledo, Spain Chair, Organizing Committee: Prof. Manuel G. Velarde The Persian-Toledan Astronomical Connection and the European Renaissance M. Heydari-Malayeri Paris Observatory Summary This paper aims at presenting a brief overview of astronomical exchanges between the Eastern and Western parts of the Islamic world from the 8th to 14th century. These cultural interactions were in fact vaster involving Persian, Indian, Greek, and Chinese traditions. I will particularly focus on some interesting relations between the Persian astronomical heritage and the Andalusian (Spanish) achievements in that period. After a brief introduction dealing mainly with a couple of terminological remarks, I will present a glimpse of the historical context in which Muslim science developed. In Section 3, the origins of Muslim astronomy will be briefly examined. Section 4 will be concerned with Khwârizmi, the Persian astronomer/mathematician who wrote the first major astronomical work in the Muslim world. His influence on later Andalusian astronomy will be looked into in Section 5. Andalusian astronomy flourished in the 11th century, as will be studied in Section 6. Among its major achievements were the Toledan Tables and the Alfonsine Tables, which will be presented in Section 7. The Tables had a major position in European astronomy until the advent of Copernicus in the 16th century. Since Ptolemy’s models were not satisfactory, Muslim astronomers tried to improve them, as we will see in Section 8. -
THE RESULTANT of TWO POLYNOMIALS Case of Two
THE RESULTANT OF TWO POLYNOMIALS PIERRE-LOÏC MÉLIOT Abstract. We introduce the notion of resultant of two polynomials, and we explain its use for the computation of the intersection of two algebraic curves. Case of two polynomials in one variable. Consider an algebraically closed field k (say, k = C), and let P and Q be two polynomials in k[X]: r r−1 P (X) = arX + ar−1X + ··· + a1X + a0; s s−1 Q(X) = bsX + bs−1X + ··· + b1X + b0: We want a simple criterion to decide whether P and Q have a common root α. Note that if this is the case, then P (X) = (X − α) P1(X); Q(X) = (X − α) Q1(X) and P1Q − Q1P = 0. Therefore, there is a linear relation between the polynomials P (X);XP (X);:::;Xs−1P (X);Q(X);XQ(X);:::;Xr−1Q(X): Conversely, such a relation yields a common multiple P1Q = Q1P of P and Q with degree strictly smaller than deg P + deg Q, so P and Q are not coprime and they have a common root. If one writes in the basis 1; X; : : : ; Xr+s−1 the coefficients of the non-independent family of polynomials, then the existence of a linear relation is equivalent to the vanishing of the following determinant of size (r + s) × (r + s): a a ··· a r r−1 0 ar ar−1 ··· a0 .. .. .. a a ··· a r r−1 0 Res(P; Q) = ; bs bs−1 ··· b0 b b ··· b s s−1 0 . .. .. .. bs bs−1 ··· b0 with s lines with coefficients ai and r lines with coefficients bj. -
Resultant and Discriminant of Polynomials
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results are well-known 19th century mathematics, but I have not inves- tigated the history, and no references are given. 1. Resultant n m Definition 1.1. Let f(x) = anx + ··· + a0 and g(x) = bmx + ··· + b0 be two polynomials of degrees (at most) n and m, respectively, with coefficients in an arbitrary field F . Their resultant R(f; g) = Rn;m(f; g) is the element of F given by the determinant of the (m + n) × (m + n) Sylvester matrix Syl(f; g) = Syln;m(f; g) given by 0an an−1 an−2 ::: 0 0 0 1 B 0 an an−1 ::: 0 0 0 C B . C B . C B . C B C B 0 0 0 : : : a1 a0 0 C B C B 0 0 0 : : : a2 a1 a0C B C (1.1) Bbm bm−1 bm−2 ::: 0 0 0 C B C B 0 bm bm−1 ::: 0 0 0 C B . C B . C B C @ 0 0 0 : : : b1 b0 0 A 0 0 0 : : : b2 b1 b0 where the m first rows contain the coefficients an; an−1; : : : ; a0 of f shifted 0; 1; : : : ; m − 1 steps and padded with zeros, and the n last rows contain the coefficients bm; bm−1; : : : ; b0 of g shifted 0; 1; : : : ; n−1 steps and padded with zeros. In other words, the entry at (i; j) equals an+i−j if 1 ≤ i ≤ m and bi−j if m + 1 ≤ i ≤ m + n, with ai = 0 if i > n or i < 0 and bi = 0 if i > m or i < 0. -
Algebraic Combinatorics and Resultant Methods for Polynomial System Solving Anna Karasoulou
Algebraic combinatorics and resultant methods for polynomial system solving Anna Karasoulou To cite this version: Anna Karasoulou. Algebraic combinatorics and resultant methods for polynomial system solving. Computer Science [cs]. National and Kapodistrian University of Athens, Greece, 2017. English. tel-01671507 HAL Id: tel-01671507 https://hal.inria.fr/tel-01671507 Submitted on 5 Jan 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. ΕΘΝΙΚΟ ΚΑΙ ΚΑΠΟΔΙΣΤΡΙΑΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΑΘΗΝΩΝ ΣΧΟΛΗ ΘΕΤΙΚΩΝ ΕΠΙΣΤΗΜΩΝ ΤΜΗΜΑ ΠΛΗΡΟΦΟΡΙΚΗΣ ΚΑΙ ΤΗΛΕΠΙΚΟΙΝΩΝΙΩΝ ΠΡΟΓΡΑΜΜΑ ΜΕΤΑΠΤΥΧΙΑΚΩΝ ΣΠΟΥΔΩΝ ΔΙΔΑΚΤΟΡΙΚΗ ΔΙΑΤΡΙΒΗ Μελέτη και επίλυση πολυωνυμικών συστημάτων με χρήση αλγεβρικών και συνδυαστικών μεθόδων Άννα Ν. Καρασούλου ΑΘΗΝΑ Μάιος 2017 NATIONAL AND KAPODISTRIAN UNIVERSITY OF ATHENS SCHOOL OF SCIENCES DEPARTMENT OF INFORMATICS AND TELECOMMUNICATIONS PROGRAM OF POSTGRADUATE STUDIES PhD THESIS Algebraic combinatorics and resultant methods for polynomial system solving Anna N. Karasoulou ATHENS May 2017 ΔΙΔΑΚΤΟΡΙΚΗ ΔΙΑΤΡΙΒΗ Μελέτη και επίλυση πολυωνυμικών συστημάτων με -
Taming the Unknown. a History of Algebra from Antiquity to the Early Twentieth Century, by Victor J
BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 52, Number 4, October 2015, Pages 725–731 S 0273-0979(2015)01491-6 Article electronically published on March 23, 2015 Taming the unknown. A history of algebra from antiquity to the early twentieth century, by Victor J. Katz and Karen Hunger Parshall, Princeton University Press, Princeton and Oxford, 2014, xvi+485 pp., ISBN 978-0-691-14905-9, US $49.50 1. Algebra now Algebra has been a part of mathematics since ancient times, but only in the 20th century did it come to play a crucial role in other areas of mathematics. Algebraic number theory, algebraic geometry, and algebraic topology now cast a big shadow on their parent disciplines of number theory, geometry, and topology. And algebraic topology gave birth to category theory, the algebraic view of mathematics that is now a dominant way of thinking in almost all areas. Even analysis, in some ways the antithesis of algebra, has been affected. As long ago as 1882, algebra captured some important territory from analysis when Dedekind and Weber absorbed the Abel and Riemann–Roch theorems into their theory of algebraic function fields, now part of the foundations of algebraic geometry. Not all mathematicians are happy with these developments. In a speech in 2000, entitled Mathematics in the 20th Century, Michael Atiyah said: Algebra is the offer made by the devil to the mathematician. The devil says “I will give you this powerful machine, and it will answer any question you like. All you need to do is give me your soul; give up geometry and you will have this marvellous machine.” Atiyah (2001), p.