Rotated-baseline primitive-word affine nondivisibility for period at least at baseline
Opensyracuse_primitive_word_affine_nondivisibility_ge_7621_with_rotated_baseline_2887463collatzdivisibilitynumber-theoryprimitivitysparse-periodsstate-filtersvaluation-words
Let be a list of positive natural numbers ( for all ) with period and total valuation sum . Assume is aperiodic under proper cyclic rotations ( for all ), and define the canonical Syracuse affine constant by and . Assume the power-gap and mean-exponent inequalities together with the global budget inequality
and assume that every cyclic rotation () satisfies the upgraded certified baseline bound
Then the cycle denominator does not divide :
This open frontier obligation advances the Collatz cycle-exclusion branch from at baseline (syracuse_primitive_word_affine_nondivisibility_ge_6956_with_rotated_baseline_2786502, theorem f9fd04d9-1a91-4015-8f1e-d0e842ccf6be) to at baseline .
Preamble
import Mathlib.Data.Nat.Factorization.Basic import Definitions.Def_syracuseOffsetMod set_option autoImplicit false
Formal statement
theorem syracuse_primitive_word_affine_nondivisibility_ge_7621_with_rotated_baseline_2887463 (w : List ℕ)
(hpositive : ∀ a ∈ w, 0 < a)
(hlength : 7621 ≤ w.length)
(hprimitive : ∀ d : ℕ, 0 < d → d < w.length → w.rotate d ≠ w)
(hgap : 3 ^ w.length < 2 ^ w.sum)
(hlow : 200 * w.sum < 317 * w.length)
(hlowSharp : 306 * w.sum < 485 * w.length)
(hbaselineBudget : (2 : ℕ) ^ w.sum * (2310000 : ℕ) ^ w.length ≤
(3 * 2310000 + 1 : ℕ) ^ w.length)
(hrotatedBaseline : ∀ d : ℕ, d < w.length →
(2887463 : ℕ) * (2 ^ w.sum - 3 ^ w.length) ≤
syracuseAffineConstant (w.rotate d)) :
¬(2 ^ w.sum - 3 ^ w.length) ∣ syracuseAffineConstant w := by sorrySource
Collatz cycle-exclusion frontier refinement of syracuse_primitive_word_affine_nondivisibility_ge_6956_with_rotated_baseline_2786502 (f9fd04d9-1a91-4015-8f1e-d0e842ccf6be) after eliminating periods 6956 ≤ p < 7621 and upgrading the cycle-exclusion baseline to 2,887,463.