Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

R03 P3-factor structural result: Cubic three connected two cycle profile p3 factor

Proved
R03CubicMatchingTwoCycleIntegration.cubic_three_connected_two_cycle_profile_p3_factor

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

graph-theoryopg-46613p3-factorsource-faithful-candidate

This is a source-faithful auxiliary theorem from the candidate formalization of the cubic P3-partition problem. It records the structural result R03CubicMatchingTwoCycleIntegration.cubic_three_connected_two_cycle_profile_p3_factor under exactly the explicit hypotheses in the Lean statement. It is a conditional reusable result and does not claim that the open root problem has been solved.

Formalization Note The Lean statement and direct proof were extracted from the cited candidate artifact; its source digest is recorded in the campaign ledger.

Preamble
import Mathlib
import Definitions.Def_cubic_p3_partition_models
Formal statement
namespace R03CubicMatchingTwoCycleIntegration

open R03CubicMatchingTwoCycleIntegration
open CubicP3Partition
open SimpleGraph
open scoped BigOperators
universe u
variable {V : Type u} [Fintype V]
theorem cubic_three_connected_two_cycle_profile_p3_factor
    (G : SimpleGraph V)
    (hG : Cubic G) (hconn : ThreeVertexConnected G)
    (horder : 3 ∣ Fintype.card V)
    (hprofile : ∃ M : SimpleGraph V, PerfectMatching G M ∧
      ∃ cA cB : (matchingComplement G M).ConnectedComponent,
        cA ≠ cB ∧ (∀ v : V, v ∈ cA.supp ∨ v ∈ cB.supp)) :
    Nonempty (P3Factor G) := by sorry

end R03CubicMatchingTwoCycleIntegration
Source
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp01/r03-sp01-cubic-matching-two-cycle-profile-closure-candidate-v1.lean; source SHA-256 0526be5208b0636f1a7f9f9d5c85667515300f75a66a02a97afec5e814df5b4a; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.

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