◄ WORLD V · SONNY 5DART 212 · a helldive at the net

THE GALOIS CONNECTION two worlds, each the order-reversed mirror of the other

A Galois connection is a pair of maps F, G between two ordered worlds with one law: F(a) ≤ b ⇔ a ≤ G(b). It is the most general shape of duality — the order-theory shadow of an adjunction. Galois's own field/group correspondence is the archetype; so is n² ≤ m ⇔ n ≤ ⌊√m⌋, where squaring and integer-square-root are the two adjoined maps. Each side determines the other; a fact in one world is a fact in the other.

THE TECHNIQUE F(a) ≤ b ⇔ a ≤ G(b) ; here x² and ⌊√x⌋

Take squaring on one side and integer square root on the other; for any n, m the two inequalities n²≤m and n≤⌊√m⌋ always agree — the connection law, verified across a range: live demo







  
HISTORY & CREDIT Galois 1832 · Ore 1944

  
“Squaring and square-root are just inverse functions.” — over the integers they are not inverse (roots aren't integers), yet they stay locked by an order duality: n≤⌊√m⌋ exactly when n²≤m. That adjoint bond — not invertibility — is what a Galois connection captures, and it is everywhere. cited

  
1832 · Évariste Galois — the correspondence between subfields and subgroups, order-reversing and mutually determining: the original connection.
1940 · Garrett Birkhoff — lattice theory frames such polarity pairs abstractly.
1944 · Øystein Ore — “Galois connexions”: names and generalises the pattern; later seen as an adjunction between posets (category theory).

  
A Galois connection is duality stripped to its essence: two ordered worlds and one bar that translates ≤ back and forth. Closure operators, syntax/semantics, abstract interpretation — all are this one bond. Ore 1944






  
RECOMMEND FOR I-13 the connection law holds across the range, computed

  
On the canonical compiler, integer square root is computed by recursion, and for m=50 (⌊√50⌋=7) the two inequalities agree at the boundary — n=7 satisfies both, n=8 fails both:

  
$ i13 run galois.i13   # isqrt(50)=7 by recursion
n=7 :  n<=isqrt(m) = 1 ,  n*n<=m = 1   -> agree
n=8 :  n<=isqrt(m) = 0 ,  n*n<=m = 0   -> agree
-- F=square, G=isqrt : F(n)<=m  <=>  n<=G(m), the connection holds

  
Recommend: the Galois connection is LIT for I-13 — verified with F=square, G=isqrt that n²≤m ⇔ n≤⌊√m⌋ at the decisive boundary (isqrt(50)=7: n=7 passes both, n=8 fails both). Not inverse functions — an adjoint bond between two ordered worlds, the most general duality there is.