R03 candidate definition: r03 defs eb25b3c47b r03 sp01 divisible cycle bridge candidate v1
Definitionr03_defs_eb25b3c47b_r03_sp01_divisible_cycle_bridge_candidate_v1graph-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
namespace CubicP3Partition
universe u
noncomputable section
set_option maxHeartbeats 1000000
def R03SP01SigmaProdEquiv {I : Type u} (k : I → Nat) :
((Σ i : I, Fin (k i)) × Fin 3) ≃ (Σ i : I, Fin (k i) × Fin 3) where
toFun z := ⟨z.1.1, (z.1.2, z.2)⟩
invFun z := (⟨z.1, z.2.1⟩, z.2.2)
left_inv z := by cases z with | mk z l => cases z; rfl
right_inv z := by cases z with | mk i z => cases z; rfl
end
end CubicP3Partition
Source
VibeMathing candidate definition artifact: Definitions/Def_r03_defs_eb25b3c47b_r03_sp01_divisible_cycle_bridge_candidate_v1.lean; candidate-only formalization for ProblemContract problem:opg-46613-p3-partition.