The Unreasonable Effectiveness of Linearity: A Historical Introduction#

An Ancient Puzzle: The Problem of Many Unknowns#

Welcome to the study of Linear Algebra. Before we embark on a formal journey through its axioms, theorems, and proofs, it is essential to understand where this remarkable field of mathematics comes from. Its story is not one of abstract invention in a vacuum, but a multi-millennial epic that begins with one of the most fundamental challenges of civilization: how to solve for many unknown quantities at once. This is not a puzzle born of intellectual curiosity alone; it is a problem woven into the very fabric of organized society. Questions of fair distribution, accurate measurement, resource allocation, and commercial exchange—the bedrock of governance and trade—all lead, in their mathematical form, to systems of linear equations. To understand Linear Algebra is to understand a monumental human endeavor to bring order, predictability, and fairness to a complex world.

The Dawn in Mesopotamia and Egypt#

Our story begins nearly 4,000 years ago, in the fertile crescent of Mesopotamia. The ancient Babylonians, renowned for their advanced positional number system and sophisticated astronomical calculations, were also grappling with practical algebraic problems. Clay tablets, preserved through the ages, reveal that Babylonian scribes knew how to solve simple systems of two linear equations with two unknowns. These problems arose from the daily necessities of a complex society: commerce, taxation, and construction. Their methods, however, were not theoretical in the modern sense. The solutions were presented rhetorically, as step-by-step recipes for specific numerical examples, without general formulas or proofs.

A similar pragmatism is found in the mathematics of ancient Egypt. The Rhind Papyrus, transcribed around 1650 BC from an even earlier text, shows that Egyptian algebra was primarily concerned with linear equations of the form $ax+b=c$. To solve these, and sometimes more complex problems, they employed a clever technique known as the "method of false position". This procedure involved making an educated guess for the unknown value, calculating the result, and then using the error in that result to proportionally adjust the initial guess until the correct answer was found. For systems with more than one unknown, a "method of double false position" was sometimes used, a technique that would persist for centuries, even appearing in the work of Islamic mathematicians and in Europe until the 1600s.

What these ancient methods from Babylon and Egypt reveal is the universality of the problem. Long before the development of symbolic algebra, societies across the globe independently recognized the need for systematic procedures to untangle the relationships between multiple unknown quantities. Their approach was algorithmic and practical, a set of instructions to be followed to achieve a desired numerical result. It was a form of computation, performed with stylus on clay or reed pen on papyrus, driven by the concrete demands of civilization.

The Eastern Pinnacle: The Nine Chapters on the Mathematical Art#

While the Babylonians and Egyptians laid the earliest groundwork, the solution to this ancient puzzle reached an unparalleled level of sophistication in Han Dynasty China, between 200 BC and 100 CE. The evidence comes from a seminal text, the Jiuzhang Suanshu, or The Nine Chapters on the Mathematical Art. This book holds a place in the history of Eastern mathematics comparable to that of Euclid's Elements in the West—not for its axiomatic structure, but for its profound and lasting influence as a foundational textbook for centuries.

Unlike the abstract, theorem-proof style of Greek mathematics, The Nine Chapters is a practical "how-to" manual, a collection of 246 problems and their solutions, designed to train civil servants in the arts of calculation necessary for managing an empire. The problems address tangible concerns: surveying fields, levying taxes on different grains, calculating labor for construction projects, and ensuring equitable transportation of goods.

The most remarkable section for our story is Chapter 8, titled Fangcheng, which translates to "Rectangular Arrays". This chapter presents a systematic and astonishingly modern procedure for solving systems of simultaneous linear equations. The method involved arranging the coefficients of the equations into columns on a counting board, a grid-like surface. The numbers themselves were represented by physical counting rods (chousuan), small bamboo sticks arranged to form different numerals. A brilliant innovation was the use of different colors—typically red for positive numbers and black for negative numbers—allowing for the full range of arithmetic operations.

The fangcheng procedure, as described in the text, is a step-by-step algorithm of column-reducing operations. By systematically cross-multiplying entries and subtracting columns from one another, the array was transformed into a triangular form. From there, the values of the unknowns could be found through a process of back substitution. This method is, in every essential detail, identical to the algorithm we now call Gaussian elimination. The text demonstrates this powerful technique on problems with up to five equations and five unknowns, and even an indeterminate system of five equations in six unknowns.

