IsKConnectedSet
def
A set $Z$ in a matroid $M$ is $k$-connected for an integer $k \ge 2$ if for every subset $A \subseteq E(M)$, the connectivity function satisfies $\lambda_M(A) \ge \min(|Z \cap A|, |Z \setminus A|, k - 1)$.
Statement
def IsKConnectedSet {α : Type*} (M : Matroid α) (k : ℕ) (Z : Set α) : Prop
- Defined in
- arXiv:2610.29979, Section 1
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Built on 1
- matroid_connectivityThe connectivity function $\lambda_M(X)$ of a subset $X$ of the ground set of a matroid $M$ is defined as…
- Used by 3
- matroid_not_k_connected_iff_exact_separationLet $M$ be a finite matroid, let $k \ge 3$ be an integer, and let $Z \subseteq E(M)$ be a $(k-1)$-connected set in $M$. Then $Z$ is not…
- is_k_connected_set_emptyIn every matroid $M$, the empty set is $k$-connected for all $k$.
- matroid_not_k_connected_of_exact_separationLet $M$ be a matroid, let $k \ge 2$ be an integer, and let $Z$ be a set in $M$. If there exists a subset $X \subseteq E(M)$ such that…
Read back from the Lean
A set Z : Set α is a k-connected set in a matroid M on α if for every subset A of the ground set M.E, the minimum of |Z ∩ A|, |Z \ A|, and k - 1 (using Set.ncard) is at most the matroid connectivity of A in M.
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
/-- A subset Z of elements of a matroid M is k-connected if λ(A) ≥ min(|Z ∩ A|, |Z \ A|, k - 1) for all A ⊆ E(M). -/ def IsKConnectedSet {α : Type*} (M : Matroid α) (k : ℕ) (Z : Set α) : Prop := ∀ A ⊆ M.E, min (min (Z ∩ A).ncard (Z \ A).ncard) (k - 1) ≤ matroid_connectivity M A