pell_number_two_mul_sub_add
2(P(m+1) - P(m)) + 2 P(m) = 2 P(m+1).
Statement
theorem pell_number_two_mul_sub_add (m : ℕ) : 2 * (pell_number (m + 1) - pell_number m) + 2 * pell_number m = 2 * pell_number (m + 1)- Source
- step towards pell_prefix_block_step
- Verified
- 20 Oct 2026
- Axioms
Quot.soundpropext- Built on 2
- pell_number_mono_succThe Pell numbers are nondecreasing: P(m) ≤ P(m+1).
- pell_numberThe Pell numbers are defined by P(0) = 0, P(1) = 1, and P(m+2) = P(m) + 2 P(m+1).
The proof, explained
The proof establishes that consecutive Pell numbers satisfy P(m) ≤ P(m + 1) via pell_number_mono_succ, ensuring that the natural number subtraction does not truncate to zero. With this inequality in hand, linear arithmetic (omega) closes the goal.
P(m) ≤ P(m + 1)
By monotonicity of Pell numbers between consecutive indices (pell_number_mono_succ), the m-th Pell number is at most the (m+1)-th Pell number.
uses
pell_number_mono_succhave hle := pell_number_mono_succ m2 * (P(m + 1) - P(m)) + 2 * P(m) = 2 * P(m + 1) automation
Because P(m) ≤ P(m + 1), natural number subtraction avoids truncation, and the identity simplifies by linear integer arithmetic.
omega
pell_number_mono_succ- For any natural number m, the m-th Pell number is less than or equal to the (m+1)-th Pell number.
- In Lean, subtraction on natural numbers (ℕ) is truncated at zero (a - b = 0 when a < b). Establishing pell_number m ≤ pell_number (m + 1) is necessary so that natural subtraction behaves like standard integer subtraction.
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.
/-- Truncated-subtraction identity `2 * (pell_number (m+1) - pell_number m) + 2 * pell_number m = 2 * pell_number (m+1)`. -/theorem pell_number_two_mul_sub_add (m : ℕ) : 2 * (pell_number (m + 1) - pell_number m) + 2 * pell_number m = 2 * pell_number (m + 1) := by have hle := pell_number_mono_succ m omega