R03 P3-factor structural result: Odd component count le deleted vertices
ProvedR03SP03PetersenBoundaryArithmeticV1.odd_component_count_le_deleted_verticesgraph-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 R03SP03PetersenBoundaryArithmeticV1.odd_component_count_le_deleted_vertices under exactly the explicit hypotheses in the Lean statement. It is a conditional reusable result and does not claim that the open root problem has been solved.
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
Formal statement
namespace R03SP03PetersenBoundaryArithmeticV1
open R03SP03PetersenBoundaryArithmeticV1
theorem odd_component_count_le_deleted_vertices
(odd_components deleted_vertices : Nat)
(hbound : 3 * odd_components ≤ 3 * deleted_vertices) :
odd_components ≤ deleted_vertices := by sorry
end R03SP03PetersenBoundaryArithmeticV1Source
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp03/r03-sp03-petersen-boundary-arithmetic-v1.lean; source SHA-256 0c145dba03bcf992a1ddc2c9158739cb79068ff29a763731058cbcf7510db157; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.