is_ultrametric_transition
deforiginal
For a natural number n and a linearly ordered type α, an n-by-n matrix P : Matrix (Fin n) (Fin n) α satisfies the ultrametric transition property if for every triple of pairwise distinct indices i, j, k : Fin n (satisfying i ≠ j, j ≠ k, and i ≠ k), P i j ≤ max (P i k) (P j k).
Statement
def is_ultrametric_transition {n : ℕ} {α : Type*} [LinearOrder α] (P : Matrix (Fin n) (Fin n) α) : Prop
- Related work
- arXiv:2610.08949 (Primitive Periods in Greedy Chip-Firing Games)
- Verified
- 29 Oct 2026
- Axioms
- none listed
- Built on 2
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder.
- TotalPreorderA total preorder: a preorder where
- Used by 1
- is_ultrametric_transition_of_eq_constFor a natural number n, a linearly ordered type α, a matrix P : Matrix (Fin n) (Fin n) α, and an element c : α, if all off-diagonal…
Read back from the Lean
Given a natural number n, a linearly ordered type α, and an n × n matrix P with entries in α, the property asserts that for all pairwise distinct indices i, j, k : Fin n (that is, i ≠ j, j ≠ k, and i ≠ k), the entry P i j is less than or equal to max (P i k) (P j k).
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
/-- Predicate that a transition matrix satisfies the ultrametric inequality on all pairwise distinct triples of states in Fin n. -/ def is_ultrametric_transition {n : ℕ} {α : Type*} [LinearOrder α] (P : Matrix (Fin n) (Fin n) α) : Prop := ∀ (i j k : Fin n), i ≠ j → j ≠ k → i ≠ k → P i j ≤ max (P i k) (P j k)