The sophistication of ancient Chinese mathematics did not stop there. Recent scholarship, most notably by historian Roger Hart, has shown that commentaries on The Nine Chapters and other texts contain the earliest known examples of determinantal-style calculations and solutions. These methods, which involve specific patterns of cross-multiplication among individual entries, predate the work of their supposed European discoverers by more than 1,500 years.

The development of the fangcheng method reveals a profound truth about the nature of mathematical discovery. It represents a different philosophical approach to mathematics than that which flourished in ancient Greece. Where the Greeks sought eternal, provable truths through logic and axioms, the Chinese developed powerful, generalizable algorithms to solve practical problems. This pragmatic mindset, focused on computation and administration, forms one of the two great historical roots of mathematics.

Furthermore, the fangcheng procedure itself can be seen as a remarkable form of physical computation. The practitioners, who Hart suggests may have been largely illiterate adepts, did not necessarily need to understand the abstract theory behind the method. They needed only to master the physical manipulation of the counting rods on the board according to a prescribed set of rules. The algorithm was embodied in the process. In this sense, the Chinese counting board was a primitive computer, and the fangcheng procedure was its software—a direct historical ancestor to the algorithms that now run on silicon chips.

Finally, this Eastern pinnacle challenges a purely Eurocentric view of mathematical history. The methods detailed in The Nine Chapters are not a historical dead end. Distinctive "fingerprint" problems and solution patterns found in the Chinese texts reappear centuries later in the work of the 13th-century Italian mathematician Fibonacci. This evidence points toward a transmission of knowledge across the Eurasian continent, suggesting that the story of linear algebra is not one of simple discovery and linear progression within Europe, but a more complex and global narrative of invention, transmission, and rediscovery. The ancient puzzle of many unknowns was first solved with breathtaking clarity not in the West, but in the East.

A New Language: Geometry, Coordinates, and Determinants#

For thousands of years, the problem of many unknowns was a matter of pure calculation, a challenge of arithmetic and algorithmic procedure. Whether through the educated guesses of the Egyptians or the sophisticated rod manipulations of the Chinese, the goal was to find a number. In the 17th century, however, a seismic shift occurred in European thought that would forever change how this problem was perceived. The French philosopher and mathematician René Descartes provided a revolutionary new way not just to solve the problem, but to see it. He built a bridge between the symbolic world of algebra and the visual, intuitive world of geometry, and in doing so, gave mathematicians a powerful new language to describe linear systems.

The Cartesian Revolution#

In his 1637 work, La Géométrie, Descartes introduced the system of coordinates that now bears his name. The idea was simple but its consequences were profound. A linear equation with two variables, like $ax+by=c$, was no longer just an abstract statement of equality. It was now a concrete object: a straight line on a two-dimensional plane. A system of two such equations was no longer just a pair of symbolic constraints; it was the search for a specific geometric location—the point where two lines intersect.

This geometric interpretation immediately provided a powerful new intuition. The nature of the solution to a system of equations became visually obvious:

• A single, unique solution corresponded to two lines intersecting at a single point.
• No solution corresponded to two parallel lines that never meet.
• Infinitely many solutions corresponded to two lines that were, in fact, the same line, overlapping at every point.

This conceptual framework extended naturally into higher dimensions. A linear equation in three variables represented a flat plane in three-dimensional space. A system of three such equations corresponded to the intersection of three planes. This act of translation—from the language of algebra to the language of geometry—unleashed a torrent of progress. It provided a new set of tools for reasoning about the problem and, more importantly, a new way of thinking. The biggest breakthroughs in mathematics often arise not from solving an old problem, but from finding a new and more powerful way to represent it. Descartes's work was a masterclass in the art of representation.

The Quest for a Universal Key: The "Determinant"#

With the geometric nature of linear systems now visible, the hunt began for a general, universal formula that could solve any system. This quest led European mathematicians to the concept of the determinant. The first to glimpse this idea was the German polymath Gottfried Wilhelm Leibniz. In a 1693 letter to the Marquis de l'Hôpital, Leibniz considered a system of three linear equations in two unknowns. He derived a condition on the coefficients of the system that would determine whether a solution existed. This condition, a specific combination of products of the coefficients, was precisely the requirement that the determinant of the coefficient matrix be zero.

