AFTD Auto-Formalizing Theoretical Domains

EuclideanGroup.specialOrthogonal.toRotation_comp_fromRotation

theoremverifiedformalizationimported Lean

specialOrthogonal.fromRotation n followed by specialOrthogonal.toRotation n is the identity; the backward leg of the isomorphism specialOrthogonalEquiv.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open EuclideanGroup in
variable {n} (p : EuclideanSpace ℝ (Fin n)) in
lemma EuclideanGroup.specialOrthogonal.toRotation_comp_fromRotation :
    (specialOrthogonal.toRotation n).comp (specialOrthogonal.fromRotation n) =
      MonoidHom.id (RotationGroup n)
Formalizes
Physlib, `EuclideanGroup.specialOrthogonal.toRotation_comp_fromRotation`
Lean proof
By Shaopeng Zhu, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2026 Shaopeng Zhu. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 14
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen EuclideanGroup invariable {n} (p : EuclideanSpace ℝ (Fin n)) in/-- `specialOrthogonal.fromRotation n` followed by `specialOrthogonal.toRotation n` is the identity; the backward leg of the isomorphism `specialOrthogonalEquiv`. -/lemma EuclideanGroup.specialOrthogonal.toRotation_comp_fromRotation :    (specialOrthogonal.toRotation n).comp (specialOrthogonal.fromRotation n) =      MonoidHom.id (RotationGroup n) := by  apply MonoidHom.ext  intro x  apply Subtype.ext  refine EuclideanGroup.ext ?_ ?_  · show (0 : EuclideanSpace ℝ (Fin n)) = x.val.translation    have h : x.val.translation = 0 := x.property.right    rw [h]  · rfl
See it in the graphDiscuss this resultChallenge it