AFTD Auto-Formalizing Theoretical Domains

op_462_five_le_min_gale_counterexample_card_three

theoremverified

If there exists a finite counterexample to Gale's conjecture in dimension 3, then the minimum cardinality min_gale_counterexample_card_three of such a counterexample is at least 5.

Statement

theorem op_462_five_le_min_gale_counterexample_card_three
    (h : ∃ V : Finset (EuclideanSpace ℝ (Fin 3)), is_gale_counterexample_three V) :
    5 ≤ min_gale_counterexample_card_three
Source
arXiv:2610.28828 Sec. 5
Verified
24 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3

Read back from the Lean

Assuming there exists a finite subset $V \subset \mathbb{R}^3$ (modeled as Finset (EuclideanSpace ℝ (Fin 3))) such that: 1. $V$ has strictly positive metric diameter ($\operatorname{diam}(V) > 0$), and 2. The simple graph on $V$ with edges between pairs of distinct points at distance strictly greater than $\sqrt{\frac{3 + \sqrt{3}}{6}} \cdot \operatorname{diam}(V)$ is not 4-colorable, then the infimum of the cardinalities of all such finite subsets $V$ (in $\mathbb{N}$) 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

By definition, the minimum cardinality of a counterexample is the infimum of the set of cardinalities of all 3-dimensional Gale counterexamples. The proof uses `le_csInf` to reduce the claim 5 ≤ inf S to showing that S is nonempty and bounded below by 5. The assumed counterexample witnesses nonemptiness, and the theorem `op_462_gale_counterexample_card_three_ge_five` establishes that every 3-dimensional counterexample has at least 5 vertices.

  1. To show that the minimum counterexample size is at least 5, it suffices to show that the set of sizes of 3-dimensional Gale counterexamples is nonempty and that 5 is a lower bound for all of its elements.

    By definition, `min_gale_counterexample_card_three` is the infimum of the set of cardinalities of all 3-dimensional counterexamples. From the hypothesis `h`, we obtain an assumed counterexample `V` with proof `hV`. Applying `le_csInf` reduces proving that 5 is bounded by the infimum to two obligations: the set of counterexample sizes is nonempty, and every element in the set is at least 5.

    lines 5–7

    uses le_csInf

      unfold min_gale_counterexample_card_three
      obtain ⟨V, hV⟩ := h
      apply le_csInf
  2. The set of counterexample cardinalities is nonempty.

    The assumed counterexample V provides the witness |V| belonging to the set of counterexample sizes.

    line 8

      · exact ⟨V.card, V, rfl, hV⟩
  3. Every counterexample to Gale's conjecture in dimension 3 has cardinality at least 5.

    Given any element m in the set, witnessed by a counterexample W with |W| = m, the existing result `op_462_gale_counterexample_card_three_ge_five` shows that 5 ≤ |W|, which means 5 ≤ m.

    lines 9–10

    uses op_462_gale_counterexample_card_three_ge_five

      · rintro m ⟨W, rfl, hW⟩
        exact op_462_gale_counterexample_card_three_ge_five W hW
le_csInf
In a conditionally complete lattice (such as ℕ), if a set s is nonempty and a is a lower bound for all elements of s, then a ≤ sInf s.
op_462_gale_counterexample_card_three_ge_five
Any finite counterexample to Gale's conjecture in dimension 3 has at least 5 points.

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

/-- If a finite counterexample to Gale's conjecture in dimension 3 exists, then min_gale_counterexample_card_three is at least 5. -/theorem op_462_five_le_min_gale_counterexample_card_three    (h : ∃ V : Finset (EuclideanSpace ℝ (Fin 3)), is_gale_counterexample_three V) :    5 ≤ min_gale_counterexample_card_three := by  unfold min_gale_counterexample_card_three  obtain ⟨V, hV⟩ := h  apply le_csInf  · exact ⟨V.card, V, rfl, hV⟩  · rintro m ⟨W, rfl, hW⟩    exact op_462_gale_counterexample_card_three_ge_five W hW
See it in the graphDiscuss this resultChallenge it