is_identically_ordered_zero
The zero cost profile where all agents have cost zero for all chores is identically ordered.
Statement
lemma is_identically_ordered_zero (m n : ℕ) : is_identically_ordered (fun (_ : Fin n) (_ : Fin m) => (0 : ℝ))
- Source
- arXiv:2611.04884, Section 2, page 8
- Verified
- 05 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- is_identically_orderedAn instance of m chores and n agents with cost functions c is identically ordered (IDO) if for every agent i, the cost function c_i is…
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder.
Read back from the Lean
For all natural numbers $m$ and $n$, the constant zero function from $\text{Fin } n \to \text{Fin } m \to \mathbb{R}$ satisfies is_identically_ordered; that is, for every row index $i \in \text{Fin } n$, the constant zero function on $\text{Fin } m$ is antitone (monotonically non-increasing).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
A cost profile is identically ordered if each agent's cost function is antitone with respect to the chore ordering. For the zero profile, every agent incurs cost zero for every chore. The antitonicity condition therefore simplifies to $0 \le 0$, which holds by reflexivity of the ordering on real numbers.
It suffices to show that for an arbitrary agent and any two chores $a \le b$, the cost of chore $b$ is at most the cost of chore $a$.
By definition, a cost profile is identically ordered if each agent's cost function is antitone. Unfolding this definition, we fix an arbitrary agent $i$, chores $a$ and $b$, and the assumption $a \le b$.
intro i a b habThe antitonicity condition holds because $0 \le 0$.
Since the zero cost profile assigns cost $0$ to every chore for every agent, both sides of the inequality evaluate to $0$. The inequality $0 \le 0$ holds by reflexivity of $\le$ on $\mathbb{R}$.
uses
le_reflexact le_refl 0
le_refl- In any preorder, every element is less than or equal to itself: $a \le a$.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
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.
/-- The zero cost function profile is identically ordered. -/lemma is_identically_ordered_zero (m n : ℕ) : is_identically_ordered (fun (_ : Fin n) (_ : Fin m) => (0 : ℝ)) := by intro i a b hab exact le_refl 0