refactor: Lint

HepLean/PerturbationTheory/WickContraction/Sign.lean

@@ -903,7 +903,7 @@ lemma stat_signFinset_insert_some_self_snd (φ : 𝓕.States) (φs : List 𝓕.S
 
 lemma signInsertSomeCoef_eq_finset (φ : 𝓕.States) (φs : List 𝓕.States)
     (c : WickContraction φs.length) (i : Fin φs.length.succ) (j : c.uncontracted)
-    (hφj : (𝓕 |>ₛ φ) = (𝓕 |>ₛ φs[j.1])) :  c.signInsertSomeCoef φ φs i j =
+    (hφj : (𝓕 |>ₛ φ) = (𝓕 |>ₛ φs[j.1])) : c.signInsertSomeCoef φ φs i j =
     if i < i.succAbove j then
       𝓢(𝓕 |>ₛ φ, 𝓕 |>ₛ ⟨φs.get,
       (Finset.univ.filter (fun x => i < i.succAbove x ∧ x < j ∧ ((c.getDual? x = none) ∨

HepLean/PerturbationTheory/WickContraction/TimeContract.lean

@@ -18,12 +18,6 @@ namespace WickContraction
 variable {n : ℕ} (c : WickContraction n)
 open HepLean.List
 
-/-!
-
-## Time contract.
-
--/
-
 /-- Given a Wick contraction `c` associated with a list `φs`, the
   product of all time-contractions of pairs of contracted elements in `φs`,
   as a member of the center of `𝓞.A`. -/

HepLean/PerturbationTheory/WickContraction/UncontractedList.lean

@@ -219,7 +219,6 @@ lemma uncontractedList_length_eq_card (c : WickContraction n) :
   rw [uncontractedList_eq_sort]
   exact Finset.length_sort fun x1 x2 => x1 ≤ x2
 
-
 lemma filter_uncontractedList (c : WickContraction n) (p : Fin n → Prop) [DecidablePred p] :
     (c.uncontractedList.filter p) = (c.uncontracted.filter p).sort (· ≤ ·) := by
   have h1 : (c.uncontractedList.filter p).Sorted (· ≤ ·) := by
@@ -237,14 +236,12 @@ lemma filter_uncontractedList (c : WickContraction n) (p : Fin n → Prop) [Deci
   have hx := (List.toFinset_sort (· ≤ ·) h2).mpr h1
   rw [← hx, h3]
 
-
 /-!
 
 ## uncontractedIndexEquiv
 
 -/
 
-
 /-- The equivalence between the positions of `c.uncontractedList` i.e. elements of
   `Fin (c.uncontractedList).length` and the finite set `c.uncontracted` considered as a finite type.
 -/
@@ -315,7 +312,6 @@ lemma uncontractedStatesEquiv_list_sum [AddCommMonoid α] (φs : List 𝓕.State
 
 -/
 
-
 lemma uncontractedList_succAboveEmb_sorted (c : WickContraction n) (i : Fin n.succ) :
     ((List.map i.succAboveEmb c.uncontractedList)).Sorted (· ≤ ·) := by
   apply fin_list_sorted_succAboveEmb_sorted