refactor: Spellings

This commit is contained in:
jstoobysmith 2025-02-08 13:07:54 +00:00
parent 4cd71f5ec6
commit 4a55351b72
33 changed files with 88 additions and 88 deletions

View file

@ -124,7 +124,7 @@ lemma pureU1_last {n : } (S : (PureU1 n.succ).LinSols) :
rw [Fin.sum_univ_castSucc] at hS
linear_combination hS
/-- Two solutions to the Linear ACCs for `n.succ` areq equal if their first `n` charges are
/-- Two solutions to the Linear ACCs for `n.succ` are equal if their first `n` charges are
equal. -/
lemma pureU1_anomalyFree_ext {n : } {S T : (PureU1 n.succ).LinSols}
(h : ∀ (i : Fin n), S.val i.castSucc = T.val i.castSucc) : S = T := by