AFTD Auto-Formalizing Theoretical Domains

finset_has_no_unique_sums_univ_zmod_three

theoremverified

The whole of Z/3Z has no unique sums.

Statement

theorem finset_has_no_unique_sums_univ_zmod_three :
    finset_has_no_unique_sums (Finset.univ : Finset (ZMod 3))
Source
Sanity check of the definitions of arXiv:2610.09349 on a small case. The paper notes that F_p itself is NUS (Sec. 1).
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • finset_has_no_unique_sumsA has no unique sums (is NUS): |A| ≥ 2 and every sum a + b with a, b ∈ A has at least two representations as an unordered pair from A.
  • finset_unordered_sum_rep_countr_{A,2}(s): the number of unordered pairs {a, b} (a = b allowed) of elements of A with a + b = s.
Used by 1

The proof, explained

To show that the full group ℤ/3ℤ has no unique sums, we unfold the definition into two conditions: the set has cardinality at least 2, and every pairwise sum has at least two unordered representations. Since ℤ/3ℤ is a finite type with only three elements, this statement is purely computational. The proof concludes by evaluating the decidable proposition directly.

  1. The set ℤ/3ℤ has at least two elements, and every pairwise sum a + b has at least two representations as an unordered sum of elements. automation

    Unfolding the definitions of `finset_has_no_unique_sums` and `finset_unordered_sum_rep_count` reduces the goal to checking that |ℤ/3ℤ| ≥ 2 and that for all a, b ∈ ℤ/3ℤ, the fiber of the addition map on unordered pairs in Sym²(ℤ/3ℤ) over a + b has cardinality at least 2. For each sum s ∈ ℤ/3ℤ, there are indeed at least two representations: 0 = 0 + 0 = 1 + 2, 1 = 0 + 1 = 2 + 2, and 2 = 0 + 2 = 1 + 1. Because all quantifiers and operations are finite, the `decide` tactic completes the proof by exhaustive evaluation.

    line 3

      unfold finset_has_no_unique_sums finset_unordered_sum_rep_count; decide

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 finset_has_no_unique_sums_univ_zmod_three :    finset_has_no_unique_sums (Finset.univ : Finset (ZMod 3)) := by  unfold finset_has_no_unique_sums finset_unordered_sum_rep_count; decide
See it in the graphDiscuss this resultChallenge it