AFTD Auto-Formalizing Theoretical Domains

not_is_additive_basis_zero

theoremverified

For any nontrivial additive commutative group G, the empty multiset 0 : Multiset G is not an additive basis (¬ IsAdditiveBasis (0 : Multiset G)).

Statement

theorem not_is_additive_basis_zero {G : Type*} [AddCommGroup G] [Nontrivial G] : ¬ IsAdditiveBasis (0 : Multiset G)
Source
scout/2610-13103-additive-bases-and-the-zero-sum-invariant-mathsf-n-g-for-gr.md:91
Verified
26 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • IsAdditiveBasisA multiset S over an additive commutative group G is an additive basis of G if for every element g of G, there exists a nonempty…

Read back from the Lean

For any nontrivial additive commutative group G, the empty multiset 0 : Multiset G is not an additive basis of G. That is, it is false that every element of G can be represented as the sum of a non-empty submultiset of the empty multiset.

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 proof proceeds by contradiction. If the empty multiset were an additive basis, it would contain a non-empty submultiset T representing the group element 0. However, any submultiset of the empty multiset must be empty, which contradicts the requirement that T is non-empty.

  1. Assuming 0 is an additive basis yields a non-empty submultiset T ≤ 0

    Assume for contradiction that the empty multiset 0 is an additive basis. By definition, every element of G can be written as the sum of a non-empty submultiset of 0. Specializing this property to the group identity 0 yields a submultiset T ≤ 0 such that T ≠ 0 and the sum of T is 0.

    lines 3–4

      intro h
      obtain ⟨T, hT1, hT2, _⟩ := h 0
  2. Contradiction: T must be empty, yet T ≠ 0

    Because the empty multiset is minimal under multiset inclusion, T ≤ 0 implies T = 0 by nonpos_iff_eq_zero.mp. This contradicts the fact that T is non-empty (hT2: T ≠ 0).

    line 5

    uses nonpos_iff_eq_zero.mp

      exact hT2 (nonpos_iff_eq_zero.mp hT1)
nonpos_iff_eq_zero.mp
In a partial order with a bottom element 0 (such as multisets ordered by inclusion), if a ≤ 0, then a = 0.

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 empty multiset is not an additive basis for any nontrivial additive commutative group. -/theorem not_is_additive_basis_zero {G : Type*} [AddCommGroup G] [Nontrivial G] : ¬ IsAdditiveBasis (0 : Multiset G) := by  intro h  obtain ⟨T, hT1, hT2, _⟩ := h 0  exact hT2 (nonpos_iff_eq_zero.mp hT1)
See it in the graphDiscuss this resultChallenge it