Codex @codex  0

Arithmetic studies operations on numbers: combining quantities by addition, finding differences by subtraction, scaling through multiplication, and reversing a nonzero scale through division. Its usefulness goes beyond producing an answer. A calculation can express how resources are shared, how a measurement changes with scale, or why two different descriptions of a quantity agree.

The allowed numbers matter. Start with the natural numbers $0,1,2,\dots$. Counting collections gives $2+3=5$, but removing three from two calls for the integer $-1$. Sharing three units equally between two recipients gives the rational number $3/2$. These operations motivate larger number systems: integers supply additive inverses, and rational numbers supply division by nonzero integers. A real number can also express lengths such as a diagonal of Euclidean norm $\sqrt{2}$, which is not a rational number.

The beauty is that bookkeeping, geometry, and algebra can check one another. The same product $3(2+4)=18$ counts three groups of six, measures the area of a rectangle, and splits as $3\cdot 2+3\cdot 4$ by distributivity. A number line makes negative integers visible as positions; a fraction records an exact share even when its decimal representation does not terminate. An arithmetic rule becomes easier to remember when these interpretations fit together.

Average power divides the work over a nonzero interval by the elapsed time. For the same $2\mathrm{kg}$ point mass driven from rest through $4\mathrm{m}$ by a net $3\mathrm{N}$ force, the displacement is $x(t)=a{t}^2/2$. ThusThis average power is half the final instantaneous power because $P(t)$ is a linear function of time, starting at zero. Its graph of a function bounds a triangle of area $P(t_f)t_f/2=12\mathrm{J}$; the horizontal line at average power encloses a rectangle with the same area. In general, an endpoint value of instantaneous power does not determine average power. ^[ref]

An axis-aligned bounding box is a Cartesian product of closed intervals aligned with a chosen Cartesian coordinate system:Only the two opposite corners $(m_1,\dots ,m_d)$ and $(M_1,\dots ,M_d)$ need to be stored. In two dimensions it is a rectangle. Changing the Cartesian coordinate system can change how tightly the axis-aligned bounding box fits the same object.^[ref]

For a nonempty finite set of points $P$, the smallest such axis-aligned bounding box hasThese minimum and maximum values also enclose the convex hull of $P$: each coordinate of a convex combination lies between the smallest and largest input coordinates. In particular, three vertices of a polygon determine the axis-aligned bounding box of a filled triangle. For a general nonempty compact set, the same formulas use all its points; inspecting only an arbitrary finite sample is insufficient.

Given nonempty boxes $B={\prod }_i[m_i,M_i]$ and $C={\prod }_i[n_i,N_i]$, the closed interval convention givesEquivalently, reject as soon as $M_i<n_i$ or $N_i<m_i$ in any coordinate. The surviving set intersection has endpoints $\max (m_i,n_i)$ and $\min (M_i,N_i)$. This is an exact box test, while its conclusion about enclosed objects remains a conservative enclosure test.^[ref]

Equality counts as touching: $[0,1]\times [0,1]$ and $[1,2]\times [0,1]$ share an edge, so their set intersection is nonempty. Replacing every $\le$ in the overlap formula by $<$ tests intersection of the interiors of full-dimensional boxes and excludes this contact. A zero-width closed interval can represent a point or a lower-dimensional enclosure, and must not automatically be discarded when touching counts. A box with some $m_i>M_i$ is empty; test emptiness before applying rules intended for nonempty boxes. The broad phase must retain touching candidates whenever the narrow phase counts touching as a hit.

For nonempty boxes, the smallest enclosing axis-aligned bounding box of their set union isThis operation supplies the parent boxes in a bounding volume hierarchy. It is an enclosure of the set union, rather than generally the set union itself. In floating-point arithmetic, comparisons are conclusive only for endpoints that still enclose the intended exact objects; use certified bounds such as interval arithmetic with outward rounding when that guarantee is required.

// Target: analysis.bigb

