AFTD Auto-Formalizing Theoretical Domains

davenport_box_three_odd_sequence_sum

theoremverified

The sequence T(m) (odd case) is a zero-sum sequence, for every m ≥ 2.

Statement

theorem davenport_box_three_odd_sequence_sum (m : ℕ) (hm : 2 ≤ m) :
    (davenport_box_three_odd_sequence m).sum = 0
Source
Step of the proof of Theorem 3 of arXiv:2610.16562 (odd m): T(m) sums to zero.
Verified
19 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • davenport_box_three_odd_sequenceThe sequence T(m) for odd m: (-m,-m,-m) repeated 4m^3-8m^2+5m-2 times, (-m,m-1,m) repeated 4m^3-2m^2+2m times, (m,-m,m-2) repeated…
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
Used by 1

The proof, explained

The theorem verifies that the multiset sequence T(m) has sum zero by expanding the multiset into a linear combination of its four constituent vectors and checking each of the three coordinates separately. Because the vector multiplicities are natural numbers defined with subtraction, four helper lemmas first establish that these multiplicities cast to the expected integer polynomials without truncation under the hypothesis m ≥ 2. Finally, evaluating the linear combination at coordinates 0, 1, and 2 yields three explicit polynomial identities in m, all of which cancel identically to zero.

  1. The multiplicity 4m³ - 8m² + 5m - 2 cast from ℕ to ℤ equals the integer polynomial 4m³ - 8m² + 5m - 2.

    Under m ≥ 2, nlinarith proves 8m² ≤ 4m³ and omega proves 2 ≤ 4m³ - 8m² + 5m. Rewriting with Nat.cast_sub using these inequalities converts the natural subtractions to integer subtractions, after which push_cast and ring confirm the equality in ℤ.

    lines 3–9

    uses Nat.cast_sub

      have h1 : 8 * m ^ 2 ≤ 4 * m ^ 3 := by nlinarith
      have h2 : 2 ≤ 4 * m ^ 3 - 8 * m ^ 2 + 5 * m := by omega
      rw [Nat.cast_sub h2]
      push_cast
      rw [Nat.cast_sub h1]
      push_cast
      ring
  2. The multiplicity 4m³ - 2m² + 2m cast from ℕ to ℤ equals the integer polynomial 4m³ - 2m² + 2m.

    Since m ≥ 2, nlinarith establishes 2m² ≤ 4m³. Applying Nat.cast_sub rewrites the natural subtraction to integer subtraction, and ring verifies the equality.

    lines 13–17

    uses Nat.cast_sub

      have h1 : 2 * m ^ 2 ≤ 4 * m ^ 3 := by nlinarith
      push_cast
      rw [Nat.cast_sub h1]
      push_cast
      ring
  3. The multiplicity 4m³ - 2m² + m cast from ℕ to ℤ equals the integer polynomial 4m³ - 2m² + m.

    Again 2m² ≤ 4m³ holds by nlinarith. Rewriting with Nat.cast_sub and pushing the integer cast allows ring to complete the identity.

    lines 21–25

    uses Nat.cast_sub

      have h1 : 2 * m ^ 2 ≤ 4 * m ^ 3 := by nlinarith
      push_cast
      rw [Nat.cast_sub h1]
      push_cast
      ring
  4. The multiplicity 4m³ - 4m² + 2m cast from ℕ to ℤ equals the integer polynomial 4m³ - 4m² + 2m.

    Non-linear arithmetic confirms 4m² ≤ 4m³. Rewriting with Nat.cast_sub converts the subtraction to ℤ, and ring completes the verification.

    lines 29–33

    uses Nat.cast_sub

      have h1 : 4 * m ^ 2 ≤ 4 * m ^ 3 := by nlinarith
      push_cast
      rw [Nat.cast_sub h1]
      push_cast
      ring
  5. The multiset sum is expressed as a linear combination of the four constituent vectors in ℤ³.

    Unfolding the definition of davenport_box_three_odd_sequence, Multiset.sum_add distributes the summation over the four multiset summands, and Multiset.sum_replicate replaces each replicated multiset sum with scalar multiplication of the vector by its multiplicity.

    lines 37–39

    uses Multiset.sum_add, Multiset.sum_replicate

      dsimp [davenport_box_three_odd_sequence]
      rw [Multiset.sum_add, Multiset.sum_add, Multiset.sum_add]
      rw [Multiset.sum_replicate, Multiset.sum_replicate, Multiset.sum_replicate, Multiset.sum_replicate]
  6. Vector equality is reduced to coordinates, and the integer polynomial formulas for the coefficients are introduced.

    Applying ext i reduces equality of vectors in ℤ³ (functions Fin 3 → ℤ) to showing that the i-th coordinate vanishes for each index i. Hypotheses hc1 through hc4 are obtained by applying the four helper lemmas to m and hm.

    lines 40–44

    uses davenport_box_three_odd_sequence_sum_cast1, davenport_box_three_odd_sequence_sum_cast2, davenport_box_three_odd_sequence_sum_cast3, davenport_box_three_odd_sequence_sum_cast4

      ext i
      have hc1 := davenport_box_three_odd_sequence_sum_cast1 m hm
      have hc2 := davenport_box_three_odd_sequence_sum_cast2 m hm
      have hc3 := davenport_box_three_odd_sequence_sum_cast3 m hm
      have hc4 := davenport_box_three_odd_sequence_sum_cast4 m hm
  7. It suffices to verify that the linear combination vanishes at each of the three coordinates i ∈ {0, 1, 2}.

    We perform case analysis on i : Fin 3 using fin_cases, generating three subgoals corresponding to coordinates 0, 1, and 2.

    line 45

      fin_cases i
  8. The sequence sum vanishes on the first coordinate (i = 0).

    For i = 0, simp evaluates the first component of each vector—giving -m, -m, m, and m - 1—and substitutes the cast multiplicities hc1 through hc4. The resulting integer polynomial identity -(4m³ - 8m² + 5m - 2)m - (4m³ - 2m² + 2m)m + (4m³ - 2m² + m)m + (4m³ - 4m² + 2m)(m - 1) = 0 is verified by ring.

    line 46

      · simp [hc1, hc2, hc3, hc4]; ring
  9. The sequence sum vanishes on the second coordinate (i = 1).

    For i = 1, the vector components evaluate to -m, m - 1, -m, and m. Substituting hc1 through hc4 yields -(4m³ - 8m² + 5m - 2)m + (4m³ - 2m² + 2m)(m - 1) - (4m³ - 2m² + m)m + (4m³ - 4m² + 2m)m = 0, which ring confirms equals 0.

    line 47

      · simp [hc1, hc2, hc3, hc4]; ring
  10. The sequence sum vanishes on the third coordinate (i = 2).

    For i = 2, the vector components are -m, m, m - 2, and -m. Substituting hc1 through hc4 yields -(4m³ - 8m² + 5m - 2)m + (4m³ - 2m² + 2m)m + (4m³ - 2m² + m)(m - 2) - (4m³ - 4m² + 2m)m = 0, which ring confirms equals 0.

    line 48

      · simp [hc1, hc2, hc3, hc4]; ring
