R03 P3-factor structural result: P3 factor block count eq four of order twelve
ProvedR03SP02P3FactorCardinalityV1.p3Factor_blockCount_eq_four_of_order_twelvegraph-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 R03SP02P3FactorCardinalityV1.p3Factor_blockCount_eq_four_of_order_twelve 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 R03SP02P3FactorCardinalityV1
open R03SP02P3FactorCardinalityV1
open CubicP3Partition
theorem p3Factor_blockCount_eq_four_of_order_twelve
{V : Type} [Fintype V]
{G : SimpleGraph V} (f : P3Factor G)
(hcard : Fintype.card V = 12) :
f.blockCount = 4 := by sorry
end R03SP02P3FactorCardinalityV1Source
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp02/order12_bipartite_p3factor_cardinality_v1.lean; source SHA-256 1ef9d81b079c970ae7f150cd2e82e827f760a3ccfe3eb5090b825484adcc1a4f; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.