AFTD Auto-Formalizing Theoretical Domains

monroe_ceil_le_floor_succ

theoremverified

⌈n/k⌉ ≤ ⌊n/k⌋ + 1, written (n + k - 1)/k ≤ n/k + 1, for all natural n, k.

Statement

theorem monroe_ceil_le_floor_succ (n k : ℕ) : (n + k - 1) / k ≤ n / k + 1
Source
step towards hare_monroe_satisfies_droop_jr (Monroe and Droop-JR, open case of Justified Representation: From Hare to Droop, arXiv:2508.00811)
Verified
06 Oct 2026
Axioms
Quot.soundpropext
Used by 1
  • monroe_exists_heavyCounting step: if (W, π) is Hare-valid and |S| > n/(k+1), then some c ∈ W satisfies |π⁻¹(c)| < min(|π⁻¹(c)|, |S|) + |π⁻¹(c) ∩ S|.

Lean source view module on GitHub

/-- ⌈n/k⌉ ≤ ⌊n/k⌋ + 1, written (n + k - 1)/k ≤ n/k + 1, for all natural n, k. -/theorem monroe_ceil_le_floor_succ (n k : ℕ) : (n + k - 1) / k ≤ n / k + 1 := by  rcases Nat.eq_zero_or_pos k with rfl | hk  · simp  · calc (n + k - 1) / k ≤ (n + k) / k := Nat.div_le_div_right (by omega)      _ = n / k + 1 := Nat.add_div_right n hk
See it in the graphDiscuss this resultChallenge it