poset_sorting_map_idempotent_braid
theoremverified
For 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 equation and is idempotent: R_P ∘ R_P = R_P.
Statement
theorem poset_sorting_map_idempotent_braid (P : Type*) [PartialOrder P] : is_braid_solution (poset_sorting_map P) ∧ poset_sorting_map P ∘ poset_sorting_map P = poset_sorting_map P
- Source
- Step of arXiv:2611.15540, Theorem A (Theorem 2.1 and Corollary 2.2)
- Verified
- 14 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- poset_sorting_mapFor 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.
- is_braid_solutionA map R : X × X → X × X on a type X is a solution of the braid equation if (R × id) ∘ (id × R) ∘ (R × id) = (id × R) ∘ (R × id) ∘ (id × R)…
- Used by 2
- 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…
- 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…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Classical inprivate lemma psm_apply_ib {P : Type*} [PartialOrder P] (p : P × P) : poset_sorting_map P p = if p.2 < p.1 then (p.2, p.1) else p := by rfltheorem poset_sorting_map_idempotent_braid (P : Type*) [PartialOrder P] : is_braid_solution (poset_sorting_map P) ∧ poset_sorting_map P ∘ poset_sorting_map P = poset_sorting_map P := by constructor · dsimp only [is_braid_solution] funext ⟨x, y, z⟩ simp only [Function.comp_apply, psm_apply_ib] by_cases h1 : y < x <;> by_cases h2 : z < y <;> by_cases h3 : z < x <;> by_cases h4 : x < y <;> by_cases h5 : y < z <;> by_cases h6 : x < z <;> simp only [h1, h2, h3, h4, h5, h6, if_true, if_false] <;> first | rfl | exact absurd h4 (lt_asymm h1) | exact absurd h5 (lt_asymm h2) | exact absurd h6 (lt_asymm h3) | exact absurd (lt_trans h2 h1) h3 | exact absurd (lt_trans h4 h5) h6 | exact absurd (lt_trans h1 h6) h5 | exact absurd (lt_trans h3 h4) h2 | exact absurd (lt_trans h6 h2) h4 | exact absurd (lt_trans h5 h3) h1 · funext ⟨x, y⟩ simp only [Function.comp_apply, psm_apply_ib] by_cases h : y < x · simp [h, lt_asymm h] · simp [h]