Murgu Collatz Unicity

Infinite Upward Connections • Unique Downward Path to Unity

After 89 years — A new mathematical lens.

Every positive integer has infinitely many upward Collatz connections (preimages),
but exactly ONE unique downward path to Unity (1).

Simple Explanation: Up vs Down

Upward = Finding preimages (many numbers can flow into a target) — this is where infinity appears.

Downward = Normal Collatz procedure (3n+1 if odd, divide by 2 if even) — this path is always unique.

Example 1: LET2 Number = 5

A. Upward Connections (Preimages)

ExponentMultiplierPreimageType
123LDN
3813LET1
53253LET2
7128213LDN
9512853LET1

B. How they reach 5 (Unique Downward Paths)

PreimagePath until reaching 5
33 → 10 → 5
1313 → 40 → 20 → 10 → 5
5353 → 160 → 80 → 40 → 20 → 10 → 5
213213 → 640 → 320 → 160 → 80 → 40 → 20 → 10 → 5
853853 → ... → 5

Unique continuation from 5: 5 → 16 → 8 → 4 → 2 → 1

Example 2: LET1 Number = 7

A. Upward Connections (Preimages)

kMultiplierPreimageType
049LDN
31637LET1
62865LET2
94093LDN

B. How they reach 7 (Unique Downward Paths)

PreimagePath until reaching 7
99 → 28 → 14 → 7
3737 → 112 → 56 → 28 → 14 → 7
6565 → 196 → 98 → 49 → 148 → 74 → 37 → ... → 7
9393 → 280 → 140 → 70 → 35 → ... → 7

Unique continuation from 7: 7 → 22 → 11 → 34 → 17 → 52 → 26 → 13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1

Conclusion – The Beauty of Murgu Unicity

Multiple different numbers (LDNs, LET1, LET2) can reach the same target (like 5 or 7),
each through its own unique history.

But from that target onward, there is only one single deterministic path to Unity.

This is the elegant truth revealed by Murgu Table2To3.

Based on Ion Murgu’s Table2To3 Framework and Collatz Unicity
Corrected & Verified • June 2026