op462_coords65_diameter_squared_le
Every squared distance between the scaled integer points is at most 10^34.
Statement
theorem op462_coords65_diameter_squared_le :
∀ i j : Fin 65, (∑ k : Fin 3, (op462_coords65 i k - op462_coords65 j k)^2) ≤ (10^17 : ℤ)^2- Source
- Helper formalizing the known 65-point example accompanying arXiv:2610.28828, https://github.com/vsvor/Gale-conjecture/tree/bd6dc9594c589791f599a0bf4685841bcb5b4486/best_known/3d_65p_088808. Exact data and independent computation: experiment 4045. Trimmed LRAT dependency graph: experiment 4047.
- Verified
- 24 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- op462_coords65The exact integer coordinates of the 65 indexed points, obtained by multiplying the primary decimal coordinates by 10^17.
- Used by 5
- op_462_min_counterexample_card_three_in_rangeThere exists a unique natural number m in the range 5 ≤ m ≤ 101 such that m is the least element of the set of cardinalities of all finite…
- op_462_min_gale_counterexample_card_three_range_sixty_fiveThe minimum cardinality
min_gale_counterexample_card_threeof a finite counterexample to Gale's conjecture in dimension 3 satisfies 5 ≤… - op_462_min_gale_counterexample_card_three_lt_101Open Problem OP-462: the minimum cardinality
min_gale_counterexample_card_threeof a finite counterexample to Gale's conjecture in… - op_462_min_gale_counterexample_card_three_le_sixty_fiveThe minimum cardinality
min_gale_counterexample_card_threeof a finite counterexample to Gale's conjecture in dimension 3 is at most 65. - op_462_gale_counterexample_card_three_le_101There exists a finite subset V of
EuclideanSpace ℝ (Fin 3)with cardinality 101 that is a counterexample to Gale's conjecture in…
The proof, explained
The theorem asserts that the squared Euclidean distance between any two of the 65 given 3-dimensional integer points does not exceed (10¹⁷)² = 10³⁴. Since the domain Fin 65 is finite, the universal statement consists of 4,225 concrete arithmetic checks on explicit integer coordinates. The proof completes by exhaustive computational evaluation using Lean's `decide` tactic.
For all indices i, j ∈ Fin 65, the squared Euclidean distance between point i and point j is at most (10¹⁷)² = 10³⁴. automation
The statement is a universally quantified inequality over the finite domain Fin 65 × Fin 65. Because the points have explicit integer coordinates and the domain is finite (65 × 65 = 4225 pairs), the proposition is decidable. The `decide` tactic checks the inequality for all pairs by direct exhaustive computation.
decide
- The entire proof is carried out by Lean's kernel through computational reduction; all 4,225 index pairs are checked by direct evaluation.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open scoped BigOperatorstheorem op462_coords65_diameter_squared_le : ∀ i j : Fin 65, (∑ k : Fin 3, (op462_coords65 i k - op462_coords65 j k)^2) ≤ (10^17 : ℤ)^2 := by decide