AFTD Auto-Formalizing Theoretical Domains

chore_opposite_pair

def

Given implicit natural numbers m and n, a hypothesis h2n : 2 * n ≤ m, and an element j : Fin n, chore_opposite_pair is defined as the Finset (Fin m) containing the two elements j.val and 2 * n - 1 - j.val (viewed as elements of Fin m).

Statement

def chore_opposite_pair {m n : ℕ} (h2n : 2 * n ≤ m) (j : Fin n) : Finset (Fin m)
Defined in
arXiv:2611.04884, Section 4, line 729
Verified
04 Nov 2026
Axioms
none listed
Used by 3
  • ido_chore_opposite_pairs_cost_boundsIn an identically ordered instance of m chores and n agents with 2 * n ≤ m and nonnegative costs c where every agent has maximin share 1,…
  • ido_opposite_pair_cost_le_four_thirdsIn an identically ordered instance of m chores and n agents with 2 * n ≤ m and nonnegative costs c where every agent has maximin share 1,…
  • chore_opposite_pair_cardGiven implicit natural numbers m and n, a hypothesis h2n : 2 * n ≤ m, and an element j : Fin n, the cardinality of chore_opposite_pair h2n…

Read back from the Lean

Given natural numbers m and n (implicit), a proof h2n : 2 * n ≤ m, and an element j : Fin n, chore_opposite_pair is defined as the Finset (Fin m) consisting of the two elements ⟨j.val, _⟩ and ⟨2 * n - 1 - j.val, _⟩ (i.e., the pair of indices {j.val, 2 * n - 1 - j.val} viewed as elements of Fin m).

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 j-th opposite pair Q_j combining chore j with chore 2n - 1 - j in Finset (Fin m). -/
def chore_opposite_pair {m n : ℕ} (h2n : 2 * n ≤ m) (j : Fin n) : Finset (Fin m) :=
  have hj : j.val < m := by
    have := j.isLt
    omega
  have hopp : 2 * n - 1 - j.val < m := by
    have := j.isLt
    omega
  {⟨j.val, hj⟩, ⟨2 * n - 1 - j.val, hopp⟩}
See it in the graphDiscuss this resultChallenge it