Algebraic number theory Created 2026-09-24 Updated 2026-10-18
Algebraic number theory studies integer factorization, divisibility, prime ideals, and units after extending the rational numbers to a number field. Its basic objects are a number field and its ring of integers : the counterparts of and . The field norm turns multiplication in into multiplication of rational numbers, and takes algebraic integers to integers. These connections let linear algebra and Euclidean geometry answer arithmetic questions.[ref]
A first example is with ring of integers . The integer acquires the factorization
Each factor has field norm . Neither is a unit, and each is an irreducible element: any factorization into two nonunits would factor the prime number into two integers of absolute value greater than one. Arithmetic in a larger ring thus reveals structure invisible in ordinary integer factorization.
There is also a complication: unique factorization of elements can fail, as in the failure of unique factorization in the ring of integers generated by square root of minus five. The general replacement is prime ideal factorization. The ideal class group measures the obstruction to making every ideal a principal ideal.
The historical motivation is visible in Richard Dedekind's original 1877 exposition: he begins with ordinary integer factorization, passes to Gaussian integers, and then uses a quadratic example to explain why ideals are needed. His later section establishes unique factorization of ideals in a number field. This is a direct record of the development of the theory, rather than a claim that all its ideas originated in one year.[ref][ref]
Andrei Seymour-Howell 2026-11-05
Andrei Seymour-Howell works in computational number theory, particularly automorphic forms and trace formulas. His 2022 paper develops an algorithm to compute and rigorously verify Maass cusp forms for specified groups of squarefree level and trivial character. It combines a Selberg trace formula involving Hecke operators with linear algebra to isolate spectral information.[ref]
The distinction between computation and certification is central. A decimal approximation to an eigenvalue suggests where to look; a rigorous verification must justify that the computed information corresponds to an actual mathematical object, with controlled error. As a schematic illustration, a proved enclosure conveys a different kind of information from a program merely printing 10.00. The numbers here illustrate the distinction and are not a reported eigenvalue. The paper applies its verified computations to gather evidence about further conjectures; verified examples still do not prove a conjecture quantified over all forms.[ref]
Figure 1.
Andrei Seymour-Howell
. Portrait presented on the author's homepage, reached from his University of Bristol page.
Berlekamp polynomial factorization algorithm Created 2026-10-20 Updated 2026-11-05
For a monic squarefree polynomial , the Berlekamp polynomial factorization algorithm computes the fixed space of the Frobenius map on :
This is a vector space over , obtained as the kernel of a matrix minus the identity. If has distinct irreducible factors, the Chinese remainder theorem identifies with , so its dimension is .
A nonconstant element of separates factors through for . Repeating these splits produces the irreducible factors. Repeated factors require an initial squarefree factorization step; the fixed-space dimension statement assumes squarefreeness. The method converts polynomial factorization into linear algebra over a finite field.
Born rule Created 2026-09-24 Updated 2026-10-18
The Born rule connects a quantum state to measurement probabilities. Let be a complete orthonormal basis, finite or countably infinite, for a Hilbert space, and let
An ideal measurement distinguishing these basis vectors returns label with probability
This assignment is a physical measurement rule. Its compatibility with total probability one follows from orthonormality and normalization:
The probabilities are the squared moduli, not the amplitudes themselves or the squares . [ref].
If the basis is an eigenbasis of an observable, the reported numerical value is its eigenvalue. Several vectors can share one eigenvalue; the probability of that value is then the sum over the corresponding basis labels. More generally, a projective measurement with orthogonal projections assigns
for a pure state and a general density matrix , respectively. This also covers mixed states and degenerate eigenspaces. The Born rule determines outcome statistics; the ideal conditional state change is specified separately by the Lüders rule. See projective measurement for that formulation and its assumptions. [ref].
For a worked example, take the normalized qubit quantum state
The squared moduli add to . A computational-basis measurement, equivalently a measurement of the Pauli matrix, has
These probabilities do not depend on the relative quantum phase . Now choose the Hadamard basis
whose vectors are eigenstates of the Pauli matrix, also used by the Pauli X gate. The new probability amplitudes and probabilities are
Both probabilities are nonnegative and their sum is one. The relative quantum phase becomes visible because the two probability amplitudes add before their squared modulus is taken:
  • At , and .
  • At , .
  • At , and .
