VOYAGE SEVENTEEN · WHEN TABLES BEGAN TO MOVE SPACE AND INFORMATION

When Number Tables Began to Move Worlds — From Counting Rods to Quantum States and AI

Travel from counting-rod tables in Luoyang, determinants in Edo, a Hanover letter, a Geneva rule, Göttingen observation, and London’s new algebra into quantum states, compression, optimization, graphics, search, and AI. Watch a number table change from a place to arrange problems into an operation that transforms worlds.

QUESTION FOR THE ROUTE

Why did equations, spaces, observations, and data—often without a direct line of transmission—repeatedly need a language that tables relations and transforms the table itself?

WHAT THE LINE DOES NOT CLAIM

This route does not call the Nine Chapters’ counting-rod array a modern abstract matrix or crown Seki, Leibniz, Cramer, Gauss, Sylvester, or Cayley as a sole inventor. Determinants, elimination, vector spaces, matrix algebra, and numerical linear algebra grew from different problems at different times. Modern applications do not mean matrices explain all meaning or social judgment in quantum theory, search, or AI.

The camera rests on each city while you read, then eases through the runway between scenes. Select any marker or scene link to travel in either direction.

The same route, four questions

A lens never hides a scene or proves a cause. It changes which places you compare first, and the URL preserves your choice.

Whole route Translation networks Commercial demand Observation and institutions Patronage and power

Commercial demand · READING QUESTION

Which recurring problems and audiences made this mathematics useful and worth transmitting?

Allocation, astronomical and geodetic error, logistics, screen transformation, web search, and large models created reasons to repeat calculations over many relations. No single practical demand invented matrices, and a computable objective does not replace every human purpose.

Start with:Luoyang Göttingen Washington DC Cambridge, MA Stanford Mountain View

Demand can shape selection and circulation; it does not prove an invention site, a single cause, or civilizational superiority.

Live map · 지도를 불러오는 중…

01 / 15 · 263 CE

Luoyang

01 · 263 CE
Luoyang · Reception
Reducing Rows in a Counting-Rod Table — The Nine Chapters and Liu Hui
Commercial demand · lens spotlight
The Fangcheng chapter of the Nine Chapters arranged counting rods in rectangular cells and manipulated columns to solve several unknowns. Liu Hui’s 263 commentary explained why procedures worked. This resembles later elimination, but it was not yet an abstract matrix with modern row-operation notation. Luoyang is an editorial anchor for the Wei intellectual setting; the exact place of composition is unknown.
PAUSE AND ASK
Why can several unknowns be reduced together after a word problem is moved into counting-rod cells?
How the idea changed
Instead of solving each equation alone, align coefficients and values and apply elimination to the whole table.
What this place made possible
The Wei capital’s editorial setting supplies context for Liu Hui’s 263 explanation of accumulated practical procedures through reasons and checks. The exact writing place is unknown.
How it moved
Allocation problems → layered Nine Chapters → Liu Hui’s commentary → manuscript, print, and teaching → modern historical comparison with elimination
Do not overclaim
Luoyang is an editorial anchor, not proven discovery site. Counting-rod column operations did not already contain the modern matrix object, row notation, or Gauss’s name.
Evidence sources
- MacTutor — The Nine Chapters on the Mathematical Art
  Supports: The Fangcheng counting-rod arrangement, elimination procedures, and the historical layer of Liu Hui’s 263 commentary
Stable link to this scene
LuoyangTokyo
02 · 1683 CE
Tokyo · Composition
Holding Entangled Equations in One Quantity — Seki’s Determinants
Seki Takakazu organized coefficients of equations and presented determinant-like rules in 1683 within Japan’s wasan tradition. His path was independent of Leibniz in Europe. It did not complete modern linear algebra or instantly create today’s determinant method for linear systems.
PAUSE AND ASK
What can one learn by compressing the entanglement of coefficients into one rule?
How the idea changed
Move from calculating individual unknowns to tracking permutations and signs in an array of coefficients.
What this place made possible
Edo’s wasan schools, problem tablets, manuscripts, and print networks supported reconstruction of Chinese mathematics and competitive development of independent symbolic procedures.
How it moved
Japanese reception of Chinese equation methods → wasan school problem culture → Seki’s 1683 text → students and later Japanese mathematics
Do not overclaim
Seki’s path was independent of Leibniz but not identical to modern determinant notation or all linear algebra, and no direct route to Cayley is claimed.
Evidence sources
- MacTutor — Seki Takakazu
  Supports: Seki’s determinant-like rules in 1683 and their Japanese wasan context
