AFTD Auto-Formalizing Theoretical Domains

op462_coords65_edges_squared_ge

theoremverified

Every witness edge has scaled squared distance at least 7887420401648046950672144846523981.

Statement

theorem op462_coords65_edges_squared_ge :
    op462_edges65.all (fun e => decide ((7887420401648046950672144846523981 : ℤ) ≤ ∑ k : Fin 3, (op462_coords65 e.1 k - op462_coords65 e.2 k)^2)) = true
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 2
  • op462_coords65The exact integer coordinates of the 65 indexed points, obtained by multiplying the primary decimal coordinates by 10^17.
  • op462_edges65The 859 witness edges on the 65 indexed points in the primary repository.
Used by 5

The proof, explained

The theorem states that all edges in the explicit 65-vertex graph `op462_edges65` have a squared Euclidean distance between their endpoints of at least 7887420401648046950672144846523981. Because both the edge list and the coordinate embedding are given by concrete integer values, the statement is a closed computation over finite data. The proof completes in a single step via the `decide` tactic, which verifies all edge inequalities by direct evaluation.

  1. For every edge in `op462_edges65`, the squared Euclidean distance between its endpoint coordinates is at least 7887420401648046950672144846523981. automation

    The edge list `op462_edges65` is finite and explicit, and the vertex coordinates in `op462_coords65` are concrete integers in $\mathbb{Z}^3$. The statement asserts that a Boolean predicate holds for every element of this list, which is a closed decidable proposition. The `decide` tactic reduces the entire expression to `true = true` by evaluating the sums of squared differences and integer comparisons directly.

    line 5

      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

open scoped BigOperatorstheorem op462_coords65_edges_squared_ge :    op462_edges65.all (fun e => decide ((7887420401648046950672144846523981 : ℤ) ≤ ∑ k : Fin 3, (op462_coords65 e.1 k - op462_coords65 e.2 k)^2)) = true := by  decide
See it in the graphDiscuss this resultChallenge it