A transitive composite forces a common invariant to be constant
ProvedCollatzWork.Disproof.FiniteResidueFirstIntegral.commutator_transitive_forces_constantcollatz-work-import
Let and be arbitrary types, let , and let satisfy the right-inverse identities and for every . Assume and for every . Put , and suppose every can be reached from every by some nonnegative iterate: . Then
Here is the identity map. This general invariance principle is the formal core used by the residue-first-integral argument. The theorem assumes neither finiteness of nor left-inverse laws, and it does not itself supply the arithmetic residue-model construction.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_CollatzWork_Disproof_FiniteResidueFirstIntegral
Formal statement
theorem CollatzWork.Disproof.FiniteResidueFirstIntegral.commutator_transitive_forces_constant
{X Color : Type} (I : X → Color)
(A Ainv B Binv : X → X)
(hARightInverse : ∀ x, A (Ainv x) = x)
(hBRightInverse : ∀ x, B (Binv x) = x)
(hA : IsInvariant I A) (hB : IsInvariant I B)
(htransitive : ∀ x y, ∃ n,
iterate (commutator A Ainv B Binv) n x = y) :
∀ x y, I x = I y := by sorry
Source