AFTD Auto-Formalizing Theoretical Domains

Lorentz.Vector.apply_sum

theoremverifiedformalizationimported Lean

Lorentz.Vector.apply_sum

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.apply_sum {d : ℕ} {ι : Type} [Fintype ι] (f : ι → Vector d) (i : Fin 1 ⊕ Fin d) :
    (∑ j, f j) i = ∑ j, f j i
Formalizes
Physlib, `Lorentz.Vector.apply_sum`
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 17

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.apply_sum {d : ℕ} {ι : Type} [Fintype ι] (f : ι → Vector d) (i : Fin 1 ⊕ Fin d) :    (∑ j, f j) i = ∑ j, f j i := by  let P (ι : Type) [Fintype ι] := ∀ (f : ι → Vector d) (i : Fin 1 ⊕ Fin d),    (∑ j : ι, f j) i = ∑ j, f j i  revert i f  change P ι  apply Fintype.induction_empty_option  · intro ι1 ι2 _ e h1    dsimp [P]    intro f i    have h' := h1 (f ∘ e) i    simp at h'    rw [← @e.sum_comp, ← @e.sum_comp, h']  · intro f i    simp only [Finset.univ_eq_empty, Finset.sum_empty]    rfl  · intro ι _ h f i    rw [Fintype.sum_option, apply_add, h, Fintype.sum_option]
See it in the graphDiscuss this resultChallenge it