Leibniz, a firm believer in the power of good notation, experimented with various ways to write these coefficient systems, using the term "resultant" for the value he had found. The modern term "determinant" was introduced much later, in 1801, by Carl Friedrich Gauss, who used it because this special number determines the essential properties of the system.

The development of a general formula based on this idea culminated in the work of the Swiss mathematician Gabriel Cramer. In a 1750 paper, Cramer presented a general rule for solving a system of $n$ linear equations in $n$ unknowns. This formula, now known as Cramer's Rule, expresses the value of each unknown as a fraction of two determinants. It is an elegant and theoretically powerful result, providing a complete, explicit formula for the solution. Though Cramer is credited with the general rule, similar results for smaller systems had been published earlier by the Scottish mathematician Colin Maclaurin and even hinted at by the 16th-century Italian mathematician Gerolamo Cardano in his Ars Magna.

Gauss and the Return of the Algorithm#

While the formulaic approach of Cramer's Rule was a theoretical triumph, it had a major practical drawback: for systems larger than three or four variables, the number of calculations required to compute the determinants becomes astronomically large, rendering the method highly inefficient. The story now turns to the towering figure of 19th-century mathematics, Carl Friedrich Gauss. While Gauss made foundational contributions to the theory of determinants, his most enduring practical legacy in this area was the formalization of a systematic procedure for solving linear systems.

This method, now universally known as Gaussian elimination, involves a sequence of "elementary row operations"—swapping two equations, multiplying an equation by a non-zero constant, or adding a multiple of one equation to another—to systematically eliminate variables. The process reduces the system to an equivalent "row-echelon" or triangular form, from which the solution can be easily found by back substitution. This powerful, general algorithm worked for any system, regardless of size, and was vastly more efficient than the determinant-based methods.

Of course, as we have seen, this was not a new discovery but a rediscovery. The algorithm that Gauss systematized for 19th-century Europe was, in its essence, the same fangcheng procedure that had been recorded in China's The Nine Chapters on the Mathematical Art nearly two millennia earlier.

The parallel development of these two approaches in Europe—the formulaic and the algorithmic—created a fundamental duality that continues to define linear algebra today. Cramer's Rule represents a declarative approach: it tells you what the solution is, providing a closed-form expression. Gaussian elimination represents a procedural approach: it tells you how to find the solution, providing a step-by-step recipe. The first is beautiful in theory but often impractical in computation. The second is less elegant but is the workhorse of numerical linear algebra. This is why, in your studies, you will learn about determinants for their theoretical importance—for instance, in checking if a solution exists at all—and you will master row reduction for the practical task of actually finding that solution. The history of the subject reveals that this is not a pedagogical quirk, but a deep reflection of two distinct and complementary ways of mathematical thinking.

A Thing in Itself: The Creation of the Matrix#

The story of linear algebra has so far been the story of solving systems of equations. The rectangular array of numbers at the heart of the problem was always seen as a tool, a convenient piece of bookkeeping for the "real" objects of interest—the equations and their variables. The next great conceptual leap, and arguably the most crucial for the birth of linear algebra as a distinct subject, was to see this array not as a process but as an object, a mathematical entity with a life and an algebra of its own. This revolutionary idea came not from the academic mainstream, but from the minds of two brilliant 19th-century British mathematicians who forged their most important work while working as lawyers.

Sylvester the Namer, Cayley the Creator#

The protagonists of this chapter are James Joseph Sylvester and Arthur Cayley, whose lifelong friendship and mathematical collaboration formed one of the most fruitful partnerships of the Victorian era. They met in the 1840s while studying for the bar, a path both were forced into due to the difficulty of securing academic positions in a system biased against their pure mathematical interests. Their days were spent on law, but their evenings and correspondence were filled with the creation of new mathematics.

It was the poetical and flamboyant Sylvester who, in 1850, first gave a name to the rectangular array of numbers. He called it a "matrix," from the Latin word for "womb". He chose this term because he viewed the matrix as a generative object, a "womb" from which various smaller square arrays could be selected to form determinants. This act of naming was itself a profound shift in perspective. The array was no longer just a "tableau" or a "disposition"; it was now a source, an origin, a thing in itself.

