Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

R03 candidate definition: r03 defs e44e91d0f9 r03 sp01 divisibility candidate v1

Definition
r03_defs_e44e91d0f9_r03_sp01_divisibility_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 CubicP3Partition

set_option maxHeartbeats 1000000

def R03SP01RootP3FactorClaim : Prop :=
  ∀ (V : Type) [Fintype V], ∀ G : SimpleGraph V,
    CubicP3Partition.Cubic G →
    CubicP3Partition.ThreeVertexConnected G →
    Fintype.card V % 3 = 0 →
    Nonempty (CubicP3Partition.P3Factor G)

end CubicP3Partition
Source
VibeMathing candidate definition artifact: Definitions/Def_r03_defs_e44e91d0f9_r03_sp01_divisibility_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