Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

R03 P3-factor definition module: r03_defs_809c83f713_sp05_port_balanced_slot_factor_lift_formalizatio

Definition
r03_defs_809c83f713_sp05_port_balanced_slot_factor_lift_formalizatio

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

graph-theoryopg-46613p3-factorsource-faithful-candidate

This module packages source-faithful finite-graph, matching, port, or bookkeeping structures used by reusable auxiliary theorems in the cubic P3-partition formalization. It contains definitions and structural interfaces only; it does not assert closure of the open root problem.

Formalization Note The code was extracted from the cited candidate artifact and its exact digest is recorded in the campaign ledger.

Definition code
import Mathlib
import Definitions.Def_cubic_p3_partition_models

namespace R03SlotHallLift

open CubicP3Partition

universe u

variable {V : Type u} [Fintype V]

abbrev Center (C : Finset V) := {v // v ∈ C}
abbrev Leaf (C : Finset V) := {v // v ∉ C}
abbrev Slot (C : Finset V) := Center C × Fin 2

noncomputable section
open scoped Classical

def slotRel (R : V → Fin 2 → V → Prop) (C : Finset V)
    (s : Slot C) (w : Leaf C) : Prop := R s.1.1 s.2 w.1

def HallCondition (R : V → Fin 2 → V → Prop) (C : Finset V) : Prop :=
  ∀ A : Finset (Slot C),
    A.card ≤ (Finset.univ.filter
      (fun w : Leaf C => ∃ s ∈ A, slotRel R C s w)).card

def SlotMatching (R : V → Fin 2 → V → Prop) (C : Finset V) : Prop :=
  ∃ f : Slot C → Leaf C,
    Function.Injective f ∧ ∀ s, slotRel R C s (f s)

def BijectiveSlotMatching (R : V → Fin 2 → V → Prop) (C : Finset V) : Prop :=
  ∃ f : Slot C → Leaf C,
    Function.Bijective f ∧ ∀ s, slotRel R C s (f s)

def placeFun (C : Finset V) (eC : Fin C.card ≃ Center C) (f : Slot C ≃ Leaf C)
    (x : Fin C.card × Fin 3) : V :=
  if x.2 = 0 then (f (eC x.1, 0)).1
  else if x.2 = 1 then (eC x.1).1
  else (f (eC x.1, 1)).1

def GraphCenterHallCondition (G : SimpleGraph V) (C : Finset V) : Prop :=
  HallCondition (fun c _ w => G.Adj c w) C

def GraphCenterTwoExpansion (G : SimpleGraph V) (C : Finset V) : Prop :=
  ∀ S : Finset (Center C),
    2 * S.card ≤ (Finset.univ.filter
      (fun w : Leaf C => ∃ c ∈ S, G.Adj c.1 w.1)).card

def GraphCenterTwoExpansionDefect (G : SimpleGraph V) (C : Finset V) : Prop :=
  ∃ S : Finset (Center C),
    (Finset.univ.filter
      (fun w : Leaf C => ∃ c ∈ S, G.Adj c.1 w.1)).card < 2 * S.card

end
end R03SlotHallLift
Source
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp05/sp05_port_balanced_slot_factor_lift_formalization_v1.lean; source SHA-256 1c41ef56f3bc84875d663d12e511fa7013c8f126a76a8fbe13202168e3b28bc9; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.

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