recursive_line_hole_budget
def
The recursive-line hole budget recursive_line_hole_budget m n z z_RL for natural numbers m, n and integers z, z_RL is defined as (m : ℤ) * n + z - 2 * z_RL.
Statement
def recursive_line_hole_budget (m n : ℕ) (z z_RL : ℤ) : ℤ- Defined in
- scout/2610-22875-overtake-and-the-recursive-line-equality-for-second-order-z.md:541
- Verified
- 22 Oct 2026
- Axioms
- none listed
- Used by 3
- low_hole_reduction_ruling_out_overtakeLet m, n be natural numbers and let z, z_RL, z_2, z_2A be integers such that z_RL ≤ z_2 and z_2 ≤ z_2A. Suppose there exist integers H and…
- low_hole_reduction_overtakeLet m, n be natural numbers and let z, z_RL, z_2, z_2A, H, d be integers. If z_RL ≤ z_2, z_2 ≤ z_2A, 0 ≤ H, 0 ≤ d, 2 * (z_2A - z_RL) =…
- recursive_line_hole_budget_four_fourThe recursive-line hole budget recursive_line_hole_budget 4 4 9 10 is equal to 5.
Read back from the Lean
recursive_line_hole_budget is defined as a function that takes two natural numbers m and n and two integers z and z_RL, and returns the integer (m : ℤ) * (n : ℤ) + z - 2 * z_RL.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The recursive-line hole budget h_RL(m,n) = mn + z(m,n) - 2 * z_RL(m,n). -/ def recursive_line_hole_budget (m n : ℕ) (z z_RL : ℤ) : ℤ := (m : ℤ) * n + z - 2 * z_RL