R03 candidate definition: r03 defs d5036bedfc r03 sp01 two factor two cycle component bridge c
Definitionr03_defs_d5036bedfc_r03_sp01_two_factor_two_cycle_component_bridge_cgraph-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
open SimpleGraph
universe u
set_option maxHeartbeats 1000000
def R03SP01SumProdDistrib {X Y Z : Type u} :
((X ⊕ Y) × Z) ≃ ((X × Z) ⊕ (Y × Z)) where
toFun z := match z.1 with
| Sum.inl x => Sum.inl (x, z.2)
| Sum.inr y => Sum.inr (y, z.2)
invFun z := match z with
| Sum.inl x => (Sum.inl x.1, x.2)
| Sum.inr y => (Sum.inr y.1, y.2)
left_inv z := by cases z with | mk s z => cases s <;> rfl
right_inv z := by cases z <;> rfl
end CubicP3Partition
Source
VibeMathing candidate definition artifact: Definitions/Def_r03_defs_d5036bedfc_r03_sp01_two_factor_two_cycle_component_bridge_c.lean; candidate-only formalization for ProblemContract problem:opg-46613-p3-partition.