AFTD Auto-Formalizing Theoretical Domains

op_1503_two_deletion_hinge_eq

theoremverified

For any alphabet size q, length n, threshold r, and word y : Fin n → Fin q, the multiple-deletion hinge sum for two deletions qary_multiple_deletion_hinge 2 q n r y equals the two-deletion hinge sum qary_two_deletion_hinge q n r y.

Statement

theorem op_1503_two_deletion_hinge_eq (q n r : ℕ) (y : Fin n → Fin q) :
    qary_multiple_deletion_hinge 2 q n r y = qary_two_deletion_hinge q n r y
Source
knowledgebase, OP-1503
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • qary_multiple_deletion_hingeFor natural numbers t, q, n, and r, and a q-ary word y of length n (y : Fin n → Fin q), the t-deletion hinge sum is the sum over all words…
  • qary_two_deletion_hingeFor integers q, n, and r, and a q-ary word y of length n, qary_two_deletion_hinge q n r y is the sum over all words x : Fin (n + 2) → Fin…

Read back from the Lean

For all natural numbers $q$, $n$, and $r$, and for any function (word) $y : \mathrm{Fin}\ n \to \mathrm{Fin}\ q$, the multiple-deletion hinge quantity qary_multiple_deletion_hinge with parameter $t = 2$ equals qary_two_deletion_hinge q n r y.

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 theorem reduces the general multiple-deletion hinge sum for $t = 2$ deletions to the specialized two-deletion hinge sum. By definition, setting the deletion parameter $t$ to $2$ in `qary_multiple_deletion_hinge` produces the exact formula defining `qary_two_deletion_hinge`. Consequently, both sides are definitionally identical, and reflexivity concludes the proof.

  1. The two expressions are definitionally equal.

    Unfolding the definition of `qary_multiple_deletion_hinge` with parameter $t = 2$ gives $\sum_{x : \mathrm{Fin}\,(n + 2) \to \mathrm{Fin}\,q} (\mathrm{q\_ary\_subsequence\_num\_embeddings}(q, n, n + 2, y, x) - r)$, which is definitionally identical to `qary_two_deletion_hinge q n r y`. The proof therefore succeeds by reflexivity (`rfl`).

    line 4

      rfl

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

/-- Reduction of qary_multiple_deletion_hinge with 2 deletions to qary_two_deletion_hinge. -/theorem op_1503_two_deletion_hinge_eq (q n r : ℕ) (y : Fin n → Fin q) :    qary_multiple_deletion_hinge 2 q n r y = qary_two_deletion_hinge q n r y := by  rfl
See it in the graphDiscuss this resultChallenge it