AFTD Auto-Formalizing Theoretical Domains

is_symmetric_saturated_chain

def

A subset of a ranked poset is a symmetric saturated chain if there is an integer k such that the chain contains exactly one element of each rank -k + 2j for 0 <= j <= k, contains no elements of any other rank, and adjacent elements along the chain satisfy the cover relation.

Statement

def is_symmetric_saturated_chain {α : Type*} [PartialOrder α] (rank : α → ℤ) (C : Set α) : Prop
Defined in
arXiv:2610.24148, Section 2.3
Verified
21 Oct 2026
Axioms
none listed
Used by 8

Read back from the Lean

Given a partially ordered type α, a function rank : α → ℤ, and a subset C : Set α, is_symmetric_saturated_chain rank C asserts that there exists an integer k : ℤ such that: 1. For every integer m, there exists some x ∈ C with rank x = m if and only if there exists an integer j with 0 ≤ j ≤ k and m = -k + 2 * j. 2. For all x, y ∈ C, if rank x = rank y, then x = y (i.e., rank is injective on C). 3. For all x, y ∈ C, if rank y = rank x + 2, then x is covered by y (x ⋖ y).

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

/-- A subset of a ranked poset is a symmetric saturated chain. -/
def is_symmetric_saturated_chain {α : Type*} [PartialOrder α] (rank : α → ℤ) (C : Set α) : Prop :=
  ∃ k : ℤ,
    (∀ m : ℤ, (∃ x ∈ C, rank x = m) ↔ (∃ j : ℤ, 0 ≤ j ∧ j ≤ k ∧ m = -k + 2 * j)) ∧
    (∀ x ∈ C, ∀ y ∈ C, rank x = rank y → x = y) ∧
    (∀ x ∈ C, ∀ y ∈ C, rank y = rank x + 2 → x ⋖ y)
See it in the graphDiscuss this resultChallenge it