AFTD Auto-Formalizing Theoretical Domains

Matroid.IsCyclic

def

A subset X of the ground set of a matroid M is cyclic if it is a union of circuits of M.

Statement

def Matroid.IsCyclic {α : Type*} (M : Matroid α) (X : Set α) : Prop
Defined in
arXiv:2611.15741 Definition 2.9
Verified
14 Nov 2026
Axioms
none listed
Used by 2

Read back from the Lean

For a matroid M on a type α and a subset X of α, Matroid.IsCyclic M X asserts that there exists a collection of subsets 𝒮 : Set (Set α) such that every set C ∈ 𝒮 is a circuit of M (M.IsCircuit C), and X is the union of the sets in 𝒮 (X = ⋃₀ 𝒮).

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 of the ground set of a matroid is cyclic if it is a union of circuits. -/
def Matroid.IsCyclic {α : Type*} (M : Matroid α) (X : Set α) : Prop := ∃ 𝒮 : Set (Set α), (∀ C ∈ 𝒮, M.IsCircuit C) ∧ X = ⋃₀ 𝒮
See it in the graphDiscuss this resultChallenge it