is_rank_three_signotope
A function u : OrderedTriple α → ℤˣ assigning units of ℤ ({+1, -1}) to ordered triples in a linearly ordered type α is a rank-3 signotope if for all a < b < c < d in α, the sequence of four values (u(abc), u(abd), u(acd), u(bcd)) has at most one sign change (no alternating pattern of length 3).
Statement
def is_rank_three_signotope {α : Type*} [LinearOrder α] (u : OrderedTriple α → ℤˣ) : Prop
- Defined in
- arXiv:2610.03808 Def. 2.1, Def. 6.7
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Built on 3
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - 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 thanLinearOrder— it does NOT require antisymmetry or…
- LinearOrder.toTotalPreorderEvery
- Used by 8
- 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…
- bruhat_order_three_graphThe higher Bruhat order B(α, 2) is the simple graph whose vertices are rank-3 signotopes u : OrderedTriple α → ℤˣ (subtypes of functions…
- 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…
- 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…
- 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
Let α be a type equipped with a linear order, and let u be a function mapping every OrderedTriple α (a strictly increasing triple of elements of α) to an integer unit (ℤˣ, i.e., 1 or -1).
The predicate is_rank_three_signotope u asserts that for all elements a, b, c, d : α satisfying a < b, b < c, and c < d, if we define:
- x₁ = u ⟨a, b, c, a < b, b < c⟩
- x₂ = u ⟨a, b, d, a < b, b < d⟩ (where b < d is by transitivity of b < c < d)
- x₃ = u ⟨a, c, d, a < c, c < d⟩ (where a < c is by transitivity of a < b < c)
- x₄ = u ⟨b, c, d, b < c, c < d⟩
then all of the following four conditions hold:
1. ¬ (x₁ = x₃ ∧ x₁ ≠ x₂)
2. ¬ (x₁ = x₄ ∧ x₁ ≠ x₂)
3. ¬ (x₁ = x₄ ∧ x₁ ≠ x₃)
4. ¬ (x₂ = x₄ ∧ x₂ ≠ x₃)
(Equivalently, since ℤˣ = {1, -1}, the sequence (x₁, x₂, x₃, x₄) does not alternate in sign; it has at most one sign change.)
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
/-- A map from ordered triples to signs ℤˣ is a rank-3 signotope if every 4-element packet has at most one sign change. -/ def is_rank_three_signotope {α : Type*} [LinearOrder α] (u : OrderedTriple α → ℤˣ) : Prop := ∀ (a b c d : α) (hab : a < b) (hbc : b < c) (hcd : c < d), let x₁ := u ⟨a, b, c, hab, hbc⟩ let x₂ := u ⟨a, b, d, hab, hbc.trans hcd⟩ let x₃ := u ⟨a, c, d, hab.trans hbc, hcd⟩ let x₄ := u ⟨b, c, d, hbc, hcd⟩ ¬ (x₁ = x₃ ∧ x₁ ≠ x₂) ∧ ¬ (x₁ = x₄ ∧ x₁ ≠ x₂) ∧ ¬ (x₁ = x₄ ∧ x₁ ≠ x₃) ∧ ¬ (x₂ = x₄ ∧ x₂ ≠ x₃)