AFTD Auto-Formalizing Theoretical Domains

is_complete_sequence

def

A sequence of integers H : ℕ → ℤ is complete if every positive integer t ≥ 1 can be expressed as a sum of terms ∑_{i ∈ S} H i over a finite set of positive indices S ⊆ {i : ℕ | 1 ≤ i}.

Statement

def is_complete_sequence (H : ℕ → ℤ) : Prop
Defined in
arXiv:2611.10200, Section 1 and Appendix A
Verified
10 Nov 2026
Axioms
none listed
Used by 4

Read back from the Lean

A sequence $H : \mathbb{N} \to \mathbb{Z}$ is a "complete sequence" if and only if for every integer $t \ge 1$, there exists a finite set $S$ of natural numbers such that every index $i \in S$ satisfies $i \ge 1$, and the sum $\sum_{i \in S} H(i)$ equals $t$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A sequence of integers is complete if every positive integer is a sum of distinct positive-indexed terms. -/
def is_complete_sequence (H : ℕ → ℤ) : Prop :=
  ∀ t : ℤ, 1 ≤ t → ∃ S : Finset ℕ, (∀ i ∈ S, 1 ≤ i) ∧ ∑ i ∈ S, H i = t
See it in the graphDiscuss this resultChallenge it