- Atlas
- Mathematics
- Linear Algebra
Linear Algebra
Linear algebra is the study of vector spaces and the linear maps between them—the mathematics of straight lines, flat planes, and the transformations that preserve them.
11 frameworks, from 1693 to today · Algebra · Mathematics
- Elimination and Determinant Theory 1693-1900
- Canonical Forms and Eigenvalue Theory 1829-Present
- Matrix and Vector Algebra 1843-1930
- Matrix Analysis 1900-Present
- Spectral theory 1904-Present
- Module 1920-Present
- Vector space 1920-Present
- Multilinear algebra 1930-Present
- Numerical Linear Algebra 1950-Present
- Sparse and Iterative Methods 1952-Present
- Random matrix 1955-Present
Overview
Linear algebra is the study of vector spaces and the linear maps between them—the mathematics of straight lines, flat planes, and the transformations that preserve them1. Its central objects are vectors (lists or arrows that can be added and scaled), matrices (rectangular arrays of numbers encoding linear transformations), and the structures built from them: bases, dimensions, eigenvalues, and decompositions. What is at stake is enormous. Linear algebra is the working language of quantum mechanics, computer graphics, statistics, optimization, signal processing, and machine learning; it is also the gateway through which most students first meet abstract algebra. Its history is a long climb from practical rule-based problem solving to a fully axiomatic theory, with each stage solving problems the previous one could not.
Solving Systems by Elimination: Ancient Roots to the Eighteenth Century
The oldest strand is the solution of simultaneous linear equations1. Babylonian scribes around 1800 BCE solved two-equation problems on clay tablets by a method we would recognize as elimination—combining equations to cancel an unknown. Chinese mathematicians in the Nine Chapters on the Mathematical Art (compiled by the first century CE) went further, arranging coefficients in counting-rod arrays and performing systematic row operations to solve systems with several unknowns, including problems with more equations than unknowns. This "fang cheng" procedure is recognizably Gaussian elimination in tabular form1.
The decisive early modern step came from Gottfried Wilhelm Leibniz1. In 1693, in letters to Guillaume de l'Hôpital, Leibniz described a "resultant"—a determinant-like quantity that vanishes exactly when a system of linear equations has a nontrivial solution. He used it to test solvability, not yet as an independent object. The idea was taken up and named: Gabriel Cramer's Introduction à l'analyse des lignes courbes algébriques (1750) gave the rule expressing each unknown of a square system as a ratio of determinants. Cramer's rule was a computational convenience, but it made determinants central. Over the following decades, mathematicians including Alexandre-Théophile Vandermonde, Pierre-Simon Laplace, and Augustin-Louis Cauchy developed determinant theory systematically: Laplace's expansion by cofactors, Cauchy's 1812 memoir establishing multiplication rules and the product theorem, and Carl Gustav Jacob Jacobi's work on functional determinants (Jacobians) in the 1830s–40s. By mid-century, determinants were a mature computational tool for elimination and for geometry.
Matrices, Vectors, and the Algebra of Transformations
Determinants were numbers attached to arrays; the arrays themselves became objects of study in the nineteenth century2. Arthur Cayley's 1858 memoir "A Memoir on the Theory of Matrices" is the landmark: Cayley defined matrices as algebraic entities, gave their addition and multiplication, proved the Cayley–Hamilton theorem (a matrix satisfies its own characteristic equation) for small cases, and treated matrices as representing linear substitutions. James Joseph Sylvester, Cayley's collaborator, coined the word "matrix" in 1850 (originally for a rectangular array from which determinants are formed) and later introduced "invariant" ideas. The concept of a vector as an abstract quantity with magnitude and direction was developed in the same era by William Rowan Hamilton (quaternions, 1843) and Hermann Grassmann, whose Ausdehnungslehre (1844, expanded 1862) introduced n-dimensional vector spaces, linear independence, and exterior algebra—ideas largely ignored in his lifetime but foundational later.
The geometric payoff came with the study of quadratic forms and their reduction to sums of squares. Cauchy and Jacobi worked on orthogonal transformations; Karl Weierstrass and others studied the classification of quadratic forms. This line led directly to the eigenvalue problem: the characteristic roots of a matrix, and the question of when a matrix can be diagonalized. Cauchy (1829) and later Weierstrass and Camille Jordan (1870) developed the theory of canonical forms, culminating in the Jordan normal form—a classification of matrices up to change of basis over the complex numbers.
Axiomatization: Linear Algebra Becomes Abstract
The nineteenth-century theory was concrete: vectors were tuples of numbers, matrices were arrays. The twentieth century made it structural1. Giuseppe Peano gave an axiomatic treatment of vector spaces in 1888, but the decisive reformulation came from the Göttingen school. David Hilbert's work on integral equations (1904–1910) treated functions as vectors in infinite-dimensional spaces, and his students—Erhard Schmidt, Erhard Schmidt's orthogonality methods, and later Stefan Banach and John von Neumann—developed the geometry of such spaces. In 1920s Göttingen, Emmy Noether and others pushed the axiomatic method: a vector space is any set with addition and scalar multiplication satisfying a short list of axioms, and linear maps are structure-preserving functions between them. This abstraction, codified in textbooks such as Bartel Leendert van der Waerden's Moderne Algebra (1930–31) and later Paul Halmos's Finite-Dimensional Vector Spaces (1942), freed the subject from coordinates. The same theorems now applied to polynomials, functions, and matrices alike1.
The abstract viewpoint made possible the spectral theory of linear operators3. Hilbert and von Neumann extended eigenvalues and eigenvectors from matrices to operators on infinite-dimensional spaces; von Neumann's 1932 Mathematische Grundlagen der Quantenmechanik made self-adjoint operators and their spectral decompositions the mathematical backbone of quantum theory. The spectral theorem—that suitable operators can be decomposed into simpler pieces—became one of the most consequential results in analysis and physics.
Fields, Modules, and the Limits of the Classical Theory
Classical linear algebra assumes scalars form a field (a number system where every nonzero element has an inverse, like the rationals or reals)145. The twentieth century asked what happens over other rings. Over the integers, or over polynomial rings, not every matrix is invertible and modules replace vector spaces. This is the domain of linear algebra over arbitrary fields and rings, developed within commutative algebra and module theory: Smith normal form over principal ideal rings, structure theorems for finitely generated modules, and the theory of linear equations over rings. The abstract framework also spawned multilinear and tensor algebra: tensors as multilinear maps, exterior and symmetric powers, and the tensor product—tools that became indispensable in differential geometry, relativity, and representation theory.
Matrix Analysis and the Computational Turn
Alongside the abstract theory, a concrete tradition of matrix analysis matured: inequalities, norms, perturbation theory, positive definite matrices, and the behavior of matrices under small changes. This tradition, associated with figures such as Hermann Minkowski, Issai Schur, and later Olga Taussky-Todd and Roger Horn, asks quantitative questions—how large can an eigenvalue move when an entry changes?—that pure structure theory does not.
The mid-twentieth century brought the digital computer, and with it numerical linear algebra16. Solving large systems by hand was impossible; solving them by machine required new algorithms with controlled rounding error6. James Wilkinson's Rounding Errors in Algebraic Processes (1963) and his work at the National Physical Laboratory established backward error analysis—showing that a computed solution is the exact solution of a slightly perturbed problem. The 1950s–70s produced the core toolkit still in use: George Dantzig's simplex method (1947) for linear programming, the QR algorithm for eigenvalues (independently by John Francis and Vera Kublanovskaya, around 1961), the singular value decomposition's computational realization, and the LINPACK and EISPACK libraries (1970s) that made reliable software possible. Gene Golub and Charles Van Loan's Matrix Computations (1983) became the standard reference.
Scale forced structural innovation. Sparse matrix methods exploit the fact that most large matrices arising from physical models—finite-element meshes, networks, discretized differential equations—have mostly zero entries7. Iterative methods such as the conjugate gradient method (Magnus Hestenes and Eduard Stiefel, 1952) and preconditioning techniques made it possible to solve systems with millions of unknowns. Direct sparse factorization methods (sparse Cholesky, multifrontal methods) developed from the 1960s onward.
Random Matrices: From Nuclear Physics to Data
A surprising twentieth-century offshoot is random matrix theory: the study of matrices whose entries are random variables, and of the statistical behavior of their eigenvalues8. Eugene Wigner introduced it in the 1950s to model the energy levels of heavy atomic nuclei, where exact Hamiltonians were unknowable but statistical regularities appeared. Wigner's semicircle law describes the limiting eigenvalue distribution of large random symmetric matrices9. The field grew through the work of Freeman Dyson, Madan Lal Mehta, and others, and later found applications far beyond physics—in number theory (Montgomery's pair correlation conjecture, linked to the Riemann zeta function), in wireless communications, and in high-dimensional statistics and machine learning, where the behavior of sample covariance matrices is central.
The Present
Linear algebra today is both a mature core curriculum and an active research frontier. The abstract theory—vector spaces, linear maps, spectral decomposition—remains the organizing framework, taught from axiomatic textbooks worldwide1. Numerical linear algebra drives scientific computing, with randomized algorithms for very large matrices and structure-exploiting methods for tensors now active areas. Random matrix theory has become a major interface between probability, statistics, and physics8. Sparse and iterative methods underpin large-scale optimization and machine learning10. Matrix analysis supplies the perturbation and stability theory that makes numerical work trustworthy11. The open questions are practical and deep: efficient algorithms for tensor decompositions, the spectral theory of non-normal and random operators, and the limits of what can be computed reliably at extreme scale.
References
- Linear algebra (introduction, Fluid mechanics, fluid dynamics, and thermal energy systems, Vector spaces, Linear systems, History), Wikipedia
- Determinant (History), Wikipedia
- Spectral theory, Wikipedia
- Vector space, Wikipedia
- Field (mathematics), Wikipedia
- Numerical linear algebra, Wikipedia
- Sparse matrix, Wikipedia
- Random matrix, Wikipedia
- Wigner semicircle distribution, Wikipedia
- Conjugate gradient method, Wikipedia
- Condition number, Wikipedia
The frameworks of Linear Algebra
Each framework is a way of working the field has used: when it held, and the question it answers.
- 1693-1900
Elimination and Determinant Theory
How can we solve systems of linear equations?
- 1829-Present
Canonical Forms and Eigenvalue Theory
When can a matrix be diagonalized?
- 1843-1930
Matrix and Vector Algebra
How do arrays and arrows combine algebraically?
- 1900-Present
- 1904-Present
- 1920-Present
- 1920-Present
- 1930-Present
- 1950-Present
Numerical Linear Algebra
How can computers solve linear systems accurately?
- 1952-Present
Sparse and Iterative Methods
How can we solve enormous systems with mostly zero entries?
- 1955-Present
How the ideas connect
Each arrow runs from an earlier idea to the later one it shaped. The list below says what passed between them.
Canonical Forms and Eigenvalue Theory grew out of Elimination and Determinant Theory
The characteristic equation det(A − λI) = 0, built from determinant theory, turned the eigenvalue problem into a question about determinants. Cauchy's 1829 work on the characteristic roots of symmetric matrices and later Jordan's canonical form grew directly out of determinant techniques.
Carried by Augustin-Louis Cauchy; Camille Jordan.
Spectral theory grew out of Canonical Forms and Eigenvalue Theory
Spectral theory extended eigenvalues and eigenvectors from finite matrices to operators on infinite-dimensional spaces. Hilbert's work on integral equations (1904–1910) and von Neumann's spectral theorem for self-adjoint operators generalized the diagonalization of matrices.
Carried by David Hilbert; John von Neumann.
Vector space grew out of Matrix and Vector Algebra
The abstract vector space of the 1920s axiomatized the concrete vector algebra of Grassmann, Hamilton, and Peano. Peano's 1888 axioms and the Göttingen school's reformulation turned tuples and arrows into any set satisfying the vector-space axioms.
Carried by Giuseppe Peano; Bartel Leendert van der Waerden.
Sparse and Iterative Methods grew out of Numerical Linear Algebra
Sparse and iterative methods are a branch of numerical linear algebra that arose when direct methods became impractical for very large systems. The conjugate gradient method (Hestenes and Stiefel, 1952) and later preconditioning techniques were developed within the numerical linear algebra tradition.
Carried by Magnus Hestenes; Eduard Stiefel.
Matrix and Vector Algebra influenced by Elimination and Determinant Theory
Cayley's matrix algebra was motivated by linear substitutions and determinants: he defined matrix multiplication so that det(AB) = det(A)det(B), and the word 'matrix' itself came from Sylvester's determinant arrays. Determinant theory supplied the objects and the product theorem that matrix algebra generalized.
Carried by Arthur Cayley; James Joseph Sylvester.
Matrix Analysis grew out of Canonical Forms and Eigenvalue Theory
Matrix analysis took the eigenvalue and canonical-form questions of the nineteenth century and made them quantitative: perturbation of eigenvalues, norms, and inequalities for matrices. Schur's 1909 work on the characteristic polynomial and later Horn and Johnson's matrix analysis continue this line.
Carried by Issai Schur; Roger Horn.
Random matrix influenced by Canonical Forms and Eigenvalue Theory
Random matrix theory studies the eigenvalue distributions of matrices with random entries, a direct outgrowth of eigenvalue theory. Wigner's 1955 work on the statistics of nuclear energy levels used the eigenvalues of random symmetric matrices.
Carried by Eugene Wigner.
Module grew out of Matrix and Vector Algebra
Module theory generalized matrix and vector algebra over rings rather than fields. The failure of invertibility over rings led to Smith normal form and structure theorems for finitely generated modules, developed within commutative algebra in the 1920s.
Carried by Emmy Noether; Bartel Leendert van der Waerden.
Multilinear algebra grew out of Matrix and Vector Algebra
Multilinear algebra grew out of Grassmann's exterior algebra and the tensor calculus of the nineteenth century. In the 1930s the tensor product and exterior powers were recast in the abstract language of vector spaces and modules.
Carried by Hermann Grassmann; Bartel Leendert van der Waerden.
Numerical Linear Algebra influenced by Matrix Analysis
Numerical linear algebra took the norms, condition numbers, and perturbation bounds of matrix analysis and turned them into tools for error analysis. Wilkinson's backward error analysis (1963) rests on matrix norms and perturbation theory.
Carried by James Wilkinson; Matrix Computations (1983).
Random matrix influenced by Spectral theory
Random matrix theory borrowed the spectral viewpoint, treating eigenvalue distributions as the object of study. The limiting spectral distributions and the semicircle law are spectral-theoretic notions applied to random matrices.
Carried by Eugene Wigner.
Beyond the field
Where Linear Algebra's ideas came from in other fields, and what they led to there: the strongest 12 of 89 links.
Elimination and Determinant Theory led to Linear algebra in Algebra
Determinant and elimination theory, from Leibniz and Cramer through Gauss, supplied the computational and conceptual core out of which linear algebra grew; determinants and Gaussian elimination remain its basic tools.
Carried by Carl Friedrich Gauss; Gabriel Cramer.
Spectral theory grew out of Linear Theory and Sturm–Liouville Spectral Theory in Ordinary Differential Equations
Sturm–Liouville theory gave the first spectral decomposition of a differential operator, and Hilbert and his school generalized it to the spectral theory of self-adjoint operators.
Carried by David Hilbert; Joseph Liouville.
Spectral theory grew out of Functional Analysis in Mathematical Analysis
Spectral theory is a core chapter of functional analysis, arising from Hilbert's and von Neumann's operator theory; the spectral theorem for self-adjoint operators is a founding result of the field.
Carried by David Hilbert; John von Neumann.
Spectral theory grew out of Integral Equations and Spectral Theory in Functional Analysis
Hilbert's work on integral equations with symmetric kernels produced the spectral theorem for self-adjoint operators, and the spectral theory of linear operators grew directly out of that integral-equation tradition.
Carried by David Hilbert.
Spectral theory led to Hilbert Space Spectral Theory in Operator Theory
Finite-dimensional spectral theory (eigenvalues, diagonalisation, the spectral theorem for symmetric matrices) was generalised by Hilbert and his school to integral operators and then by von Neumann to self-adjoint operators on Hilbert space.
Carried by David Hilbert; John von Neumann.
Module grew out of Linear algebra in Algebra
Module theory was created by generalizing linear algebra from vector spaces over a field to modules over a ring, keeping the same axioms but dropping invertibility of scalars.
Carried by Emmy Noether.
Vector space influenced Vector Space Model in Information Retrieval
Salton's vector space model represents documents and queries as vectors in a term space and measures similarity by vector operations such as the cosine. The mathematical notion of a vector space supplied the formal apparatus.
Carried by Gerard Salton.
Vector space influenced Vector space model in Information Science
Salton's vector space model for retrieval took the mathematical vector space and its cosine similarity directly from linear algebra. Documents and queries were represented as vectors in a term space.
Carried by Gerard Salton.
Vector space grew out of Linear algebra in Algebra
The axiomatic vector space concept was distilled from the concrete theory of linear equations, determinants and transformations that constituted classical linear algebra. Peano, Pincherle and later Weyl and Banach recast the coordinate-based results of linear algebra as axioms for abstract vector spaces.
Carried by Giuseppe Peano; Hermann Weyl.
Multilinear algebra grew out of Linear algebra in Algebra
Multilinear algebra is the branch of linear algebra treating maps that are linear in each of several vector arguments, built directly on the vector space and tensor constructions of linear algebra.
Numerical Linear Algebra led to Randomized numerical linear algebra in Randomized Algorithms
Randomized numerical linear algebra grew out of classical numerical linear algebra, replacing exact factorizations with randomized sketching and sampling of matrices.
Numerical Linear Algebra grew out of Numerical analysis in Applied Mathematics
Numerical linear algebra is the matrix-computation core of numerical analysis, growing out of mid-century work on solving linear systems and eigenvalue problems on computers by Wilkinson, Householder and others.
Carried by James H. Wilkinson.

Linear Algebra is a planet in Nousfarer
Its city has a tower for each of these 11 frameworks. Land, walk in, and climb one concept at a time.
Land on Linear AlgebraRelated fields
Fields its ideas are linked to
- Operator Theory 15 links
- Algebra 13 links
- Abstract Algebra 6 links
- Numerical Analysis 6 links
- Functional Analysis 4 links
- Multivariate Statistics 3 links
- Lie Theory 2 links
- Ring Theory 2 links
- Randomized Algorithms 2 links
- Ordinary Differential Equations 2 links
- Inverse Problems 2 links
- Matroid Theory 2 links