Rigidity of the positive-label branching-center equation
ProvedCollatzWork.Disproof.BranchingCenter.branchingCenterEquationRigidcollatz-work-import
Let be positive natural numbers satisfying
Then
This is the arithmetic obstruction for the particular two-center, three-edge ansatz described in the source: its displayed consistency equation allows no distinct positive labels. The theorem does not assert existence of a Collatz trajectory or settle termination.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_CollatzWork_Disproof_BranchingCenter import Theorems.Thm_CollatzWork_Disproof_BranchingCenter_centerTwoPowerOddNormalFormUnique
Formal statement
theorem CollatzWork.Disproof.BranchingCenter.branchingCenterEquationRigid
(a b c : Nat)
(_ha : 0 < a) (hb : 0 < b) (hc : 0 < c)
(hEq : 2 ^ (b + c) + 3 * 2 ^ b =
2 ^ (a + b) + 3 * 2 ^ a) :
a = b ∧ b = c := by sorry
Source