AFTD Auto-Formalizing Theoretical Domains

chore_remaining_set

def

For m chores and n agents, the set V of remaining chores consists of all chores whose index is at least 2n.

Statement

def chore_remaining_set (m n : ℕ) : Finset (Fin m)
Defined in
arXiv:2611.04884, Section 4, line 729
Verified
04 Nov 2026
Axioms
none listed
Used by 3

Read back from the Lean

Definition of chore_remaining_set: for two natural numbers m and n, it is the finite set (Finset (Fin m)) of all elements e in Fin m such that 2 * n ≤ e.val.

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 set of remaining chores V consisting of chores with index at least 2n. -/
def chore_remaining_set (m n : ℕ) : Finset (Fin m) := Finset.univ.filter (fun e => 2 * n ≤ e.val)
See it in the graphDiscuss this resultChallenge it