AFTD Auto-Formalizing Theoretical Domains

EuclideanGroup.rotation_smul_origin

theoremverifiedformalizationimported Lean

A rotation fixes the origin: its translation part vanishes (RotationGroup ≤ OriginStabilizer), so ↑r • 0 = 0. Stated in the ↑r form (the simp normal form of r • _, via rotation_smul_eq) so it is a well-formed simp lemma.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open EuclideanGroup in
variable {d : ℕ} in
@[simp] lemma EuclideanGroup.rotation_smul_origin (r : RotationGroup d) :
    (r : EuclideanGroup d) • (0 : Space d) = (0 : Space d)
Formalizes
Physlib, `EuclideanGroup.rotation_smul_origin`
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 47
Used by 3

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen EuclideanGroup invariable {d : ℕ} in/-- A rotation fixes the origin: its translation part vanishes (`RotationGroup ≤ OriginStabilizer`), so `↑r • 0 = 0`. Stated in the `↑r` form (the simp normal form of `r • _`, via `rotation_smul_eq`) so it is a well-formed `simp` lemma. -/@[simp] lemma EuclideanGroup.rotation_smul_origin (r : RotationGroup d) :    (r : EuclideanGroup d) • (0 : Space d) = (0 : Space d) := by  have h_trans : (r : EuclideanGroup d).translation = 0 := by    apply r.property.right  have h_rot : (r : EuclideanGroup d) • ((0 : Space d)) =      ((r : EuclideanGroup d).linear • (0 : EuclideanSpace ℝ (Fin d)) + 0) +ᵥ ((0 : Space d)) := by    show ((r : EuclideanGroup d).linear • ((0 : Space d) -ᵥ (0 : Space d))        + (r : EuclideanGroup d).translation) +ᵥ (0 : Space d) = _    rw [vsub_self, h_trans]  simp [h_rot]
See it in the graphDiscuss this resultChallenge it