Shadows, Rupert pairs and the separation criterion #
shadow R is the projection of the Noperthedron under the matrix R. A Rupert pair
(Ro, Ri) has the closure of the inner shadow inside the interior of the outer one.
We reduce IsRupert exactVerts to the existence of a Rupert pair of rotations (using the
existing offset-removal argument), and prove the only non-Rupert criterion the checker
uses: an inner vertex that no outer vertex beats in some direction w ≠ 0.
The shadow of the Noperthedron under R.
Equations
- Cayley.shadow R = (fun (p : Euc(3)) => proj_xyL ((Matrix.toEuclideanLin R) p)) '' Noperthedron.exactHull
Instances For
A Rupert passage with outer rotation Ro and inner rotation Ri (offset zero).
Equations
- Cayley.RupPair Ro Ri = (closure (Cayley.shadow Ri) ⊆ interior (Cayley.shadow Ro))
Instances For
theorem
Cayley.rupert_set_implies_pose_rupert'
{S : Set Euc(3)}
(r : IsRupertSet S)
:
∃ (p : MatrixPose), RupertPose p S
Copied from NoperthedronIsNotRupert.lean (it lives there next to the trig proof).
theorem
Cayley.not_rupPair_of_sep
(Ro Ri : Matrix (Fin 3) (Fin 3) ℝ)
(S : Noperthedron.VertexIndex)
(w0 w1 : ℝ)
(hw : w0 ≠ 0 ∨ w1 ≠ 0)
(h :
∀ (T : Noperthedron.VertexIndex),
lin w0 w1 (Ro.mulVec (Noperthedron.exactVertex T).ofLp) ≤ lin w0 w1 (Ri.mulVec (Noperthedron.exactVertex S).ofLp))
:
The separation criterion.