arrows_markable_unmarked
def
The number of unmarked markable edges of a position p of the Game of Arrows on G: edges of G neither of whose endpoints has degree 1 and that carry no arrow in p.
Statement
open scoped Classical in noncomputable def arrows_markable_unmarked {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (p : ArrowsPos V) : ℕ
- Source
- Helper for arrows_parity_of_threads_le_two, arXiv:2610.15145 Theorem 10.3 / Corollary 10.4 (the induction in the proof of Theorem 10.3: every option has value (e-1) mod 2 or an option of value e mod 2), done directly on positions of T without the sum decomposition
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Built on 1
- ArrowsPosGiven a type V, ArrowsPos V is the subtype of boolean-valued binary relations p : V → V → Bool that are asymmetric, meaning that for all…
- Used by 3
- arrows_markable_unmarked_emptyIn the empty position the number of unmarked markable edges equals the number of markable (non-pendant) edges, tree_markable_edges.
- arrows_markable_unmarked_of_legalEvery legal move of the Game of Arrows decreases the number of unmarked markable edges by exactly one.
- arrows_parity_of_strategy_classLet T be a finite tree and S a class of positions of the Game of Arrows on T that contains the empty position, such that from every…
Lean source view module on GitHub
open scoped Classical in noncomputable def arrows_markable_unmarked {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (p : ArrowsPos V) : ℕ := (G.edgeFinset.filter (fun e => (∀ v ∈ e, G.degree v ≠ 1) ∧ e.lift ⟨fun u v => p.1 u v = false ∧ p.1 v u = false, fun _ _ => propext and_comm⟩)).card