R03 P3-factor structural result: R03SP01NoP3FactorHasCenterSlotHallObstruction
ProvedCubicP3Partition.R03SP01NoP3FactorHasCenterSlotHallObstructiongraph-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.R03SP01NoP3FactorHasCenterSlotHallObstruction 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 4e1ff2664875b2b00606de187b2c034d0d2f8436fc9b50a16732852122407fef.
Formal statement
import Mathlib
import Definitions.Def_cubic_p3_partition_models
import Definitions.Def_r03_defs_adda565e91_r03_sp01_center_slot_factor_bridge_candidate_v1
namespace CubicP3Partition
open CubicP3Partition
universe u
theorem R03SP01NoP3FactorHasCenterSlotHallObstruction
{V : Type u} [Fintype V]
(G : SimpleGraph V)
[DecidableEq V] [DecidableRel G.Adj]
(hNo : ¬ Nonempty (P3Factor G)) :
∀ (C : Finset V) (n : Nat),
C.card = n →
n * 3 = Fintype.card V →
∀ eC : Fin n ≃ (↑C : Set V),
∃ A : Finset ((↑C : Set V)ᶜ : Set V),
(Finset.univ.filter (fun b : Fin n × Fin 2 =>
∃ a ∈ A, G.Adj (a : V) (eC b.1 : V))).card < A.card := by sorry
end CubicP3Partition
Source
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp01/r03-sp01-center-slot-factor-bridge-candidate-v1.lean; source SHA-256 4e1ff2664875b2b00606de187b2c034d0d2f8436fc9b50a16732852122407fef; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.