AFTD Auto-Formalizing Theoretical Domains

carpool_slack

def

The discrepancy slack carpool_slack taking an integer threshold D : ℤ, a discrepancy vector d : Fin n → ℤ, and a finite vertex subset S : Finset (Fin n) as arguments, defined as the integer (∑ i ∈ S, d i) - carpool_threshold_A D S.card.

Statement

def carpool_slack {n : ℕ} (D : ℤ) (d : Fin n → ℤ) (S : Finset (Fin n)) : ℤ
Defined in
arXiv:2611.00388 Section 4.1
Verified
07 Nov 2026
Axioms
none listed
Built on 1
  • 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 3
  • carpool_slack_emptyFor any natural number n : ℕ, integer threshold D : ℤ, and discrepancy vector d : Fin n → ℤ, the slack carpool_slack D d (∅ : Finset (Fin…
  • carpool_witness_familyFix n, T, an edge sequence (u_t, v_t) and D >= 300. From the edges alone one builds a family W of pairs (t, S) with |W| <= 2 T…
  • 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

Given a natural number $n$, an integer $D$, a sequence/function $d : \text{Fin } n \to \mathbb{Z}$, and a finite subset $S \subseteq \text{Fin } n$, carpool_slack D d S is defined as the integer $(\sum_{i \in S} d(i)) - \text{carpool\_threshold\_A}(D, |S|)$.

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

/-- Discrepancy slack Lambda(d, S) = d(S) - A(|S|) of a vertex subset S. -/
def carpool_slack {n : ℕ} (D : ℤ) (d : Fin n → ℤ) (S : Finset (Fin n)) : ℤ := (∑ i ∈ S, d i) - carpool_threshold_A D S.card
See it in the graphDiscuss this resultChallenge it