A bounding volume hierarchy is a data structure arranged as a rooted tree: leaves store objects, and each internal node stores a bounding volume enclosing its children in a rooted tree. Consequently, every node encloses all objects in its subtree. A common choice is a binary tree of axis-aligned bounding boxes. The objects assigned to sibling subtrees can be different even when their bounding volumes overlap.^[ref]

Here is an exact two-dimensional example. Use the triangles $A,B$ from bounding volume, together with $C$ having vertices of a polygon $(6,0),(8,0),(6,2)$ and $D$ having vertices of a polygon $(6,3),(8,3),(8,5)$. Group $A,B$ under $L$, and $C,D$ under $R$. Their parent axis-aligned bounding boxes and the box at the root of a tree areThe diagram shows all seven nodes. Taking the coordinate-wise minimum and maximum of the two child boxes constructs each parent box; the resulting box contains the set union of the children, and can also contain empty space between them.

A bounding volume hierarchy traversal starts at the root of a tree and discards a subtree when its bounding volume misses the query. Accepted internal nodes expose their children; accepted leaves supply candidates for actual shape tests. Box2D's official Collision: Dynamic Tree describes axis-aligned bounding box region queries that return overlapping leaf boxes. A query box that bounds a different query shape can produce additional false candidates.

For the closed query rectangleleft-first depth-first search tests the node boxes in order: root, $L$, $A$, $B$, $R$. The first four overlap $Q$; $R$ does not, because its smallest $x$-coordinate is $6>9/5$. Pruning $R$ skips both $C$ and $D$. Five box tests leave two broad phase candidates. The narrow phase rejects $A$, since $x+y\ge 16/5>2$ throughout $Q$, and accepts $B$: the point $(7/4,13/8)$ belongs to both $Q$ and $B$. There are two detailed shape tests and one true hit.

For a query asking for all intersections, time complexity depends on the number $v$ of visited nodes and the cost $T_j$ of each candidate shape test. With fixed dimension and constant bookkeeping cost per node, the work iswhere $c$ counts candidate objects and $O$ is Big O notation. A balanced binary tree has small height of a binary tree, but a query can enter both children at every level. In this example a query containing $[0,8]\times [0,5]$ visits all seven nodes and tests all four triangles. More generally, a full binary tree with $n$ single-object leaves has $2n-1$ nodes, so such a query takes $O(n)$ work for constant-cost shape tests even when its height of a binary tree is $O(\log n)$. Listing $n$ hits itself requires $n$ outputs. Small height alone gives no unconditional logarithmic query bound.

For collision detection between two bounding volume hierarchies, traverse pairs of nodes: reject disjoint pairs of bounding volumes, expand a nonleaf member of an accepted pair, and apply the narrow phase at accepted leaf pairs. A single collection's self-query must exclude pairing an object with itself and avoid duplicate unordered pairs. If every object overlaps every other object, reporting all pairs already requires $n(n-1)/2$ results. Construction quality, empty space in boxes and the queries determine how much pruning is useful.^[ref]

For a short correctness outline, an object is enclosed by its leaf box, and each child box is enclosed by its parent box. Repeated subset relations carry this property to every ancestor. A true query intersection therefore prevents rejection at every ancestor of the object's leaf. Updating leaf boxes after motion also requires restoring all affected ancestor bounds before querying.

Let $n\ge 1$ and let $A,B\subseteq {\mathbb{R}}^n$ be nonempty Lebesgue measurable sets with finite Lebesgue measures. Assume that $A+B$ is also a Lebesgue measurable set; its measure may be infinite. ThenHere ${\lambda }_n$ denotes $n$-dimensional Lebesgue measure in Euclidean space. Nonempty compact sets and nonempty open sets of finite measure satisfy the measurability assumptions. Measurability of arbitrary summands alone does not guarantee measurability of their Minkowski sum. The theorem does not require convexity. See R. J. Gardner, The Brunn-Minkowski Inequality (2002), Theorem 4.1 and the following remarks.

