instDecEqIntervalFamily
instance
Equality on intervals in an interval family is decidable.
Statement
instance instDecEqIntervalFamily {T : ColoredRootedTree} {R : ℕ} (F : IntervalFamily T R) : DecidableEq F.ι- Defined in
- arXiv:2611.03620 Definition 2.2
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Built on 2
- IntervalFamilyAn interval family for a colored tree consists of an injective mapping from vertices to integers and a laminar family of non-empty integer…
- ColoredRootedTreeA finite rooted tree properly colored with 4 colors, represented by an ancestorship partial order with a root element below all vertices,…
- Used by 1
- contiguous_interval_family_depth_lower_boundFor all integers R ≥ 1 and d ≥ 0 there is a finite rooted tree, properly colored with the 4 colors 0..3, with at most 11(2R+1)^d vertices,…
Read back from the Lean
For every colored rooted tree T, natural number R, and interval family F : IntervalFamily T R, equality on the index type F.ι of F is decidable (providing the DecidableEq F.ι instance stored in the field F.decEq).
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
/-- DecidableEq instance for the interval index type. -/ instance instDecEqIntervalFamily {T : ColoredRootedTree} {R : ℕ} (F : IntervalFamily T R) : DecidableEq F.ι := F.decEq