R03 P3-factor structural result: R03 s p01 exists cross edge of connected
ProvedCubicP3Partition.R03SP01ExistsCrossEdgeOfConnectedgraph-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.R03SP01ExistsCrossEdgeOfConnected 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; the artifact is candidate-only and 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 R03SP01ExistsCrossEdgeOfConnected
{A B : Type u} (G : SimpleGraph (A ⊕ B))
(a0 : A) (b0 : B) (hconn : G.Connected) :
∃ a : A, ∃ b : B, G.Adj (Sum.inl a) (Sum.inr b) := by sorry
end CubicP3PartitionSource
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp01/r03-sp01-two-cycle-cyclic-order-assembly-candidate-v3.lean; source SHA-256 c846197e5e4259b0320012f9799f1f933b8caba92513d6ca4689d68935f35f89; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.