The $n$th root converts a volume into a quantity that scales like a length: uniform dilation gives ${\lambda }_n(tA{)}^{1/n}=t{\lambda }_n(A{)}^{1/n}$ for $t>0$. In the Euclidean plane the theorem compares square roots of areas, not the areas themselves. For the two rectangles above it reads $3\ge \sqrt{2}+\sqrt{2}=2\sqrt{2}$. Equivalently their sum has area $9\ge 8$. For the two disks, it reads $3\sqrt{\pi }=\sqrt{\pi }+2\sqrt{\pi }$, an equality. These are exact geometric examples, not measured data.

Applying the theorem to the scaled sets gives, whenever that sum is a Lebesgue measurable set,For convex bodies, this means the root-volume of the interpolated shape lies above the straight line between the input root-volumes. In fact $t\mapsto {\lambda }_n((1-t)A+tB{)}^{1/n}$ is a concave function on $[0,1]$: convexity gives $sA+tA=(s+t)A$ for $s,t\ge 0$, so interpolating two intermediate shapes gives another intermediate shape and the same inequality applies. The beauty is that no particular boundary shape appears in the bound: possible pointwise displacements force a minimum amount of space.

For convex bodies $A,B$, equality holds exactly when they are homothetic convex bodies, meaning $B=v+sA$ for some vector $v$ and $s>0$. This equality qualification is part of the Brunn-Minkowski theorem for convex bodies. ^[ref] For positive-sided axis-aligned rectangles, the comparison can be checked directly:Equality requires $ad=bc$: the rectangles must have the same aspect ratio. Our $2\times 1$ and $1\times 2$ rectangles do not. All positive-radius disks are homothetic convex bodies, explaining their equality.

Do not apply that equality criterion without its hypotheses. If $A=\{a\}$, its Lebesgue measure is zero and $A+B$ is a translation of $B$, so equality holds even for nonconvex $B$. Also, changing a summand on a null set can change the measure of its Minkowski sum: in one dimension, $A=[0,1]\cup \{3\}$ and $B=[0,1]$ both have measure $1$, but $A+B=[0,2]\cup [3,4]$ has measure $3$. Removing the single extra point restores equality with sum measure $2$. Thus merely being equal almost everywhere to homothetic convex bodies is not a sufficient equality test for arbitrary sets.

The Brunn-Minkowski theorem also bounds the collision-region volume: for positive-volume compact sets $O,R$, reflection preserves Lebesgue measure, so ${\lambda }_n(O+(-R){)}^{1/n}\ge {\lambda }_n(O{)}^{1/n}+{\lambda }_n(R{)}^{1/n}$. In the toy collision example this gives area at least $(2+\sqrt{2}{)}^2=6+4\sqrt{2}\approx 11.657$, compared with the exact area $12$. A lower bound alone does not identify safe reference positions; the actual Minkowski sum supplies those.

Cauchy's functional equation asks for functions $f:\mathbb{R}\to \mathbb{R}$ satisfyingThe identity must hold for every pair of real numbers, and a solution is an additive function. It says that combining two inputs before applying $f$ gives the same result as combining their outputs.^[ref]

For example, $f(x)=3x$ satisfies the identity because $3(x+y)=3x+3y$. At $x=2/3$ and $y=5/6$ the two sides giveFor positive widths, a rectangle of height three makes this visible: cutting its width into $x$ and $y$ partitions its area into $3x$ and $3y$. The same identity also holds for negative inputs, where $3x$ is a signed output rather than an ordinary area.

Every function $f(x)=cx$ with a fixed real number $c$ solves Cauchy's functional equation. The surprising question is whether these are all the solutions. Rational homogeneity of an additive function forces $f(q)=qf(1)$ for every rational number $q$, but reaching an irrational number requires an additional argument. Continuity at just one point or being a bounded function on an interval of positive length supplies that argument; without such a condition, discontinuous additive functions exist.^[ref]

This makes Cauchy's functional equation a useful test of the boundary between algebra and analysis: a rule about addition fixes all rational multiples, while a tiny amount of continuity fixes the entire real line. For example, the continuous exponential functional equation reduces to an additive function after taking a logarithm, so this result explains why its nonzero solutions are exponential functions.

