refactor: linear_combination

This commit is contained in:
jstoobysmith 2024-09-04 06:32:42 -04:00
parent 17f09022db
commit 158c33e8d3
2 changed files with 5 additions and 11 deletions

View file

@ -74,12 +74,7 @@ lemma doublePoint_B₃_B₃ (R : MSSMACC.LinSols) : cubeTriLin B₃.val B₃.val
have h0 := hLin 0
have h2 := hLin 2
simp [Fin.sum_univ_three] at h0 h2
have h1 {a b : } (ha : a = 0) (hb : b = 0) : 9 * a - 24 * b = 0 := by
rw [ha, hb]
simp
have h1' := h1 h0 h2
ring_nf at h1'
ring_nf
exact h1'
linear_combination (norm := ring_nf) 9 * (h0) - 24 * (h2)
simp only [Fin.isValue, Prod.mk_zero_zero, Prod.mk_one_one, add_add_sub_cancel, add_neg_cancel]
end MSSMACC

View file

@ -74,9 +74,8 @@ lemma doublePoint_Y₃_Y₃ (R : MSSMACC.LinSols) :
simp at hLin
have h3 := hLin 3
simp [Fin.sum_univ_three] at h3
have h5 := congrArg (HMul.hMul 6) h3
ring_nf at h5
ring_nf
exact h5
linear_combination (norm := ring_nf) 6 * h3
simp only [Fin.isValue, Prod.mk_zero_zero, Prod.mk_one_one, add_add_sub_cancel, add_neg_cancel]
end MSSMACC