AFTD Auto-Formalizing Theoretical Domains

tfjr_droop_le

theoremverified

⌈(t+1)s/n⌉ - 1 ≤ t whenever s ≤ n.

Statement

theorem tfjr_droop_le (t s n : ℕ) (hs : s ≤ n) : ((t + 1) * s + n - 1) / n - 1 ≤ t
Source
step towards temporal_droop_fjr_not_imp_bfjr (Droop-FJR vs BFJR, arXiv:2505.22513, App. A.3)
Verified
06 Oct 2026
Axioms
Quot.soundpropext
Used by 1
  • temporal_droop_fjr_not_imp_bfjrDroop-FJR does not imply BFJR in temporal voting, even when no voter approves every candidate in a round. Four voters, six rounds, two…

Lean source view module on GitHub

/-- ⌈(t+1)s/n⌉ - 1 ≤ t whenever s ≤ n. -/theorem tfjr_droop_le (t s n : ℕ) (hs : s ≤ n) : ((t + 1) * s + n - 1) / n - 1 ≤ t := by  rcases Nat.eq_zero_or_pos n with rfl | hn  · simp  · have h1 : (t + 1) * s ≤ (t + 1) * n := Nat.mul_le_mul_left _ hs    have h2 : (t + 2) * n = (t + 1) * n + n := by ring    have : ((t + 1) * s + n - 1) / n < t + 2 := (Nat.div_lt_iff_lt_mul hn).2 (by omega)    omega
See it in the graphDiscuss this resultChallenge it