Sign vectors, as residues
15 = 3·5 gives 2² = 4; 1155 = 3·5·7·11 gives 2⁴ = 16 — one residue per ± choice across four places.
Hypercomplex algebras introduces i_k, j_k and ε_k as formal generators with a square attached. But you do not have to adjoin them — ℤ/m already contains them, and which ones it contains is decided one prime at a time. This page follows that all the way down.
The Chinese Remainder Theorem splits the ring: for m=∏piai,
Z/m≅i∏Z/piaiand a ring isomorphism carries x2=1 to the same equation in each factor independently. So a square root of 1 mod m is a choice of root in each channel — and an odd prime power pa has exactly two, ±1, because (Z/pa)× is cyclic and so has a unique element of order 2.
Counting is then immediate. For odd m,
#{x:x2≡1(modm)}=2ω(m)with ω(m) the number of distinct primes dividing m. These 2ω(m) residues are exactly the ±1 sign vectors over the CRT channels — a spectral basis, one coordinate per place. Two of them, 1 and m−1, are the trivial pair; every other one is a genuine split unit, a square root of 1 that is not ±1.
15 = 3·5 gives 2² = 4; 1155 = 3·5·7·11 gives 2⁴ = 16 — one residue per ± choice across four places.
The rows of that second list are the sign vectors: 1 is (+,+,+,+), 1154 is (−,−,−,−), and the fourteen in between are the mixed ones. Reading a residue as a vector of signs is the whole content of the CRT here.
The clean law is stated for odd m because 2 misbehaves, and it misbehaves in a way worth seeing: Z/2 has one root of 1, Z/4 has two, and Z/2a for a≥3 has four — namely ±1 and ±1+2a−1. The unit group stops being cyclic at 8, so it acquires a second independent element of order 2.
Now ask the same question for x2=−1. Again it decomposes channel by channel, but now most channels have nothing to offer: Z/p has a square root of −1 iffp≡1(mod4). So
x2≡−1(modm) is solvable⟺every odd prime factor of m≡1(mod4), and 4∤m.Half the primes qualify, by Dirichlet. This is the asymmetry that makes split units the generic case and imaginary units special — and it is the same asymmetry that makes R[j]/(j2−1)≅R×R split while R[i]/(i2+1)≅C does not.
65 = 5·13, both ≡ 1 (mod 4), so two channels each contributing two roots. 15 = 3·5 has none: 3 ≡ 3 (mod 4) kills it.
Finding a root mod p is a search; getting it mod pa is Hensel's lemma. If r2≡−1(modpk) then the correction
r′=r−2rr2+1(modpk+1)is a root one power higher, and 2r is invertible because p is odd and r≡0. Each step is Newton's method on f(x)=x2+1 over the p-adics, and it converges for exactly the reason Newton's method does — which is why a root mod p is enough to give a root mod pa for every a, and in the limit a root in Zp.
Both of these are one head: Wolfram's PowerModList(a, 1/r, m), the r-th roots of a mod m. The split units are its (1,1/2) case and the imaginary units its (−1,1/2) case, so there is no bespoke head to learn — and the same call reaches past squares.
Three cube roots of 8 mod 13, because 3 divides 12.
7² = 49 = 50 − 1, so 7 is the lift of 2 to ℤ/25; 182 is the lift to ℤ/625.
A split unit is not just a curiosity of ℤ/m: it is a homomorphism. If x2=1 in ℤ/m then
R[j]/(j2−1)⟶Z/m,j↦xrespects addition and multiplication, so every identity the symbolic algebra proves becomes a fact about ℤ/m. The zero divisor and the idempotent both survive the trip: (1+j)(1−j)=0 becomes (1+4)(1−4)=−15≡0, and 21+j — an idempotent because j2=1 — lands on 5⋅8=40≡10, with 102=100≡10.
Left: the symbolic identity. Right: its image under j ↦ 4 in ℤ/15.
This is why the idempotents matter. The split units, the CRT sign vectors and the orthogonal idempotents 21±j are three descriptions of one thing: a decomposition of the ring into independent channels.
Step back and the three columns of the grid stop looking like three arbitrary choices. Over a field, the quadratic algebra K[x]/(x2−d) has discriminant 4d, and exactly three things can happen:
| d | algebra | unit |
|---|---|---|
| a square in K | K×K — splits | j |
| a non-square | a quadratic field | i |
| zero | K[ε] — degenerate, the two roots collide | \epsilon |
So j, i and ε are not three unrelated inventions: they are the three outcomes of one construction, selected by whether d is a square, a non-square, or zero. And "is d a square" is a local question — it has a different answer at each place.
That is what the mod-m results above are really saying. Take d=−1:
Whereas d=+1 splits at every place, which is why split units are everywhere and R[j]/(j2−1)≅R2 already at the real place. A hypercomplex unit's character is not a property of the unit — it is a property of the unit at a place.
The rings Z/m are not separate objects. They form a system under divisibility — Z/m→Z/n whenever n∣m — and the inverse limit of that system is the profinite integers
Z=mlimZ/m≅p∏Zp,so the CRT splitting at each finite level is the shadow of one product over all primes. Under that identification the split units assemble too: the elements of order dividing 2 in Z× are a sign per prime, ∏p{±1} — a Cantor-set of split units, of which the 2ω(m) residues above are the finite truncations. Hensel lifting is the statement that a root mod p already determines its coherent lift into Zp, so "which units exist" stabilises per place.
Adjoining the archimedean place gives the adeles, AQ=R×∏p′Qp, and the split/inert/degenerate trichotomy above is then a statement about all places at once: a quadratic algebra over Q has a local character at each place, and those characters are not independent — quadratic reciprocity is precisely a constraint tying them together, so the local behaviours have to multiply out consistently. Which means the ± sign vectors that index the split units of ℤ/m are a fragment of something global, not just bookkeeping per modulus.
That is the direction, stated honestly as a direction: this page demonstrates the finite levels and the per-place criterion, and nothing here computes an adelic object. The pieces that would make it concrete — a Norm that names its ambient level, coefficients that live in ℤ/m rather than only mapping into it, and a per-place signature rather than one global square — are all still to build.