bruhat_order_three_graph
def
The higher Bruhat order B(α, 2) is the simple graph whose vertices are rank-3 signotopes u : OrderedTriple α → ℤˣ (subtypes of functions satisfying is_rank_three_signotope), with adjacency defined by differing at exactly one ordered triple via differs_at_one.
Statement
def bruhat_order_three_graph (α : Type*) [LinearOrder α] : SimpleGraph { u : OrderedTriple α → ℤˣ // is_rank_three_signotope u }
- Defined in
- arXiv:2610.03808 Def. 6.7
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Built on 7
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - differs_at_one_symmFor any type ι and any functions f, g : ι → ℤˣ taking values in the units of ℤ, if differs_at_one f g holds, then differs_at_one g f holds.
- 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…
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - differs_at_one_irreflFor any type ι and any function f : ι → ℤˣ taking values in the units of ℤ, differs_at_one f f does not hold.
- differs_at_oneTwo functions f and g of type ι → ℤˣ (taking values in the units of ℤ, {+1, -1}) differ at exactly one index if there is a unique index i…
- OrderedTripleAn ordered triple in a preordered type is a triple of elements (a, b, c) with a < b and b < c.
- LinearOrder.toTotalPreorderEvery
- Used by 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…
- op_517_zero_excess_iff_exists_walkTwo rank-3 signotopes on Fin m have braid-move excess 0 if and only if there exists a walk in the higher Bruhat order B(m, 2) between them…
- 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…
- op_518_positive_fibre_adj_of_adjFor every natural number m > 0, and any functions u, v : OrderedTriple (Fin m) → ℤˣ that are rank-3 signotopes whose positive fibres are…
- op_517_zero_excess_of_eqEvery 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…
- 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
Given a type α equipped with a linear order, bruhat_order_three_graph α is the simple graph whose vertices are rank-three signotopes on α (that is, elements of the subtype { u : OrderedTriple α → ℤˣ // is_rank_three_signotope u }), where two vertices u and v are adjacent if and only if u.val and v.val differ at exactly one triple (i.e., differs_at_one u.val v.val).
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
/-- The higher Bruhat order B(α, 2) viewed as an undirected flip graph of rank-3 signotopes. -/ def bruhat_order_three_graph (α : Type*) [LinearOrder α] : SimpleGraph { u : OrderedTriple α → ℤˣ // is_rank_three_signotope u } := { Adj := fun u v => differs_at_one u.val v.val symm := ⟨fun _ _ h => differs_at_one_symm h⟩ loopless := ⟨fun u => differs_at_one_irrefl u.val⟩ }