AFTD Auto-Formalizing Theoretical Domains

Lorentz.Vector.sum_basis_eq_zero_iff

theoremverifiedformalizationimported Lean

Lorentz.Vector.sum_basis_eq_zero_iff

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Module in
open Matrix in
open MatrixGroups in
open Complex in
open TensorProduct in
open InnerProductSpace in
lemma Lorentz.Vector.sum_basis_eq_zero_iff {d : ℕ} (f : Fin 1 ⊕ Fin d → ℝ) :
    (∑ μ, f μ • basis μ) = 0 ↔ ∀ μ, f μ = 0
Formalizes
Physlib, `Lorentz.Vector.sum_basis_eq_zero_iff`
Lean proof
By Matteo Cipollina, Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 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
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 23
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Module inopen Matrix inopen MatrixGroups inopen Complex inopen TensorProduct inopen InnerProductSpace inlemma Lorentz.Vector.sum_basis_eq_zero_iff {d : ℕ} (f : Fin 1 ⊕ Fin d → ℝ) :    (∑ μ, f μ • basis μ) = 0 ↔ ∀ μ, f μ = 0 := by  apply Iff.intro  · intro h    have h1 := (linearIndependent_iff').mp basis.linearIndependent Finset.univ f h    intro μ    exact h1 μ (by simp)  · intro h    simp [h]
See it in the graphDiscuss this resultChallenge it