Murgu Functional Divergence: The New 9 Formulas Legacy

The Concept of the 9 Transition Formulas

In traditional number theory, the Collatz mapping is treated as a dynamic, unstable process because numbers jump unpredictably across the set of integers. The Murgu 1D Array Logic resolves this by establishing that after the natural exclusion of evens via 2^k(D), all transformations are actually static coordinate shifts within an infinite 3x3 grid matrix.

Because the odd numbers are split perfectly into three lanes—LET1 (1+6i), LDN (3+6i), and LET2 (5+6i)—there are precisely 3 inputs and 3 possible target spaces. This creates a finite system of exactly 9 distinct linear transition channels that map the movement of all numbers to infinity.

The 3x3 Structural Coordinate Transition Matrix

Every trajectory represents an entry from an Origin Lane (Rows) to a Destination Layer (Columns), driven by the Murgu Parity Bifurcation Lemmas:

1. From LET1 Origin (1 + 6i)

Formula 1: LET1 → LET1 Transition

F_{11}(i) \implies 3(1+6i) + 1 = 4 + 18i = 2^{2k+2} · (1+6j)

Maps numbers that divide across an even power of 2, looping back into the Active Engine 1 space with perfect linearity.

Formula 2: LET1 → LDN Transition

F_{12}(i) \implies 3(1+6i) + 1 = 4 + 18i = 2^k · (3+6j)

Directs trajectories downward into the Logical Dead Node boundary sink, where forward upward escape is prohibited.

Formula 3: LET1 → LET2 Transition

F_{13}(i) \implies 3(1+6i) + 1 = 4 + 18i = 2^{2k+1} · (5+6j)

Driven by Murgu Lemma 2, shifting the numerical stream across an odd exponent track into Active Engine 2.

2. From LDN Origin (3 + 6i)

Note: These formulas operate strictly downward. As proved by the LDN Closure rule, these lines can only be initiated as a start state or an exit funnel, never as a midpoint step from a lower odd precursor.

Formula 4: LDN → LET1 Transition

F_{21}(i) \implies 3(3+6i) + 1 = 10 + 18i = 2^{2k+2} · (1+6j)

Discharges a Dead Node baseline value out into the linear track of Engine 1.

Formula 5: LDN → LDN Transition

F_{22}(i) \implies 3(3+6i) + 1 = 10 + 18i = 2^k · (3+6j)

An internal boundary adjustment layer that maps dead points directly onto lower horizontal layers of the LDN spine.

Formula 6: LDN → LET2 Transition

F_{23}(i) \implies 3(3+6i) + 1 = 10 + 18i = 2^{2k+1} · (5+6j)

Funnels the output of a multiple of 3 structural coordinate directly into the Engine 2 track via an odd power of 2 scaling shift.

3. From LET2 Origin (5 + 6i)

Formula 7: LET2 → LET1 Transition

F_{31}(i) \implies 3(5+6i) + 1 = 16 + 18i = 2^{2k+2} · (1+6j)

Crosses over the parity boundary, moving the active numeric coordinates from Engine 2 cleanly back into the Engine 1 baseline.

Formula 8: LET2 → LDN Transition

F_{32}(i) \implies 3(5+6i) + 1 = 16 + 18i = 2^k · (3+6j)

Captures coordinates out of the Engine 2 trajectory and deposits them into the permanent structural containment walls of the LDN system.

Formula 9: LET2 → LET2 Transition

F_{33}(i) \implies 3(5+6i) + 1 = 16 + 18i = 2^{2k+1} · (5+6j)

Maintains the track within Engine 2 space, enforcing a smooth linear scaling downward across the global grid coordinate map.

The Legacy of Functional Divergence

1. Double Linearity Confirmed: Because every single one of these 9 formulas relies on invariant, predictable modular remainders via the Murgu Lemmas, the entire grid operates deterministically. There is no chaotic divergence—only Functional Divergence governed by explicit coordinate rules.

2. Structural Inversion: Traditional systems must compute millions of iterations to map a number's trajectory. The 9 Formulas act as a closed algebraic group, allowing the Murgu Inverse Method to treat the entire network as an organized geometric space. You can trace paths backward instantly from any target layer back to its original node coordinate.