Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, p. 1018 — a β-cycle of an induced subhypergraph lifts to G; subhypergraphs of β-acyclic hypergraphs are β-acyclic

Proved
RunIntersect.Tight.lemma_3

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

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

Let G=(V,E)G=(V,E)G=(V,E) be a hypergraph and V′⊆VV'\subseteq VV′⊆V. The subhypergraph GV′G_{V'}GV′​ induced by V′V'V′ has node set V′V'V′ and edges e∩V′e\cap V'e∩V′ for e∈Ee\in Ee∈E with ∣e∩V′∣≥2|e\cap V'|\ge 2∣e∩V′∣≥2.

  1. If GV′G_{V'}GV′​ contains a β-cycle of length ttt, then GGG contains a β-cycle of length ttt.
  2. In particular, if GGG is β-acyclic, then GV′G_{V'}GV′​ is β-acyclic.

This is the hereditary property of β-acyclicity used throughout §3.3 and §5.3: it lets edge-induced pieces of a β-acyclic hypergraph inherit acyclicity.

Formalization Note A β-cycle of length ttt is given by injective maps v : Fin t → α, e : Fin t → Finset α (0-based), see the Setting file.

Preamble
import Mathlib
import Definitions.Def_RunIntersect_Tight_Setting
Formal statement
namespace RunIntersect.Tight

theorem lemma_3 {α : Type*} [Fintype α] [DecidableEq α] (G : Hypergraph α) (W : Finset α) (hW : W ⊆ G.V) :
    (∀ t, (∃ v e, IsBetaCycle (subHg G W) t v e) → ∃ v e, IsBetaCycle G t v e) ∧
      (IsBetaAcyclic G → IsBetaAcyclic (subHg G W)) := by sorry

end RunIntersect.Tight
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