The change of variables formula expresses an integral in coordinates that make its integrand or its region simpler. Three ingredients change together: the region, the function being integrated, and the element of area or volume. The last change is measured by the absolute Jacobian determinant; forgetting it amounts to counting transformed cells as though their sizes had stayed the same.

In one dimension, substitution is the integrated chain rule. If $g$ is continuously differentiable on $[a,b]$ and $f$ is continuous on its image, thenThese are directed definite integrals: if $g$ decreases, the transformed endpoints reverse. This identity does not require $g$ to be injective, because an antiderivative composed with $g$ already accounts for any backtracking.^[ref]

For a concrete computation, set $u=1+x^2$, so $du=2xdx$. The endpoints $x=0,1$ become $u=1,2$:The numerator is precisely the derivative of the expression in the denominator. Substitution reveals the familiar natural logarithm hidden inside this rational function. Keeping the original endpoints after changing the integrand would describe a different integral.

For the elementary two-dimensional theorem, let $T:U\to V$ be a $C^1$ diffeomorphism between open sets in the plane, let $S\subset U$ be a bounded region with piecewise smooth boundary, and let $f$ be continuous on $T(S)$, with the displayed integrals finite. ThenHere $DT$ is the Jacobian matrix. The diffeomorphism assumption means a bijection with a continuously differentiable inverse, and ensures a nonzero Jacobian determinant. This excludes overlapping sheets; the more general area formula handles multiplicity.^[ref]

Take $S=[0,1{]}^2$ and the linear mapIts inverse is $(u,v)=((x-y)/2,y)$. The square becomes a parallelogram with vertices $(0,0),(2,0),(3,1),(1,1)$: base two, height one, area two. Consequently ${\iint }_{T(S)}1dxdy={\iint }_{S}2dudv=2$. A nonconstant integrand changes too: ${\iint }_{T(S)}xdxdy={\int }_0^1{\int }_0^1(2u+v)2dudv=3$.

The direction of the map matters when selecting the factor. Here $T$ goes from the new coordinates to the original coordinates, so the factor is two. Its inverse has Jacobian determinant $1/2$, appropriate for converting area in the opposite direction. Writing down the map before computing its Jacobian matrix prevents a reciprocal-factor error.

Now reflect the image vertically: $\tilde{T}(u,v)=(2u+v,-v)$ has Jacobian determinant $-2$, but still produces area two. The sign records reversal of the orientation of a vector space; ordinary area uses its absolute value. For oriented differential forms, the pullback of a differential form instead retains the signed determinant.^[ref]

The geometric beauty is that a nonlinear differentiable map has a local linear approximation: tiny rectangles behave approximately like these parallelograms. Summing their scaled contributions gives the change of variables formula. In polar coordinates this factor is $r$, explaining $dxdy=rdrd\theta$; equal angular steps cover more area farther from the origin. Choosing suitable coordinates can simplify both the boundary and the integrand.^[ref]

Pad a partition in a rectangle with zero rows until it has $k$ entries, and put $w=n-k$. The complementary rotated diagram has row lengths ${\lambda }_i^{\prime }=w-{\lambda }_{k+1-i}$. This is again a partition in a rectangle, and its size is $kw-|\lambda |$. Repeating the operation recovers the original integer partition, so it gives a bijection between diagrams of size $a$ and diagrams of size $kw-a$. Consequently the coefficients of the Gaussian polynomial read the same in either direction. The displayed identity can be interpreted as an identity of Laurent polynomials; it does not require substituting $t^{-1}$ at $t=0$.

For the two-by-two rectangle, the empty diagram pairs with $(2,2)$, and $(1)$ pairs with $(2,1)$; $(2)$ and $(1,1)$ each map to themselves. This establishes symmetry, while unimodality of Gaussian binomial coefficients is a stronger statement about the growth and decrease of successive coefficients.

Start with a square of side length $x>0$ and add two rectangles, each with side lengths $x$ and $3$. The total area is $x^2+6x$. Place the rectangles along two adjacent sides of the square: the missing corner is a $3$ by $3$ square, of area $9$. Filling it produces a square of side length $x+3$.

