order_graph_top_set
def
For an edge e = (ν, a) and a level m, the top set U_m(e) is the set consisting of a together with the first m-1 labels of ν.
Statement
def order_graph_top_set {d : ℕ} (m : ℕ) (e : Order d × Fin d) : Finset (Fin d)- Source
- step towards order_graph_edges_ge_lower_bound
- Verified
- 31 Oct 2026
- Axioms
- none listed
- Built on 1
- OrderAn order of dimension d is a permutation of the attribute set {0, ..., d-1}, represented as a list without duplicates containing all…
- Used by 1
- complete_order_graph_dim_six_lower_boundEvery complete order graph of dimension 6 has at least 40 edges.
Lean source view module on GitHub
/-- The m-element label set determined by an edge: its label plus the first m-1 labels of its order. -/ def order_graph_top_set {d : ℕ} (m : ℕ) (e : Order d × Fin d) : Finset (Fin d) := insert e.2 (List.take (m - 1) e.1.elems).toFinset