AFTD Auto-Formalizing Theoretical Domains

op_517_zero_excess_of_le_two

theoremverified

For 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 vacuously and therefore inst has braid-move excess 0 (wiring_diagram_zero_excess inst).

Statement

theorem op_517_zero_excess_of_le_two (inst : WiringDiagramPair) (h : inst.m ≤ 2) : wiring_diagram_zero_excess inst
Source
arXiv:2610.03808
Verified
28 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 6
  • 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…
  • WiringDiagramPairAn 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…
  • OrderedTripleAn ordered triple in a preordered type is a triple of elements (a, b, c) with a < b and b < c.
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
  • 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

For any inst : WiringDiagramPair whose size parameter inst.m is at most 2 (inst.m ≤ 2), the pair has zero excess (wiring_diagram_zero_excess inst), meaning that the shortest path distance between inst.u and inst.v in the rank-3 Bruhat graph on Fin inst.m is equal to the number of ordered triples t : OrderedTriple (Fin inst.m) at which inst.u t ≠ inst.v t.

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

By op_517_zero_excess_of_eq_pair, any pair of wiring diagrams with identical signotope functions has braid-move excess 0, so it suffices to show that inst.u = inst.v. For any ordered triple t = (a, b, c) of elements from Fin inst.m, the indices must satisfy 0 ≤ a < b < c < inst.m ≤ 2, which requires c ≥ 2 and c < 2 simultaneously. Because no such triple can exist, the equality inst.u = inst.v holds vacuously.

  1. It suffices to show that inst.u = inst.v.

    By op_517_zero_excess_of_eq_pair, whenever the two signotope assignments u and v coincide, the braid-move excess of the wiring diagram pair is 0.

    line 3

    uses op_517_zero_excess_of_eq_pair

      apply op_517_zero_excess_of_eq_pair
  2. The equality inst.u = inst.v holds vacuously.

    By function extensionality (ext t), it suffices to show that inst.u t = inst.v t for any ordered triple t in Fin inst.m. An ordered triple requires strictly increasing elements 0 ≤ t.a < t.b < t.c, while the assumption t.c ∈ Fin inst.m with inst.m ≤ 2 requires t.c < inst.m ≤ 2. However, two strict steps from 0 force t.c ≥ 2, a contradiction. Linear integer arithmetic (omega) derives this contradiction, confirming that no such triple exists.

    lines 4–8

      ext t
      have : t.a.val < t.b.val := t.ab
      have : t.b.val < t.c.val := t.bc
      have : t.c.val < inst.m := t.c.isLt
      omega
op_517_zero_excess_of_eq_pair
If a pair of wiring diagrams has identical signotope assignments, its braid-move excess is 0.

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

/-- Every pair of wiring diagrams on m ≤ 2 wires has braid-move excess 0. -/theorem op_517_zero_excess_of_le_two (inst : WiringDiagramPair) (h : inst.m ≤ 2) : wiring_diagram_zero_excess inst := by  apply op_517_zero_excess_of_eq_pair  ext t  have : t.a.val < t.b.val := t.ab  have : t.b.val < t.c.val := t.bc  have : t.c.val < inst.m := t.c.isLt  omega
See it in the graphDiscuss this resultChallenge it