AFTD Auto-Formalizing Theoretical Domains

Lorentz.ContrMod.stdBasis_apply

theoremverifiedformalizationimported Lean

Lorentz.ContrMod.stdBasis_apply

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_apply (μ ν : Fin 1 ⊕ Fin d) : (stdBasis μ).val ν = if μ = ν then 1 else 0
Formalizes
Physlib, `Lorentz.ContrMod.stdBasis_apply`
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
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 10

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 : ℕ} inlemma Lorentz.ContrMod.stdBasis_apply (μ ν : Fin 1 ⊕ Fin d) : (stdBasis μ).val ν = if μ = ν then 1 else 0 := by  simp only [stdBasis, Basis.coe_ofEquivFun]  change Pi.single μ 1 ν = _  simp only [Pi.single_apply]  refine ite_congr ?h₁ (congrFun rfl) (congrFun rfl)  exact Eq.propIntro (fun a => id (Eq.symm a)) fun a => id (Eq.symm a)
See it in the graphDiscuss this resultChallenge it