AFTD Auto-Formalizing Theoretical Domains

poset_sorting_map

def

For a partially ordered set P, the map R_P on P × P swaps (x, y) to (y, x) if y < x and leaves (x, y) fixed otherwise.

Statement

open Classical in
noncomputable def poset_sorting_map (P : Type*) [PartialOrder P] : P × P → P × P
Defined in
arXiv:2611.15540 Section 2, (2.1)
Verified
13 Nov 2026
Axioms
none listed
Used by 6
  • swap_idempotent_braid_iff_poset_sorting_mapIf R : X×X → X×X satisfies R(x,y) ∈ {(x,y),(y,x)} for all x,y, then R is an idempotent solution of the braid equation iff R = R_P for a…
  • braid_aut_poset_sorting_mapA permutation σ of a partially ordered set P lies in Aut(P,R_P) iff σ is (the underlying permutation of) an order automorphism of P.
  • poset_sorting_map_classificationLet P and Q be partially ordered sets and X a set, and let R_P : P×P → P×P map (x,y) to (y,x) if y<x and fix it otherwise. Then (1) R_P…
  • poset_sorting_map_intertwine_iffAn equivalence e : P ≃ Q between partially ordered sets intertwines R_P and R_Q, (e×e)∘R_P = R_Q∘(e×e), iff e preserves and reflects the…
  • poset_sorting_map_idempotent_braidFor every partially ordered set P, the sorting map R_P (swapping (x,y) to (y,x) when y<x, fixing it otherwise) satisfies the braid…
  • poset_sorting_map_braid_iso_iffFor partially ordered sets P and Q, the solutions (P,R_P) and (Q,R_Q) are isomorphic iff P and Q are order isomorphic.

Read back from the Lean

Given a type P with a partial order, poset_sorting_map is the function from P × P to P × P that maps each pair (x, y) to (y, x) if y < x, and to (x, y) otherwise.

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

open Classical in
/-- The sorting map R_P : P × P → P × P associated to a partially ordered set P. -/
noncomputable def poset_sorting_map (P : Type*) [PartialOrder P] : P × P → P × P := fun ⟨x, y⟩ => if y < x then (y, x) else (x, y)
See it in the graphDiscuss this resultChallenge it