@@ -192,9 +192,10 @@ lemma surjective_snd_prod :
192192 ← b₁.basisProd_aux eι b₂, map_lieSpan, image_union, h₁, h₂]
193193 simp [range_comp]
194194
195- lemma lie_fst_eq_zero_of_mem_prodCartan [IsLieAbelian H₁]
195+ lemma lie_fst_eq_zero_of_mem_prodCartan
196196 {y : b₁.prod eι b₂} (hy : y ∈ prodCartan eι b₁ b₂) (x : H₁) :
197197 ⁅(y : L₁ × L₂).fst, (x : L₁)⁆ = 0 := by
198+ have := b₁.isLieAbelian_cartan
198199 induction hy using lieSpan_induction with
199200 | mem u hu =>
200201 obtain ⟨i, rfl⟩ := hu
@@ -205,7 +206,7 @@ lemma lie_fst_eq_zero_of_mem_prodCartan [IsLieAbelian H₁]
205206 | smul t u hu hu' => simp [hu']
206207 | lie u v hu hv hu' hv' => simp [hu', hv']
207208
208- lemma lie_snd_eq_zero_of_mem_prodCartan [IsLieAbelian H₂]
209+ lemma lie_snd_eq_zero_of_mem_prodCartan
209210 {y : b₁.prod eι b₂} (hy : y ∈ prodCartan eι b₁ b₂) (x : H₂) :
210211 ⁅(y : L₁ × L₂).snd, (x : L₂)⁆ = 0 := by
211212 suffices (prodSymmEquiv eι b₁ b₂).symm y ∈ prodCartan eι.symm b₂ b₁ from
@@ -228,7 +229,7 @@ variable {K : Type*} [Field K] [CharZero K]
228229 (hA : b₁.A.reindex eι eι = b₂.A)
229230include hA
230231
231- lemma prod_lt_top [IsKilling K L₁] [IsKilling K L₂] [ Nontrivial L₂] :
232+ lemma prod_lt_top [Nontrivial L₂] :
232233 b₁.prod eι b₂ < ⊤ := by
233234 /- This innocent-looking result is the key. The informal literature seems only to contain
234235 somewhat heavy-weight proofs (e.g., [ Chapter IV, Theorem 14.2 ] (humphreys1972) makes an
0 commit comments