R03 P3-factor definition module: r03_defs_117d348ee0_SP08_NATIVE_BRIDGELESS_FROM_3CONN_CUBIC_v1
Definitionr03_defs_117d348ee0_SP08_NATIVE_BRIDGELESS_FROM_3CONN_CUBIC_v1graph-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
/-!
Candidate-only native graph lemma. It derives absence of native graph
bridges from the exact frozen ThreeVertexConnected and Cubic predicates. It
is deliberately independent of planarity, rotation systems, source
hypermaps, and the Four-Colour theorem.
-/
namespace R03SP08NativeBridgeless
open CubicP3Partition
universe u
variable {V : Type u} [Fintype V]
/-- The native edge-bridge-free condition used by this candidate. -/
def NativeBridgeless (G : SimpleGraph V) : Prop :=
∀ ⦃u v : V⦄, G.Adj u v → ¬ G.IsBridge s(u, v)
end R03SP08NativeBridgeless
Source
VibeMathing candidate artifact: research/artifacts/candidates/r03/parallel/sp08/SP08_NATIVE_BRIDGELESS_FROM_3CONN_CUBIC_v1.lean; source SHA-256 9e378aa60c062b376a47c3c9df77c824c6a54083eedefad9fdf7e25eca0deda7; ProblemContract problem:opg-46613-p3-partition; candidate-only formalization.