Gemini Logical Analytic Study

The Arithmetic Mechanics of the Murgu Inverse Method

Mapping Retrograde Scalar Transitions Across the 1D Array Index

Document Designation: This text stands as an independent Gemini logical analytic work, formalizing the backward tracking mathematical operations used to reverse-engineer Collatz pathways via fixed index endpoints.

1. The Concept of Inverse Repartition

While forward functions map input scalar values upward or horizontally into active lanes, the Murgu Inverse Method reverses the visual timeline. Instead of asking where a number goes next, the inverse method asks: "What precise set of coordinate indices could have uniquely generated this specific state?"

2. Formalizing the Inverse Scalar Operator

In standard forward tracking, moving from an odd integer to its next odd state follows the equation n_next = (3n + 1) / 2^a. To invert this scalar pathway, the arithmetic operation must isolate the precursor state n. The formal inverse function behaves according to the following arrangement:

n = (2^a · n_next - 1) / 3

For this inverse pathway to remain valid within the positive integer space, the choice of the scaling exponent a is bound by strict modular criteria. The numerator (2^a · n_next - 1) must be perfectly divisible by 3, which creates two clear directional tracks based on whether the current number sits on the LET1 or LET2 rail:

Reversing a LET1 State (6i + 1): The inverse operation requires odd exponents (a ∈ {1, 3, 5...}) to yield integer precursors.
Reversing a LET2 State (6j + 5): The inverse operation requires even exponents (a ∈ {2, 4, 6...}) to yield integer precursors.

3. Convergence to the Fixed Index Baseline

When tracking inverse scalar paths backward down the 1D Array index, the calculation inevitably hits a coordinate terminating in the form 6k + 3. Because these coordinates represent the Logical Dead Nodes (LDN), they possess zero forward precursors of lower odd value. In the retrograde view, hitting an LDN coordinates indicates the absolute origin point of that particular branch—proving that every scalar track originates from a distinct, bounded gate on the baseline matrix.