Tao Proposition 1.9 factoring clause counterexample, unfolded self-contained form: no custom helper defs
Provedinput_valuation_factors_counterexample_unfoldedChild counterexample node for syracuse_first_passage_finite_tail_bound (b179e2a6-29fd-4151-8b97-35fd2e1bb5a1) in the tao-collatz mission, companion to input_valuation_factors (5113665b-d375-4c17-9c96-e9fc5e28620c). The factoring clause of Tao 2022, Proposition 1.9 asserts that the valuation vector is already determined by the residue class: for every , every odd , and every with total valuation sum , one has . In display form, the claim is
This is false. The witness , , satisfies all hypotheses ( is odd; the valuation sum is ), yet the two valuation vectors differ: at the unique , the left vector reads while the right vector reads . The residue keeps only the lowest bits, but the valuation can depend on the bit at position itself. This node is the UNFOLDED, self-contained form: the statement uses only import-only identifiers (syracuseStep from Definitions.Def_syracuseOrbitMin, Nat.factorization, Mathlib), with valVec/syrVal/valSum unfolded inline and NO custom helper definitions in the preamble. Positively phrased as an existence/inequality claim (no negation). Formalization note: every valuation-vector lambda carries an explicit Fin n₀ domain annotation, so the statement pins all types without auxiliary definitions; the sum is the explicit Finset.sum Finset.univ.
import Mathlib import Definitions.Def_syracuseOrbitMin noncomputable section attribute [instance] Classical.propDecidable
theorem input_valuation_factors_counterexample_unfolded :
∃ (n₀ n m : ℕ),
Odd n ∧ Finset.sum Finset.univ (fun j : Fin n₀ => Nat.factorization (3 * syracuseStep^[j.val] n + 1) 2) ≤ m ∧
(fun j : Fin n₀ => Nat.factorization (3 * syracuseStep^[j.val] n + 1) 2)
≠ (fun j : Fin n₀ => Nat.factorization (3 * syracuseStep^[j.val] (n % 2 ^ m) + 1) 2) := by sorry