R03 P3-factor structural result: R03 s p01 two cycle cyclic order assembly swap
ProvedCubicP3Partition.R03SP01TwoCycleCyclicOrderAssemblySwapgraph-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.R03SP01TwoCycleCyclicOrderAssemblySwap 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
universe u
theorem R03SP01TwoCycleCyclicOrderAssemblySwap
{A B : Type u} [Fintype A] [Fintype B]
(G : SimpleGraph (A ⊕ B))
(kA kB : Nat)
(eA : Fin (2 + kA * 3) ≃ A)
(eB : Fin (1 + kB * 3) ≃ B)
(cycleA : ∀ i : Fin (2 + kA * 3),
G.Adj (Sum.inl (eA i))
(Sum.inl (eA ⟨(i.val + 1) % (2 + kA * 3),
Nat.mod_lt _ (by omega)⟩)))
(cycleB : ∀ i : Fin (1 + kB * 3),
G.Adj (Sum.inr (eB i))
(Sum.inr (eB ⟨(i.val + 1) % (1 + kB * 3),
Nat.mod_lt _ (by omega)⟩)))
(cross01 : G.Adj (Sum.inl (eA 0)) (Sum.inr (eB 0)))
(cross12 : G.Adj (Sum.inl (eA 0)) (Sum.inl (eA 1))) :
Nonempty (P3Factor G) := by sorry
end CubicP3PartitionSource
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp01/r03-sp01-two-cycle-cyclic-order-assembly-candidate-v2.lean; source SHA-256 ef3d16fc54c949e4e406925cf421f08dc09345d011c607c8b3d951ad51cdc940; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.