AFTD Auto-Formalizing Theoretical Domains

Lorentz.ContrMod.stdBasis_decomp

theoremverifiedformalizationimported Lean

Decomposition of a contravariant Lorentz vector into the standard basis.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Lorentz Lorentz.ContrMod in
open Matrix Module MatrixGroups Complex in
variable {d : ℕ} in
lemma Lorentz.ContrMod.stdBasis_decomp (v : ContrMod d) : v = ∑ i, v.toFin1dℝ i • stdBasis i
Formalizes
Physlib, `Lorentz.ContrMod.stdBasis_decomp`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2024 Joseph Tooby-Smith. 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 12

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Lorentz Lorentz.ContrMod inopen Matrix Module MatrixGroups Complex invariable {d : ℕ} in/-- Decomposition of a contravariant Lorentz vector into the standard basis. -/lemma Lorentz.ContrMod.stdBasis_decomp (v : ContrMod d) : v = ∑ i, v.toFin1dℝ i • stdBasis i := by  apply toFin1dℝEquiv.injective  simp only [map_sum, _root_.map_smul]  funext μ  rw [Fintype.sum_apply μ fun c => toFin1dℝEquiv v c • toFin1dℝEquiv (stdBasis c)]  change _ = ∑ x : Fin 1 ⊕ Fin d, toFin1dℝEquiv v x • (toFin1dℝEquiv (stdBasis x) μ)  rw [Finset.sum_eq_single_of_mem μ (Finset.mem_univ μ)]  · simp only [stdBasis_toFin1dℝEquiv_apply_same, smul_eq_mul, mul_one]  · intro b _ hbμ    rw [stdBasis_toFin1dℝEquiv_apply_ne hbμ]    simp only [smul_eq_mul, mul_zero]
See it in the graphDiscuss this resultChallenge it