threshold101_coords_injective
The 101 integer coordinate triples are pairwise distinct.
Statement
theorem threshold101_coords_injective : Function.Injective threshold101_coords- 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 asserts that the 101 integer coordinate triples in `threshold101_coords` are pairwise distinct, or equivalently, that the indexing function is injective. Because the domain `Fin 101` is finite and equality of integer vectors is decidable, this is a purely finite computation. The proof proceeds by running Lean's `decide` tactic with an increased recursion depth to exhaustively evaluate distinctness across all pairs.
The coordinate mapping `threshold101_coords` is injective. automation
Because the domain is the finite index set `Fin 101` and equality of integer coordinate triples is decidable, injectivity is a decidable proposition. Lean's `decide` tactic verifies the claim by exhaustive evaluation—checking that no two distinct indices among the 101 entries share the same coordinate triple—with the recursion depth limit increased to 100,000 to allow the full evaluation of all pairs.
set_option maxRecDepth 100000 in decide
- The proof relies entirely on computational reflection (`decide`) rather than symbolic deduction, exhaustively checking the distinctness of all pairs via kernel 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.
theorem threshold101_coords_injective : Function.Injective threshold101_coords := by set_option maxRecDepth 100000 in decide