Parity compatibility fixes the refined product modulo four
ProvedCollatzWork.compatibleProduct_mod_fourcollatz-work-import
For natural parameters , put , , and . When , the exponent uses truncated natural subtraction.
Assume and . Then
This supplies the exact two-halving guard in the refined parent construction; no lower bound on L is required.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_CollatzWork_RefinedMersenneChild
Formal statement
theorem CollatzWork.compatibleProduct_mod_four
(L epsilon z : Nat) (hepsilon : epsilon ≤ 1)
(hparity : epsilon % 2 = L % 2) :
(3 ^ L * refinedA epsilon z) % 4 = 1 := by sorry
Source