op_491_threshold_ge_two_q_plus_one_of_ne
Assuming the stabilization threshold set is nonempty, if $A_q(2q, \\{2,4\\}) \\ne 1 + \\binom{2q}{2}$, then the eventual length threshold satisfies $2q + 1 \\le N_*(q)$.
Statement
theorem op_491_threshold_ge_two_q_plus_one_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 + Nat.choose (2 * q) 2) : 2 * q + 1 ≤ 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 a natural number $N$ such that for all $m \ge N$, the maximum cardinality of a subset of $(\mathrm{Fin}\; q)^m$ whose distinct elements always have Hamming distance 2 or 4 is $1 + \binom{m}{2}$, and if the maximum cardinality of such a subset in $(\mathrm{Fin}\; q)^{2q}$ is not equal to $1 + \binom{2q}{2}$, then the eventual threshold (the infimum of all $N$ such that the maximum cardinality equals $1 + \binom{n}{2}$ for all $n \ge N$) is at least $2q + 1$.
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 establishes that if the maximum size of a {2, 4}-code of length 2q is not 1 + C(2q, 2), then the eventual stabilization threshold satisfies 2q + 1 ≤ N_*(q). This follows by applying `op_491_threshold_gt_of_ne` specialized to n = 2q, which gives 2q < N_*(q). In natural number arithmetic, 2q < N_*(q) is definitionally equivalent to 2q + 1 ≤ N_*(q), and the required premises are provided directly by the hypotheses.
2 * q + 1 ≤ two_four_eventual_threshold q
Apply `op_491_threshold_gt_of_ne` with length parameter $n = 2q$. Because the strict inequality $2q < N_*(q)$ on natural numbers is definitionally identical to $2q + 1 \le N_*(q)$, the lemma's conclusion matches the goal. The two subgoals generated—that the stabilization set is nonempty and that $A_q(2q, \{2,4\}) \ne 1 + \binom{2q}{2}$—are discharged immediately by the hypotheses `h_nonempty` and `hne`.
uses
op_491_threshold_gt_of_netheorem op_491_threshold_ge_two_q_plus_one_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 + Nat.choose (2 * q) 2) : 2 * q + 1 ≤ two_four_eventual_threshold q := by first | exact op_491_threshold_gt_of_ne | (apply op_491_threshold_gt_of_ne <;> assumption) | (apply op_491_threshold_gt_of_ne <;> simp_all) | simpa using op_491_threshold_gt_of_ne | (simp only [two_four_code_max_card, two_four_eventual_threshold] at *; first | exact op_491_threshold_gt_of_ne | (apply op_491_threshold_gt_of_ne <;> assumption) | (apply op_491_threshold_gt_of_ne <;> simp_all) | simpa using op_491_threshold_gt_of_ne)
op_491_threshold_gt_of_ne- If the threshold set is nonempty and the maximum size of a {2, 4}-code of length n is not 1 + C(n, 2), then n is strictly less than the eventual stabilization threshold N_*(q).
- The proof script uses `first | ...` with multiple candidate tactics generated by automated search; the branch that succeeds is `apply op_491_threshold_gt_of_ne <;> assumption`.
- Over the natural numbers, the strict inequality $2q < N_*(q)$ from the lemma is definitionally equal to $2q + 1 \le N_*(q)$, allowing the conclusion of `op_491_threshold_gt_of_ne` to unify with the goal directly.
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, {2,4}) ≠ 1 + C(2q, 2), then 2q + 1 ≤ N_*(q). -/theorem op_491_threshold_ge_two_q_plus_one_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 + Nat.choose (2 * q) 2) : 2 * q + 1 ≤ two_four_eventual_threshold q := by first | exact op_491_threshold_gt_of_ne | (apply op_491_threshold_gt_of_ne <;> assumption) | (apply op_491_threshold_gt_of_ne <;> simp_all) | simpa using op_491_threshold_gt_of_ne | (simp only [two_four_code_max_card, two_four_eventual_threshold] at *; first | exact op_491_threshold_gt_of_ne | (apply op_491_threshold_gt_of_ne <;> assumption) | (apply op_491_threshold_gt_of_ne <;> simp_all) | simpa using op_491_threshold_gt_of_ne)