AFTD Auto-Formalizing Theoretical Domains

two_insertion_collision_defect_envelope_six

theoremverified

The two-insertion collision defect envelope two_insertion_collision_defect_envelope at n = 6 equals 31.

Statement

theorem two_insertion_collision_defect_envelope_six :
    two_insertion_collision_defect_envelope 6 = 31
Source
arXiv:2611.01064 Maximal input entropy for binary two-deletion and two-insertion channels
Verified
04 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1

Read back from the Lean

two_insertion_collision_defect_envelope 6 equals 31.

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 asserts that the two-insertion collision defect envelope at $n = 6$ evaluates to 31. Because the definition consists entirely of computable operations on natural numbers and finite sets, the result is established by direct evaluation using the `decide` tactic.

  1. The value of two_insertion_collision_defect_envelope 6 is 31. automation

    The definition of `two_insertion_collision_defect_envelope 6` is an explicit, computable expression over natural numbers and finite sets. For $n = 6$, the set $K = \{1\} \cup [2, (6 - 2) / 3 - 1] = \{1\} \cup [2, 0] = \{1\}$ contains only $k = 1$. Evaluating the term at $k = 1$ gives quotient $q = 2$ and remainder $r = 0$, producing a value of $16$; adding $\binom{6}{2} = 15$ results in $31$. The `decide` tactic evaluates this decidable proposition by finite arithmetic computation and closes the goal.

    line 4

      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

/-- The two-insertion collision defect envelope evaluates to 31 at length 6. -/theorem two_insertion_collision_defect_envelope_six :    two_insertion_collision_defect_envelope 6 = 31 := by  decide
See it in the graphDiscuss this resultChallenge it