AFTD Auto-Formalizing Theoretical Domains

mordell_ten_integer_witness_ineq

theoremverifiedformalization

For the ten integer points W = ![(11183, 0), (-11183, 0), (32765, 14669), (32765, -14669), (-32765, 14669), (-32765, -14669), (12323, 31572), (12323, -31572), (-12323, 31572), (-12323, -31572)] in Fin 10 → ℤ × ℤ and q = 9999608174, 9^36 times the product over all i < j in Fin 10 of the squared Euclidean distances ((W i).1 - (W j).1)^2 + ((W i).2 - (W j).2)^2 is strictly greater than q^45.

Statement

lemma mordell_ten_integer_witness_ineq :
    let W : Fin 10 → ℤ × ℤ := ![(11183, 0), (-11183, 0),
      (32765, 14669), (32765, -14669), (-32765, 14669), (-32765, -14669),
      (12323, 31572), (12323, -31572), (-12323, 31572), (-12323, -31572)]
    let q : ℤ := 9999608174
    (9 : ℤ) ^ 36 * ∏ i : Fin 10, ∏ j : Fin 10 with i < j,
      (((W i).1 - (W j).1) ^ 2 + ((W i).2 - (W j).2) ^ 2) > q ^ 45
Formalizes
arXiv:2611.03088 eq. (8)
Verified
05 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
Used by 1
  • mordell_ten_exists_feasible_gt_chalkThere exists a configuration of ten points z : Fin 10 → ℂ in the complex plane satisfying ∑ i : Fin 10, ‖z i‖^2 = 10 such that ∏ i : Fin…

Read back from the Lean

Let $W : \text{Fin } 10 \to \mathbb{Z} \times \mathbb{Z}$ be the sequence of ten points: - $W(0) = (11183, 0)$ - $W(1) = (-11183, 0)$ - $W(2) = (32765, 14669)$ - $W(3) = (32765, -14669)$ - $W(4) = (-32765, 14669)$ - $W(5) = (-32765, -14669)$ - $W(6) = (12323, 31572)$ - $W(7) = (12323, -31572)$ - $W(8) = (-12323, 31572)$ - $W(9) = (-12323, -31572)$ and let $q : \mathbb{Z} = 9999608174$. The declaration asserts the strict integer inequality: $$9^{36} \cdot \prod_{i \in \text{Fin } 10} \prod_{\substack{j \in \text{Fin } 10 \\ i < j}} \left( (W(i)_1 - W(j)_1)^2 + (W(i)_2 - W(j)_2)^2 \right) > q^{45}$$ that is, $9^{36}$ times the product of the squared Euclidean distances between all 45 pairs $W(i), W(j)$ with $i < j$ is strictly greater than $q^{45}$.

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 theorem states a strict inequality between two concrete integers: $9^{36}$ times the product of the $\binom{10}{2} = 45$ pairwise squared Euclidean distances among 10 explicit integer points in $\mathbb{Z}^2$ is greater than $q^{45}$ for $q = 9999608174$. The proof proceeds purely by computation: the decision tactic `decide` evaluates the product over the finite type `Fin 10` and compares the resulting large integers directly.

  1. The inequality $9^{36} \prod_{0 \le i < j < 10} \left((W_i.1 - W_j.1)^2 + (W_i.2 - W_j.2)^2\right) > q^{45}$ holds for the specified 10 points $W$ and $q = 9999608174$. automation

    The statement asserts a strict inequality between two fully determined integer values: a product of 45 squared Euclidean distances between concrete points in $\mathbb{Z} \times \mathbb{Z}$ scaled by $9^{36}$, and $q^{45}$. Because the index set is finite and all operations are standard integer arithmetic, the proposition is decidable. The `decide` tactic in the `first | ...` chain computes the values of both sides and verifies that the inequality holds.

    line 8

          (((W i).1 - (W j).1) ^ 2 + ((W i).2 - (W j).2) ^ 2) > q ^ 45 := by first | (simp_all; done) | omega | decide | linarith | positivity | (aesop; done)

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

/-- Exact integer certificate that 9^36 times the pairwise squared distance product exceeds q^45 for q = 9999608174. -/lemma mordell_ten_integer_witness_ineq :    let W : Fin 10 → ℤ × ℤ := ![(11183, 0), (-11183, 0),      (32765, 14669), (32765, -14669), (-32765, 14669), (-32765, -14669),      (12323, 31572), (12323, -31572), (-12323, 31572), (-12323, -31572)]    let q : ℤ := 9999608174    (9 : ℤ) ^ 36 * ∏ i : Fin 10, ∏ j : Fin 10 with i < j,      (((W i).1 - (W j).1) ^ 2 + ((W i).2 - (W j).2) ^ 2) > q ^ 45 := by first | (simp_all; done) | omega | decide | linarith | positivity | (aesop; done)
See it in the graphDiscuss this resultChallenge it