chirotope_three_graph
The mutation walk graph of uniform rank-3 chirotopes on Ω is the simple graph whose vertices are uniform rank-3 chirotopes chi : OrderedTriple Ω → ℤˣ (subtypes of functions satisfying is_rank_three_uniform_chirotope), with adjacency defined by differing at exactly one ordered triple via differs_at_one.
Statement
def chirotope_three_graph (Ω : Type*) [LinearOrder Ω] : SimpleGraph { chi : OrderedTriple Ω → ℤˣ // is_rank_three_uniform_chirotope chi }
- Defined in
- arXiv:2610.03808 Def. 6.2
- 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.
- 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.
- is_rank_three_uniform_chirotopeA function chi : OrderedTriple α → ℤˣ assigning units of ℤ to ordered triples in a linearly ordered type α is a uniform rank-3 chirotope…
- 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 1
- 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…
Read back from the Lean
Given a linearly ordered type Ω, chirotope_three_graph Ω is the simple graph whose vertices are the rank-three uniform chirotopes on Ω—that is, functions chi : OrderedTriple Ω → ℤˣ satisfying is_rank_three_uniform_chirotope chi—where two vertices c₁ and c₂ are adjacent if and only if their underlying functions differ at exactly one ordered triple (differs_at_one c₁.val c₂.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 mutation walk graph of uniform rank-3 chirotopes on Ω. -/ def chirotope_three_graph (Ω : Type*) [LinearOrder Ω] : SimpleGraph { chi : OrderedTriple Ω → ℤˣ // is_rank_three_uniform_chirotope chi } := { Adj := fun c₁ c₂ => differs_at_one c₁.val c₂.val symm := ⟨fun _ _ h => differs_at_one_symm h⟩ loopless := ⟨fun c => differs_at_one_irrefl c.val⟩ }