AFTD Auto-Formalizing Theoretical Domains

carpool_slack_empty

theoremverified

For any natural number n : ℕ, integer threshold D : ℤ, and discrepancy vector d : Fin n → ℤ, the slack carpool_slack D d (∅ : Finset (Fin n)) is zero.

Statement

theorem carpool_slack_empty {n : ℕ} (D : ℤ) (d : Fin n → ℤ) :
    carpool_slack D d (∅ : Finset (Fin n)) = 0
Source
arXiv:2611.00388 Lemma 4.1
Verified
07 Nov 2026
Axioms
Quot.soundpropext
Built on 2
  • carpool_slackThe discrepancy slack carpool_slack taking an integer threshold D : ℤ, a discrepancy vector d : Fin n → ℤ, and a finite vertex subset S :…
  • carpool_threshold_AThe quadratic threshold function carpool_threshold_A taking an integer parameter D : ℤ and a natural number k : ℕ, defined as the integer…
Used by 1
  • carpool_backward_step_slack_increaseFor natural numbers n and T, an integer D, trajectory d : ℕ → Fin n → ℤ, and receiver/sender functions a, b : ℕ → Fin n satisfying for all…

Read back from the Lean

For any natural number $n$, integer $D$, and function $d : \mathrm{Fin}(n) \to \mathbb{Z}$, the carpool slack carpool_slack D d ∅ evaluated on the empty finset of $\mathrm{Fin}(n)$ is equal to $0$.

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

The proof proceeds by unfolding the definitions of slack and the threshold function. On the empty set, the sum of discrepancies is zero and the cardinality is zero, making both terms vanish and leaving a slack of zero.

  1. carpool_slack D d ∅ = 0 automation

    Unfold the definitions of carpool_slack and carpool_threshold_A. The sum over the empty set is 0, and the cardinality of the empty set is 0, so the threshold term evaluates to 0 · D - 15 · 0 · (0 - 1) = 0. The simplifier computes 0 - 0 = 0 and closes the goal.

    line 4

    uses carpool_slack, carpool_threshold_A

      simp [carpool_slack, carpool_threshold_A]
carpool_slack
the slack on a subset S of vertices, defined as the sum ∑ i ∈ S, d i minus carpool_threshold_A D |S|
carpool_threshold_A
the threshold function on cardinality k, defined as k * D - 15 * k * (k - 1)

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

/-- The slack on the empty set of vertices is zero. -/theorem carpool_slack_empty {n : ℕ} (D : ℤ) (d : Fin n → ℤ) :    carpool_slack D d (∅ : Finset (Fin n)) = 0 := by  simp [carpool_slack, carpool_threshold_A]
See it in the graphDiscuss this resultChallenge it