The Law of Squares: How a Prime Reads a Loop

This is paper 11 of the cut square series. Paper I gave every box an algebra of length types on a loop, with real weights. Here the weights are whole numbers, and three things appear that real weights hide. First, the loop breaks into pieces without zero divisors, one for each sub-loop, cut out by products of (unit − whole of a sub-loop) with a fixed pattern of signs. Paper I's algebra has no zero divisors exactly when the number of types is prime. Second, the loop has symmetries, "run the loop j times", which commute. Third, a prime p is one of them: when the whole weights are reduced by p, the p-th power of a ledger is that ledger on the loop run p times, and the number of pieces the loop breaks into is counted by how soon p returns. A type on a loop is a ledger that every symmetry only steps. Types multiply, and a ledger of all whole numbers placed at their types is a ledger product over the primes, in which gross and net do not mix. On a loop of a prime number p of steps, the ledger of the squares is a type ledger, and its square is p for a height prime and −p for a width prime. Letting a second prime q act on it as a symmetry gives the law of squares: q is a square on the p-loop exactly when p is a square on the q-loop, unless both are width primes, when exactly one is. The number −1 is a square on the p-loop exactly for height primes, and 2 exactly when the p-th power of the cut of the unit keeps its hidden part positive; that case is read off from (1+i)² = 2i. A corollary gives the law for a loop of any length. The paper states how far this road reaches, which is every case with commuting symmetries over the rational numbers, and where it stops (t³ = 2). The same ledgers count the whole points of a given size on the line, in the plane, and in the quaternions and octonions. All statements are proved or cited and checked numerically. The accompanying Python script (verify_law_of_squares.py) runs 56 checks, one printed line each, in under ten seconds.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24243069
Primary Topic
Mathematics and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Law of Squares: How a Prime Reads a Loop

Eric Guideng
Zenodo (CERN European Organization for Nuclear Research)
Mathematics and Applications
preprint

The Law of Squares: How a Prime Reads a Loop

Eric Guideng
preprint en

Abstract

This is paper 11 of the cut square series. Paper I gave every box an algebra of length types on a loop, with real weights. Here the weights are whole numbers, and three things appear that real weights hide. First, the loop breaks into pieces without zero divisors, one for each sub-loop, cut out by products of (unit − whole of a sub-loop) with a fixed pattern of signs. Paper I's algebra has no zero divisors exactly when the number of types is prime. Second, the loop has symmetries, "run the loop j times", which commute. Third, a prime p is one of them: when the whole weights are reduced by p, the p-th power of a ledger is that ledger on the loop run p times, and the number of pieces the loop breaks into is counted by how soon p returns. A type on a loop is a ledger that every symmetry only steps. Types multiply, and a ledger of all whole numbers placed at their types is a ledger product over the primes, in which gross and net do not mix. On a loop of a prime number p of steps, the ledger of the squares is a type ledger, and its square is p for a height prime and −p for a width prime. Letting a second prime q act on it as a symmetry gives the law of squares: q is a square on the p-loop exactly when p is a square on the q-loop, unless both are width primes, when exactly one is. The number −1 is a square on the p-loop exactly for height primes, and 2 exactly when the p-th power of the cut of the unit keeps its hidden part positive; that case is read off from (1+i)² = 2i. A corollary gives the law for a loop of any length. The paper states how far this road reaches, which is every case with commuting symmetries over the rational numbers, and where it stops (t³ = 2). The same ledgers count the whole points of a given size on the line, in the plane, and in the quaternions and octonions. All statements are proved or cited and checked numerically. The accompanying Python script (verify_law_of_squares.py) runs 56 checks, one printed line each, in under ten seconds.

Zenodo (CERN European Organization for Nuclear Research)
Mathematics and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon