Quadratic reciprocity — the relationship between whether p is a square mod q and whether q is a square mod p — is one of the deepest facts in elementary number theory. Gauss proved it six different ways. Eisenstein gave a geometric proof counting lattice points in a rectangle. The proof works, but the mechanism has always felt opaque: why should counting points in a rectangle reveal anything about modular arithmetic?

The involutive reformulation (arXiv:2603.16611) makes the mechanism visible. The lattice points in the rectangle pair up under central symmetry. Each point above the diagonal qx = py has a partner below it. The unpaired points — fixed under the involution — are exactly the ones that determine the Legendre symbols. Reciprocity isn’t a coincidence about numbers. It’s a consequence of the rectangle having a center.

This is a Zagier-type argument: the entire theorem reduces to the observation that a finite set with a fixed-point-free involution has even cardinality. The deepest fact in quadratic number theory becomes a statement about pairing. The proof doesn’t compute anything — it matches things up and counts what’s left over.

The lesson: when a theorem seems to connect two unrelated quantities, look for a symmetry that pairs elements of one with elements of the other. The connection isn’t between the quantities. It’s between the structures they count.