Guarded residue-20 ancestor interfaces
DefinitionCollatzWork_ResidueAncestorStatementcollatz-work-import
Let be the shortcut Collatz map: for even and for odd . Write for its -fold iterate, with .
For a natural root r, the common conclusion is
One interface assumes a factorization 4r+1=3^v u with v at least 13 and positive u not divisible by 3. The second assumes only divisibility by the thirteenth power of 3. Both retain a guard on the root, and neither asserts universal convergence.
Definition code
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_CollatzWork_ConvergenceStatement
import Definitions.Def_CollatzWork_InverseWordBoundaryStatement
namespace CollatzWork
/-- Complete uniform refined residue-20 ancestor theorem in factorized form.
The exponent and positive 3-adic unit are unbounded. The factorization guard
implies that the original root is also 20 modulo 27. The conclusion gives
an actual forward orbit from a strictly smaller positive root in that class.
This statement does not assert that all roots satisfy the valuation guard. -/
def ResidueAncestorStatement : Prop :=
∀ v u r : Nat, 13 ≤ v → 0 < u → u % 3 ≠ 0 →
3 ^ v * u = 4 * r + 1 →
∃ m b : Nat, 0 < m ∧ m < r ∧ m % 27 = 20 ∧ shortcutIter b m = r
/-- Direct integer-divisibility form of the complete valuation-at-least-13
theorem. No separate existence or maximality assumption for a 3-adic
factorization is required at this public boundary. -/
def ResidueAncestorDivisibilityStatement : Prop :=
∀ r : Nat, 3 ^ 13 ∣ 4 * r + 1 →
∃ m b : Nat, 0 < m ∧ m < r ∧ m % 27 = 20 ∧ shortcutIter b m = r
end CollatzWork
Source