AFTD Auto-Formalizing Theoretical Domains

greedy_distinct_diff_seq_one_two_surjective

theoremverifiedformalization

The greedy sequence with distinct consecutive differences started at 1, 2 takes every positive integer as a value.

Statement

theorem greedy_distinct_diff_seq_one_two_surjective :
    ∀ v, 0 < v → ∃ n, greedy_distinct_diff_seq 1 2 n = v
Formalizes
'Permutations of the positive integers with restrictions on the sequence of differences' (Pacific J. Math. 71, 1977), main theorem, as cited in arXiv:2610.15860 (A note on the Slater–Vélez permutation); the special case a₁ = 1, a₂ = 2 of OP-203.
Verified
22 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • greedy_distinct_diff_seqThe greedy sequence with distinct consecutive differences started at a₁, a₂ (term 0 is a₁, term 1 is a₂; each later term is the least…
  • greedy_distinct_diff_seq_surjectiveConjecture: for any distinct positive integers a₁, a₂, the greedy sequence with distinct consecutive differences started at a₁, a₂ takes…

The proof, explained

The theorem specializes the general surjectivity result `greedy_distinct_diff_seq_surjective` to the initial terms 1 and 2. The side conditions requiring both initial terms to be positive and distinct are verified by direct numerical computation.

  1. Every positive integer appears in the greedy sequence starting with 1 and 2.

    Apply the general surjectivity theorem `greedy_distinct_diff_seq_surjective` with initial values $a_1 = 1$ and $a_2 = 2$. The three required hypotheses—that $0 < 1$, $0 < 2$, and $1 \neq 2$—are discharged by direct computational evaluation (`decide`).

    line 3

    uses greedy_distinct_diff_seq_surjective

      exact greedy_distinct_diff_seq_surjective 1 2 (by decide) (by decide) (by decide)
greedy_distinct_diff_seq_surjective
For any distinct positive integers $a_1$ and $a_2$, the greedy sequence with distinct consecutive differences initialized with $a_1$ and $a_2$ takes every positive integer as a value.

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 greedy_distinct_diff_seq_one_two_surjective :    ∀ v, 0 < v → ∃ n, greedy_distinct_diff_seq 1 2 n = v := by  exact greedy_distinct_diff_seq_surjective 1 2 (by decide) (by decide) (by decide)
See it in the graphDiscuss this resultChallenge it