R03 candidate definition: r03 defs eaea42a5b0 center component balance necessity candidate v1
Definitionr03_defs_eaea42a5b0_center_component_balance_necessity_candidate_v1graph-theoryopg-46613p3-factorsource-faithful-candidate
This is a source-faithful definition module supporting a conditional formalization of the cubic P3-partition problem. It contains data structures and predicates used by separately published theorem candidates; it does not assert that the open root problem is solved.
Definition code
import Definitions.Def_cubic_p3_partition_models
namespace R03CenterBalanceNecessityCandidate
open CubicP3Partition
universe u
variable {V : Type u} [Fintype V] [DecidableEq V]
/-- An explicit two-leaves-per-center assignment, with every assigned pair
required to lie in the same equivalence class. The relation is abstract so
that the statement can later be instantiated with graph reachability. -/
structure ClassPairing (r : Setoid V) (C L : Finset V) where
pairing : ({v // v ∈ C} × Fin 2) ≃ {v // v ∈ L}
same_class : ∀ c : {v // v ∈ C}, ∀ j : Fin 2,
r.r c.1 (pairing (c, j)).1
noncomputable def classC (r : Setoid V) (C : Finset V) (v : V) : Finset V := by
classical
exact C.filter (fun x => r.r v x)
noncomputable def classL (r : Setoid V) (L : Finset V) (v : V) : Finset V := by
classical
exact L.filter (fun x => r.r v x)
structure GraphPairing (G : SimpleGraph V) (C L : Finset V) where
pairing : ({v // v ∈ C} × Fin 2) ≃ {v // v ∈ L}
adjacent : ∀ c : {v // v ∈ C}, ∀ j : Fin 2,
G.Adj c.1 (pairing (c, j)).1
end R03CenterBalanceNecessityCandidate
Source
VibeMathing candidate definition artifact: Definitions/Def_r03_defs_eaea42a5b0_center_component_balance_necessity_candidate_v1.lean; candidate-only formalization for ProblemContract problem:opg-46613-p3-partition.