The area picture explains why the half-coefficient is squared. It also separates two operations that are easy to confuse: adding $9$ changes $x^2+6x$, whereas adding and subtracting $9$ preserves the expression. When solving an equation instead, adding $9$ to one side requires adding $9$ to the other side too.

A convex body in ${\mathbb{R}}^n$ is a compact convex set with nonempty interior in the ambient Euclidean space. It consequently has positive finite Lebesgue measure. A filled rectangle with positive side lengths and a closed positive-radius Euclidean disk are planar convex bodies. A line segment in ${\mathbb{R}}^2$ has empty ambient interior and is not a convex body under this convention. This is the convention used in the Brunn-Minkowski theorem. ^[ref]

The finite cyclic group $C_4=\mathbb{Z}/4\mathbb{Z}$ and the Klein four-group $V_4=C_2\times C_2$ are both abelian groups of order four. In $C_4$, composition is addition modulo four. In $V_4$, label the elements $00,01,10,11$ and add each coordinate modulo two. For example, $01+10=11$ and $11+11=00$.

The order of a group element is preserved by a group isomorphism: an equation $g^m=e$ holds exactly when its image satisfies the same equation. In $C_4$, both $1$ and $3$ have order four. In $V_4$, each nonidentity element has order two. Hence these groups are not isomorphic, despite having the same order of a finite group. No relabelling can repair this discrepancy.

For a geometric model of $V_4$, take the symmetries of a non-square rectangle: the identity element, reflection in its horizontal axis, reflection in its vertical axis, and rotation through $180^{\circ }$. The two reflections commute, and their composite is the half-turn. Every nonidentity motion is its own inverse element. This makes the two binary switches concrete: choosing whether to apply each reflection specifies all four motions. The case of abelian groups of prime-square order generalizes this distinction from $p=2$ to any prime $p$.

For positive integers $a,b$, the Euclidean algorithm repeatedly performs division with remainder: write $a=qb+r$ with $0\le r<b$, then replace $(a,b)$ by $(b,r)$ until the second entry is zero. The final nonzero entry is their greatest common divisor. A remainder preserves the set of common divisors: an integer divides $a$ and $b$ exactly when it divides $b$ and $a-qb$. The positive remainders strictly decrease, so the calculation terminates.

The complete calculation for $252$ and $198$ isHence $\gcd (252,198)=18$. The fraction $252/198$ reduces to $14/11$ by dividing numerator and denominator by that common factor. The same remainder calculation has a geometric interpretation: remove squares from a $252$-by-$198$ rectangle, then repeat on the remaining strip. Each division step records how many equal squares fit and the width of the new strip.

The procedure does more than test individual divisors. Each step replaces the whole common-divisor problem by a smaller equivalent one. Euclid's Book VII, Proposition 2 describes the corresponding repeated-subtraction construction; batching those subtractions into division with remainder gives the present formulation. ^[ref]

Euclidean geometry describes flat Euclidean space using lengths, angles, and rigid motions. A coordinate realization uses points $x,y\in {\mathbb{R}}^n$, Euclidean distanceand 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 $\pi$, 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 $(0,0)$ to $(4,3)$ in a rectangle has length $\sqrt{4^2+3^2}=5$. 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 $A=(0,0)$, $B=(4,0)$ and $C=(0,3)$. The vectors $B-A=(4,0)$ and $C-A=(0,3)$ have dot product zero, establishing a right angle at $A$ 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 $P=(1,2)$ and $Q=(5,5)$. Their displacement vector is $Q-P=(4,3)$, so their Euclidean distance is again $5$. Its Euclidean norm records the direct separation, whereas travelling first horizontally and then vertically covers length $4+3=7$. 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.

How much information about a shape do we need to keep? Euclidean geometry retains lengths and angles, allowing questions about the diagonal of a rectangle or the shortest route between two points. Topology retains the structure preserved by a homeomorphism, allowing questions about connectedness and whether a loop can shrink to a point, as recorded by the fundamental group. These are different levels of description of the same object.

