AFTD Auto-Formalizing Theoretical Domains

op_462_gale_counterexample_card_three_ge_five

theoremverified

For every finite subset V of EuclideanSpace ℝ (Fin 3), if V is a counterexample to Gale's conjecture in dimension 3 (is_gale_counterexample_three V), then the cardinality of V is at least 5.

Statement

theorem op_462_gale_counterexample_card_three_ge_five (V : Finset (EuclideanSpace ℝ (Fin 3))) (hV : is_gale_counterexample_three V) : 5 ≤ V.card
Source
arXiv:2610.28828, Sec. 5, Question 2
Verified
24 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 3

Read back from the Lean

For any finite subset $V$ of the 3-dimensional Euclidean space $\mathbb{R}^3$, if $V$ is a "Gale counterexample in dimension 3" (meaning that the metric diameter of $V$ is strictly positive and the graph on $V$ whose edges connect distinct points at distance strictly greater than $\sqrt{(3 + \sqrt{3})/6} \cdot \operatorname{diam}(V)$ is not 4-colorable), then the cardinality of $V$ is at least 5.

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 theorem is proved by contradiction. Assuming that a counterexample V to Gale's conjecture in dimension 3 has fewer than 5 points, its cardinality must be at most 4. This immediately contradicts the previously established fact that no subset of ℝ³ with at most 4 points can be a Gale counterexample.

  1. Assuming for contradiction that |V| < 5, we have |V| ≤ 4.

    We proceed by contradiction, assuming that |V| is not at least 5 (negating 5 ≤ |V|). By linear integer arithmetic, a natural number that is not at least 5 is at most 4, so |V| ≤ 4.

    lines 3–4

      by_contra h
      have h4 : V.card ≤ 4 := by omega
  2. A contradiction is reached, establishing 5 ≤ |V|.

    By op_462_not_is_gale_counterexample_three_of_card_le_four, any finite subset of ℝ³ with cardinality at most 4 cannot be a Gale counterexample. Applying this theorem to V and |V| ≤ 4 contradicts the hypothesis hV that V is a counterexample.

    line 5

    uses op_462_not_is_gale_counterexample_three_of_card_le_four

      exact op_462_not_is_gale_counterexample_three_of_card_le_four V h4 hV
op_462_not_is_gale_counterexample_three_of_card_le_four
Any finite subset of ℝ³ with at most 4 points cannot be a counterexample to Gale's conjecture in dimension 3.

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

/-- Every counterexample to Gale's conjecture in dimension 3 has at least 5 points. -/theorem op_462_gale_counterexample_card_three_ge_five (V : Finset (EuclideanSpace ℝ (Fin 3))) (hV : is_gale_counterexample_three V) : 5 ≤ V.card := by  by_contra h  have h4 : V.card ≤ 4 := by omega  exact op_462_not_is_gale_counterexample_three_of_card_le_four V h4 hV
See it in the graphDiscuss this resultChallenge it