cyclic_permutation_subtraction_set_nonempty
For any natural numbers d, s, a, b, the finite set cyclic_permutation_subtraction_set d s a b is nonempty.
Statement
theorem cyclic_permutation_subtraction_set_nonempty (d s a b : ℕ) :
(cyclic_permutation_subtraction_set d s a b).Nonempty- Source
- arXiv:2611.09157
- Verified
- 10 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- cyclic_permutation_subtraction_setFor natural numbers d, s, a, b, cyclic_permutation_subtraction_set d s a b is the finite set in Finset (List (Fin d)) consisting of the…
- multidim_instance_existsFor every natural number D ≥ 1, there exists an instance of multidimensional scheduling with D resources.
Read back from the Lean
For all natural numbers $d$, $s$, $a$, and $b$, the finite set cyclic_permutation_subtraction_set d s a b is nonempty (i.e., contains at least one element).
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 asserts that the finite set `cyclic_permutation_subtraction_set d s a b` is nonempty for any natural numbers d, s, a, b. Unfolding the definition reveals that the set is defined as an explicit pair `{x, y}` of two list elements. Such an explicitly enumerated set is trivially nonempty, which the simplifier discharges immediately.
The finite set cyclic_permutation_subtraction_set d s a b is nonempty. automation
The automated search explores several candidate tactic combinations via `first`. The successful alternative unfolds the definition of `cyclic_permutation_subtraction_set`, revealing that the set is defined as an explicit two-element finite set `{x, y}`. The simplifier (`simpa`) then immediately discharges the nonemptiness goal, since any explicitly constructed set literal containing elements is non-empty.
uses
cyclic_permutation_subtraction_set,multidim_instance_exists(cyclic_permutation_subtraction_set d s a b).Nonempty := by first | exact multidim_instance_exists | (apply multidim_instance_exists <;> assumption) | (apply multidim_instance_exists <;> simp_all) | simpa using multidim_instance_exists | (simp only [cyclic_permutation_subtraction_set] at *; first | exact multidim_instance_exists | (apply multidim_instance_exists <;> assumption) | (apply multidim_instance_exists <;> simp_all) | simpa using multidim_instance_exists)
cyclic_permutation_subtraction_set- The definition expressing the subtraction set as a finite set containing two explicit flattened list elements.
multidim_instance_exists- For any dimension D ≥ 1, there exists an instance of MultidimInstance D (an artifact from an automated search).
- The proof script was generated by an automated tactic search that tries combinations of `exact`, `apply`, and `simpa` using `multidim_instance_exists`. Although `multidim_instance_exists` is supplied to `simpa`, it is mathematically irrelevant: `simpa` closes the goal solely because any set literal of the form `{x, y}` is automatically recognized as nonempty by simp lemmas for finite sets.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The cyclic permutation subtraction set is always nonempty. -/theorem cyclic_permutation_subtraction_set_nonempty (d s a b : ℕ) : (cyclic_permutation_subtraction_set d s a b).Nonempty := by first | exact multidim_instance_exists | (apply multidim_instance_exists <;> assumption) | (apply multidim_instance_exists <;> simp_all) | simpa using multidim_instance_exists | (simp only [cyclic_permutation_subtraction_set] at *; first | exact multidim_instance_exists | (apply multidim_instance_exists <;> assumption) | (apply multidim_instance_exists <;> simp_all) | simpa using multidim_instance_exists)