op_491_threshold_ge_two_q_of_ne
Assuming the stabilization threshold set is nonempty, if $A_q(2q - 1, \\{2,4\\}) \\ne 1 + \\binom{2q - 1}{2}$, then the eventual length threshold satisfies $2q \\le N_*(q)$.
Statement
theorem op_491_threshold_ge_two_q_of_ne (q : ℕ) (h_nonempty : ∃ N, ∀ m ≥ N, two_four_code_max_card q m = 1 + Nat.choose m 2) (hne : two_four_code_max_card q (2 * q - 1) ≠ 1 + Nat.choose (2 * q - 1) 2) : 2 * q ≤ two_four_eventual_threshold q- Source
- arXiv:2610.30613 Remark 6.1
- Verified
- 08 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- op_491_threshold_gt_of_neAssuming the stabilization threshold set is nonempty, if $A_q(n, \\{2,4\\}) \\ne 1 + \\binom{n}{2}$ for some length $n$, then $n$ is…
- two_four_code_max_cardFor integers $q$ and $n$, $A_q(n, \{2,4\})$ is the supremum of cardinalities of finite subsets of $\mathrm{Fin}\, n \to \mathrm{Fin}\, q$…
- two_four_eventual_thresholdFor an integer $q$, the eventual length threshold $N_*(q)$ is the infimum of all integers $N$ such that…
Read back from the Lean
For any natural number q, if there exists N : ℕ such that for all m ≥ N, the maximum cardinality of a code of length m over an alphabet of size q with pairwise Hamming distances in {2, 4} equals 1 + Nat.choose m 2, and if the maximum cardinality of such a code of length 2 * q - 1 is not equal to 1 + Nat.choose (2 * q - 1) 2, then 2 * q ≤ two_four_eventual_threshold q (which is the infimum of all N such that the maximum code size of length n equals 1 + Nat.choose n 2 for all n ≥ N).
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
To bound the eventual stabilization threshold $N_*(q)$ from below by $2q$, the proof uses the fact that the code size formula fails at block length $2q - 1$. The lemma `op_491_threshold_gt_of_ne` immediately implies $2q - 1 < N_*(q)$, from which linear arithmetic over ℕ establishes $2q \le N_*(q)$.
The eventual stabilization threshold strictly exceeds $2q - 1$, that is, $2q - 1 < N_*(q)$.
By assumption, the stabilization threshold set is nonempty and the maximal code cardinality at block length $2q - 1$ differs from the asymptotic formula $1 + \binom{2q - 1}{2}$. Applying the lemma `op_491_threshold_gt_of_ne` with $n = 2q - 1$ shows that $2q - 1$ is strictly below the infimum threshold $N_*(q)$.
uses
op_491_threshold_gt_of_nehave h := op_491_threshold_gt_of_ne q (2 * q - 1) h_nonempty hne$2q \le N_*(q)$
By linear arithmetic on natural numbers (`omega`), the strict inequality $2q - 1 < N_*(q)$ implies $2q \le N_*(q)$ (if $q \ge 1$, adding 1 gives $2q \le N_*(q)$; if $q = 0$, $0 \le N_*(0)$ is trivial).
omega
op_491_threshold_gt_of_ne- If the set of stabilization thresholds is nonempty and the maximal cardinality of a $\{2,4\}$-code of block length $n$ over an alphabet of size $q$ does not equal $1 + \binom{n}{2}$, then the eventual threshold $N_*(q)$ is strictly greater than $n$.
- Natural number subtraction truncates at zero (so $2q - 1 = 0$ when $q = 0$), but `omega` handles both $q = 0$ and $q \ge 1$ automatically.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- If A_q(2q-1, {2,4}) ≠ 1 + C(2q-1, 2), then 2q ≤ N_*(q). -/theorem op_491_threshold_ge_two_q_of_ne (q : ℕ) (h_nonempty : ∃ N, ∀ m ≥ N, two_four_code_max_card q m = 1 + Nat.choose m 2) (hne : two_four_code_max_card q (2 * q - 1) ≠ 1 + Nat.choose (2 * q - 1) 2) : 2 * q ≤ two_four_eventual_threshold q := by have h := op_491_threshold_gt_of_ne q (2 * q - 1) h_nonempty hne omega