Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 6 — if e is dependent on P₁ but on no proper subset of P₁, then P₁ + e is a circuit

Proved
WhitneyMatroid.RankCircuit.circuit_of_minimal_dependent

by mikedeng1 · 1 vote · Oct 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

circuitsmatroidsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1rank-function

Let rrr be a rank function on the subsets of a finite set MMM satisfying (R1)(\mathrm R_1)(R1​)–(R3)(\mathrm R_3)(R3​). Let P1⊆MP_1 \subseteq MP1​⊆M and e∉P1e \notin P_1e∈/P1​. Suppose eee is dependent on P1P_1P1​, i.e. r(P1+e)=r(P1)r(P_1 + e) = r(P_1)r(P1​+e)=r(P1​), but on no proper subset of P1P_1P1​: r(Q+e)≠r(Q)r(Q + e) \ne r(Q)r(Q+e)=r(Q) for every Q⊂P1Q \subset P_1Q⊂P1​, Q≠P1Q \neq P_1Q=P1​. Then

P=P1+e  is a circuit of r.P = P_1 + e \ \text{ is a circuit of } r.P=P1​+e  is a circuit of r.

Together with Lemma 5 this is the bridge between dependence of an element on a set and circuits through that element (Theorem 4).

Formalization Note The hypothesis e∉P1e \notin P_1e∈/P1​ is tacit in the paper (it writes P=P1+eP = P_1 + eP=P1​+e and its proof uses ρ(P1)<ρ(P)\rho(P_1) < \rho(P)ρ(P1​)<ρ(P)); it is added as a binder.

Preamble
import Mathlib
import Definitions.Def_WhitneyMatroid_RankCircuit_IsRankSystem
Formal statement
namespace WhitneyMatroid.RankCircuit

theorem circuit_of_minimal_dependent {α : Type*} [Fintype α] [DecidableEq α]
    (r : Finset α → ℤ) (hr : IsRankSystem r) (P₁ : Finset α) (e : α) (he : e ∉ P₁)
    (hdep : IsDependentOn r e P₁) (hmin : ∀ Q : Finset α, Q ⊂ P₁ → ¬ IsDependentOn r e Q) :
    circuitsOfRank r (insert e P₁) := by sorry

end WhitneyMatroid.RankCircuit
Source
Whitney, On the Abstract Properties of Linear Dependence, Amer. J. Math. 57 (1935), p. 512, Lemma 6
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me