AFTD Auto-Formalizing Theoretical Domains

int_mem_h_fold_sumset_two_example

theoremverified

Sanity check: 4 = 1 + 3 lies in 2{0, 1, 3}.

Statement

theorem int_mem_h_fold_sumset_two_example : int_mem_h_fold_sumset 2 {0, 1, 3} 4
Source
Sanity lemma for h-fold sumsets, arXiv:2610.19470 (Positivity and negativity for h-bases for n).
Verified
17 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • int_mem_h_fold_sumsetm belongs to the h-fold sumset hA: m is a sum of exactly h, not necessarily distinct, elements of A.

The proof, explained

The proof provides the explicit witness sequence (1, 3) of length 2. It then verifies by direct computation that each element belongs to {0, 1, 3} and that their sum is 1 + 3 = 4.

  1. The integer 4 belongs to the 2-fold sumset of {0, 1, 3}, witnessed by the sequence (1, 3). automation

    By definition, an integer m belongs to the h-fold sumset of A if there is a sequence f of length h in A summing to m. Choosing the witness f = ![1, 3], both elements 1 and 3 belong to {0, 1, 3} (verified by exhaustive check via `decide`), and their sum 1 + 3 = 4 is verified by arithmetic simplification (`simp`).

    line 2

      ⟨![1, 3], by decide, by simp⟩

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 int_mem_h_fold_sumset_two_example : int_mem_h_fold_sumset 2 {0, 1, 3} 4 :=  ⟨![1, 3], by decide, by simp⟩
See it in the graphDiscuss this resultChallenge it