AFTD Auto-Formalizing Theoretical Domains

IsCollinearTriple

def

A set T of vertices in a simple graph G is collinear if there exist three pairwise distinct vertices x, y, z in T such that G.dist x y + G.dist y z = G.dist x z.

Statement

def IsCollinearTriple {V : Type*} (G : SimpleGraph V) (T : Set V) : Prop
Defined in
arXiv:2610.39966 Section 2
Verified
02 Nov 2026
Axioms
none listed
Used by 1
  • graphNumCollinearTriplesThe number of collinear triples of a finite simple graph G is the number of 3-element subsets of vertices that are collinear according to…

Read back from the Lean

Given a type V, a simple graph G on V, and a set of vertices T : Set V, IsCollinearTriple G T asserts that there exist vertices x, y, z : V such that: 1. x ∈ T, y ∈ T, and z ∈ T, 2. x, y, z are pairwise distinct (x ≠ y, y ≠ z, and x ≠ z), and 3. G.dist x y + G.dist y z = G.dist x z.

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

/-- Collinear triple predicate on a vertex set of a simple graph. -/
def IsCollinearTriple {V : Type*} (G : SimpleGraph V) (T : Set V) : Prop :=
  ∃ x y z, x ∈ T ∧ y ∈ T ∧ z ∈ T ∧ x ≠ y ∧ y ≠ z ∧ x ≠ z ∧ G.dist x y + G.dist y z = G.dist x z
See it in the graphDiscuss this resultChallenge it