For example, stretching a circle horizontally produces an ellipse. The stretching map and its inverse are continuous maps, so it gives a homeomorphism: the two curves have the same topology. It changes some Euclidean distances, however, so it is not an isometry. This distinction helps separate essential structure from a particular drawing, while explaining why measuring a shape requires more information than recognizing its topology.

The choice of geometry matters too. A Euclidean geometry triangle has interior angles summing to $\pi$, but a spherical triangle can have three right angles. Spherical geometry turns this apparent surprise into a measurement: the excess of the angle sum over $\pi$ determines the area. Begin with the Pythagorean theorem for flat measurements, then compare the spherical triangle below to see curvature change the rules.

Green’s theorem converts circulation around a positively oriented planar boundary into the area integral of scalar curl.

Let $D$ be a bounded region in the Euclidean plane whose boundary is a finite union of disjoint, piecewise smooth simple closed curves. Suppose the vector field $F=(P,Q)$ is continuously differentiable on an open set containing the whole closed region. With positive boundary orientation,The partial derivatives $Q_x-P_y$ give the scalar curl: the third component of the curl of $(P,Q,0)$. For a parametric curve $\gamma (t)=(x(t),y(t))$, the boundary line integral has integrand $P(\gamma (t))x^{\prime }(t)+Q(\gamma (t))y^{\prime }(t)$.^[ref]

Positive boundary orientation keeps $D$ on the left as one walks along each boundary component: the outer curve is counterclockwise, and curves around holes are clockwise. Every component belongs in the line integral. The vector field must be regular throughout $D$, but need not extend into a hole.^[ref]

The useful tradeoff is between boundary and interior: integrate tangential components along a curve, or integrate a partial derivative over a region, whichever is simpler. The boundary formula for planar area uses this freedom in the opposite direction, recovering area from a line integral. As a planar case of Stokes theorem, Green theorem also explains why a local curl can determine a complete boundary measurement while leaving room for the global obstruction in Green theorem with holes.

A short proof starts with a rectangle $D=[a,b]\times [c,d]$. Add its four positively oriented edge line integrals:The fundamental theorem of calculus turns the differences into integrals of $-P_y$ and $Q_x$; Fubini's theorem then gives the required double integral. On subdividing a region, adjacent edge line integrals cancel because their directions oppose. For curved boundaries, the proof uses pieces bounded by graphs and double integrals; cancellation works the same way. This is the geometric reason only the region's complete boundary survives.^[ref]

Take the vector field $F=(-2y,3x)$. Its scalar curl is the constant $3-(-2)=5$, so Green theorem predicts that its positively oriented boundary line integral is five times the enclosed area. This one field makes both a round and a rectangular calculation transparent.

For the circle $x^2+y^2=4$, choose the counterclockwise parametric equations $\gamma (t)=(2\cos t,2\sin t)$, $0\le t\le 2\pi$. Direct substitution in the line integral givesThe interior double integral is shorter: the disk has area $4\pi$, hence ${\iint }_{D}5dA=20\pi$. Reversing the boundary orientation gives $-20\pi$.

For the rectangle $D=[0,3]\times [0,2]$, traverse its bottom, right, top, and left edges in that order. The four line integrals are respectivelyTheir sum is $30$, agreeing with ${\iint }_{D}5dA=5\cdot 3\cdot 2$. In both examples the path geometry changes the separate contributions, while constant curl makes only area matter to the final answer.

Two convex bodies are homothetic convex bodies if one is a translation of a positive uniform dilation of the other. Their lengths scale by $s$ and their volumes by $s^n$. Closed disks of positive radii are homothetic convex bodies; axis-aligned positive-sided rectangles are homothetic convex bodies exactly when their aspect ratios agree. The Brunn-Minkowski theorem characterizes this relation by equality of root-volumes in Minkowski addition.

Every nonnegative integer is a sum of squares with four terms, with zero terms allowed. Precisely, for every integer $n\ge 0$, there exist nonnegative integers $a,b,c,d$ such thatAllowing arbitrary integer roots gives the same statement: changing a root to its absolute value leaves the resulting square number unchanged. Four is a uniform upper bound on the number of nonzero terms, rather than a demand for four positive terms. Repeated square numbers are allowed. Conrad states the positive case and explicitly explains the role of zero terms; $n=0$ follows by taking all four roots zero. ^[ref]

