HexSymmetry #
Geometry and verified arithmetic for the Conway–Soifer covering theorem at n = 3.
Rotation by -i * 60°. Only a local hexagon symmetry is asserted.
Equations
Instances For
The linear hexagon symmetry moving a selected vertex to the first vertex.
Equations
- ConwaySoifer.Simplified.hexToZero i = { toFun := ConwaySoifer.Simplified.hexToZeroFun i, map_add' := ⋯, map_smul' := ⋯ }
Instances For
theorem
ConwaySoifer.Simplified.hexToZero_sidePoint
(i : Fin 6)
(right : Bool)
(s : ℝ)
:
(hexToZero i) (linePoint (vertex i) (sideDirection i right) s) = linePoint (vertex 0) (sideDirection 0 right) s
Reflection across the Euclidean horizontal axis, expressed in triangular coordinates.
Equations
- ConwaySoifer.Simplified.horizontal = { toFun := fun (p : ConwaySoifer.Point) => (p.1 + p.2, -p.2), map_add' := ⋯, map_smul' := ⋯ }
Instances For
theorem
ConwaySoifer.Simplified.horizontal_sidePoint
(right : Bool)
(s : ℝ)
:
horizontal (linePoint (vertex 0) (sideDirection 0 right) s) = linePoint (vertex 0) (sideDirection 0 !right) s
theorem
ConwaySoifer.Simplified.sext_map_side
(i : Fin 6)
(d : Bool)
(t : ℝ)
:
(hexToZero 5) (linePoint (vertex (i + 5)) (sideDirection (i + 5) d) t) = linePoint (vertex i) (sideDirection i d) t