R03 P3-factor structural result: R03SP01ThreeDivisibleComponents
ProvedCubicP3Partition.R03SP01ThreeDivisibleComponentsgraph-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 CubicP3Partition.R03SP01ThreeDivisibleComponents 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 da28a7c7e75fd6dbc71565a267e41aa75cab5dd8d9e3d00d9b3c455f4f5c757f.
Formal statement
import Definitions.Def_cubic_p3_partition_models
import Definitions.Def_r03_defs_b3aaf86bc3_r03_sp01_three_divisible_components_candidate_v1
namespace CubicP3Partition
open CubicP3Partition
open SimpleGraph
universe u
theorem R03SP01ThreeDivisibleComponents
{V : Type u} [Fintype V]
(G F : SimpleGraph V)
(hTF : TwoFactor G F)
(cA cB cC : F.ConnectedComponent)
(eV : cA.supp ⊕ (cB.supp ⊕ cC.supp) ≃ V)
(heA : ∀ x : cA.supp, eV (Sum.inl x) = x.1)
(heB : ∀ x : cB.supp, eV (Sum.inr (Sum.inl x)) = x.1)
(heC : ∀ x : cC.supp, eV (Sum.inr (Sum.inr x)) = x.1)
(kA kB kC : Nat)
[Fintype cA.supp] [Fintype cB.supp] [Fintype cC.supp]
(hcardA : Fintype.card cA.supp = kA * 3)
(hcardB : Fintype.card cB.supp = kB * 3)
(hcardC : Fintype.card cC.supp = kC * 3) :
Nonempty (P3Factor G) := by sorry
end CubicP3Partition
Source
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp01/r03-sp01-three-divisible-components-candidate-v1.lean; source SHA-256 da28a7c7e75fd6dbc71565a267e41aa75cab5dd8d9e3d00d9b3c455f4f5c757f; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.