AFTD Auto-Formalizing Theoretical Domains

is_path_connected

def

A set of items on the path 0, 1, ..., m-1 is connected if it contains every item between two of its items.

Statement

def is_path_connected {m : ℕ} (B : Finset (Fin m)) : Prop
Defined in
Connected EF1 Allocations Exist in Discrete Chore Cutting, arXiv:2609.32545 v1, Sec. 2 (chores on a path, connected bundles, EF1) and Sec. 4 (PO); PO among connected allocations, as usual for connected fair division; formalized by the operator (Claude), 2026-10-03
Verified
03 Oct 2026
Axioms
none listed
Used by 1

Lean source view module on GitHub

/-- A set of items on a path `0, 1, …, m - 1` is connected: it contains every item lying between two of its items. -/
def is_path_connected {m : ℕ} (B : Finset (Fin m)) : Prop :=
  ∀ x ∈ B, ∀ y ∈ B, ∀ z, x ≤ z → z ≤ y → z ∈ B
See it in the graphDiscuss this resultChallenge it