threshold101_diameter_squared_le
Every squared distance between integer triples is at most 100000000000000100 squared.
Statement
theorem threshold101_diameter_squared_le :
∀ i j : Fin 101, (∑ k : Fin 3, (threshold101_coords i k - threshold101_coords j k)^2) ≤ (100000000000000100 : ℤ)^2- Source
- Helper for arXiv:2610.28828 Theorem 2. Exact 101-point coordinates and a trimmed witness subgraph from https://github.com/vsvor/Gale-conjecture/tree/bd6dc9594c589791f599a0bf4685841bcb5b4486/best_known/3d_101p_088928. points.csv SHA256 362e063b96d5075c6904446d3e9164879b47233de32158e46ff6703c96704093. Independent integer geometry and SAT check: experiment 6995; the LRAT proof is independently generated and kernel checked.
- Verified
- 27 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- threshold101_coordsThe 101 exact integer coordinate triples, obtained by scaling the primary decimal coordinates by 10^17.
- Used by 1
- threshold_graph_four_not_colorable_101There exists a finite subset V of 3-dimensional Euclidean space with cardinality 101 and strictly positive diameter such that the distance…
The proof, explained
The theorem states that the set of 101 three-dimensional integer points defined by `threshold101_coords` has diameter at most $100000000000000100$ (measured by squared Euclidean distance). Because the domain of point pairs is finite and all coordinates are explicit integers, the assertion is decidable. The proof proceeds entirely by computational reflection: Lean's `decide` tactic evaluates the inequality for all $101 \times 101 = 10{,}201$ pairs and verifies that each one satisfies the bound.
For all indices $i, j \in \{0, \dots, 100\}$, the squared Euclidean distance between the $i$-th and $j$-th points in `threshold101_coords` is at most $100000000000000100^2$. automation
The claim is a universally quantified statement over the finite domain $\text{Fin } 101 \times \text{Fin } 101$, which contains $101^2 = 10{,}201$ index pairs. For any fixed pair $(i, j)$, the sum of squared differences of their three coordinates is an explicit integer expression, making the inequality decidable. Increasing the recursion depth limit via `set_option maxRecDepth 100000` gives Lean sufficient depth to evaluate the decision procedure `decide`, which exhaustively computes and verifies the inequality for all 10,201 pairs.
set_option maxRecDepth 100000 in decide
- The proof contains no algebraic derivation; it relies entirely on Lean's kernel carrying out the exhaustive computational check of all 10,201 pairwise squared distances via `decide`.
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.
theorem threshold101_diameter_squared_le : ∀ i j : Fin 101, (∑ k : Fin 3, (threshold101_coords i k - threshold101_coords j k)^2) ≤ (100000000000000100 : ℤ)^2 := by set_option maxRecDepth 100000 in decide