AFTD Auto-Formalizing Theoretical Domains

zero_sum_w_bad_nil

theoremverified

The empty sequence is w-bad.

Statement

theorem zero_sum_w_bad_nil (n r : ℕ) : zero_sum_w_bad n ([] : List (Fin r → ℤ))
Source
Sanity lemma for w-bad sequences, arXiv:2610.19965 (Proofs and disproofs of some conjectures on zero-sum problems).
Verified
15 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • zero_sum_w_badAn admissible sequence is w-bad when no nonempty subsequence satisfies (1.2).

The proof, explained

To show that the empty sequence is w-bad, we must show that it is admissible and that it has no good sub-sequences. Admissibility holds vacuously because the empty list contains no elements. Furthermore, any good sub-sequence requires a non-empty index set from the sequence's index type Fin 0, which is impossible since Fin 0 is empty.

  1. The goal reduces to showing that the empty list is admissible and that it contains no good sub-sequences.

    Unfolding the definitions of `zero_sum_w_bad`, `zero_sum_admissible`, and `zero_sum_good_subseq`, a list is w-bad if every element has a coordinate not divisible by n (admissibility), and no index set defines a good sub-sequence. The constructor splits the conjunction into these two independent goals.

    lines 2–3

      dsimp [zero_sum_w_bad, zero_sum_admissible, zero_sum_good_subseq]
      constructor
  2. The empty list is admissible.

    We assume an element a belongs to the empty list `[]`. Because the empty list has no elements, case analysis on this membership hypothesis immediately rules out any possibilities, completing the vacuous proof.

    lines 4–5

      · intro a ha
        cases ha
  3. The empty list contains no good sub-sequences.

    Suppose toward contradiction that there is an index set I ⊆ Fin 0 that forms a good sub-sequence. By definition, I must be non-empty, which would furnish an element x ∈ Fin 0. But Fin 0 is empty, so Fin.elim0 produces a contradiction from x.

    lines 6–8

    uses Fin.elim0

      · intro I hI
        obtain ⟨⟨x, _⟩, _⟩ := hI
        exact Fin.elim0 x
Fin.elim0
Given an element of the empty type Fin 0, any proposition follows (ex falso quodlibet).

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

theorem zero_sum_w_bad_nil (n r : ℕ) : zero_sum_w_bad n ([] : List (Fin r → ℤ)) := by  dsimp [zero_sum_w_bad, zero_sum_admissible, zero_sum_good_subseq]  constructor  · intro a ha    cases ha  · intro I hI    obtain ⟨⟨x, _⟩, _⟩ := hI    exact Fin.elim0 x
See it in the graphDiscuss this resultChallenge it