ocycap_crosses_cut
def
For any type V, an unordered pair e : Sym2 V of vertices crosses a set of vertices C : Set V if there exist u, v : V such that e = s(u, v), u ∈ C, and v ∉ C.
Statement
def ocycap_crosses_cut {V : Type*} (e : Sym2 V) (C : Set V) : Prop
- Defined in
- arXiv:2611.08570 Section 1.2, Section 3.1
- Verified
- 09 Nov 2026
- Axioms
- none listed
Read back from the Lean
Given a type V, an unordered pair e : Sym2 V, and a subset C : Set V, ocycap_crosses_cut e C asserts that there exist u, v : V such that e is the unordered pair s(u, v) (i.e. Sym2.mk (u, v)), with u ∈ C and v ∉ C (that is, the edge e has one endpoint in C and the other endpoint not in C).
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
/-- An unordered pair e : Sym2 V crosses a set C : Set V if one endpoint is in C and the other is not. -/ def ocycap_crosses_cut {V : Type*} (e : Sym2 V) (C : Set V) : Prop := ∃ u v, e = s(u, v) ∧ u ∈ C ∧ v ∉ C