Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, p. 1018 — a β-cycle of a subhypergraph G_{V′} gives a β-cycle of G of the same length

Proved
RunIntersect.Strict.lemma_3

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

beta-acyclichypergraphp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1subhypergraph

Let G=(V,E)G=(V,E)G=(V,E) be a hypergraph and V′⊆VV'\subseteq VV′⊆V. If the subhypergraph GV′G_{V'}GV′​ contains a β-cycle of length ttt, then GGG contains a β-cycle of length ttt. In particular,

G β-acyclic ⟹ GV′ β-acyclic.G\ \text{β-acyclic}\ \Longrightarrow\ G_{V'}\ \text{β-acyclic}.G β-acyclic ⟹ GV′​ β-acyclic.

The lemma lets a short β-cycle found in an induced subhypergraph be transported back to GGG; it is used in the proof of Proposition 5 to show that the subhypergraph induced by a shortest β-cycle has a very rigid shape.

Preamble
import Mathlib
import Definitions.Def_RunIntersect_Strict_Setting
Formal statement
namespace RunIntersect.Strict

/-- Lemma 3, p. 1018: a β-cycle of length `t` of the subhypergraph `G_W` (`W ⊆ V`) gives a β-cycle of
length `t` of `G`; in particular `G_W` is β-acyclic when `G` is. -/
theorem lemma_3 {α : Type*} [Fintype α] [DecidableEq α] (G : Hypergraph α) (W : Finset α)
    (hW : W ⊆ G.V) :
    (∀ (t : ℕ) (v : Fin t → α) (e : Fin t → Finset α), IsBetaCycle (subHg G W) t v e →
        ∃ (v' : Fin t → α) (e' : Fin t → Finset α), IsBetaCycle G t v' e') ∧
      (IsBetaAcyclic G → IsBetaAcyclic (subHg G W)) := by sorry

end RunIntersect.Strict
Source
Del Pia and Khajavirad, The running intersection relaxation of the multilinear polytope, Math. Oper. Res. 46 (2021), p. 1018, Lemma 3
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 10, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me