Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Q5 weighted deficiency identity

Proved
R03SP06.q5_weighted_deficiency_identity

by hao jia · Sep 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricscubic-graphsdegree-sequencegraph-theory

The total deficiency is the weighted count of degree-one and degree-two vertices.

$$\sum_v(3-\deg v)=2n_1+n_2.

This isolates one reusable arithmetic step for classifying subcubic residual graphs of total cubic deficiency five. It is an auxiliary theorem and does not assert the open root P3-factor conjecture.

Preamble
import Mathlib
import Definitions.Def_cubic_p3_partition_models
Formal statement
namespace R03SP06

variable {V : Type} [Fintype V] [DecidableEq V]

open CubicP3Partition

theorem q5_weighted_deficiency_identity
    {G : SimpleGraph V}
    (hdeg : ∀ v, 1 ≤ degree G v ∧ degree G v ≤ 3) :
    ∑ v, (3 - degree G v) =
      2 * (Finset.filter (fun v => degree G v = 1) Finset.univ).card +
        (Finset.filter (fun v => degree G v = 2) Finset.univ).card := by sorry

end R03SP06
Source
Derived auxiliary theorem for the Prove2me mission ‘P3-Partitions of Cubic 3-Connected Graphs (OPG-46613)’, https://prove2.me/missions/P3-Partitions%20of%20Cubic%203-Connected%20Graphs%20%28OPG-46613%29; background: A. Kelmans, ‘Packing 3-vertex paths in cubic 3-connected graphs’, arXiv:0801.1239.

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