AFTD Auto-Formalizing Theoretical Domains

op_462_min_gale_counterexample_card_three_le_sixty_five

theoremverified

The minimum cardinality min_gale_counterexample_card_three of a finite counterexample to Gale's conjecture in dimension 3 is at most 65.

Statement

theorem op_462_min_gale_counterexample_card_three_le_sixty_five : min_gale_counterexample_card_three ≤ 65
Source
arXiv:2610.28828 Sec. 5, Question 2
Verified
08 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 8
Used by 1

Read back from the Lean

The infimum (in ℕ) of the set of natural numbers m such that there exists a finite subset V ⊆ ℝ³ (Euclidean space of dimension 3) with cardinality m, strictly positive metric diameter, and whose Gale distance graph at threshold √( (3 + √3) / 6 ) * diam(V) is not 4-colorable, is less than or equal to 65.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The proof shows that the minimum cardinality of a 3-dimensional counterexample to Gale's conjecture is at most 65 by exhibiting an explicit 65-point integer configuration scaled by S = 10¹⁷. Using the criterion `op_462_min_card_le_of_integer_witness`, the problem reduces to verifying that the configuration has diameter at most S, that a specified edge graph has squared edge lengths at least Q and is not 4-colorable, and that the critical ratio σ₃² is strictly less than Q / S². The geometric and graph-theoretic properties are supplied by pre-verified lemmas, and the remaining scalar inequality (3 + √3) / 6 < Q / S² is checked by numerical calculation.

  1. The minimum counterexample cardinality is at most 65, provided that σ₃² < Q / S² for scale S = 10¹⁷ and squared distance threshold Q = 7887420401648046950672144846523981.

    We apply `op_462_min_card_le_of_integer_witness` using the explicit 65-point configuration `op462_coords65` and edge list `op462_edges65`. The hypotheses are discharged as follows: the scale 10¹⁷ is positive (via `norm_num`); the maximum squared distance between any pair is at most (10¹⁷)² (by `op462_coords65_diameter_squared_le`); every edge in the list has squared length at least Q (by `op462_coords65_edges_squared_ge`); the graph on these edges is not 4-colorable (by `op462_no_four_coloring65`); and the edge list is non-empty as witnessed by (0, 1) (checked by `decide`). This leaves only the threshold inequality σ₃² < Q / S².

    lines 3–6

    uses op_462_min_card_le_of_integer_witness, op462_coords65_diameter_squared_le, op462_coords65_edges_squared_ge, op462_no_four_coloring65

      apply op_462_min_card_le_of_integer_witness 65 (10^17)
        7887420401648046950672144846523981 (by norm_num)
        op462_coords65 op462_edges65 op462_coords65_diameter_squared_le
        op462_coords65_edges_squared_ge ?_ op462_no_four_coloring65 0 1 (by decide)
  2. It suffices to show that (3 + √3) / 6 < 7887420401648046950672144846523981 / (10¹⁷)².

    We unfold the definition of the 3-dimensional Gale threshold σ₃ = √((3 + √3) / 6) on line 7. On line 8, `Real.sq_sqrt` simplifies (√((3 + √3) / 6))² to (3 + √3) / 6, with non-negativity of the radicand verified by `positivity`.

    lines 7–8

    uses Real.sq_sqrt

      unfold gale_sigma_three
      rw [Real.sq_sqrt (by positivity)]
  3. The inequality (3 + √3) / 6 < 7887420401648046950672144846523981 / (10¹⁷)² holds. automation

    The `num_ineq` tactic proves this numerical inequality by rigorously approximating the algebraic number (3 + √3) / 6 ≈ 0.788675 and comparing it to the rational threshold Q / S² ≈ 0.788742.

    line 9

      num_ineq
op_462_min_card_le_of_integer_witness
If an integer point configuration of size n has diameter squared at most S², a non-empty list of edges E whose endpoints all have squared distance at least Q with σ₃² < Q / S², and the graph on E cannot be 4-colored, then the minimum cardinality of a 3-dimensional Gale counterexample is at most n.
op462_coords65_diameter_squared_le
For all pairs of points in the 65-point configuration op462_coords65, their squared Euclidean distance is at most (10¹⁷)².
op462_coords65_edges_squared_ge
Every edge in op462_edges65 connects two points in op462_coords65 whose squared Euclidean distance is at least 7887420401648046950672144846523981.
op462_no_four_coloring65
The graph with vertex set Fin 65 and edge set op462_edges65 does not admit a proper 4-coloring.
Real.sq_sqrt
For any non-negative real number x, the square of its square root is x.

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

/-- The minimum cardinality of a finite counterexample to Gale's conjecture in dimension 3 is at most 65. -/theorem op_462_min_gale_counterexample_card_three_le_sixty_five : min_gale_counterexample_card_three ≤ 65 := by  apply op_462_min_card_le_of_integer_witness 65 (10^17)    7887420401648046950672144846523981 (by norm_num)    op462_coords65 op462_edges65 op462_coords65_diameter_squared_le    op462_coords65_edges_squared_ge ?_ op462_no_four_coloring65 0 1 (by decide)  unfold gale_sigma_three  rw [Real.sq_sqrt (by positivity)]  num_ineq
See it in the graphDiscuss this resultChallenge it