AFTD Auto-Formalizing Theoretical Domains

mordell_ten_exists_feasible_gt_chalk

theoremverified

There 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 10, ∏ j : Fin 10 with i < j, ‖z i - z j‖^2 > (10 : ℝ)^45 / (9 : ℝ)^36.

Statement

lemma mordell_ten_exists_feasible_gt_chalk :
    ∃ z : Fin 10 → ℂ, (∑ i : Fin 10, ‖z i‖ ^ 2 = 10) ∧
      (∏ i : Fin 10, ∏ j : Fin 10 with i < j, ‖z i - z j‖ ^ 2) > (10 : ℝ) ^ 45 / (9 : ℝ) ^ 36
Source
arXiv:2611.03088 Section 5.1
Verified
05 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 1
  • mordell_ten_suboptimalIn Mordell's problem for ten points in the complex plane, the supremum sSup of { d : ℝ | ∃ z : Fin 10 → ℂ, (∑ i : Fin 10, ‖z i‖^2 = 10) ∧…

Read back from the Lean

There exists a family of 10 complex numbers $z : \text{Fin } 10 \to \mathbb{C}$ such that: 1. The sum of the squared complex norms $\sum_{i \in \text{Fin } 10} \|z(i)\|^2$ is equal to $10$, and 2. The product over all pairs $(i, j)$ of indices in $\text{Fin } 10$ with $i < j$ of the squared distances $\|z(i) - z(j)\|^2$, namely $\prod_{i \in \text{Fin } 10} \prod_{j \in \text{Fin } 10,\, i < j} \|z(i) - z(j)\|^2$, is strictly greater than $\frac{10^{45}}{9^{36}}$ (as real numbers).

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 proves the existence of a 10-point configuration in ℂ satisfying ∑ ‖z i‖^2 = 10 whose pairwise squared distance product exceeds 10^45 / 9^36, beating the regular centered 9-gon value. The witness is constructed by scaling an explicit 10-point symmetric integer configuration W by c = √(10 / 9999608174), matching the norm sum constraint because ∑ ‖W i‖^2 = 9999608174. Factoring out c^2 from each of the 45 pairs scales the product of pairwise squared distances by (10 / 9999608174)^45. The result then follows by combining a precomputed integer inequality on the distance product of W with an algebraic rearrangement lemma.

  1. For each index i, factoring out the scalar c from the inner product over j > i yields c raised to the number of such indices j.

    For any fixed index i, the product over j with i < j distributes over multiplication, separating the constant factor c from d(i, j). Since c is constant, its product over the filtered set of indices equals c raised to the cardinality #{j | i < j}.

    lines 10–13

    uses prod_mul_distrib, prod_const

      have h1 : ∀ i : Fin 10, (∏ j : Fin 10 with i < j, (c * d i j)) =
          c ^ #(filter (fun j : Fin 10 => i < j) univ) * ∏ j : Fin 10 with i < j, d i j := by
        intro i
        rw [prod_mul_distrib, prod_const]
  2. Scaling each term in the double product over pairs i < j by c factors out c^45.

    Substituting the inner product factorization into the outer product, distributing the outer product, and combining powers of c yields c raised to the sum of cardinalities ∑ i, #{j | i < j}. That sum is the number of pairs 10 * 9 / 2 = 45, verified by Lean's computational kernel (`decide`).

    lines 14–18

    uses prod_mul_distrib, prod_pow_eq_pow_sum

      simp_rw [h1]
      rw [prod_mul_distrib]
      rw [prod_pow_eq_pow_sum]
      have h2 : (∑ i : Fin 10, #(filter (fun j : Fin 10 => i < j) univ)) = 45 := by decide
      rw [h2]
  3. The constants 9^36 and q^45 are strictly positive.

    Since 9 is positive, 9^36 > 0; similarly, since q > 0 is assumed, q^45 > 0 by positivity.

    lines 23–24

      have h9 : (0 : ℝ) < (9 : ℝ) ^ 36 := by positivity
      have hq45 : (0 : ℝ) < q ^ 45 := by positivity
  4. If q > 0 and 9^36 * P > q^45, then (10 / q)^45 * P > 10^45 / 9^36.

    The power (10 / q)^45 expands to 10^45 / q^45. Using the positivity of 9^36 and q^45, clearing denominators and rearranging terms transforms the inequality into 10^45 * q^45 < 10^45 * (9^36 * P), which follows immediately from q^45 < 9^36 * P by nonlinear arithmetic.

    lines 25–32

    uses div_pow, gt_iff_lt, div_lt_iff₀, mul_assoc, mul_comm, div_mul_eq_mul_div, lt_div_iff₀

      rw [div_pow]
      rw [gt_iff_lt] at *
      rw [div_lt_iff₀ h9]
      rw [mul_assoc]
      rw [mul_comm P (9 ^ 36)]
      rw [div_mul_eq_mul_div]
      rw [lt_div_iff₀ hq45]
      nlinarith
  5. Define the candidate configuration z by scaling the integer witness points W by c = √(10 / 9999608174).

    We introduce the ten integer lattice points W and the scaling factor c, construct the configuration z : Fin 10 → ℂ where z(i) = c * (W(i).1 + i * W(i).2), and provide z as the existential witness.

    lines 38–41

      let W := mordell_ten_exists_feasible_gt_chalk_W
      let c : ℝ := Real.sqrt (10 / 9999608174)
      let z : Fin 10 → ℂ := fun i => (c : ℂ) * Complex.mk ((W i).1 : ℝ) ((W i).2 : ℝ)
      use z
  6. The squared scale factor is c^2 = 10 / 9999608174, and the squared norm of each point is ‖z i‖^2 = c^2 * (W(i).1^2 + W(i).2^2).

    Squaring the square root gives c^2 = 10 / 9999608174. By multiplicativity of the complex squared norm, ‖z i‖^2 factors into c^2 times the squared norm of the integer point W(i), which is the sum of the squares of its real and imaginary parts.

    lines 42–49

    uses Real.sq_sqrt, Complex.normSq_eq_norm_sq, Complex.normSq.map_mul, Complex.normSq_ofReal, Complex.normSq_mk, sq

      have hc2 : c ^ 2 = 10 / 9999608174 := by
        apply Real.sq_sqrt
        positivity
      have hnorm : ∀ i : Fin 10, ‖z i‖ ^ 2 = c ^ 2 * (((W i).1 : ℝ) ^ 2 + ((W i).2 : ℝ) ^ 2) := by
        intro i
        rw [← Complex.normSq_eq_norm_sq]
        dsimp [z]
        rw [Complex.normSq.map_mul, Complex.normSq_ofReal, Complex.normSq_mk, sq, sq, sq]
  7. The configuration z satisfies the feasibility constraint ∑ i, ‖z i‖^2 = 10.

    Substituting the squared norms into the sum and factoring out c^2 = 10 / 9999608174 leaves c^2 times the sum of the squared integer coordinates. Lemma `mordell_ten_integer_norm_sum` establishes that this integer sum equals 9999608174, so multiplying by 10 / 9999608174 cancels the denominator, giving 10.

    lines 50–60

    uses Finset.mul_sum, mordell_ten_integer_norm_sum, congr_arg, div_mul_cancel₀

      have hsum : ∑ i : Fin 10, ‖z i‖ ^ 2 = 10 := by
        simp_rw [hnorm, hc2]
        rw [← Finset.mul_sum]
        have h : (∑ i : Fin 10, (((W i).1 : ℝ) ^ 2 + ((W i).2 : ℝ) ^ 2)) = (9999608174 : ℝ) := by
          have h0 := mordell_ten_integer_norm_sum
          have h_cast := congr_arg (fun (x : ℤ) => (x : ℝ)) h0
          push_cast at h_cast
          exact h_cast
        rw [h]
        exact div_mul_cancel₀ 10 (by norm_num)
      refine ⟨hsum, ?_⟩
  8. For each pair i, j, the squared distance ‖z i - z j‖^2 equals c^2 * ((W(i).1 - W(j).1)^2 + (W(i).2 - W(j).2)^2).

    The difference z(i) - z(j) factors as c * (W(i) - W(j)). By multiplicativity of the complex squared norm, this is c^2 times the squared Euclidean distance between the integer coordinates.

    lines 61–70

    uses Complex.normSq_eq_norm_sq, mul_sub, Complex.normSq.map_mul, Complex.normSq_ofReal, sq, Complex.normSq_apply

      have hdiff : ∀ i j : Fin 10,
          ‖z i - z j‖ ^ 2 = c ^ 2 * (((W i).1 - (W j).1 : ℝ) ^ 2 + ((W i).2 - (W j).2 : ℝ) ^ 2) := by
        intro i j
        rw [← Complex.normSq_eq_norm_sq]
        dsimp [z]
        rw [← mul_sub]
        rw [Complex.normSq.map_mul, Complex.normSq_ofReal, sq]
        congr 1
        rw [Complex.normSq_apply]
        simp [sq]
  9. The product of all 45 pairwise squared distances strictly exceeds 10^45 / 9^36.

    Rewriting pairwise distances with the previous factoring identity and applying lemma `mordell_ten_exists_feasible_gt_chalk_prod_pair_scale` factors out (c^2)^45 = (10 / 9999608174)^45 from the product. Casting the integer inequality 9^36 * P > 9999608174^45 from `mordell_ten_integer_witness_ineq` to ℝ and applying `mordell_ten_exists_feasible_gt_chalk_ineq_step` completes the inequality.

    lines 71–81

    uses mordell_ten_exists_feasible_gt_chalk_prod_pair_scale, mordell_ten_integer_witness_ineq, mordell_ten_exists_feasible_gt_chalk_ineq_step

      simp_rw [hdiff, hc2]
      rw [mordell_ten_exists_feasible_gt_chalk_prod_pair_scale]
      have hP : (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) > (9999608174 : ℝ) ^ 45 := by
        have h0 := mordell_ten_integer_witness_ineq
        have h_cast : ((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) : ℝ) > (((9999608174 : ℤ) : ℝ) ^ 45) := by
          exact_mod_cast h0
        push_cast at h_cast
        exact h_cast
      exact mordell_ten_exists_feasible_gt_chalk_ineq_step 9999608174 _ (by norm_num) hP
Complex.normSq_apply
The squared norm of a complex number z equals the sum of the squares of its real and imaginary parts.
Complex.normSq_eq_norm_sq
The complex squared norm equals the squared Euclidean norm: Complex.normSq z = ‖z‖^2.
Complex.normSq_mk
The squared norm of a complex number given by its real and imaginary parts x, y is x^2 + y^2.
Complex.normSq_ofReal
The complex squared norm of a real number is its square: Complex.normSq (r : ℂ) = r^2.
Complex.normSq.map_mul
The complex squared norm preserves multiplication: Complex.normSq (a * b) = Complex.normSq a * Complex.normSq b.
Finset.mul_sum
Multiplication by a scalar distributes over a finite sum from the left.
Real.sq_sqrt
The square of the square root of a non-negative real number x is x.
congr_arg
Applying a function to equal arguments produces equal results: a₁ = a₂ implies f a₁ = f a₂.
div_mul_cancel₀
Multiplying a quotient a / b by b yields a, provided b ≠ 0.
div_mul_eq_mul_div
Multiplying a fraction a / b by c equals (a * c) / b.
div_lt_iff₀
For c > 0, b / c < a holds if and only if b < a * c.
div_pow
The n-th power of a quotient a / b equals the quotient of powers a^n / b^n.
gt_iff_lt
Strict inequality x > y is definitionally equivalent to y < x.
lt_div_iff₀
For c > 0, a < b / c holds if and only if a * c < b.
mordell_ten_exists_feasible_gt_chalk_ineq_step
If q > 0 and 9^36 * P > q^45, then (10 / q)^45 * P > 10^45 / 9^36.
mordell_ten_exists_feasible_gt_chalk_prod_pair_scale
Scaling each factor in the product of 45 pairs by c factors out c^45: ∏ i < j, (c * d i j) = c^45 * ∏ i < j, d i j.
mordell_ten_integer_norm_sum
The sum of squared Euclidean norms of the ten integer witness points W equals 9999608174.
mordell_ten_integer_witness_ineq
For the ten integer points W and q = 9999608174, 9^36 times the product of the 45 pairwise squared distances strictly exceeds q^45.
mul_assoc
Multiplication in a semigroup is associative: (a * b) * c = a * (b * c).
mul_comm
Multiplication is commutative: a * b = b * a.
mul_sub
Multiplication distributes over subtraction from the left: a * (b - c) = a * b - a * c.
prod_const
The product of a constant b over a finite set s is b raised to the cardinality of s.
prod_mul_distrib
The product of a pointwise product over a finite set equals the product of the first factors times the product of the second factors.
prod_pow_eq_pow_sum
The product over a finite set of a constant base raised to varying exponents equals the base raised to the sum of the exponents.
sq
The square of an element equals multiplying it by itself: a^2 = a * a.

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

open Finsetdef mordell_ten_exists_feasible_gt_chalk_W : Fin 10 → ℤ × ℤ := ![(11183, 0), (-11183, 0),  (32765, 14669), (32765, -14669), (-32765, 14669), (-32765, -14669),  (12323, 31572), (12323, -31572), (-12323, 31572), (-12323, -31572)]lemma mordell_ten_exists_feasible_gt_chalk_prod_pair_scale (c : ℝ) (d : Fin 10 → Fin 10 → ℝ) :    (∏ i : Fin 10, ∏ j : Fin 10 with i < j, (c * d i j)) =      c ^ 45 * ∏ i : Fin 10, ∏ j : Fin 10 with i < j, d i j := by  have h1 : ∀ i : Fin 10, (∏ j : Fin 10 with i < j, (c * d i j)) =      c ^ #(filter (fun j : Fin 10 => i < j) univ) * ∏ j : Fin 10 with i < j, d i j := by    intro i    rw [prod_mul_distrib, prod_const]  simp_rw [h1]  rw [prod_mul_distrib]  rw [prod_pow_eq_pow_sum]  have h2 : (∑ i : Fin 10, #(filter (fun j : Fin 10 => i < j) univ)) = 45 := by decide  rw [h2]lemma mordell_ten_exists_feasible_gt_chalk_ineq_step (q P : ℝ) (hq : 0 < q)    (hP : (9 : ℝ) ^ 36 * P > q ^ 45) :    (10 / q) ^ 45 * P > (10 : ℝ) ^ 45 / (9 : ℝ) ^ 36 := by  have h9 : (0 : ℝ) < (9 : ℝ) ^ 36 := by positivity  have hq45 : (0 : ℝ) < q ^ 45 := by positivity  rw [div_pow]  rw [gt_iff_lt] at *  rw [div_lt_iff₀ h9]  rw [mul_assoc]  rw [mul_comm P (9 ^ 36)]  rw [div_mul_eq_mul_div]  rw [lt_div_iff₀ hq45]  nlinarith/-- Existence of a feasible 10-point configuration beating the centered regular polygon value. -/lemma mordell_ten_exists_feasible_gt_chalk :    ∃ z : Fin 10 → ℂ, (∑ i : Fin 10, ‖z i‖ ^ 2 = 10) ∧      (∏ i : Fin 10, ∏ j : Fin 10 with i < j, ‖z i - z j‖ ^ 2) > (10 : ℝ) ^ 45 / (9 : ℝ) ^ 36 := by  let W := mordell_ten_exists_feasible_gt_chalk_W  let c : ℝ := Real.sqrt (10 / 9999608174)  let z : Fin 10 → ℂ := fun i => (c : ℂ) * Complex.mk ((W i).1 : ℝ) ((W i).2 : ℝ)  use z  have hc2 : c ^ 2 = 10 / 9999608174 := by    apply Real.sq_sqrt    positivity  have hnorm : ∀ i : Fin 10, ‖z i‖ ^ 2 = c ^ 2 * (((W i).1 : ℝ) ^ 2 + ((W i).2 : ℝ) ^ 2) := by    intro i    rw [← Complex.normSq_eq_norm_sq]    dsimp [z]    rw [Complex.normSq.map_mul, Complex.normSq_ofReal, Complex.normSq_mk, sq, sq, sq]  have hsum : ∑ i : Fin 10, ‖z i‖ ^ 2 = 10 := by    simp_rw [hnorm, hc2]    rw [← Finset.mul_sum]    have h : (∑ i : Fin 10, (((W i).1 : ℝ) ^ 2 + ((W i).2 : ℝ) ^ 2)) = (9999608174 : ℝ) := by      have h0 := mordell_ten_integer_norm_sum      have h_cast := congr_arg (fun (x : ℤ) => (x : ℝ)) h0      push_cast at h_cast      exact h_cast    rw [h]    exact div_mul_cancel₀ 10 (by norm_num)  refine ⟨hsum, ?_⟩  have hdiff : ∀ i j : Fin 10,      ‖z i - z j‖ ^ 2 = c ^ 2 * (((W i).1 - (W j).1 : ℝ) ^ 2 + ((W i).2 - (W j).2 : ℝ) ^ 2) := by    intro i j    rw [← Complex.normSq_eq_norm_sq]    dsimp [z]    rw [← mul_sub]    rw [Complex.normSq.map_mul, Complex.normSq_ofReal, sq]    congr 1    rw [Complex.normSq_apply]    simp [sq]  simp_rw [hdiff, hc2]  rw [mordell_ten_exists_feasible_gt_chalk_prod_pair_scale]  have hP : (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) > (9999608174 : ℝ) ^ 45 := by    have h0 := mordell_ten_integer_witness_ineq    have h_cast : ((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) : ℝ) > (((9999608174 : ℤ) : ℝ) ^ 45) := by      exact_mod_cast h0    push_cast at h_cast    exact h_cast  exact mordell_ten_exists_feasible_gt_chalk_ineq_step 9999608174 _ (by norm_num) hP
See it in the graphDiscuss this resultChallenge it