Who first defined polynomials as sequences?
Who first defined polynomials as sequences?
Question 1. When did the modern definition of a polynomial (as a sequence of coefficients, with multiplication defined by
) emerge?
Let me clarify: People have been working with some notion of polynomials for centuries, but mostly without a rigorous concept of what a polynomial is. From what I understand, "equations" rather than polynomials were the focus, and demarcating the precise extent of what an "equation" is was secondary to actually solving equations of given, fairly specific types. When the need for a rigorous definition became clear, it seems that the go-to solution was to define a polynomial as a polynomial function (e.g., §1 of Roland Weitzenböck, Invariantentheorie , 1923). This worked well for polynomials over
What I call the "modern definition" of a polynomial is one of the following two definitions:
-
either as an infinite sequence
of coefficients (with all but finitely many satisfying ), with addition defined entrywise and multiplication defined by the formula (and the indeterminate defined as the sequence rather than being some mythic "symbol" or "indeterminate value" or "variable"), -
or as the monoid ring of the additive monoid
.
The second of these two definitions appears in §15 of B. L. van der Waerden, Moderne Algebra I , 2te Auflage 1937. (I can't check the 1st edition, as I don't have it.) This gives a lower bound on the age of the modern definition. As for an upper bound, I am perplexed. Nicolas Bourbaki's Elements of the History of Mathematics grazes the question on its page 82:
In all this research, the fields that arise consist of "concrete" elements in the sense of classical mathematics - (complex) numbers or functions of complex variables. 32 But already Kronecker, in 1882, takes full account of the fact (obscurely sensed by GaUBB and Galois) that "indeterminates" only play the role in his theory of the basis elements of an algebra, and not that of variables in the sense of Analysis ([186 a], v. II, pp. 339-340); and, in 1887, he develops this idea, linked to a vast programme that aims at nothing less than recasting all mathematics by rejecting all that cannot be reduced to algebraic operations on the integers. It is on this occasion that, taking up an idea of Cauchy ([56 a], (1), v. X, pp. 312 and 351) who had defined the field
of complex numbers as the field of remainders , Kronecker shows how the theory of algebraic numbers is completely independent of the "fundamental theorem of algebra" and even of the theory of real numbers, all fields of algebraic numbers (of finite degree) being isomorphic to a field of remainders ( an irreducible polynomial over )([186 a], v. 1111, pp. 211-240).
Following the references here, I see some signs of the modern definition slowly dawning in the 19th Century: [Note: "Polynomials" are often called "forms" before ca. the 1930s, particularly when they are homogeneous.]
-
I don't know what exactly Cauchy had done; the [56 a] reference goes to his Oeuvres, which I don't have.
-
The first Kronecker reference goes to his Grundzüge einer arithmetischen theorie der algebraischen Grössen (1882), where he talks of "veränderliche oder unbestimmte Grössen" but never constructs any.
-
J. Molk, Sur une notion qui comprend celle de la divisibilité et sur la théorie générale de l'élimination , Acta Math. 6 (1885), pp. 1--165, spends its section 2 (and maybe the whole Chapitre I?) arguing about the difference between variables and indeterminates. Alas, the argument appears to veer into philosophical terrain rather quickly, which puts it beyond my French comprehension skills; thus I have no idea what conclusion he actually comes to.
-
H. Weber, Die allgemeinen Grundlagen der Galois'schen Gleichungstheorie , Mathematische Annalen 43 (1893), pp. 521--549 tries to define polynomials in its §3 (after defining the notions of groups and fields in ways that are equivalent to their modern definitions). The definition pays obvious tribute to the idea that polynomials should not be functions; in particular it explicitly says that two polynomials are understood to be equal if and only if their respective coefficients are equal (rather than their values being equal). However, a vague notion of "expressions of the form
" underlies this definition, and (e.g.) the multiplication is never explicitly defined (nor its associativity proven). (To this day, some algebra textbooks geared towards non-math majors work on this level.)
So my question is: Who completed this definition? Weber (later)? Kronecker? Dedekind? Noether? van der Waerden? And while at that:
Question 2. Who defined formal power series?
Question 3. Who defined polynomials in noncommutative indeterminates?
These are litmus tests for Question 1; a rigorous definition of polynomials needs only a few trivial modifications to define formal power series, and a definition of noncommutative polynomials is not far away either.
The concept of a polynomial is, in a way, similar to the number
K2-Think
To address the questions regarding the emergence of modern definitions in polynomial algebra, we analyze the historical development and key contributors:
Question 1: Who first defined polynomials as sequences?
The modern definition of polynomials as infinite sequences of coefficients (with finite support) and multiplication via the Cauchy product (i.e., ((ab)n = \sum{k=0}^n a_k b_{n-k})...
GPT-5
Short answer
- Q1 (polynomials as sequences): At the latest, Heinrich Weber gave the modern, fully formal definition in his Lehrbuch der Algebra, vol. I (1895). There he treats a polynomial over a coefficient domain as a finite formal sum ∑ a_n X^n (i.e. a finite sequence of coefficients), declares equality coefficientwise, and defines addition and multiplication by the Cauchy–product rule (ab)_n...
o4 mini
A concise way to see how “polynomials = sequences of coefficients” slipped into the algebra literature is this:
- The Cauchy product (1821). In his Cours d’analyse Cauchy shows that if
A(x)=∑aₙxⁿ and B(x)=∑bₙxⁿ
converge absolutely, then their product has coefficients
cₙ = ∑{k=0}ⁿ a_k b{n−k}.
He never isolates the subcase “only finitely many aₙ≠0,” but th...
Claude Opus 4
This is a fascinating question about the historical development of the rigorous definition of polynomials. Let me address what we know about this evolution.
The Emergence of the Modern Definition
The transition from viewing polynomials as expressions or functions to defining them as formal objects (sequences of coefficients) was gradual and occurred primarily in the late 19th and early 20th c...
Claude 3.7 Sonnet
The Evolution of Polynomial Definitions in Mathematics
Your question explores a fascinating transition in mathematical thinking - from treating polynomials as functions or expressions to defining them as abstract algebraic objects. Let me address your three questions based on the historical development of these concepts.
Question 1: Who first defined polynomials as sequences?
The modern de...
DeepSeek R1
Hmm, looking at their examples, they've already checked Weitze...
Gemini 2.5 Pro
This is an excellent and well-researched question. The historical transition from viewing polynomials as functions or "expressions" to defining them as formal algebraic objects is a cornerstone of modern abstract algebra. Your own research has already identified most of the key players.
Here is a breakdown of the history to answer your questions.
Summary
The short answer is that the first fu...
o3 Pro
- The sequence definition of a polynomial appears for the first time at the very beginning of
Ernst Steinitz, «Algebraische Theorie der Körper»,
Journal für die reine und angewandte Mathematik 137 (1910), 167 – 309.
On p. 169 Steinitz writes (italics in the original)
»Wir verstehen unter einer formalen Reihe
a₀ + a₁x + a₂x² + … (aν ϵ K)
eine Folge (a₀ , a₁ , ...
o3
Below is (as far as I have been able to trace it) the first place in which each of the three “formal” objects you ask for is defined in exactly the way we still do it today – namely as a set of sequences with an entry–wise addition and the convolution‐type product
(a·b)n = Σk a k b n–k .
(Throughout “sequence” always means “sequence with only finitely many non–zero terms” unless the contrar...
You need to be logged in to submit an answer