AFTD Auto-Formalizing Theoretical Domains

WiringDiagramPair

structure

An instance of the zero excess problem consisting of a wire count m and two rank-3 signotopes u and v on Fin m representing wiring diagrams of m pseudolines.

Statement

structure WiringDiagramPair
Defined in
arXiv:2610.03808 Sec. 2
Verified
26 Oct 2026
Axioms
none listed
Built on 4
  • OrderedTripleAn ordered triple in a preordered type is a triple of elements (a, b, c) with a < b and b < c.
  • is_rank_three_signotopeA function u : OrderedTriple α → ℤˣ assigning units of ℤ ({+1, -1}) to ordered triples in a linearly ordered type α is a rank-3 signotope…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
Used by 5
  • op_517_zero_excess_of_eq_pairFor any instance inst of WiringDiagramPair, if the two signotopes inst.u and inst.v are equal, then inst has braid-move excess 0…
  • op_517_zero_excess_of_le_twoFor any instance inst of WiringDiagramPair on m pseudolines with m ≤ 2, there are no ordered triples in Fin m, so inst.u = inst.v holds…
  • op_517_zero_excess_of_adjIf two wiring diagrams (represented as rank-3 signotopes u and v on Fin m) are adjacent in the higher Bruhat graph…
  • wiring_diagram_pair_encodeEncodes an instance of a pair of wiring diagrams on m pseudolines as a list of Booleans consisting of m unary ones followed by false and…
  • wiring_diagram_zero_excessA pair of wiring diagrams (represented as rank-3 signotopes) has braid-move excess 0 if their distance in the higher Bruhat graph B(m, 2)…

Read back from the Lean

The structure WiringDiagramPair defines a bundled object consisting of: 1. A natural number m. 2. A function u assigning an integer unit (i.e., an element of ℤˣ = {1, -1}) to each ordered triple (a, b, c) of elements in Fin m with a < b < c. 3. A second function v assigning an integer unit to each ordered triple (a, b, c) of elements in Fin m with a < b < c. 4. A hypothesis hu asserting that u is a rank-three signotope: for every quadruple a, b, c, d : Fin m with a < b < c < d, setting - x₁ = u(a, b, c) - x₂ = u(a, b, d) - x₃ = u(a, c, d) - x₄ = u(b, c, d), it is NOT the case that: - x₁ = x₃ and x₁ ≠ x₂, nor - x₁ = x₄ and x₁ ≠ x₂, nor - x₁ = x₄ and x₁ ≠ x₃, nor - x₂ = x₄ and x₂ ≠ x₃. (Equivalently, the sequence (x₁, x₂, x₃, x₄) has at most one sign change.) 5. A hypothesis hv asserting the identical rank-three signotope condition for v.

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

/-- An instance of the zero excess problem consisting of m wires and two rank-3 signotopes. -/
structure WiringDiagramPair where
  m : ℕ
  u : OrderedTriple (Fin m) → ℤˣ
  v : OrderedTriple (Fin m) → ℤˣ
  hu : is_rank_three_signotope u
  hv : is_rank_three_signotope v
See it in the graphDiscuss this resultChallenge it