op_517_zero_excess_of_eq
Every rank-3 signotope on Fin m has braid-move excess 0 with respect to itself: the distance in B(m, 2) from u to u is 0, which equals the number of triples on which u differs from u.
Statement
theorem op_517_zero_excess_of_eq (m : ℕ) (u : OrderedTriple (Fin m) → ℤˣ)
(hu : is_rank_three_signotope u) :
(bruhat_order_three_graph (Fin m)).dist ⟨u, hu⟩ ⟨u, hu⟩ = {t : OrderedTriple (Fin m) | u t ≠ u t}.ncard- Source
- arXiv:2610.03808 Sec. 2.2
- Verified
- 27 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- bruhat_order_three_graphThe higher Bruhat order B(α, 2) is the simple graph whose vertices are rank-3 signotopes u : OrderedTriple α → ℤˣ (subtypes of functions…
- 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
LinearOrderis aTotalPreorder. - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or…
Read back from the Lean
For every natural number m, every function u from ordered triples in Fin m to ℤˣ, and every proof hu that u is a rank-three signotope, the graph distance from the vertex ⟨u, hu⟩ to itself in the rank-three Bruhat graph on Fin m equals the natural cardinality (ncard) of the set of ordered triples t such that u t ≠ u 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
Both sides of the equation evaluate directly to $0$. The left-hand side is the graph distance from a vertex to itself, which is always $0$. The right-hand side is the cardinality of the set of triples where $u$ differs from itself, which is empty and therefore has size $0$. A single simplification step evaluates both sides and completes the proof.
Both the graph distance from $\langle u, hu\rangle$ to itself and the number of triples where $u$ differs from $u$ evaluate to $0$.
The simplifier evaluates both sides of the equation to $0$. On the left-hand side, the distance between any vertex and itself in a graph is $0$. On the right-hand side, the condition $u(t) \neq u(t)$ is impossible by the reflexivity of equality, so the set of such triples is empty, and its cardinality is $0$. Both sides simplify to $0$, closing the goal.
simp
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Every rank-3 signotope has zero excess to itself. -/theorem op_517_zero_excess_of_eq (m : ℕ) (u : OrderedTriple (Fin m) → ℤˣ) (hu : is_rank_three_signotope u) : (bruhat_order_three_graph (Fin m)).dist ⟨u, hu⟩ ⟨u, hu⟩ = {t : OrderedTriple (Fin m) | u t ≠ u t}.ncard := by simp