While Sylvester was the namer, it was the more reserved and methodical Arthur Cayley who became the true creator of matrix theory. In a series of papers published in the 1850s, culminating in his groundbreaking 1858 Memoir on the theory of matrices, Cayley took the decisive step. He proposed that matrices were not mere notational conveniences but were algebraic objects that could be manipulated according to a new set of rules. He gave the first abstract definition of a matrix and proceeded to define an entire algebra for them: matrix addition, scalar multiplication, and, most consequentially, matrix multiplication. He also defined the special roles of the identity matrix (the matrix equivalent of the number 1) and the matrix inverse (the equivalent of a reciprocal).

A Strange New World: Non-Commutative Multiplication#

Cayley's new algebra contained a startling and revolutionary discovery. He found that, unlike the multiplication of ordinary numbers, matrix multiplication is not, in general, commutative. That is, for two matrices $A$ and $B$, the product $AB$ is often not equal to the product $BA$. This was a radical departure from all prior algebraic experience. For centuries, algebra had been understood as a generalization of arithmetic, and the commutative law of multiplication ($a \times b = b \times a$) was considered a self-evident truth. Cayley's work demonstrated that one could construct a perfectly consistent, logical algebraic system that defied this fundamental rule.

This was not just a new chapter in the story of solving equations; it was a foundational moment for the entire field of abstract algebra. By showing that mathematicians could create new algebraic structures with their own distinct rules, Cayley opened the door to the modern study of groups, rings, and fields, where the familiar laws of arithmetic are no longer taken for granted.

Crucially, Cayley's definition of matrix multiplication was not arbitrary. It was carefully crafted to capture a deeper reality: the composition of linear transformations. A linear transformation is a function that maps vectors to vectors in a way that preserves addition and scalar multiplication—geometrically, it can be a rotation, a scaling, a shearing, or a projection. Cayley showed that any such transformation could be represented by a matrix. If a transformation $T$ is represented by matrix $M_T$ and a transformation $S$ is represented by matrix $M_S$, then the composite transformation of first applying $T$ and then applying $S$ is represented precisely by the matrix product $M_S M_T$. The non-commutativity of matrix multiplication, therefore, reflects the tangible fact that the order of transformations matters. For example, rotating a book 90 degrees forward and then 90 degrees to the right results in a different final orientation than performing those same rotations in the opposite order.

This connection provides the deep, underlying justification for the seemingly strange rule for multiplying matrices. It is the rule that makes the algebra of matrices the perfect language for the geometry of transformations.

The story of Cayley and Sylvester offers a powerful lesson on the nature of scientific progress. It is said that they both considered their work on matrix theory to be an exercise in pure mathematics, a beautiful abstract system with no conceivable practical use. They could not have been more wrong. The "useless" algebraic structure they pioneered, born from their shared passion during their time away from the academic world, would prove to be the essential language for describing the two great physical revolutions of the 20th century: relativity and quantum mechanics. It would become the engine behind modern computer graphics, the framework for data science, and the tool for countless other applications they could never have imagined. Their story is perhaps the most elegant example of the "unreasonable effectiveness of mathematics"—the mysterious way in which abstract ideas, pursued for their own intellectual beauty, so often turn out to be precisely the tools needed to describe the world.

The Unseen Architecture: The Rise of the Vector Space#

The history of linear algebra has, up to this point, followed a "bottom-up" trajectory. It began with specific, concrete problems (solving for unknowns), which led to the development of general algorithms (elimination) and general formulas (determinants). This, in turn, led to the abstraction of the tools themselves into a new class of mathematical objects (matrices). The final and most profound revolution in the subject was a "top-down" one: the realization that all of these disparate ideas—geometric arrows, lists of numbers, systems of equations, matrices, and linear transformations—were merely different manifestations of a single, unifying, underlying structure. This unseen architecture is the vector space.

Hermann Grassmann's Visionary Leap#

The person who first glimpsed this unifying structure was a figure far ahead of his time: Hermann Grassmann, a German high school teacher in Stettin. In his 1844 magnum opus, Die Lineale Ausdehnungslehre, ein neuer Zweig der Mathematik ("The Theory of Linear Extension, a New Branch of Mathematics"), Grassmann single-handedly laid the foundations for nearly all of modern linear algebra.

Grassmann's work was not motivated by solving equations, but by a deep philosophical desire to create a universal calculus of extension that was independent of Cartesian geometry. He began with abstract elements he called "units" ($e_1, e_2, e_3, \ldots$) and defined a formal algebra on their linear combinations ($a_1 e_1 + a_2 e_2 + a_3 e_3 + \ldots$). In this one remarkable work, he developed, with astonishing rigor and generality, the core concepts that form the syllabus of a modern linear algebra course:

