AFTD Auto-Formalizing Theoretical Domains

pm_ans_lt

theoremverified

If the oracle answers a < b then a < b holds and b < a does not.

Statement

theorem pm_ans_lt {n : ℕ} (P : PMPoset n) (a b : Fin n) (h : P.ans a b = PMAns.lt) :
    P.lt a b = true ∧ P.lt b a = false
Source
step towards pm_exact_complexity / pm_lower_bound (exact complexity 2n - 3 at width 2, refuting the tightness conjecture of Sorting and Selection in Posets, SODA 2009 / SIAM J. Comput. 2011 (arXiv:0707.1532), Section 4)
Verified
06 Oct 2026
Axioms
propext
Built on 4
  • PMAnsThe three possible answers of a comparison query (a, b) on a poset: a ≺ b, b ≺ a, or a ∥ b (incomparable). Setting of arXiv 0707.1532…
  • PMPosetA strict partial order on the ground set Fin n, given by a Boolean relation lt (lt a b = true means a ≺ b).
  • PMPoset.ansThe comparison oracle: the answer to query (a, b) on the poset P.
  • pm_asymma ≺ b excludes b ≺ a.
Used by 1
  • pm_alg_runCorrectness of the candidate-list algorithm on width-2 posets.

Lean source view module on GitHub

theorem pm_ans_lt {n : ℕ} (P : PMPoset n) (a b : Fin n) (h : P.ans a b = PMAns.lt) :    P.lt a b = true ∧ P.lt b a = false := by  unfold PMPoset.ans at h  have hasym := pm_asymm P a b  cases h1 : P.lt a b <;> cases h2 : P.lt b a <;> simp_all
See it in the graphDiscuss this resultChallenge it