arrows_unmarked_count
def
The number of unmarked edges of G at the position p: edges of G on which neither orientation has been marked.
Statement
open scoped Classical in noncomputable def arrows_unmarked_count {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (p : ArrowsPos V) : ℕ
- Source
- step towards arrows_twin_branch_reduction
- Verified
- 24 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…
Lean source view module on GitHub
open scoped Classical in /-- The number of edges of G still available to be marked at position p. -/ noncomputable def arrows_unmarked_count {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (p : ArrowsPos V) : ℕ := (@Finset.filter (Sym2 V) (fun e => e.lift ⟨fun u v => p.1 u v = false ∧ p.1 v u = false, by intro u v exact propext and_comm⟩) (Classical.decPred _) G.edgeFinset).card