• The idea of an $n$-dimensional space, where $n$ is not limited to two or three.
• The theory of linear independence and linear dependence.
• The concepts of subspace, span, basis, and dimension.
• The proof that the dimension of a space is invariant (does not change) regardless of the choice of basis.
• The fundamental formula for the dimension of the sum of two subspaces:

Grassmann's vision was breathtakingly complete. Yet, his work was met with almost complete silence. The mathematical community of his time was not ready for such a high level of abstraction. His writing was notoriously dense, philosophical, and filled with obscure, self-invented terminology. Even a mathematician as great as Möbius confessed he could not understand it. A report by the influential mathematician Ernst Kummer, solicited by the Prussian Ministry of Education when Grassmann sought a university position, damned the work as containing "commendably good material expressed in a deficient form," effectively ending his academic ambitions. Grassmann was a prophet without honor, a genius who had discovered the fundamental structure of linearity half a century before the world was ready to see it.

The Formalization: Peano's Axioms#

The concept of a vector space was finally given its modern, rigorous footing in 1888 by the Italian mathematician Giuseppe Peano. Peano, who was one of the few mathematicians of his time to have studied and understood Grassmann's work, published a book titled Calcolo geometrico secondo l'Ausdehnungslehre di H. Grassmann ("Geometric Calculus according to the Extension Theory of H. Grassmann"). In this book, he stripped away Grassmann's difficult philosophy and presented the core ideas with formal clarity.

Peano laid out the formal axioms for what he called a "linear system," now known as a vector space. This was the ultimate step in abstraction. The axioms define a "vector" not by what it is—an arrow in space, a list of numbers, a physical quantity—but by how it behaves. A vector space is simply a set of objects (of any kind) for which there are two well-defined operations, vector addition and scalar multiplication, that satisfy a list of eight simple rules (such as commutativity of addition, associativity, existence of a zero vector, etc.).

This abstract definition is not a complication; it is a radical simplification. It reveals that a vast array of different mathematical objects are, at their core, structurally identical. Anything that satisfies these eight axioms is a vector space and can be studied with the universal tools of linear algebra. Geometric arrows in space are vectors. Lists of numbers (tuples) are vectors. Polynomials are vectors. Continuous functions are vectors. Matrices themselves form a vector space. The solutions to a linear differential equation form a vector space. A theorem about linear independence, once proven for an abstract vector space, does not need to be re-proven for polynomials, then again for functions, and again for matrices. It applies to all of them, automatically. This is the immense power of the abstract, top-down approach pioneered by Grassmann and formalized by Peano.

The Power of Abstraction: What is a "Vector"?#

| Embodiment of "Vector" | |-------------------------| | Geometric Arrow | | List of Numbers (Tuple) | | Polynomial | | Function | | Quantum State |

The modern pedagogical approach to linear algebra, which this textbook will follow, is fundamentally Grassmann's view. We begin with the abstract definition of a vector space precisely because it is the most general and powerful perspective. This historical journey explains why. The abstract starting point is not an arbitrary choice; it is the culmination of a 2,000-year search for the true, underlying essence of linearity.

The World Remade: The Power of the Linear Framework#

The journey from ancient practical puzzles to the abstract architecture of the vector space was a long and winding one. The result of this journey is a framework of astonishing power and versatility. The seemingly esoteric concepts you are about to study—vector spaces, linear transformations, eigenvalues, eigenvectors—are not merely the subject of a mathematics course. They form the fundamental language used to build and understand our modern scientific and technological world. Linearity, it turns out, is the master key, the ultimate first-order approximation that allows us to model, predict, and manipulate a world that is, in its true nature, overwhelmingly complex and non-linear.

Physics: Describing the Fabric of Reality#

The two great pillars of modern physics, general relativity and quantum mechanics, are both written in the language of linear algebra.

In General Relativity, Albert Einstein's theory of gravity, the familiar three dimensions of space and one of time are unified into a single four-dimensional continuum called spacetime. Gravity is no longer a force, but a manifestation of the curvature of this spacetime. The mathematical objects used to describe this curved geometry and relate physical quantities within it are called tensors. Tensors are, in essence, generalized vectors and linear operators, and the entire framework for manipulating them is built upon the foundations of linear algebra. The metric tensor, for instance, is a key object that defines local geometry at every point in spacetime, playing the role of a "gravitational potential". Linear algebra provides the essential tools to understand the structure of spacetime itself.

