AFTD Auto-Formalizing Theoretical Domains

is_braid_solution

def

A 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) on X × X × X.

Statement

def is_braid_solution {X : Type*} (R : X × X → X × X) : Prop
Defined in
scout/2611-15540-solutions-of-the-set-theoretic-quantum-yang-baxter-equation.md:135
Verified
13 Nov 2026
Axioms
none listed
Used by 4

Read back from the Lean

For a type X and a function R : X × X → X × X, is_braid_solution R is the proposition that R12 ∘ R23 ∘ R12 = R23 ∘ R12 ∘ R23, where R12, R23 : X × X × X → X × X × X are defined by: - R12 (x, y, z) = ((R (x, y)).1, (R (x, y)).2, z) - R23 (x, y, z) = (x, (R (y, z)).1, (R (y, z)).2)

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

/-- Predicate stating that a map R : X × X → X × X satisfies the braid relation on X³. -/
def is_braid_solution {X : Type*} (R : X × X → X × X) : Prop :=
  let R12 : X × X × X → X × X × X := fun (x, y, z) => ((R (x, y)).1, (R (x, y)).2, z)
  let R23 : X × X × X → X × X × X := fun (x, y, z) => (x, (R (y, z)).1, (R (y, z)).2)
  R12 ∘ R23 ∘ R12 = R23 ∘ R12 ∘ R23
See it in the graphDiscuss this resultChallenge it