Stable link to this scene
TokyoHannover
03 · 1693 CE
Hannover · Letter sent
Asking about Solutions through Arrays of Coefficients — Leibniz’s Letter
In a 1693 letter to l’Hôpital, Leibniz gave coefficients two indices and discussed solution conditions through determinant-like expressions. The work was not a widely published standard method in his lifetime, so the letter is not treated as the single beginning of European linear algebra.
PAUSE AND ASK
How can row-and-column addresses on coefficients shorten a condition for solutions?
How the idea changed
Rewrite long equations as doubly indexed coefficients and combinations, exposing the array’s structure.
What this place made possible
A Hanover court and library post plus wide correspondence let Leibniz exchange pre-publication ideas with colleagues across Paris, Basel, and London.
How it moved
Equation theory → Leibniz’s double indices → 1693 letter to l’Hôpital → posthumous manuscript study → reconstruction of determinant history
Do not overclaim
A private letter was not a widely read textbook, does not monopolize priority over Seki’s independent work, and is not evidence of a direct line to Cayley’s algebra.
Evidence sources
- MacTutor — Matrices and determinants
  Supports: Double-index notation and determinant conditions in the 1693 l’Hôpital letter, with its limited contemporary influence
Stable link to this scene
HannoverGeneva
04 · 1750 CE
Geneva · Publication
Making One Ratio for Each Unknown — Cramer’s Rule
In an appendix to his 1750 book on algebraic curves, Gabriel Cramer expressed solutions of a square linear system as ratios of determinants. The rule is elegant for small symbolic examples, but it is not an efficient practical algorithm for large systems.
PAUSE AND ASK
Can each solution be written as a ratio of determinants when equations and unknowns match?
How the idea changed
Replace a full elimination sequence with a general symbolic formula read from coefficient arrays.
What this place made possible
Geneva’s academy and European print and correspondence networks supported publication and circulation of Cramer’s general rule in a book appendix.
How it moved
Determinant traditions → intersections of curves → Geneva publication in 1750 → Cramer’s rule in algebra texts → comparison with numerical efficiency
Do not overclaim
It is an expression for nonsingular square systems, not a recommended large-scale numerical algorithm. Cramer did not invent determinants or linear equations themselves.
Evidence sources
- e-rara — Cramer, Introduction à l’analyse des lignes courbes algébriques (1750)
  Supports: The 1750 Geneva edition containing the original rule for simultaneous equations
Stable link to this scene
GenevaGöttingen
05 · 1809 CE
Göttingen · Publication
Eliminating Orbits and Measurement Error — Gauss
Commercial demand · lens spotlight
Gauss reduced systems of linear equations step by step in astronomical and geodetic computation and connected them with least squares. We now say Gaussian elimination, although related elimination procedures are much older. His achievement was not exclusive invention but integration of calculation with observation and error adjustment.
PAUSE AND ASK
How can one calculate one persuasive orbit from many imperfect observations?
How the idea changed
Combine triangular reduction of linear systems with least squares and error adjustment to handle inconsistent observation.
What this place made possible
Göttingen’s university, observatory, and geodetic work joined repeated celestial and terrestrial observations, calculators, and state surveying needs.
How it moved
Astronomical observation → normal equations and elimination → 1809 orbit theory → geodesy and error adjustment → later numerical linear algebra
Do not overclaim
Gaussian elimination is a later name. It does not erase earlier elimination including Liu Hui’s tradition, and Gauss’s normal equations are not always the most numerically stable route.
Evidence sources
- MacTutor — Matrices and determinants
  Supports: Gauss’s use of elimination in astronomical calculation and its distinction from earlier Chinese traditions
