AFTD Auto-Formalizing Theoretical Domains

poset_edge_braid_map_is_braid_solution

theoremverifiedformalization

For any partially ordered set P with decidable equality, poset_edge_braid_map satisfies the braid equation.

Statement

theorem poset_edge_braid_map_is_braid_solution {P : Type*} [PartialOrder P] [DecidableEq P] :
    is_braid_solution (@poset_edge_braid_map P _ _)
Formalizes
arXiv:2611.15540, Theorem 3.3
Verified
16 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • 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)…
  • poset_edge_braid_mapFor a partially ordered set P with decidable equality, poset_edge_braid_map is the bipartite braid map on ({p : P × P // p.1 ≤ p.2} ⊕ (P ×…

Read back from the Lean

For every type P equipped with a partial order ([PartialOrder P]) and decidable equality ([DecidableEq P]), the map poset_edge_braid_map on the type X = {p : P × P // p.1 ≤ p.2} ⊕ (P × ZMod 2) is a braid solution; that is, the map R = poset_edge_braid_map satisfies the braid relation R₁₂ ∘ R₂₃ ∘ R₁₂ = R₂₃ ∘ R₁₂ ∘ R₂₃ on X × X × X.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The proof establishes that the poset bipartite map satisfies the braid relation R₁₂ ∘ R₂₃ ∘ R₁₂ = R₂₃ ∘ R₁₂ ∘ R₂₃ by evaluating both sides pointwise on an arbitrary triple (a, b, c) of elements from E ⊕ V, where E represents poset relations u ≤ v and V = P × ℤ/2. Decomposing each of the three components into either an edge or a marked vertex yields eight cases. The braid map acts as the identity on pairs of like type and swaps mixed pairs while applying an edge-vertex transition t(l, ·). Because t(l, ·) is an involution on V, repeated transitions on the same edge cancel, causing both ternary compositions to evaluate to the identical triple in every case.

  1. The vertex transition map t(l, ·) is an involution on P × ℤ/2 for every edge l. automation

    We unfold the definition of poset_edge_braid_map_is_braid_solution_t. Splitting into cases on the if-then-else conditions via split_ifs analyzes whether z equals (l.1, 0), (l.2, 1), or neither; in every branch, substituting the known equalities and simplifying verifies that applying t a second time returns z.

    lines 9–10

      unfold poset_edge_braid_map_is_braid_solution_t
      split_ifs with h1 h2 h3 h4 h5 h6 <;> subst_vars <;> simp_all
  2. It suffices to show that (R₁₂ ∘ R₂₃ ∘ R₁₂)(a, b, c) = (R₂₃ ∘ R₁₂ ∘ R₂₃)(a, b, c) for an arbitrary triple (a, b, c).

    Unfolding the definition of is_braid_solution, the goal is the functional equality R₁₂ ∘ R₂₃ ∘ R₁₂ = R₂₃ ∘ R₁₂ ∘ R₂₃ of ternary operations. By function extensionality (funext), it suffices to prove both composite maps agree on an arbitrary triple x, which we unpack into its three components (a, b, c).

    lines 33–35

      unfold is_braid_solution
      funext x
      obtain ⟨a, b, c⟩ := x
  3. The goal reduces to eight cases depending on whether each strand carries an edge or a marked vertex.

    Each strand takes values in the disjoint union of edges and marked vertices, {p : P × P // p.1 ≤ p.2} ⊕ (P × ℤ/2). Performing case analysis on a, b, and c using rcases generates 2³ = 8 subgoals covering all combinations of the sum injections Sum.inl and Sum.inr.

    line 36

      rcases a with l1 | z1 <;> rcases b with l2 | z2 <;> rcases c with l3 | z3 <;>
  4. The braid equation holds in all eight cases.

    In each of the eight cases, we expand function compositions using Function.comp_apply and evaluate poset_edge_braid_map on each pair using the lemmas corresponding to the component types: poset_edge_braid_map_is_braid_solution_R_ii for two edges, poset_edge_braid_map_is_braid_solution_R_vv for two vertices, and poset_edge_braid_map_is_braid_solution_R_iv and poset_edge_braid_map_is_braid_solution_R_vi for mixed pairs. Whenever the two compositions perform adjacent edge-vertex interactions on the same edge, poset_edge_braid_map_is_braid_solution_t_invol cancels the double transition t(l, t(l, z)) back to z. Both composite maps simplify to the exact same triple, closing all eight cases.

    lines 37–42

    uses Function.comp_apply, poset_edge_braid_map_is_braid_solution_R_ii, poset_edge_braid_map_is_braid_solution_R_vv, poset_edge_braid_map_is_braid_solution_R_iv, poset_edge_braid_map_is_braid_solution_R_vi, poset_edge_braid_map_is_braid_solution_t_invol

        simp only [Function.comp_apply,
          poset_edge_braid_map_is_braid_solution_R_ii,
          poset_edge_braid_map_is_braid_solution_R_vv,
          poset_edge_braid_map_is_braid_solution_R_iv,
          poset_edge_braid_map_is_braid_solution_R_vi,
          poset_edge_braid_map_is_braid_solution_t_invol]
Function.comp_apply
Function composition applied to an argument satisfies (f ∘ g)(x) = f(g(x)).
poset_edge_braid_map_is_braid_solution_R_ii
The braid map acts as the identity on any pair of poset edges: R(inl(l), inl(l')) = (inl(l), inl(l')).
poset_edge_braid_map_is_braid_solution_R_vv
The braid map acts as the identity on any pair of vertices: R(inr(z), inr(z')) = (inr(z), inr(z')).
poset_edge_braid_map_is_braid_solution_R_iv
When applied to an edge followed by a vertex, the braid map transposes the elements and transforms the vertex via t: R(inl(l), inr(z)) = (inr(t(l, z)), inl(l)).
poset_edge_braid_map_is_braid_solution_R_vi
When applied to a vertex followed by an edge, the braid map transposes the elements and transforms the vertex via t: R(inr(z), inl(l)) = (inl(l), inr(t(l, z))).
poset_edge_braid_map_is_braid_solution_t_invol
For any edge l and vertex z, the transition map t(l, ·) is an involution: t(l, t(l, z)) = z.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

private def poset_edge_braid_map_is_braid_solution_t {P : Type*} [PartialOrder P] [DecidableEq P]    (l : {p : P × P // p.1 ≤ p.2}) (z : P × ZMod 2) : P × ZMod 2 :=  if z = ((l : P × P).1, 0) then ((l : P × P).2, 1)  else if z = ((l : P × P).2, 1) then ((l : P × P).1, 0) else zprivate lemma poset_edge_braid_map_is_braid_solution_t_invol {P : Type*} [PartialOrder P] [DecidableEq P]    (l : {p : P × P // p.1 ≤ p.2}) (z : P × ZMod 2) :    poset_edge_braid_map_is_braid_solution_t l (poset_edge_braid_map_is_braid_solution_t l z) = z := by  unfold poset_edge_braid_map_is_braid_solution_t  split_ifs with h1 h2 h3 h4 h5 h6 <;> subst_vars <;> simp_allprivate lemma poset_edge_braid_map_is_braid_solution_R_ii {P : Type*} [PartialOrder P] [DecidableEq P]    (l l' : {p : P × P // p.1 ≤ p.2}) :    poset_edge_braid_map (Sum.inl l, Sum.inl l') = (Sum.inl l, Sum.inl l') := rflprivate lemma poset_edge_braid_map_is_braid_solution_R_vv {P : Type*} [PartialOrder P] [DecidableEq P]    (z z' : P × ZMod 2) :    poset_edge_braid_map (Sum.inr z, Sum.inr z') = (Sum.inr z, Sum.inr z') := rflprivate lemma poset_edge_braid_map_is_braid_solution_R_iv {P : Type*} [PartialOrder P] [DecidableEq P]    (l : {p : P × P // p.1 ≤ p.2}) (z : P × ZMod 2) :    poset_edge_braid_map (Sum.inl l, Sum.inr z)      = (Sum.inr (poset_edge_braid_map_is_braid_solution_t l z), Sum.inl l) := rflprivate lemma poset_edge_braid_map_is_braid_solution_R_vi {P : Type*} [PartialOrder P] [DecidableEq P]    (l : {p : P × P // p.1 ≤ p.2}) (z : P × ZMod 2) :    poset_edge_braid_map (Sum.inr z, Sum.inl l)      = (Sum.inl l, Sum.inr (poset_edge_braid_map_is_braid_solution_t l z)) := rfl/-- The poset bipartite map E_P is a solution of the braid equation. -/theorem poset_edge_braid_map_is_braid_solution {P : Type*} [PartialOrder P] [DecidableEq P] :    is_braid_solution (@poset_edge_braid_map P _ _) := by  unfold is_braid_solution  funext x  obtain ⟨a, b, c⟩ := x  rcases a with l1 | z1 <;> rcases b with l2 | z2 <;> rcases c with l3 | z3 <;>    simp only [Function.comp_apply,      poset_edge_braid_map_is_braid_solution_R_ii,      poset_edge_braid_map_is_braid_solution_R_vv,      poset_edge_braid_map_is_braid_solution_R_iv,      poset_edge_braid_map_is_braid_solution_R_vi,      poset_edge_braid_map_is_braid_solution_t_invol]
See it in the graphDiscuss this resultChallenge it