AFTD Auto-Formalizing Theoretical Domains

bipartite_poset_le

def

For a graph H on α and subsets A, B of α, the height-2 order relation associated to H with bipartition (A, B) has x ≤ y if and only if x = y or (x ∈ A, y ∈ B, and x and y are adjacent in H).

Statement

def bipartite_poset_le {α : Type*} (H : SimpleGraph α) (A B : Set α) (x y : α) : Prop
Defined in
arXiv:2610.24774, Section 4.1; Trotter, Combinatorics and Partially Ordered Sets (1992)
Verified
22 Oct 2026
Axioms
none listed
Used by 3

Read back from the Lean

Given a type α, a simple graph H on α, subsets A, B : Set α, and vertices x, y : α, bipartite_poset_le H A B x y is defined to hold if and only if x = y or (x ∈ A, y ∈ B, and x and y are adjacent in H).

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

/-- The partial order relation of the height-2 poset associated to a bipartite graph. -/
def bipartite_poset_le {α : Type*} (H : SimpleGraph α) (A B : Set α) (x y : α) : Prop :=
  x = y ∨ (x ∈ A ∧ y ∈ B ∧ H.Adj x y)
See it in the graphDiscuss this resultChallenge it