# Field (mathematics) A field is a set where addition, subtraction, multiplication, and division by anything nonzero all behave as they do in the rationals: both operations are commutative and associative, each has an identity (0 and 1), and multiplication distributes over addition. Fields are the fully solvable arithmetic environments of [[Abstract_algebra]] — ℚ, ℝ, ℂ, and the finite fields GF(q) are the canonical citizens — and they are load-bearing across [[Mathematics]]: every vector space in [[Linear_algebra]] needs a field of scalars, every [[Affine_geometry|affine]] or [[Projective_geometry|projective]] coordinate system is built over one, [[Algebraic_geometry]] studies equations with coefficients in one, and Galois theory — the correspondence Galois left in 1832 — converts questions about equations into questions about [[Group_theory|groups]]. Engineering runs on the finite cases: GF(2⁸) arithmetic executes inside every AES encryption in [[Cryptography]] and every Reed–Solomon decode in [[Error_detection_and_correction]]. ## The axioms and what they buy Formally, (F, +) is a commutative group, (F∖{0}, ×) is a commutative group, and distributivity welds them together. Division is the point: in a mere ring like ℤ, the equation 2x = 1 has no solution, while in a field every ax = b with a ≠ 0 solves uniquely as x = a⁻¹b. That guarantee is what makes Gaussian elimination terminate, determinants test invertibility, and eigenvalue theory make sense — the whole apparatus of [[Linear_algebra]], and with it the state-space models of [[Control_theory]] and the least-squares machinery of [[Statistics]], silently presupposes field axioms. Fields also admit no zero divisors — ab = 0 forces a = 0 or b = 0 — so polynomial [[Algorithm|algorithms]] like the [[Computer_algebra|evaluation–interpolation]] pair work without pathology: a nonzero polynomial of degree d has at most d roots over any field, the fact underneath both secret sharing and [[Signal_processing|signal reconstruction]]. ## Characteristic: the coarsest invariant Add 1 to itself repeatedly; either you never return to 0 — characteristic zero, and the field contains a copy of ℚ — or you first return at a prime p, and the field contains GF(p) = {0, 1, …, p−1} with the [[Discrete_mathematics|clock arithmetic]] of remainders. Characteristic p arithmetic has a signature move: the Frobenius map x ↦ xᵖ is a homomorphism, because (x + y)ᵖ = xᵖ + yᵖ when every intermediate binomial coefficient is divisible by p — the "freshman's dream" made rigorous, and the engine of finite-field [[Group_theory|symmetry]]. Dedekind named the concept *Körper* around 1871; Steinitz's 1910 axiomatization proved every field sits inside an essentially unique algebraic closure, giving [[Abstract_algebra]] its modern shape and [[First-order_logic|model theorists]] a favorite test bed: algebraically closed fields have a [[Theory_of_computation|decidable]], quantifier-eliminable theory. ## Galois's census of finite fields Finite fields obey a complete and short law: one exists with q elements exactly when q = pⁿ is a prime power; it is unique up to isomorphism (E. H. Moore, 1893, completing Galois's 1830 sketch); and its nonzero elements form a single cyclic [[Group_theory|group]] under multiplication. There is no field with 6, 10, or 12 elements. | q | field? | reason | |---|--------|--------| | 4 = 2² | yes | GF(4), char 2 | | 6 = 2·3 | no | not a prime power | | 8 = 2³ | yes | GF(8), char 2 | | 9 = 3² | yes | GF(9), char 3 | | 10 = 2·5 | no | not a prime power | Construction is concrete [[Computer_algebra]]: GF(2⁸) is the 256 bit-patterns of a byte, multiplied modulo the fixed polynomial x⁸ + x⁴ + x³ + x + 1. The cyclic multiplicative structure yields maximal-length shift-register sequences of period 2ⁿ − 1 — the pseudorandom m-sequences, generated by a [[Finite-state_machine]], whose correlation properties give GPS its ranging codes, stream ciphers in [[Cryptography]] a keystream source, and spread-spectrum [[Signal_processing]] its robustness; the BCH codes of [[Error_detection_and_correction]] are cut from the same cyclic cloth. The same GF(q) coordinatize the [[Finite_geometry|finite geometries]] and the complete sets of mutually orthogonal Latin squares that [[Combinatorics]] and experimental [[Statistics]] build designs from (Bose, 1938). ## Extensions and the Galois correspondence Fields grow by adjoining roots: ℚ(√2) has degree 2 over ℚ, and compass-and-straightedge [[Geometry|constructions]] can only produce degrees that are powers of 2 — hence Wantzel's 1837 verdicts that angle trisection and cube duplication are impossible, and Lindemann's 1882 proof that π is transcendental kills circle-squaring. The Galois correspondence puts the intermediate fields of a well-behaved extension in order-reversing bijection with subgroups of its symmetry [[Group_theory|group]]; solvability of the group decides solvability of the equation by radicals — the showpiece duality of [[Abstract_algebra]] — which is why the general quintic has no formula (Abel, 1824; Galois, 1832). At the top of the classical tower sits ℂ: algebraically closed — every nonconstant polynomial has a root, with fully rigorous proofs dating to the early 19th century — which is why [[Complex_analysis]] is the natural home of characteristic-zero [[Geometry]], and why ℝ, the unique complete ordered field, anchors [[Mathematical_analysis]] and [[Calculus]]. ## Fields as infrastructure Choose a field and geometry follows: planes coordinatized by GF(q) give the [[Finite_geometry|finite planes]]; classical theorems even police the algebra, since a [[Projective_geometry|projective plane]] satisfies Pappus's theorem exactly when its coordinates commute. The reals parametrize every [[Dynamical_system|dynamical system's]] time axis; the complexes carry [[Quantum_mechanics]] — the i in the [[Schrödinger_equation]] is not decoration but load-bearing — and [[Fourier_analysis]] happens over ℂ because the unit circle lives there. Rational-function fields k(s) host the transfer functions of [[Linear_time-invariant_system|LTI systems]], making [[Control_theory|controller]] algebra literally field arithmetic. Where the scalars fail to form a field — integers, polynomial rings, the max-plus semiring of scheduling in [[Operations_research]] — the standard toolkits bend or break, which is the practical measure of how much the axioms were doing. ## Finite fields at work: GF(2⁸) in your pocket Two 1970s-to-1980s design decisions put field arithmetic in consumer hardware. First, coding: Reed–Solomon codes (1960) treat data blocks as polynomials over GF(2⁸) and evaluate them redundantly; any sufficiently large subset of symbols reconstructs the polynomial, so scratches on a CD, bursts on a DVB channel, damaged corners of a QR code, and deep-space noise on the Voyager downlink to [[NASA]] are all repaired by the same [[Abstract_algebra|algebra]] of [[Error_detection_and_correction|error correction]]. Second, secrecy: AES (standardized 2001) builds its S-box from multiplicative inversion in GF(2⁸); Diffie–Hellman (1976) hides exponents in the cyclic [[Group_theory|group]] GF(p)ˣ; elliptic-curve [[Cryptography]] (1985) replaces that group with the points of a curve over GF(q), marrying fields to [[Algebraic_geometry]]; and Shamir's secret sharing (1979) is [[Computer_algebra|polynomial interpolation]] over a finite field — k points determine a degree-(k−1) polynomial, fewer reveal nothing. Every one of these is a theorem about fields, compiled and shipped at [[Information_theory|channel-capacity]] scale. **On the spine:** [[Abstract_algebra]] · [[Group_theory]] · [[Linear_algebra]] · [[Finite_geometry]] · [[Cryptography]]. ## Wikipedia : Wikitube **Strict pair:** [Wikipedia](https://en.wikipedia.org/wiki/Field_%28mathematics%29) : [Wikitube](https://en.wikitube.io/wiki/Field_%28mathematics%29) ## Previous hub tags Hubs: `Systems`. Portals: [[PORTAL_Dynamical_system]], [[PORTAL_Graph_theory]], [[PORTAL_Information_theory]], [[PORTAL_Control_theory]], [[PORTAL_Operations_research]]. --- *Repopulated 2026-08-12 · redlink fill · 0 deletions.*