AFTD Auto-Formalizing Theoretical Domains

ValidCarpoolEdgeSequence

def

A list of edges on n vertices is valid for online carpooling if every arriving edge connects two distinct vertices.

Statement

def ValidCarpoolEdgeSequence (n : ℕ) (edges : List (Fin n × Fin n)) : Prop
Defined in
arXiv:2611.00388 Sec 1.1, Online carpooling against an oblivious adversary
Verified
06 Nov 2026
Axioms
none listed
Used by 5

Read back from the Lean

Given a natural number n and a list edges of pairs of elements of Fin n, ValidCarpoolEdgeSequence n edges asserts that for every edge e in edges, the first component e.1 is not equal to the second component e.2 (that is, no edge in the list is a self-loop).

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

/-- Validity condition that every edge joins two distinct vertices. -/
def ValidCarpoolEdgeSequence (n : ℕ) (edges : List (Fin n × Fin n)) : Prop := ∀ e ∈ edges, e.1 ≠ e.2
See it in the graphDiscuss this resultChallenge it