Stable link to this scene
GöttingenLeipzig
06 · 1844 CE
Leipzig · Publication
Writing Spaces That Could Extend beyond Three Dimensions — Grassmann
Grassmann’s 1844 Theory of Linear Extension treated directed quantities through laws of addition and multiplication in spaces of arbitrary dimension. Its unfamiliar notation and an outsider’s position delayed reception, yet it supplied foundations for vector spaces and exterior algebra. Leipzig marks publication; Grassmann worked in Stettin.
PAUSE AND ASK
Can addition and multiplication remain lawful when a space has more than three directions?
How the idea changed
Treat coordinate collections not as mere lists but as extensible quantities governed by laws independent of dimension.
What this place made possible
Leipzig print made the Stettin teacher’s radical manuscript a book, but could not guarantee rapid reception for work outside established posts and notation.
How it moved
Directed quantities in geometry and mechanics → Grassmann’s 1844 extension theory → limited early readership → later editions and vector analysis → vector spaces and exterior algebra
Do not overclaim
Modern vector-space axioms and column-vector notation are not projected unchanged into the 1844 book, and Leipzig publication is not turned into Grassmann’s workplace.
Evidence sources
- MacTutor — Grassmann’s 1844 Ausdehnungslehre
  Supports: The 1844 work’s arbitrary-dimensional extension quantities and its difficult early reception
Stable link to this scene
LeipzigLondon
07 · 1858 CE
London · Publication
Making the Number Table Itself an Object of Calculation — Sylvester and Cayley
Sylvester coined the term “matrix” in 1850, and Cayley’s 1858 memoir systematically treated matrix addition, multiplication, and inverses. The fact that reversing order can change a product signaled a new algebra. Their work belongs after long histories of tabular calculation and determinants, not as an isolated invention by two men.
PAUSE AND ASK
What changes when the number table itself can be added and multiplied as one object?
How the idea changed
Move from an auxiliary array for determinants to an independent algebraic object with ordered products and inverses.
What this place made possible
Within London’s legal, Royal Society, and mathematical networks, practicing lawyers Sylvester and Cayley sustained exchanges on invariants and matrices alongside legal work.
How it moved
Determinants and linear transformations → Sylvester’s 1850 naming → Cayley’s 1858 memoir → matrix algebra, representation theory, and linear algebra texts
Do not overclaim
Cayley’s 1858 scene belongs to London activity and publication, not Cambridge. The two men did not replace from nothing the earlier histories of tables, Seki, Leibniz, Cramer, and Gauss.
Evidence sources
- MacTutor — Matrices and determinants
  Supports: Sylvester’s 1850 naming and Cayley’s 1858 abstract matrix algebra
Stable link to this scene
LondonLondon
08 · 1901 CE
London · Publication
Finding the Axes That Best Explain a Cloud of Points — Pearson
Pearson posed the problem of fitting the closest line or plane to observations in many dimensions. Together with Hotelling’s 1930s formulation, it became the language of principal component analysis: summarizing variation through a few directions. Pearson’s biometric work must be read alongside his eugenics, and the 1901 paper was not yet all of modern PCA.
PAUSE AND ASK
Can a high-dimensional cloud be laid onto one or two directions with the least loss?
How the idea changed
Replace one-variable-at-a-time inspection with the whole covariance structure and its closest-fitting axes.
What this place made possible
University College London’s biometric laboratory combined biological data, computing labor, and a statistics journal while also strengthening eugenic classification and institutional power.
How it moved
Least squares and correlation → Pearson’s 1901 closest lines and planes → Hotelling’s 1930s components → eigenvector computation → dimensionality reduction
Do not overclaim
The 1901 paper is not all of modern PCA and does not erase Hotelling’s later formulation. Statistical axes do not discover neutral natural types of people.
Evidence sources
- Pearson (1901) — On Lines and Planes of Closest Fit
  Supports: The original paper on closest-fitting lines and planes for points in several dimensions
Stable link to this scene
LondonGöttingen
09 · 1925 CE
Göttingen · Publication
Turning Observable Quantities into Multiplication Tables — Matrix Mechanics
Heisenberg computed atomic spectra using arrays of transition amplitudes; Born recognized matrix multiplication, and work by Born and Jordan and then all three developed matrix mechanics. Noncommutative multiplication, where order changes the result, became part of the structure of quantum observables. This was a collaborative development, not one isolated flash.
PAUSE AND ASK
What multiplication appears if a table keeps observable transitions instead of invisible electron orbits?
How the idea changed
Move from classical orbit pictures to arrays of transition amplitudes and accept a noncommutative structure where multiplication order matters physically.
What this place made possible
Göttingen’s theoretical-physics seminar and Born’s group supplied the density of collaboration needed to connect Heisenberg’s arrays with Jordan’s matrix knowledge and test them in papers.
How it moved
Spectroscopy → Heisenberg’s transition arrays → Born’s recognition of matrices → Born–Jordan and three-author papers → operator language of quantum mechanics
Do not overclaim
Heisenberg is not made the sole inventor of matrix mechanics. The matrix formalism is one representation of quantum theory and does not settle every interpretive question about measurement.
Evidence sources
- American Institute of Physics — Heisenberg and matrix mechanics
  Supports: Heisenberg’s arrays, Born’s recognition of matrices, and collaboration with Born and Jordan
