R03 P3-factor structural result: Pairing graph degree
ProvedR03PortBalancedLift.pairingGraph_degreegraph-theoryopg-46613p3-factorsource-faithful-candidate
This is a source-faithful auxiliary theorem from the candidate formalization of the cubic P3-partition problem. It records the structural result R03PortBalancedLift.pairingGraph_degree under exactly the explicit hypotheses in the Lean statement. It is a reusable conditional result and does not claim closure of the open root problem.
Formalization Note The Lean statement and direct proof were extracted from the cited candidate artifact; its source digest is recorded in the campaign ledger.
Preamble
import Mathlib import Definitions.Def_cubic_p3_partition_models import Definitions.Def_r03_defs_2164cbfb81_sp05_port_balanced_quotient_lift_formalization_v
Formal statement
namespace R03PortBalancedLift
open R03PortBalancedLift
open CubicP3Partition
universe u v
variable {P : Type u} {V : Type v} [Fintype P] [Fintype V]
open scoped Classical
theorem pairingGraph_degree (pair : (P × Fin 2) ≃ V)
(p : P) (b : Fin 2) :
degree (pairingGraph pair) (pair (p, b)) = 1 := by sorry
end R03PortBalancedLiftSource
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp05/sp05_port_balanced_quotient_lift_formalization_v1.lean; source SHA-256 57fa222021aa425ec2411a888cc409befe235b123a468d11050269c21de596ab; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.