All possible pythagorean triples, visualized

Pythagorean triples—integer side lengths (a, b, c) satisfying a² + b² = c²—can be generated and visualized in a single, surprisingly structured way: take lattice points in the complex plane and repeatedly square them. Every lattice point (u, v) corresponds to the complex number u + vi, whose distance from the origin is √(u² + v²). Squaring u + vi produces (u² − v²) + (2uv)i, and the new point’s distance from the origin becomes u² + v², a guaranteed whole number. That algebraic “machine” turns any integer pair (u, v) into a Pythagorean triple, with the legs given by |u² − v²| and |2uv| and the hypotenuse by u² + v². Examples fall out immediately: (3 + 2i)² = 5 + 12i yields the 5–12–13 triangle, and (4 + i)² = 15 + 8i yields the 8–15–17 triangle.

The visualization comes from applying the transformation z → z² to the entire integer grid. Under squaring, straight grid lines warp into parabolic arcs. Where these arcs intersect land on squared lattice points—exactly the points whose distance from the origin is an integer, hence the endpoints of hypotenuses for right triangles with integer legs. This reframes triples from scattered curiosities into an organized geometric pattern: instead of isolated solutions, they cluster at predictable intersections.

But the method doesn’t hit every triple directly. Some valid triples correspond to lattice points that never appear as z² for integer z. The transcript gives concrete misses such as 6 + 8i (the 6–8–10 triple) and 9 + 12i, and notes that points with odd imaginary parts are never produced. The key fix is to account for scaling: even when a primitive triple’s point is missing, its multiples can still be recovered. For each point produced by squaring, draw the ray from the origin through that point; every lattice point on that ray corresponds to a scaled-up triple. Doing this for all squared lattice points fills in the gaps left by the initial squaring step.

To justify that nothing is still missing, the argument shifts to rational points on the unit circle. Dividing a² + b² = c² by c² turns it into x² + y² = 1 with x = a/c and y = b/c, so every integer triple corresponds to a rational point on the unit circle. Squaring lattice points and projecting along rays produces a set of rational points on that circle; the remaining question is whether any rational point could evade all rays. The transcript rules that out by using slopes: connect any rational point on the circle to −1, observe that the line’s slope is rational, and show that the squaring construction realizes every possible rational slope. Because the rays from the origin cover all rational slopes, they must pass through every rational point on the unit circle, meaning every integer Pythagorean triple is accounted for somewhere in the diagram.

In short: squaring lattice points generates a structured subset of triples, scaling along rays completes the set, and a slope-based rational-circle argument guarantees the completion is total.