Murgu Table2To3

A Completely New Scientific Treatment

New Structure + New Coordinate System for the Collatz Conjecture

Positive Integers Domain Only

Abstract

All is NEW in this scientific treatment of the Collatz Conjecture.

The Murgu Table2To3 Framework introduces for the first time:

This represents a fundamental new approach to understanding the ordered nature of the Collatz Conjecture.

1. Domain of the Collatz Conjecture

The Collatz Conjecture is formally defined only for Positive Integers (ℕ⁺).

Motivation for Strict Positive Integers Domain:

When the Collatz rules (n/2 if even, 3n+1 if odd) are applied to negative integers, the behavior completely changes. Instead of converging to the single 4 → 2 → 1 cycle, negative numbers fall into multiple different cycles.

This total loss of unified convergence makes the original conjecture lose its sense in the negative domain.

Therefore, the extension into negatives naturally creates a separate and independent conjecture called MCVR (Modified Collatz Variant Rule).

This clear separation is essential: solving the classic Collatz Conjecture (positive integers) does not automatically solve the behavior in negative numbers, and vice versa.

2. Core Concept

Table2To3 simultaneously functions as:

• A new structured organization of positive integers
• A new coordinate system that maps Collatz trajectories

It reveals the Functional Divergence Functions and Marker USA Murgu Arrows.

3. Mod-6 Partitioning

ClassFormmod 6Role
LET11 + 6i1Active upward nodes
LDN3 + 6k3Logical Dead Nodes / Closures
LET25 + 6j5Active upward nodes

4. Collatz Functional Divergence Functions

C.E.-1 (LET1):
\( \bigl(2^{(2k+2)} \bigr) \times (1 + 6i) - 1 = 3 Q_i \)
C.E.-2 (LET2):
\( \bigl(2^{(2l+1)} \bigr) \times (5 + 6j) - 1 = 3 Q_j \)

where \( k, l, i, j = 0,1,2,\dots \)

5. LDN Rules

  1. LDNs (≡ 3 mod 6) have no upward inverse connections.
  2. Trajectories from LDNs reach 1 without hitting another LDN.
  3. Trajectories from LET1/LET2 do not hit LDNs before 1.

6. Murgu Collatz Unicity – Second Key of the Framework

Murgu Collatz Unicity is one of the central pillars of the Table2To3 Structure and Coordinate System.

LET1 (1 + 6i) and LET2 (5 + 6j) act as Triads Engines.

• Each LET node has infinitely many upward Collatz connections (inverse direction).
• However, in the downward direction (forward Collatz iteration), every node has exactly one unique connection.

This downward unicity — that each number maps to one and only one successor through the defined functional divergence — is a fundamental characteristic revealed by the Murgu Table2To3 Coordinate System.

This unicity, combined with the LDN closures and the mod-6 partitioning, forms the foundation for the claim of a structured unique solution path toward the 4 → 2 → 1 cycle for all positive integers.

7. MCVR – Modified Collatz Variant Rule (Independent Conjecture)

MCVR manifests in two main aspects:

1. Positive Domain Variant (3x − 1 behavior)
Instead of converging to a single cycle, it produces multiple roots. Examples:
5 → 7
17 → 25 → 37 → 55 → 41 → 61 → 91 → ...
(and several other independent cycles)

2. Negative Domain (Classic Collatz Rules)
The behavior becomes even more fragmented:
(−1)
(−5) → (−7)
(−17) → (−25) → (−37) → (−55) → (−41) → (−61) → (−91) → ...
(and multiple other cycles)

These examples clearly demonstrate that Collatz Conjecture loses its unified sense in the negative domain. The single attractive cycle (4 → 2 → 1) disappears completely.

This fundamental difference justifies treating MCVR as a fully independent conjecture, separate from the classic Collatz Conjecture (which remains strictly defined for positive integers).