AFTD Auto-Formalizing Theoretical Domains

min_gale_counterexample_card_three

def

The minimum cardinality min_gale_counterexample_card_three of a finite counterexample to Gale's conjecture in dimension 3 is the infimum of the set of natural numbers m such that there exists a finite subset V of EuclideanSpace ℝ (Fin 3) with cardinality m satisfying is_gale_counterexample_three V.

Statement

noncomputable def min_gale_counterexample_card_three : ℕ
Defined in
arXiv:2610.28828, Sec. 5, Question 2
Verified
23 Oct 2026
Axioms
none listed
Built on 1
  • is_gale_counterexample_threeA finite subset V of the 3-dimensional Euclidean space EuclideanSpace ℝ (Fin 3) is a counterexample to Gale's conjecture in dimension 3…
Used by 8

Read back from the Lean

min_gale_counterexample_card_three is defined as the infimum (in ℕ) of the set of all natural numbers m such that there exists a finite subset V of 3-dimensional Euclidean space (EuclideanSpace ℝ (Fin 3)) with cardinality m satisfying is_gale_counterexample_three V.

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

Lean source view module on GitHub

/-- The minimum cardinality m(3) of a finite counterexample to Gale's conjecture in dimension 3. -/
noncomputable def min_gale_counterexample_card_three : ℕ := sInf { m : ℕ | ∃ V : Finset (EuclideanSpace ℝ (Fin 3)), V.card = m ∧ is_gale_counterexample_three V }
See it in the graphDiscuss this resultChallenge it