Ferdinand Georg Frobenius

Ferdinand Georg Frobenius (26 October 1849 – 3 August 1917) was a German mathematician, best known for his contributions to the theory of elliptic functions, differential equations, number theory, and to group theory. He is known for the famous determinantal identities, known as Frobenius–Stickelberger formulae, governing elliptic functions, and for developing the theory of biquadratic forms. He was also the first to introduce the notion of rational approximations of functions (nowadays known as Padé approximants), and gave the first full proof for the Cayley–Hamilton theorem. He also lent his name to certain differential-geometric objects in modern mathematical physics, known as Frobenius manifolds.

Biography Ferdinand Georg Frobenius was born on 26 October 1849 in Charlottenburg, a suburb of Berlin, from parents Christian Ferdinand Frobenius, a Protestant parson, and Christine Elizabeth Friedrich. He entered the Joachimsthal Gymnasium in 1860 when he was nearly eleven.

In 1867, after graduating, he went to the University of Göttingen, where he began his university studies. However, he studied there for only one semester before returning to Berlin, where he attended lectures by Leopold Kronecker, Ernst Kummer and Karl Weierstrass. He received his doctorate (awarded with distinction) in 1870 supervised by Weierstrass. His thesis was on the solution of differential equations. In 1874, after having taught at secondary school level — first at the Joachimsthal Gymnasium, then at the Sophienrealschule — he was appointed to the University of Berlin as an extraordinary professor of mathematics. Only in 1991, after the classification of finite simple groups, was this problem solved in general.

More important was his creation of the theory of group characters and group representations, which are fundamental tools for studying the structure of groups. This work led to the notion of Frobenius reciprocity and the definition of what are now called Frobenius groups. A group is said to be a Frobenius group if there is a subgroup such that for all

In that case, the set

together with the identity element of forms a subgroup which is nilpotent as John G. Thompson showed in 1959. All known proofs of that theorem make use of characters. In his first paper about characters (1896), Frobenius constructed the character table of the group of order for all odd (this is a simple group He also made fundamental contributions to the representation theory of the symmetric and alternating groups.

Contributions to number theory

Frobenius introduced a canonical way of turning primes into conjugacy classes in Galois groups over Q. Specifically, if K/Q is a finite Galois extension then to each (positive) prime p which does not ramify in K and to each prime ideal P lying over p in K there is a unique element g of Gal(K/Q) satisfying the condition g(x) = xp (mod P) for all integers x of K. Varying P over p changes g into a conjugate (and every conjugate of g occurs in this way), so the conjugacy class of g in the Galois group is canonically associated to p. This is called the Frobenius conjugacy class of p and any element of the conjugacy class is called a Frobenius element of p. If we take for K the mth cyclotomic field, whose Galois group over Q is the units modulo m (and thus is abelian, so conjugacy classes become elements), then for p not dividing m the Frobenius class in the Galois group is p mod m. From this point of view, the distribution of Frobenius conjugacy classes in Galois groups over Q (or, more generally, Galois groups over any number field) generalizes Dirichlet's classical result about primes in arithmetic progressions. The study of Galois groups of infinite-degree extensions of Q depends crucially on this construction of Frobenius elements, which provides in a sense a dense subset of elements which are accessible to detailed study.

Differential equations

Frobenius made important contributions to the solution of linear variable-coefficient ordinary differential equations by elaborating on the resolution of power-series methods applied at singular-points where standard Taylor-series methods fail. His algorithm is now referred to as the Frobenius method.