tfjr_count
theoremverified
In the counterexample, every nonempty group either contains voter 2 or 3, or has a member who approves nothing in at least ⌈(|T|+1)|S|/4⌉ - 1 rounds of T (checked by decide).
Statement
theorem tfjr_count : ∀ S : Finset (Fin 4), ∀ T : Finset (Fin 6), S.Nonempty → (∃ i ∈ S, 2 ≤ i.val) ∨ ∃ j ∈ S, ((T.card + 1) * S.card + 4 - 1) / 4 - 1 ≤ (T.filter fun r => tfjr_ballot j r = ∅).card
- Source
- step towards temporal_droop_fjr_not_imp_bfjr (Droop-FJR vs BFJR, arXiv:2505.22513, App. A.3)
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- tfjr_ballotBallots of the Droop-FJR vs BFJR counterexample: voter 0 approves candidate 0 in rounds 0-2, voter 1 approves candidate 0 in rounds 3-5,…
- 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
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.
/-- For groups inside `{0, 1}`, some member approves nothing on enough rounds of `T`. -/theorem tfjr_count : ∀ S : Finset (Fin 4), ∀ T : Finset (Fin 6), S.Nonempty → (∃ i ∈ S, 2 ≤ i.val) ∨ ∃ j ∈ S, ((T.card + 1) * S.card + 4 - 1) / 4 - 1 ≤ (T.filter fun r => tfjr_ballot j r = ∅).card := by decide