AFTD Auto-Formalizing Theoretical Domains

designated_partition_six_tuple_exact_valuation_iff

theoremverified

The exact 3-adic valuation statement that 243 divides designated_partition_k_tuple 6 (12n + 10) for all n and 729 does not divide all of them is logically equivalent to the universal divisibility by 243 alone.

Statement

theorem designated_partition_six_tuple_exact_valuation_iff :
    ((∀ n : ℕ, 243 ∣ designated_partition_k_tuple 6 (12 * n + 10)) ∧
     ¬(∀ n : ℕ, 729 ∣ designated_partition_k_tuple 6 (12 * n + 10))) ↔
    (∀ n : ℕ, 243 ∣ designated_partition_k_tuple 6 (12 * n + 10))
Source
arXiv:2611.05623 Conjecture 6.3
Verified
09 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2

Read back from the Lean

The declaration asserts that the conjunction of: 1. For all natural numbers n, 243 divides designated_partition_k_tuple 6 (12 * n + 10), and 2. It is not the case that for all natural numbers n, 729 divides designated_partition_k_tuple 6 (12 * n + 10) holds if and only if For all natural numbers n, 243 divides designated_partition_k_tuple 6 (12 * n + 10).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The equivalence is proved in two directions. The forward direction is trivial: assuming the conjunction, its first conjunct asserts universal divisibility by 243. The reverse direction reduces to showing that 729 does not divide all terms; this is proved by contradiction, since specializing to n = 1 implies that 729 divides designated_partition_k_tuple 6 22, which is known to be false.

  1. The conjunction of divisibility conditions implies universal divisibility by 243.

    To prove the logical equivalence, we first establish the forward implication. Assuming the conjunction that 243 divides designated_partition_k_tuple 6 (12 * n + 10) for all n and 729 does not divide all of them, extracting the first conjunct immediately gives universal divisibility by 243.

    lines 6–8

      constructor
      · rintro ⟨h1, -⟩
        exact h1
  2. To show that universal divisibility by 243 implies the conjunction, it suffices to prove that 729 does not divide designated_partition_k_tuple 6 (12 * n + 10) for all n.

    For the reverse implication, we assume that 243 divides designated_partition_k_tuple 6 (12 * n + 10) for all n. Supplying this hypothesis satisfies the first conjunct of the goal, leaving only the second conjunct: the non-universal divisibility by 729.

    lines 9–10

      · intro h1
        refine ⟨h1, ?_⟩
  3. 729 does not divide designated_partition_k_tuple 6 (12 * n + 10) for all n.

    Assume for contradiction that 729 divides designated_partition_k_tuple 6 (12 * n + 10) for every n. Specializing this universal statement to n = 1 yields that 729 divides designated_partition_k_tuple 6 22 (since 12 * 1 + 10 = 22), which directly contradicts the lemma designated_partition_six_tuple_twenty_two_not_mod_729.

    lines 11–12

    uses designated_partition_six_tuple_twenty_two_not_mod_729

        intro h2
        exact designated_partition_six_tuple_twenty_two_not_mod_729 (h2 1)
designated_partition_six_tuple_twenty_two_not_mod_729
729 does not divide designated_partition_k_tuple 6 22

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The conjunction of universal divisibility by 243 and non-universal divisibility by 729 is equivalent to universal divisibility by 243. -/theorem designated_partition_six_tuple_exact_valuation_iff :    ((∀ n : ℕ, 243 ∣ designated_partition_k_tuple 6 (12 * n + 10)) ∧     ¬(∀ n : ℕ, 729 ∣ designated_partition_k_tuple 6 (12 * n + 10))) ↔    (∀ n : ℕ, 243 ∣ designated_partition_k_tuple 6 (12 * n + 10)) := by  constructor  · rintro ⟨h1, -⟩    exact h1  · intro h1    refine ⟨h1, ?_⟩    intro h2    exact designated_partition_six_tuple_twenty_two_not_mod_729 (h2 1)
See it in the graphDiscuss this resultChallenge it