Figure 1.
The same qubit preparation has phase-independent Z probabilities and phase-sensitive X probabilities
. Details.
A Hadamard gate followed by a computational-basis measurement realizes these statistics, since , respectively. Compare the two bases using fresh, identically prepared copies: a preceding measurement may change the state. The quantum superposition section shows why replacing the preparation by the mixed state keeps the statistics but gives for every .
The usefulness of the Born rule is this conversion from linear algebra to experimental predictions: calculate overlaps in the basis actually measured, then take squared moduli. Its appealing geometry is that changing basis redistributes probability while preserving total squared norm. The same rule relates an energy eigenstate expansion to an energy measurement and a position wavefunction to a probability density.
Born's 1926 paper on quantum scattering interpreted the outgoing-wave coefficients in terms of the probabilities of collision outcomes; a corrective footnote specified proportionality to the square of the amplitude. This is a historical scattering formulation, rather than the general density matrix formula above. [ref]; [ref].
Brigitte Le Roux 2026-11-05
Brigitte Le Roux studies geometric data analysis, including correspondence analysis and principal component analysis. Her research account describes investigations of how principal axes change when observations, weights or the underlying Euclidean geometry are modified. This stability question asks which apparent structures survive a change in the analysis, rather than treating every fitted axis as intrinsic to the data.[ref]
Her joint book with Henry Rouanet, Geometric Data Analysis by Brigitte Le Roux and Henry Rouanet, develops the weighted-cloud approach through correspondence analysis, Euclidean clouds and principal component analysis. It connects the linear algebra of projections with explicit choices about representation of multivariate observations.[ref]
Figure 1.
Brigitte Le Roux, portrait identified on her personal research website
.
In exact classical identification of an unknown linear Boolean function , a function oracle call returns one bit . The query complexity is exactly for . Queries on the standard basis inputs reveal , proving sufficiency. For necessity, a depth- decision tree has at most answer histories and must distinguish hidden binary strings; hence , even with adaptive inputs. A reversible circuit that preserves and updates a known target by exclusive or reveals the same one bit per call.
There is also a useful linear algebra proof. Along a fixed history, the chosen inputs form the rows of a matrix over the two-element finite field, and the replies specify . If there are queries, the rank-nullity theorem gives a nonzero vector with . Then and give identical replies throughout this history. This also explains why adaptive choices cannot evade the bound: equal earlier replies force the same later choices.
Coding theory Created 2026-09-24 Updated 2026-10-18
Coding theory studies representations of messages that make decoding efficient, reliable, or compact. In channel coding, messages are mapped to separated codewords, so a corrupted word can still be recognized as coming from one particular message. In lossless source coding, a prefix code instead assigns short descriptions to frequent symbols. The objectives differ, but both exploit structure in the set of allowed words.
The simplest error-correction example sends as and as . If the receiver sees , at most one bit flip is consistent with , whereas two flips would be needed to obtain it from . A repetition code therefore recovers the original by taking the majority function of the received bits. The Hamming distance between the valid codewords is three: the spaces of one-error outputs around them do not overlap. This turns error correction into geometry in a discrete space.
The central tradeoff is between code rate and minimum distance. Additional separation makes correction possible but leaves fewer words available for messages at a fixed length. The Hamming bound counts disjoint error neighborhoods, while linear codes turn encoding and error detection into computations with matrices over finite fields. These connections explain why combinatorics, linear algebra, and probability theory all enter the subject.
Richard W. Hamming's Error Detecting and Error Correcting Codes appeared in the Bell System Technical Journal in April 1950, pp. 147–160. Its introduction motivates automatic correction through failures in digital computing, and its constructions go beyond detecting an error to identifying and correcting its location.[ref]
Composite matrix 2026-11-05
The composite matrix in a composite material is its continuous surrounding phase, distinguished from embedded fibres or particles. It holds the reinforcement together and transfers load through interfacial stresses; it can also protect the reinforcement from damage or the environment.
For a fibre-reinforced polymer, the polymer is the composite matrix even if the fibres carry much of the axial load. Matrix stiffness, interfacial adhesion and failure therefore affect the whole specimen. This materials meaning differs from a rectangular array of numbers in linear algebra.
Controllability 2026-10-13
Controllability asks whether the available control inputs can move a dynamical system between every pair of states in its declared state space. Fixing a duration gives the precise condition for every , where is the state space and its reachable set. With freely chosen duration, every pair must instead be connectable in some permitted finite time, which may depend on the pair. Always specify admissible control inputs, deadlines and any constraints along the path. [ref]
The surprising part is that one control input can control several state variables by acting at different times. For the double integrator, acceleration changes velocity directly, while the accumulated velocity changes position. Starting from rest, accelerate during the first half of the journey and brake during the second: the final velocity can vanish although the final position has changed. The figure is an analytic mathematical example in dimensionless quantities, with no experimental measurements.
Figure 1.
Timing one control input controls both position and velocity
. The double integrator starts at and runs to . Left: for one time unit, then for one time unit. Middle: the analytic state path ends at , after reaching when braking begins. Right: unit inputs on the first and second halves separately contribute and to the endpoint. Their linear combinations fill the plane when input amplitudes are unrestricted real numbers; subtracting the second contribution from the first gives . Details.
Controllability is useful before trying to design a controller: a requested endpoint outside the reachable set cannot be attained by clever choice of feedback control. The Kalman rank criterion makes this an exact linear algebra calculation for the stated linear time-invariant system model. It concerns whole states, so attaining one plant output is not enough to establish controllability. In quantum control, the declared state space may be an orbit constrained by conservation laws; see quantum controllability and unitary orbit of a density operator.
Dan Margalit (mathematician) Created 2026-10-24 Updated 2026-11-05
Coauthor with Joseph Rabinoff of an interactive linear algebra textbook. The text connects computations with the geometry of linear systems, eigenvectors and orthogonal projection.[ref]
Desargues's theorem 2026-10-31
For two projective triangles in a projective plane over a field, perspectivity from a point implies perspectivity from a line. The usual nondegenerate form assumes that the corresponding-side intersections are well defined and distinct. Its dual is the converse, by point-line duality. The result holds in the real projective plane; it is not an axiom valid in every abstract incidence plane.
One linear algebra proof explains the collinearity. Choose a representative of the center. Rescale the paired representatives to , , and , with nonzero coefficients in a nondegenerate configuration whose vertices differ from the center. The first corresponding-side intersection is represented by . Similarly choose and . Then , so the three representatives are linearly dependent. Their projective points are consequently collinear.
Primary source: Released examination archive, member 4224-1.pdf. The original nine-page scan identifies the University of Oxford Preliminary Examination in computer science on 14 June 2013. Questions 1–3 cover digital electronics, the datapath and file systems; Questions 4–6 cover linear algebra; Questions 7–8 use the supplied natural deduction rules on printed p. 9. The original p. 8 repeats Question 8(a)(i) as Question 8(a)(iii), and has a redundant closing parenthesis in Question 7(d)(i).
Primary source: Released examination archive, member 4224.pdf. The original nine-page cover identifies the Preliminary Examination in Computer Science, Trinity Term 2014, Friday 20 June. Questions 1–3 cover digital counters, the MIPS architecture and file systems; Questions 4–6 cover linear algebra; Questions 7–8 use the supplied natural deduction rules in Figures 1–3 on printed page 9.
Examination paper of the University of Oxford, Preliminary Examination in Computer Science, Trinity Term 2015, dated 19 June 2015. The original has seven pages; the last contains the prescribed natural deduction rules. Released archive: Lawrence Attachment.zip, member 2015-cs4.pdf. The paper's printed section order is linear algebra, digital electronics, and introduction to formal proof, despite the different ordering in its cover title.
Elizabeth Wong (mathematician) Created 2026-10-31 Updated 2026-11-05
Elizabeth Wong coauthored Sequential Quadratic Programming Methods by Philip E. Gill and Elizabeth Wong with Philip E. Gill. The review concerns constrained optimization, in which successive local quadratic problems determine steps and multiplier estimates.
Their work connects the design of optimization algorithms with the linear algebra needed to solve the local subproblems. The 2010 report's title page identifies the authors and institutional report number.[ref]
Erwin H. Bareiss 2026-11-05
Erwin H. Bareiss developed integer-preserving methods for Gaussian elimination. The Bareiss algorithm uses determinant identities to arrange divisions that are exact, reducing the growth of intermediate rational expressions.[ref]
An update combines two products and divides by a previous pivot. The reason this stays in the integers is structural: the quantities represent related minors satisfying Sylvester identity for bordered minors. This makes exact linear algebra practical without replacing the calculation by floating-point approximation.[ref]
Euclidean geometry Created 2026-09-24 Updated 2026-10-13
Euclidean geometry describes flat Euclidean space using lengths, angles, and rigid motions. A coordinate realization uses points , Euclidean distance
and angles determined by the dot product. The coordinate axes are a convenience: translations and rotations change coordinates while preserving these measurements. This makes Euclidean geometry useful for comparing figures and converting measurements along different directions into a single distance.
In the Euclidean plane, through a point outside a line there is exactly one parallel line. This is a standard equivalent formulation of the parallel postulate. Euclid's fifth postulate in the Elements instead describes when two lines meet using the interior angles made by a crossing line.[ref] The assumption has consequences we often take for granted: a triangle's interior angles sum to , and similar triangles can differ in size while keeping their angles. Comparing with spherical geometry reveals that these are properties of a particular geometry.
As a computed example, the diagonal from to in a rectangle has length . The Pythagorean theorem explains why perpendicular contributions add as squares. If the directions cease to meet at a right angle, the law of cosines supplies the missing angle-dependent term. The beauty is that a single distance formula unites geometric constructions, coordinate calculations, and orthogonality in linear algebra.
Make the assumptions visible: in a Cartesian coordinate system with orthogonal axes and the same length unit on each axis, take , and . The vectors and have dot product zero, establishing a right angle at before using the Pythagorean theorem. A sketch that merely looks like a right triangle supplies no such guarantee. Likewise, an image stretched horizontally and vertically by different amounts can distort both lengths and angles; a displayed shape and the assumptions defining it must be kept separate.
For a less origin-dependent measurement, take and . Their displacement vector is , so their Euclidean distance is again . Its Euclidean norm records the direct separation, whereas travelling first horizontally and then vertically covers length . This connects measuring a diagonal to locating two positions from a Cartesian coordinate system. A translation changes where the positions are recorded without changing their separation; a rotation changes the component values without changing the Euclidean norm.
Factor base Created 2026-10-14 Updated 2026-10-20
A factor base is a finite set of small prime numbers over which selected auxiliary integers are completely factored. Some methods also record a sign coordinate for , which is not a prime number. A positive integer supported entirely on the chosen factor base gives an exponent vector; reducing that vector modulo two records which prime exponents are odd integers. The product is a square of a number precisely when every prime exponent is an even integer.
For the original toy , use factor base and the two relations
The residues have exponent vectors and in the order . Adding the two vectors modulo two gives , so multiplying the residues gives . Consequently
and and . Neither individual residue was a square; combining the relations made all exponents even.
Figure 1.
A factor base turns two smooth relations into a congruence of squares through exponent parity
. The original example uses the ordered factor base . The rows and add to zero modulo two, giving residue product . The product of the original inputs is ; greatest common divisor calculations then extract seven and eleven. Details.
In a larger collection, choose relations with positive residues . If a nonempty selection has an even sum in every exponent coordinate, set
Then . Finding such a selection is a linear dependence problem over the finite field : the indicator vector of the chosen relations belongs to the kernel of a linear map given by the parity matrix. This is why a problem about prime factors recruits linear algebra. The final congruence of squares may still be trivial, so another selection can be needed. [ref].
There is a tradeoff: a small factor base gives a smaller parity matrix, but fewer auxiliary integers factor completely over it. A larger factor base accepts more relations but makes the linear algebra larger. Negative auxiliary values need an additional sign coordinate, and a selected product needs even sign parity as well as even prime exponents. Pomerance's account explains this balance and the historical development of combining smooth relations; the toy example omits algorithm-specific sieving and running-time claims. [ref].
Field with two elements Created 2026-10-20 Updated 2026-11-05
The field with two elements is , with elements and arithmetic modulo two. Its only nonzero element is its own multiplicative inverse; in particular, and . These rules satisfy the field axioms.
Interpreting as bits, addition is exclusive-or and multiplication is logical conjunction. For instance, in the vector space . This makes linear algebra over the field with two elements useful for binary linear codes and parity constraints.
Finite field Created 2026-09-24 Updated 2026-10-13
A finite field is a field with finitely many elements: addition, subtraction, multiplication, and division by a nonzero element all stay inside a finite collection. Write , or , for a finite field with elements. The subscript counts elements; it does not prescribe modular arithmetic modulo . The field with four elements is the smallest example where that distinction matters.
Every finite field has size , where is a prime number and is a positive integer. To see the counting mechanism, use its prime field : the finite field is a finite-dimensional vector space over . For a basis , every element has exactly one expression
Each coefficient has choices, so there are expressions. Here is the characteristic of a field and is the dimension of a vector space. Thus sizes are possible, whereas are not prime powers and cannot be finite field sizes.
Conversely, every prime power occurs, and any two finite fields of the same size admit a field isomorphism. These are classification statements, beyond the counting argument. See Conrad's Theorems 1.5, 2.2, and 2.7.[ref] Uniqueness means the arithmetic agrees after relabeling; it does not choose a basis, an irreducible polynomial for a quotient ring representation, or a particular field isomorphism. Even for the field with four elements, exchanging and preserves the arithmetic.
The appeal for coding theory is exact, finite arithmetic with reliable division: polynomial interpolation and linear algebra work over a finite alphabet. A Reed-Solomon code represents messages by polynomials and adds redundancy by evaluating them at several distinct finite field elements. Forney's MIT notes develop this arithmetic as preparation for such error-correcting codes.[ref] In cryptography, finite fields likewise supply exact arithmetic on finitely many symbols, with operations that can be implemented using bits.
Historically, Évariste Galois published work on finite fields beyond prime fields in 1830, constructing them by adjoining elements satisfying irreducible polynomials over prime fields. Conrad's historical account also records E. H. Moore's 1893 terminology, from which the name Galois field and notation descend.[ref]