Nat.cast_sub
For natural numbers m ≤ n, the cast of their difference into an additive group with one equals the difference of their casts: (n - m : R) = (n : R) - (m : R).
Multiset.sum_add
The sum of the union of two multisets is the sum of their individual sums: (s + t).sum = s.sum + t.sum.
Multiset.sum_replicate
The sum of a multiset containing n copies of an element a equals the scalar multiple n • a.
davenport_box_three_odd_sequence_sum_cast1
For m ≥ 2, the natural number 4m³ - 8m² + 5m - 2 cast to ℤ equals the integer polynomial 4m³ - 8m² + 5m - 2.
davenport_box_three_odd_sequence_sum_cast2
For m ≥ 2, the natural number 4m³ - 2m² + 2m cast to ℤ equals the integer polynomial 4m³ - 2m² + 2m.
davenport_box_three_odd_sequence_sum_cast3
For m ≥ 2, the natural number 4m³ - 2m² + m cast to ℤ equals the integer polynomial 4m³ - 2m² + m.
davenport_box_three_odd_sequence_sum_cast4
For m ≥ 2, the natural number 4m³ - 4m² + 2m cast to ℤ equals the integer polynomial 4m³ - 4m² + 2m.

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

lemma davenport_box_three_odd_sequence_sum_cast1 (m : ℕ) (hm : 2 ≤ m) :    ((4 * m ^ 3 - 8 * m ^ 2 + 5 * m - 2 : ℕ) : ℤ) = 4 * (m : ℤ) ^ 3 - 8 * (m : ℤ) ^ 2 + 5 * (m : ℤ) - 2 := by  have h1 : 8 * m ^ 2 ≤ 4 * m ^ 3 := by nlinarith  have h2 : 2 ≤ 4 * m ^ 3 - 8 * m ^ 2 + 5 * m := by omega  rw [Nat.cast_sub h2]  push_cast  rw [Nat.cast_sub h1]  push_cast  ringlemma davenport_box_three_odd_sequence_sum_cast2 (m : ℕ) (hm : 2 ≤ m) :    ((4 * m ^ 3 - 2 * m ^ 2 + 2 * m : ℕ) : ℤ) = 4 * (m : ℤ) ^ 3 - 2 * (m : ℤ) ^ 2 + 2 * (m : ℤ) := by  have h1 : 2 * m ^ 2 ≤ 4 * m ^ 3 := by nlinarith  push_cast  rw [Nat.cast_sub h1]  push_cast  ringlemma davenport_box_three_odd_sequence_sum_cast3 (m : ℕ) (hm : 2 ≤ m) :    ((4 * m ^ 3 - 2 * m ^ 2 + m : ℕ) : ℤ) = 4 * (m : ℤ) ^ 3 - 2 * (m : ℤ) ^ 2 + (m : ℤ) := by  have h1 : 2 * m ^ 2 ≤ 4 * m ^ 3 := by nlinarith  push_cast  rw [Nat.cast_sub h1]  push_cast  ringlemma davenport_box_three_odd_sequence_sum_cast4 (m : ℕ) (hm : 2 ≤ m) :    ((4 * m ^ 3 - 4 * m ^ 2 + 2 * m : ℕ) : ℤ) = 4 * (m : ℤ) ^ 3 - 4 * (m : ℤ) ^ 2 + 2 * (m : ℤ) := by  have h1 : 4 * m ^ 2 ≤ 4 * m ^ 3 := by nlinarith  push_cast  rw [Nat.cast_sub h1]  push_cast  ringtheorem davenport_box_three_odd_sequence_sum (m : ℕ) (hm : 2 ≤ m) :    (davenport_box_three_odd_sequence m).sum = 0 := by  dsimp [davenport_box_three_odd_sequence]  rw [Multiset.sum_add, Multiset.sum_add, Multiset.sum_add]  rw [Multiset.sum_replicate, Multiset.sum_replicate, Multiset.sum_replicate, Multiset.sum_replicate]  ext i  have hc1 := davenport_box_three_odd_sequence_sum_cast1 m hm  have hc2 := davenport_box_three_odd_sequence_sum_cast2 m hm  have hc3 := davenport_box_three_odd_sequence_sum_cast3 m hm  have hc4 := davenport_box_three_odd_sequence_sum_cast4 m hm  fin_cases i  · simp [hc1, hc2, hc3, hc4]; ring  · simp [hc1, hc2, hc3, hc4]; ring  · simp [hc1, hc2, hc3, hc4]; ring
See it in the graphDiscuss this resultChallenge it