Field (mathematics)

Field (mathematics)
Name	Field (mathematics)
Type	Algebraic structure
Axioms	Commutative ring with multiplicative inverses for nonzero elements

Field (mathematics)

A field is a set equipped with two operations satisfying axioms that generalize arithmetic of rational numbers, real numbers, and complex numbers. Fields provide the setting for algebraic operations used across Euclid, Isaac Newton, Évariste Galois, Carl Friedrich Gauss, and David Hilbert in topics ranging from number theory to algebraic geometry. Fields underpin constructions in Albert Einstein-era mathematical physics, Andrew Wiles's work on Fermat's Last Theorem, and modern computational systems such as those developed at Microsoft and Google.

Definition and basic properties

A field is defined as a commutative ring with unity in which every nonzero element has a multiplicative inverse; this formalization traces through axiomatizations used by Évariste Galois, Richard Dedekind, Emmy Noether, Emil Artin, and Stefan Banach. Fundamental properties include cancellation laws, the existence of a prime subfield isomorphic to either Q or a prime field of characteristic p studied by Carl Friedrich Gauss and Srinivasa Ramanujan, and ordering considerations related to René Descartes and Évariste Galois. Basic consequences of the axioms used by Niels Henrik Abel and David Hilbert yield that fields have no nontrivial two-sided ideals, unique division algorithms in finite fields exploited by Claude Shannon and Norbert Wiener, and that field homomorphisms are injective on prime subfields as used by Stefan Banach and Emil Artin.

Examples and classes of fields

Classical examples include the Q, R, and C fields central to work by Euclid, Isaac Newton, Leonhard Euler, and Carl Friedrich Gauss. Algebraic number fields such as those studied by Ernst Kummer and Richard Dedekind (finite extensions of Q) feature in Andrew Wiles's proof techniques and in the Langlands program advanced by Robert Langlands. Function fields over Felix Klein-inspired curves, local fields like Q_p introduced by Kurt Hensel, and finite fields GF(p^n) central to Évariste Galois and Hermann Minkowski are indispensable in coding theory developed by Claude Shannon and Elias M. Stein. Transcendental extensions and real closed fields relate to Tarski-style model theory and work by Alfred Tarski, Emil Artin, and Axel Thue-influenced diophantine studies. Fields used in Alexander Grothendieck's algebraic geometry and Jean-Pierre Serre's cohomology include separably closed fields, perfect fields, and global fields tied to André Weil.

Field extensions and Galois theory

Field extensions and the Galois correspondence, formalized by Évariste Galois and developed by Emil Artin, connect automorphism groups to intermediate fields; this framework informed Noetherian ring theory by Emmy Noether and later advances by Shafarevich and Serre. Finite extensions, normality, and separability concepts used by Richard Dedekind and Emil Artin underpin solvability by radicals explored by Niels Henrik Abel and the classification of polynomial equations considered by Carl Friedrich Gauss. Galois theory interacts with Class field theory developed by Helmut Hasse and Emil Artin and with the Taniyama–Shimura conjecture linked to Andrew Wiles. The study of Galois groups has bearing on explicit constructions used in work by Srinivasa Ramanujan and John Tate.

Algebraic closures and splitting fields

Algebraic closures, guaranteed by Zorn-type arguments referenced in the tradition of Ernst Zermelo and Abraham Fraenkel, provide algebraically closed fields such as C; splitting fields of polynomials are minimal extensions containing all roots, concepts exploited in Évariste Galois's original manuscripts and refined by Emil Artin and Emmy Noether. Construction of algebraic closures is vital in algebraic geometry by Alexander Grothendieck and in model theory by Alfred Tarski and Saharon Shelah. Splitting fields appear in explicit factorization algorithms used in computational algebra systems by teams at IBM and Wolfram Research.

Characteristic and finite fields

The characteristic of a field is 0 or a prime p, a dichotomy noted in early number-theoretic work by Carl Friedrich Gauss and formalized by Richard Dedekind and Emil Artin. Finite fields GF(p^n), first systematically studied by Évariste Galois and later by L. E. Dickson and Hasse, are central to coding theory, cryptography, and combinatorics practiced at Bell Labs and in standards by NIST. Properties such as Frobenius automorphisms relate to André Weil's conjectures and to the reduction methods used by Pierre Deligne. Local fields of positive characteristic inform arithmetic geometry pursued by Jean-Pierre Serre and Alexander Grothendieck.

Applications and related structures

Fields serve as scalars in vector spaces central to Hermann Grassmann's and David Hilbert's linear algebra, modules in ring theory influenced by Emmy Noether, and coordinate fields in algebraic geometry advanced by Alexander Grothendieck and André Weil. Applications range from error-correcting codes developed at Bell Labs and AT&T to cryptographic systems influenced by Ron Rivest and Adi Shamir, and to control theory and signal processing inspired by Norbert Wiener and Claude Shannon. Related algebraic structures include division rings studied by William Rowan Hamilton and Joseph Wedderburn, ordered fields connected to René Descartes, valuation fields tied to Kurt Hensel, and topological fields used in analytic number theory by G. H. Hardy and John Edensor Littlewood.

Category:Abstract algebra