R03 P3-factor structural result: R03SP01V2OrderedSuffixP3Factor
ProvedCubicP3Partition.R03SP01V2OrderedSuffixP3Factorgraph-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.R03SP01V2OrderedSuffixP3Factor 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 0121c1ff02b51e43b750af9dc22551a4d35d467f969b0a7fc7972c67c738aba5.
Formal statement
import Definitions.Def_cubic_p3_partition_models
import Definitions.Def_r03_defs_de73be8e06_r03_sp01_cyclic_residual_assembly_candidate_v1
namespace CubicP3Partition
open CubicP3Partition
universe u v
theorem R03SP01V2OrderedSuffixP3Factor
{V : Type u} [Fintype V]
(G : SimpleGraph V) (n k lo : Nat)
(e : Fin n ≃ V)
(hinterval : ∀ i : Fin (k * 3), lo + i.val < n)
(successorEdge : ∀ (i : Fin n) (h : i.val + 1 < n),
G.Adj (e i) (e ⟨i.val + 1, h⟩)) :
Nonempty (P3Factor (G.induce (R03SP01V2SuffixSet n k lo e))) := by sorry
end CubicP3Partition
Source
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp01/r03-sp01-cyclic-residual-assembly-candidate-v1.lean; source SHA-256 0121c1ff02b51e43b750af9dc22551a4d35d467f969b0a7fc7972c67c738aba5; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.