In Quantum Mechanics, the departure from classical intuition is even more radical, and its reliance on linear algebra is even more direct. The state of a physical system, such as an electron, is no longer described by a position and a velocity. Instead, it is represented by a state vector in an abstract, often infinite-dimensional, complex vector space called a Hilbert space. Physical observables—quantities that can be measured, like energy, momentum, or spin—are represented by linear operators (specifically, Hermitian operators) acting on this space. When a measurement is performed, the possible outcomes are not arbitrary; they are restricted to the eigenvalues of the corresponding operator. Immediately after the measurement, the system's state vector "collapses" into the eigenvector (or eigenstate) associated with that measured eigenvalue. The famous quantum principle of superposition is nothing more than vector addition: a particle can be in a state that is a linear combination of multiple eigenstates simultaneously. The entire predictive and descriptive power of quantum theory is rooted in the algebra of vectors and operators.

The Digital World: Graphics, Data, and Search#

The world inside our computers is built, quite literally, from linear algebra.

In Computer Graphics, every 3D object in a video game, an animated film, or a computer-aided design (CAD) model is stored as a collection of vertices, and the coordinates of each vertex form a vector. Every manipulation of that object—rotating it, scaling it up or down, moving it to a different location, or changing the camera's viewpoint—is accomplished by multiplying its vertex vectors by a specific transformation matrix. The seemingly complex illusion of 3D perspective on a 2D screen is achieved through a clever linear transformation using a system called homogeneous coordinates, which embeds the 3D problem into a 4D space where perspective becomes a linear projection. The smooth, fluid motion you see on screen is the result of billions of matrix-vector multiplications being performed every second.

In Data Science and Machine Learning, linear algebra is the lingua franca. A large dataset is naturally represented as a massive matrix, where each row might correspond to an observation (e.g., a customer) and each column to a feature (e.g., age, purchase history). Many machine learning algorithms are designed to find patterns within the structure of this data matrix. Principal Component Analysis (PCA), a fundamental technique for dimensionality reduction, uses the eigenvectors of the data's covariance matrix to find the directions of greatest variance, allowing complex, high-dimensional data to be simplified while retaining the most important information. The very architecture of a neural network, the engine of modern artificial intelligence, is a sequence of layers, with each layer performing a linear transformation (a matrix multiplication of its input vector by a weight matrix) followed by a non-linear activation function. Training a neural network is largely a process of finding the right numbers to put in these weight matrices.

Perhaps the most famous application is Google's PageRank algorithm, the original idea that powered the search engine's dominance. The algorithm models the entire World Wide Web as an enormous directed graph, which can be represented by a transition matrix. In this matrix, the entry $A_{ij}$ represents the probability of a random surfer clicking a link from page $j$ to page $i$. The central question is: which pages are most important? The brilliant insight of PageRank is that the "importance" of every page—its rank—can be found by solving a massive eigenvector problem. The PageRank vector, which assigns a score to every page on the web, is nothing other than the dominant eigenvector of the web's transition matrix. The list of search results you see is, in a very real sense, a sorted list of the components of this vector.

Conclusion: A New Way of Seeing#

Our story has come full circle. It began with ancient scholars in China arranging bamboo rods on a counting board to solve practical problems of grain distribution. It ends with data scientists and physicists manipulating vast matrices in supercomputers to model the universe or rank the entirety of human knowledge on the web. The tools have evolved beyond recognition, from physical rods to abstract algorithms running on silicon. Yet the fundamental idea—representing a complex, interconnected system as an array of numbers and using a systematic procedure to understand its properties—has remained a constant thread.

The history of linear algebra is the story of a gradual, often difficult, climb up a ladder of abstraction. Each step—from concrete problem to algorithm, from algorithm to formula, from formula to geometric object, from object to abstract structure—yielded a more powerful and more general perspective. What began as a set of computational tricks for solving equations has blossomed into a rich and elegant language for describing systems, transformations, and relationships of all kinds.

As you now begin your formal study of this subject, remember this history. Linear algebra is not merely a collection of facts and techniques to be memorized. It is a monumental intellectual achievement, the result of centuries of human effort to find the hidden structure of linearity that underlies so much of our world. To learn it is to acquire a new and profoundly effective way of seeing.