AFTD Auto-Formalizing Theoretical Domains

poset_braid_map

def

For a partially ordered set P with decidable order, the bipartite map poset_braid_map on (P ⊕ (P × ZMod 2)) × (P ⊕ (P × ZMod 2)) fixes pairs from P × P and (P × ZMod 2) × (P × ZMod 2), and for x in P and (y, ε) in P × ZMod 2 swaps the components while adding 1 to ε if y ≤ x.

Statement

def poset_braid_map {P : Type*} [PartialOrder P] [DecidableRel ((· ≤ ·) : P → P → Prop)]
    (p : (P ⊕ (P × ZMod 2)) × (P ⊕ (P × ZMod 2))) : (P ⊕ (P × ZMod 2)) × (P ⊕ (P × ZMod 2))
Defined in
scout/2611-15540-solutions-of-the-set-theoretic-quantum-yang-baxter-equation.md:488
Verified
13 Nov 2026
Axioms
none listed
Used by 3
  • poset_braid_map_is_braid_solutionFor any partially ordered set P with decidable order, poset_braid_map satisfies the braid equation.
  • poset_braid_iso_of_order_isoIf two partially ordered sets P and Q with decidable orders are order isomorphic, then their associated poset braid solutions…
  • poset_braid_map_involutiveFor any partially ordered set P with decidable order, the bipartite map poset_braid_map is an involution on pairs: poset_braid_map…

Read back from the Lean

Given a type P with a partial order ≤ and decidable ordering relation [DecidableRel (· ≤ ·)], poset_braid_map is the endofunction on (P ⊕ (P × ZMod 2)) × (P ⊕ (P × ZMod 2)) defined by cases on an input pair p: 1. If p = (.inl x, .inl x'), it returns (.inl x, .inl x') unchanged. 2. If p = (.inr z, .inr z'), it returns (.inr z, .inr z') unchanged. 3. If p = (.inl x, .inr (y, ε)), it returns (.inr (y, ε'), .inl x), swapping the components, where ε' = ε + 1 if y ≤ x and ε' = ε otherwise. 4. If p = (.inr (y, ε), .inl x), it returns (.inl x, .inr (y, ε')), swapping the components, where ε' = ε + 1 if y ≤ x and ε' = ε 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

/-- The involutive poset solution D_P of the braid equation on P ⊕ (P × ZMod 2). -/
def poset_braid_map {P : Type*} [PartialOrder P] [DecidableRel ((· ≤ ·) : P → P → Prop)]
    (p : (P ⊕ (P × ZMod 2)) × (P ⊕ (P × ZMod 2))) : (P ⊕ (P × ZMod 2)) × (P ⊕ (P × ZMod 2)) :=
  match p with
  | (.inl x, .inl x') => (.inl x, .inl x')
  | (.inr z, .inr z') => (.inr z, .inr z')
  | (.inl x, .inr (y, ε)) =>
    let ε' := if y ≤ x then ε + 1 else ε
    (.inr (y, ε'), .inl x)
  | (.inr (y, ε), .inl x) =>
    let ε' := if y ≤ x then ε + 1 else ε
    (.inl x, .inr (y, ε'))
See it in the graphDiscuss this resultChallenge it