Stable link to this scene
GöttingenChicago
10 · 1936 CE
Chicago · Publication
Reducing a Large Table to Its Most Important Layers — Eckart and Young
Eckart and Young stated how to find the best lower-rank approximation to a matrix. Combined later with singular value decomposition, the principle became central to image compression, denoising, recommendation, and latent structure. Their 1936 paper did not invent SVD or every modern compression technique.
PAUSE AND ASK
Which information should remain first when a large matrix is replaced by fewer directions?
How the idea changed
Instead of preserving every entry equally, retain the largest singular directions to obtain the least-error low-rank approximation.
What this place made possible
The University of Chicago’s mathematical-physics setting supported turning orthogonal-transformation questions from vibration and quantum calculation into a general approximation theorem.
How it moved
Orthogonal transformations and singular values → Eckart–Young theorem in 1936 → numerical linear algebra → low-rank models in images, denoising, and recommendation
Do not overclaim
The paper did not first discover SVD and was not a direct blueprint for JPEG or recommenders. “Important information” depends on the chosen error metric and representation.
Evidence sources
- Eckart & Young (1936) — The Approximation of One Matrix by Another of Lower Rank
  Supports: The original theorem on optimal approximation by a matrix of lower rank
Stable link to this scene
ChicagoWashington DC
11 · 1947 CE
Washington DC · Classified research
Turning Resources and Goals into a Table of Constraints — Dantzig and the Simplex Method
Commercial demand · lens spotlight
For US Air Force planning, Dantzig and colleagues represented production and transport constraints and objectives as linear expressions and developed the simplex method in 1947. Matrices made complicated choices computable, but cannot decide values omitted from an objective function.
PAUSE AND ASK
How can feasible and better plans be separated amid thousands of resource constraints?
How the idea changed
Rewrite plans as matrix inequalities and an objective, then improve along vertices of the feasible polytope.
What this place made possible
Project SCOOP at the Pentagon concentrated postwar Air Force personnel, equipment, transport planning, and computation, making large linear programs an operational problem.
How it moved
Military and economic planning → linear constraint models → Dantzig and colleagues’ 1947 simplex method → early computer implementations → industrial optimization
Do not overclaim
The scene does not erase Soviet linear-programming precedents or team implementation by making one isolated invention. An optimum is optimal only for the stated objective and constraints.
Evidence sources
- INFORMS — George Dantzig oral history
  Supports: Oral history of the 1947 Air Force planning context and development of the simplex method
Stable link to this scene
Washington DCTeddington
12 · 1961 CE
Teddington · Publication
Driving a Matrix toward a Triangle to Find Eigenvalues — The QR Algorithm
At Britain’s National Physical Laboratory, Francis, and in Leningrad, Kublanovskaya, independently reached QR iteration around 1961. It became a leading stable method for finding eigenvalues of large matrices. Teddington marks only one of the two centers.
PAUSE AND ASK
What must change so a computer can iterate toward eigenvalues of a large matrix without runaway error?
How the idea changed
Factor a matrix into orthogonal Q and triangular R, reverse the product, and iterate toward a form that reveals eigenvalues.
What this place made possible
NPL’s early computers and numerical-analysis community supplied machines and problems for testing a theoretical factorization under real precision and cost.
How it moved
Eigenvalue problems → orthogonal factorization → independent 1961 algorithms by Francis and Kublanovskaya → numerical software → scientific and engineering simulation
Do not overclaim
Teddington is not the sole birthplace: Kublanovskaya published independently in Leningrad. QR factorization and the iterative QR algorithm are also not identical terms.
Evidence sources
- SIAM — Vera Nikolaevna Kublanovskaya
  Supports: The independent 1961 QR algorithms of Francis and Kublanovskaya
