AFTD Auto-Formalizing Theoretical Domains

is_braid_iso

def

Two maps R : X × X → X × X and S : Y × Y → Y × Y are isomorphic if there exists an equivalence e : X ≃ Y such that (e × e) ∘ R = S ∘ (e × e).

Statement

def is_braid_iso {X Y : Type*} (R : X × X → X × X) (S : Y × Y → Y × Y) : Prop
Defined in
scout/2611-15540-solutions-of-the-set-theoretic-quantum-yang-baxter-equation.md:147
Verified
13 Nov 2026
Axioms
none listed
Used by 3
  • 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_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_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

For types X and Y and endomaps R : X × X → X × X and S : Y × Y → Y × Y, is_braid_iso R S asserts that there exists an equivalence (bijection) e : X ≃ Y such that Prod.map e e ∘ R = S ∘ Prod.map e e. That is, mapping a pair through R and then applying e componentwise is equal to applying e componentwise and then mapping through S.

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

/-- Isomorphism between two braid maps, witnessed by an equivalence intertwining them. -/
def is_braid_iso {X Y : Type*} (R : X × X → X × X) (S : Y × Y → Y × Y) : Prop :=
  ∃ e : X ≃ Y, Prod.map e e ∘ R = S ∘ Prod.map e e
See it in the graphDiscuss this resultChallenge it