R03 P3-factor structural result: Cubic three connected two cycle profile p3 factor
ProvedR03CubicMatchingTwoCycleIntegration.cubic_three_connected_two_cycle_profile_p3_factorgraph-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 R03CubicMatchingTwoCycleIntegrationSource
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.