AFTD Auto-Formalizing Theoretical Domains

threshold101_edges_squared_ge

theoremverified

Every trimmed witness edge has integer squared length at least 7908209857886758229068357146803906.

Statement

theorem threshold101_edges_squared_ge :
    threshold101_edges.all (fun e => decide ((7908209857886758229068357146803906 : ℤ) ≤ ∑ k : Fin 3, (threshold101_coords e.1 k - threshold101_coords e.2 k)^2)) = true
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 2
  • threshold101_coordsThe 101 exact integer coordinate triples, obtained by scaling the primary decimal coordinates by 10^17.
  • threshold101_edgesThe 908 witness edges used by the trimmed LRAT refutation, selected from the primary 2030-edge graph.
Used by 1

The proof, explained

The theorem asserts that every edge in the explicit list `threshold101_edges` connects vertices whose integer squared Euclidean distance is at least 7908209857886758229068357146803906. Because both the edge list and the coordinate vectors are fully concrete, finite data, this condition is decidable by finite computation. Raising the recursion limit allows Lean's `decide` tactic to evaluate the predicate directly across all edges by kernel arithmetic.

  1. The boolean expression asserting that every edge in `threshold101_edges` has squared Euclidean length at least 7908209857886758229068357146803906 evaluates to `true`. automation

    The statement is a decidable equality over finite, fully concrete data: an explicit list of edges and fixed integer coordinates in $\mathbb{Z}^3$. Raising the recursion depth limit (`maxRecDepth`) to 100,000 allows the `decide` tactic to exhaustively compute the 3D squared distance for each edge and verify the integer inequality directly.

    lines 3–4

      set_option maxRecDepth 100000 in
        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

theorem threshold101_edges_squared_ge :    threshold101_edges.all (fun e => decide ((7908209857886758229068357146803906 : ℤ) ≤ ∑ k : Fin 3, (threshold101_coords e.1 k - threshold101_coords e.2 k)^2)) = true := by  set_option maxRecDepth 100000 in    decide
See it in the graphDiscuss this resultChallenge it