R03 P3-factor structural result: R03 s p01 two factor two cycle p3 factor of cover at cross
ProvedCubicP3Partition.R03SP01TwoFactorTwoCycleP3FactorOfCoverAtCrossgraph-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.R03SP01TwoFactorTwoCycleP3FactorOfCoverAtCross 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 Definitions.Def_cubic_p3_partition_models
Formal statement
namespace CubicP3Partition
open CubicP3Partition
open SimpleGraph
universe u
theorem R03SP01TwoFactorTwoCycleP3FactorOfCoverAtCross
{V : Type u} [Fintype V]
(G F : SimpleGraph V)
(hTF : TwoFactor G F)
(cA cB : F.ConnectedComponent)
(hneq : cA ≠ cB)
(hcover : ∀ v : V, v ∈ cA.supp ∨ v ∈ cB.supp)
(xA xB : V)
(hxA : xA ∈ cA.supp) (hxB : xB ∈ cB.supp)
(hcross : G.Adj xA xB)
(kA kB : Nat)
[Fintype cA.supp] [Fintype cB.supp]
(hcardA : Fintype.card cA.supp = 1 + kA * 3)
(hcardB : Fintype.card cB.supp = 2 + kB * 3) :
Nonempty (P3Factor G) := by sorry
end CubicP3PartitionSource
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp01/r03-sp01-two-factor-two-cycle-component-bridge-candidate-v3.lean; source SHA-256 c21aa84669095a9bb148dd21a06848ec7c1d72535bca49c13d6617e25aa3fc02; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.