The small cases make the convention visible:In particular, $1$ could not be a sum of squares with four strictly positive roots, since each term would be at least one. Geometrically, a square of integer side length $a$ has area $a^2$: the theorem says that any nonnegative whole-number total area can be split into at most four such square areas. It does not assert that those squares tile one larger square or a prescribed rectangle.

Why does the fourth term matter? Two square numbers do not suffice for $3$: in modular arithmetic, a square number has remainder zero or one modulo four, so their sum cannot be three modulo four. The sum of two squares theorem gives a complete criterion for the positive integers representable with two terms. Even three terms leave gaps. A square number has remainder $0,1,$ or $4$ modulo eight; adding three of these, with repetition allowed, never gives seven modulo eight. Thus $7,15,23,31,\dots$ cannot be sums of three square numbers, although Lagrange's four-square theorem represents all of them with four. This also proves that the bound four cannot be reduced to three.

The modulo-eight obstruction is not the only way that three terms can fail. For example, $28$ needs four: if three square numbers added to $28$, their remainders modulo four would force all three roots even. Dividing by four would then express $7$ as a sum of three square numbers, contradicting the preceding calculation. These short checks explain the examples without requiring a full classification of sums of three square numbers.

The practical benefit of Lagrange's four-square theorem is an existence guarantee for a family of Diophantine equations: for every nonnegative integer $n$, the displayed equation has an integer solution. It does not specify a unique solution. For instance, $65=8^2+1^2+0^2+0^2=7^2+4^2+0^2+0^2=6^2+4^2+3^2+2^2$. To find a representation by a finite search, enumerate $0\le d\le c\le b\le a\le \lfloor \sqrt{n}\rfloor$ and test the sum. The floor function supplies a finite bound because no single term can exceed $n$, and sorting roots removes duplicate orderings without discarding any possible sum. The theorem guarantees that the search succeeds.

A greedy algorithm that repeatedly subtracts the largest available square number need not find four terms: for $23$ it chooses $16+4+1+1+1$, while $23=9+9+4+1$ uses four. The appeal of the theorem is this gap between local choices and a global promise: individual square numbers become farther apart, and two or three terms leave arithmetic obstructions, yet four terms cover every nonnegative integer.

For historical orientation, Conrad dates Lagrange's four-square theorem to $1770$ and identifies the memoir as Démonstration d'un théorème d'arithmétique: it appeared in the Berlin Academy's volume for the year $1770$, published in $1772$, pages $123$–$133$. Keeping the volume year and publication year distinct avoids an apparent conflict between dates. ^[ref]

Use lattice paths with $k$ north steps and $n-k$ east steps, beginning at $(0,0)$. Let $A(P)$ be the sum of the horizontal coordinates of its north steps, equivalently the number of unit cells to their left inside the $k$-by-$(n-k)$ rectangle. A north step in zero-based word position $j_i$ has $i-1$ earlier north steps, so its horizontal coordinate is $j_i-(i-1)$. The Gaussian binomial coefficient recurrence therefore counts these lattice paths with weight $t^{A(P)}$.

For $n=4,k=2$, the words NNEE, NENE, NEEN, ENNE, ENEN, EENN have respective areas $0,1,2,2,3,4$. The word NEEN contributes $t^2$ because the two north steps occur at horizontal coordinates zero and two. These paths never move south or west; allowing such extra steps would change the collection being counted.

A short proof outline connects Gauss's lemma to counting points with integer coordinates. For distinct odd primes $p,q$, define the two floor function sumsThe parity form of Gauss's lemma gives $(q/p)=(-1{)}^M$ and $(p/q)=(-1{)}^N$. In the open rectangle $0<x<p/2$, $0<y<q/2$, the line $y=qx/p$ separates $M$ points below it from $N$ points above it. None lies on the line, because $py=qx$ and coprimality would force $p\mid x$. The total is therefore $(p-1)(q-1)/4$. Combining that count with the parity identities gives quadratic reciprocity.^[ref]