DibyashanuPati/PhysLean
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

refactor: Spelling

Browse source
This commit is contained in:
jstoobysmith 2025-02-07 15:43:59 +00:00
parent b82791d671
commit f8f1e1757f
25 changed files with 80 additions and 80 deletions
Download patch file Download diff file Expand all files Collapse all files

2
HepLean/Tensors/Tree/NodeIdentities/Basic.lean
View file

@ -44,7 +44,7 @@ informal_lemma constTwoNode_eq_twoNode where
-/
/-- The tenor node of a tensor tree's tensor has a tensor which is the tensor tree's tensor. -/
/-- The tensor node of a tensor tree's tensor has a tensor which is the tensor tree's tensor. -/
lemma tensorNode_of_tree (t : TensorTree S c) : (tensorNode t.tensor).tensor = t.tensor := by
simp [tensorNode]

2
HepLean/Tensors/Tree/NodeIdentities/ProdContr.lean
View file

@ -139,7 +139,7 @@ lemma sum_inr_succAbove_leftContrI_leftContrJ (k : Fin n1) : finSumFinEquiv.symm
erw [succAbove_leftContrJ_leftContrI_natAdd]
simp
/- An auxillary lemma to `contrMap_prod_tprod`. -/
/- An auxiliary lemma to `contrMap_prod_tprod`. -/
lemma contrMap_prod_tprod_aux
(l : (OverColor.mk (c ∘ q.i.succAbove ∘ q.j.succAbove)).left ⊕ (OverColor.mk c1).left)
(l' : Fin n.succ.succ ⊕ Fin n1)