AFTD Auto-Formalizing Theoretical Domains

op_462_min_gale_counterexample_card_three_in_range

theoremverified

The minimum cardinality min_gale_counterexample_card_three of a finite counterexample to Gale's conjecture in dimension 3 satisfies 5 ≤ min_gale_counterexample_card_three and min_gale_counterexample_card_three ≤ 101.

Statement

theorem op_462_min_gale_counterexample_card_three_in_range : 5 ≤ min_gale_counterexample_card_three ∧ min_gale_counterexample_card_three ≤ 101
Source
arXiv:2610.28828, Sec. 5, Question 2
Verified
24 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
Used by 1

Read back from the Lean

The infimum in ℕ of the cardinalities of all finite subsets V of 3-dimensional Euclidean space that are "Gale counterexamples" (meaning V has strictly positive diameter and its Gale distance graph at threshold Real.sqrt ((3 + Real.sqrt 3) / 6) * diam(V) is not 4-colorable) is at least 5 and at most 101.

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 minimum cardinality of a 3-dimensional Gale counterexample is defined as the infimum of the set of cardinalities of all such counterexamples. To bound this minimum between 5 and 101, the proof establishes the lower and upper bounds separately. For the lower bound, since a 101-point counterexample exists, the set of sizes is nonempty and its infimum is attained by an actual counterexample, which must have at least 5 vertices by an established lower bound. For the upper bound, the existence of the 101-point counterexample directly implies that the infimum is at most 101.

  1. It suffices to establish the lower bound 5 ≤ min_gale_counterexample_card_three and the upper bound min_gale_counterexample_card_three ≤ 101 separately.

    Applying `constructor` splits the conjunction into two independent goals: the lower bound and the upper bound.

    line 3

      constructor
  2. The set of counterexample cardinalities is nonempty, so its minimum is attained by some counterexample V.

    Using the known 101-point counterexample provided by `op_462_gale_counterexample_card_three_le_101`, we witness that the set of counterexample sizes {m : ℕ | ∃ V, V.card = m ∧ is_gale_counterexample_three V} is nonempty. By `Nat.sInf_mem`, the infimum of any nonempty set of natural numbers is an element of that set, providing a counterexample V whose cardinality equals this infimum.

    lines 4–8

    uses op_462_gale_counterexample_card_three_le_101, Nat.sInf_mem

      · have hne : ({m : ℕ | ∃ V : Finset (EuclideanSpace ℝ (Fin 3)), V.card = m ∧ is_gale_counterexample_three V}).Nonempty := by
          obtain ⟨V, hcard, hV⟩ := op_462_gale_counterexample_card_three_le_101
          exact ⟨101, V, hcard, hV⟩
        have hmem := Nat.sInf_mem hne
        obtain ⟨V, hcard, hV⟩ := hmem
  3. 5 ≤ min_gale_counterexample_card_three

    By `op_462_gale_counterexample_card_three_ge_five`, every 3-dimensional counterexample V satisfies 5 ≤ V.card. After unfolding `min_gale_counterexample_card_three`, linear integer arithmetic (`omega`) combines V.card = sInf ... and 5 ≤ V.card to conclude 5 ≤ sInf ....

    lines 9–11

    uses op_462_gale_counterexample_card_three_ge_five

        have h5 := op_462_gale_counterexample_card_three_ge_five V hV
        unfold min_gale_counterexample_card_three
        omega
  4. min_gale_counterexample_card_three ≤ 101

    Invoking `op_462_gale_counterexample_card_three_le_101` provides a counterexample V with V.card = 101. Unfolding `min_gale_counterexample_card_three`, this witness shows that 101 belongs to the set of counterexample sizes. By `Nat.sInf_le`, the infimum of a set of natural numbers is at most any element in that set, yielding the upper bound.

    lines 12–14

    uses op_462_gale_counterexample_card_three_le_101, Nat.sInf_le

      · obtain ⟨V, hcard, hV⟩ := op_462_gale_counterexample_card_three_le_101
        unfold min_gale_counterexample_card_three
        exact Nat.sInf_le ⟨V, hcard, hV⟩
op_462_gale_counterexample_card_three_le_101
There exists a finite counterexample to Gale's conjecture in 3-dimensional Euclidean space having cardinality 101.
Nat.sInf_mem
If a set of natural numbers is nonempty, its infimum (minimum) belongs to the set.
op_462_gale_counterexample_card_three_ge_five
Every finite counterexample to Gale's conjecture in 3-dimensional Euclidean space has cardinality at least 5.
Nat.sInf_le
The infimum (minimum) of a set of natural numbers is less than or equal to any element in the set.

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 counterexample to Gale's conjecture in dimension 3 lies between 5 and 101. -/theorem op_462_min_gale_counterexample_card_three_in_range : 5 ≤ min_gale_counterexample_card_three ∧ min_gale_counterexample_card_three ≤ 101 := by  constructor  · have hne : ({m : ℕ | ∃ V : Finset (EuclideanSpace ℝ (Fin 3)), V.card = m ∧ is_gale_counterexample_three V}).Nonempty := by      obtain ⟨V, hcard, hV⟩ := op_462_gale_counterexample_card_three_le_101      exact ⟨101, V, hcard, hV⟩    have hmem := Nat.sInf_mem hne    obtain ⟨V, hcard, hV⟩ := hmem    have h5 := op_462_gale_counterexample_card_three_ge_five V hV    unfold min_gale_counterexample_card_three    omega  · obtain ⟨V, hcard, hV⟩ := op_462_gale_counterexample_card_three_le_101    unfold min_gale_counterexample_card_three    exact Nat.sInf_le ⟨V, hcard, hV⟩
See it in the graphDiscuss this resultChallenge it