R03 candidate definition: r03 defs b1a4263d2f center component profile candidate v3
Definitionr03_defs_b1a4263d2f_center_component_profile_candidate_v3graph-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
import Mathlib.Combinatorics.SimpleGraph.Acyclic
import Mathlib.Combinatorics.SimpleGraph.Bipartite
/-!
# Center-component profile candidate
Candidate-only Lean formalization for `problem:opg-46613-p3-partition`.
Bindings: problem contract SHA-256
`4a95f992a4ad0225a5d28b64ebb8172cfa123a0c75158e1c680f3266d16341dd`,
historical statement string
`3c1569b2adae0a7571fcd9b8ade6f0db66df27bc341cd2324fe28ab11f807dc`,
attempt `attempt:opg46613-obligation-planning-v1`, graph
`graph:opg46613-obligations-v1`, and obligation
`obligation:r03-root-p3-factor`.
The theorem proves only the edge-count profile of one connected crossing
component under explicit finite hypotheses. It does not define the universal
center-set existence predicate, construct a factor, or close the root.
-/
namespace R03CenterProfileCandidate
open CubicP3Partition
universe u
variable {V : Type u} [Fintype V] [DecidableEq V]
noncomputable def degree0 (H : SimpleGraph V) [DecidableRel H.Adj] (v : V) : Nat :=
H.neighborFinset v |>.card
def crossingGraph (G : SimpleGraph V) (C L : Finset V) : SimpleGraph V :=
G.between (C : Set V) (L : Set V)
end R03CenterProfileCandidate
Source
VibeMathing candidate definition artifact: Definitions/Def_r03_defs_b1a4263d2f_center_component_profile_candidate_v3.lean; candidate-only formalization for ProblemContract problem:opg-46613-p3-partition.