Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, eq. (17) — fractional Berge–Tutte formula [SU97, Theorem 2.2.6]

Proved
SpaceReset.Hardness.eq_17

by mikedeng1 · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theorymatchingp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For every finite simple graph HHH on kkk vertices,

T(H)=k+max⁡S⊆V(H){iso⁡(H−S)−∣S∣}=2(k−νf(H)),T(H)=k+\max_{S\subseteq V(H)}\{\operatorname{iso}(H-S)-|S|\}=2\big(k-\nu_f(H)\big),T(H)=k+S⊆V(H)max​{iso(H−S)−∣S∣}=2(k−νf​(H)),

where T(H)=max⁡R⊆V(H){∣R∣+iso⁡(H[R])}T(H)=\max_{R\subseteq V(H)}\{|R|+\operatorname{iso}(H[R])\}T(H)=maxR⊆V(H)​{∣R∣+iso(H[R])} and νf\nu_fνf​ is the fractional matching number.

The identity expresses the two-cut cost of an interval layout through matching deficiency.

Differences from the source:

  • encoding: a graph H on k vertices → a simple graph on any finite type V with k = |V|; reason: same statement, vertex set not relabelled
Preamble
import Mathlib
import Definitions.Def_SpaceReset_Hardness_Graphs

set_option autoImplicit false

open Classical
Formal statement
namespace SpaceReset.Hardness

/-- §3.1, eq. (17), p. 22: the fractional Berge–Tutte formula [SU97, Theorem 2.2.6]. -/
theorem eq_17 {V : Type} [Fintype V] [DecidableEq V] (H : SimpleGraph V) :
    (Tval H : ℤ) = (Fintype.card V : ℤ) +
      (Finset.univ : Finset (Finset V)).sup' Finset.univ_nonempty
        (fun S => (isoIn H (Finset.univ \ S) : ℤ) - (S.card : ℤ)) ∧
    (Tval H : ℝ) = 2 * ((Fintype.card V : ℝ) - fracMatchingNumber H) := by sorry

end SpaceReset.Hardness
Source
Rinka Miura, STOC 2027 submission #1715 (October 2026), §3.1, eq. (17), p. 22 (cited: Scheinerman–Ullman, Fractional Graph Theory, Theorem 2.2.6)
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 11, 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