AFTD Auto-Formalizing Theoretical Domains

EuclideanGroup.RotationsAbout.fromOrigin

defimported Lean

Conjugate a rotation about the origin to a rotation about p.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open EuclideanGroup in
variable {n} (p : EuclideanSpace ℝ (Fin n)) in
noncomputable def EuclideanGroup.RotationsAbout.fromOrigin :
    RotationGroup n →* RotationsAbout p
Defined in
Physlib, `EuclideanGroup.RotationsAbout.fromOrigin`
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
none listed
Built on 12
Used by 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open EuclideanGroup in
variable {n} (p : EuclideanSpace ℝ (Fin n)) in
/-- Conjugate a rotation about the origin to a rotation about `p`. -/
noncomputable def EuclideanGroup.RotationsAbout.fromOrigin :
    RotationGroup n →* RotationsAbout p where
  toFun g := ⟨translationVector.incl n (Multiplicative.ofAdd p)
    * (g : EuclideanGroup n) * translationVector.incl n (Multiplicative.ofAdd (-p)), by use g⟩
  map_one' := by simp
  map_mul' := by
    intro x y
    obtain ⟨a, ha⟩ := x
    obtain ⟨b, hb⟩ := y
    obtain ⟨r1, hr1⟩ := ha
    obtain ⟨r2, hr2⟩ := hb
    simp
See it in the graphDiscuss this resultChallenge it