Stable link to this scene
TeddingtonCambridge, MA
13 · 1963 CE
Cambridge, MA · Composition
Becoming the Transformation That Moves a Line on Screen — Sketchpad
Commercial demand · lens spotlight
Sutherland’s MIT doctoral project Sketchpad let a user draw with a light pen, impose constraints, and copy, rotate, or scale geometry. Homogeneous coordinates and transformation matrices became a consistent grammar for moving screen objects. One program is not claimed as the sole origin of every graphical interface.
PAUSE AND ASK
What should be stored to rotate or move a whole shape without relocating thousands of points one by one?
How the idea changed
Represent a shape not as a pixel list but as coordinate vectors joined to transformation matrices and constraints.
What this place made possible
The TX-2, light pen, interactive computing resources at MIT Lincoln Laboratory, and a doctoral setting enabled direct geometric dialogue with a screen.
How it moved
Projective homogeneous coordinates → radar and computer displays → 1963 Sketchpad thesis → CAD, object graphics, and graphics pipelines
Do not overclaim
Sketchpad was pivotal but does not make one person the sole inventor of every GUI, CAD system, or computer graphic. Cambridge marks the MIT research context.
Evidence sources
- Computer History Museum — Ivan Sutherland demonstrates Sketchpad
  Supports: Sketchpad’s 1963 MIT demonstration of interactive geometry, copying, and constraints
Stable link to this scene
Cambridge, MAStanford
14 · 1998 CE
Stanford · Publication
Reading the Web’s Links as a Giant Transition Matrix — PageRank
Commercial demand · lens spotlight
Brin and Page’s early search system normalized web links into a matrix and used a stable direction under repeated calculation to rank pages. Matrices gathered billions of connections under one rule, but link-based rank is not a neutral measurement of truth or social worth.
PAUSE AND ASK
Can a stable ranking of the huge web be built from who links to whom?
How the idea changed
See the web not as a pile of documents but as a sparse transition matrix carrying probability, then find the direction that remains under iteration.
What this place made possible
Stanford’s digital-library project, web infrastructure, publication culture, and Silicon Valley startup network supported scaling a research ranking experiment into search.
How it moved
Citation analysis and Markov chains → web link matrix → 1998 PageRank paper → distributed indexing and search → reuse in recommendation and network centrality
Do not overclaim
PageRank is not every part of Google Search, and links do not automatically guarantee quality or truth. Damping, spam response, and indexing choices shape results.
Evidence sources
- Stanford InfoLab — The Anatomy of a Large-Scale Hypertextual Web Search Engine
  Supports: The early PageRank account using the principal eigenvector of a normalized link matrix
Stable link to this scene
StanfordMountain View
15 · 2017 CE
Mountain View · Main activity
Comparing Context through Matrices — The Transformer
Commercial demand · lens spotlight
The Transformer multiplies query, key, and value matrices derived from token representations to calculate what each token should attend to. Large parallel matrix operations helped scale translation and generative AI, but matrix multiplication alone does not explain language understanding. Mountain View is an institutional anchor for the Google research network, not a replacement for the authors’ multiple affiliations.
PAUSE AND ASK
Which three tables let every token in a sentence compare itself with every other token at once?
How the idea changed
Move from passing recurrent state step by step to attention that computes query–key score matrices and weighted values in parallel.
What this place made possible
Google’s translation data, TPU and GPU computation, multiple research teams, and conference publication supplied institutional conditions for testing matrix-shaped attention at scale.
How it moved
Distributed representations and neural translation → prior attention research → 2017 Transformer → open implementations and accelerators → large language and multimodal models
Do not overclaim
Matrices are an efficient computational representation, not a full explanation of understanding, reasoning, or creativity. Mountain View is a Google network anchor and does not erase Toronto affiliation or earlier attention work.
Evidence sources
- Vaswani et al. (2017) — Attention Is All You Need
  Supports: The original paper’s query, key, and value matrices, parallel attention, and author affiliations
Stable link to this scene

FOUR WAYS A NUMBER TABLE BECOMES AN ACTION

Solve, move, find a stable direction, then compress

Each finite choice is saved in the URL. The four panels connect historically, but they are different mathematical questions rather than one universal matrix trick.

THE TABLE SEES RELATIONSHIPS

One row operation changes every coefficient together

Subtract a multiple of one equation from another. A zero row reveals whether the information repeats or contradicts itself.

x + y = 5

x − y = 1

x + y = 5

2y = 4

rank(A)

rank([A|b])

one solution

(x, y) = (3, 2)

Elimination, transformations, eigenvectors, and low-rank approximation share linear structure, but their assumptions, goals, and error boundaries differ.

TOUCH THE MATHEMATICS