Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

R03 candidate definition: r03 defs eaea42a5b0 center component balance necessity candidate v1

Definition
r03_defs_eaea42a5b0_center_component_balance_necessity_candidate_v1

by hao jia · Sep 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me