R03 P3-factor structural result: R03SP01GlueFiniteP3Factors
ProvedCubicP3Partition.R03SP01GlueFiniteP3Factorsgraph-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.R03SP01GlueFiniteP3Factors 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 3fd6a20dbb27627e69c064dbf2e5fc40f08a35b7ee32416834da86a7a8d74f15.
Formal statement
import Definitions.Def_cubic_p3_partition_models
import Definitions.Def_r03_defs_eb25b3c47b_r03_sp01_divisible_cycle_bridge_candidate_v1
namespace CubicP3Partition
open CubicP3Partition
universe u
theorem R03SP01GlueFiniteP3Factors
{I : Type u} [Fintype I] {V : Type u} [Fintype V]
(G : SimpleGraph V) (k : I → Nat)
(place : (Σ i : I, Fin (k i) × Fin 3) ≃ V)
(edge01 : ∀ (i : I) (j : Fin (k i)),
G.Adj (place ⟨i, (j, 0)⟩) (place ⟨i, (j, 1)⟩))
(edge12 : ∀ (i : I) (j : Fin (k i)),
G.Adj (place ⟨i, (j, 1)⟩) (place ⟨i, (j, 2)⟩)) :
Nonempty (P3Factor G) := by sorry
end CubicP3Partition
Source
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp01/r03-sp01-divisible-cycle-bridge-candidate-v1.lean; source SHA-256 3fd6a20dbb27627e69c064dbf2e5fc40f08a35b7ee32416834da86a7a8d74f15; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.